IEEE Transactions on Computers

Issue 5 • May 1972

Filter Results

Displaying Results 1 - 25 of 28
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1972, Page(s):c1 - 536
    Request permission for commercial reuse | |PDF file iconPDF (635 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1972, Page(s): c2
    Request permission for commercial reuse | |PDF file iconPDF (206 KB)
    Freely Available from IEEE
  • Error Correction in High-Speed Arithmetic

    Publication Year: 1972, Page(s):433 - 438
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1000 KB)

    In high-speed multipliers, multiplication is activated by processing a group of bits in parallel. As a result, any defects in circuitry produce possible errors in positions that are separated by fixed periods. A class of codes for the correction of such iterative error patterns resulting from a single fault is presented in this paper. A decoding algorithm together with a simple implementation sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Measure of Computational Work

    Publication Year: 1972, Page(s):439 - 446
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1624 KB)

    The computational work of a process is measured in terms of the information in a memory for its table-lookup implementation. This measure is applied first to simple logical and arithmetic processes, and then more complicated processes comprising organizations (called synergisms) of several subprocesses. The computational advantages of Cartesian, compositional, and sequential synergisms are investi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Job-Mix Modeling and System Analysis of an Aerospace Multiprocessor

    Publication Year: 1972, Page(s):446 - 454
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1560 KB)

    An aerospace guidance computer organization, consisting of multiple processors and memory units attached to a central time-multiplexed data bus, is described. A job mix for this type of computer is obtained by analysis of Apollo mission programs. Multiprocessor performance is then analyzed using: 1) queuing theory, under certain "limiting case" assumptions; 2) Markov process methods; and 3) system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Uniform Loading Theory to Circuit Packaging and Memory Arrays in High-Speed Computers

    Publication Year: 1972, Page(s):454 - 463
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3696 KB)

    The uniform loading theory [1] has been approximated and used to analyze a class of interconnection problems usually encountered in the design of high-speed circuit packaging and memory arrays in today's computers. The uniform loads are, for example, IC gates and via holes on multilayered printed circuit board and cross-coupling capacitance in memory arrays. They are treated as discrete loads alon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deductive Method for Simulating Faults in Logic Circuits

    Publication Year: 1972, Page(s):464 - 471
    Cited by:  Papers (161)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1880 KB)

    A deductive method of fault simulation is described, which "deduces" the faults defected by a test at the same time that it simulates explicitly only the good behavior of logic circuit. For large logic circuits (at least several thousand gates) it is expected to be faster than "parallel" fault simulators, but uses much more computer memory than do parallel simulators. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Permutation Networks

    Publication Year: 1972, Page(s):472 - 479
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1472 KB)

    Two sequential permutation networks which generate all nǃ permutations without duplication are presented. Each permutation can be derived from its predecessor autonomously in one clock step. Based on the principle of recursive execution of a product of transpositions, the first network is constructed in multiple cascades of ½(n²-n) switching elements each of which permute... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement

    Publication Year: 1972, Page(s):479 - 485
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1152 KB)

    The relationship between multivalued switching algebra and Boolean algebra is presented by introducing different definitions for the complements of multivalued variables. For every definition introduced, the paper points out which Boolean algebra theorems are valid for multivalued cases, which are invalid, and gives proofs to substantiate the claim. It is shown that DeMorgan's theorem holds for al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbolic Treatment of Certain Selector Functions

    Publication Year: 1972, Page(s):486 - 488
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (416 KB)

    A selector function is defined as a choice function, which selects one particular argument in a set of arguments according to given selection criteria. A notation has been developed which states the algorithms that apply for symbolic treatment of the selector functions. Some examples of selector functions are given and the corresponding physical interpretations indicated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Synthesis of Multivalued Cellular Cascades and the Decomposability of Group Functions

    Publication Year: 1972, Page(s):489 - 492
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (760 KB)

    This note is largely a generalization of the Elspas-Stone theory about the realization of group functions from Xm into H. In the paper of Elspas-Stone only the case X = {0,1} was treated, whereas we consider an arbitrary finite set X. We have shown that the most important results of [1] hold for this general case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Error Control in Sequential Machines

    Publication Year: 1972, Page(s):492 - 495
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (960 KB)

    It is shown that if a machine M con be mapped into a simpler machine M' by a homomorphism, then an error correcting/detecting code can be applied to the states of M such that the parity check bits are generated independently of the information bits that form the state assignment of M. If such a homomorphism does not exist, it is shown how to produce one by altering M if M consists entirely of loop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Description and Use of Register-Transfer Modules (RTM's)®

    Publication Year: 1972, Page(s):495 - 500
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1208 KB)

    This note describes a set of register-transfer modules (RTM's) that are used as a basis for digital systems design. RTM's allow digital systems to be specified in a flow chart form with complete construction (wiring) information, thus obviating combinational and sequential switching circuit theory based design. The modules make extensive use of integrated circuitry. The note briefly describes the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on State Minimization of a Special Class of Incomplete Sequential Machines

    Publication Year: 1972, Page(s):500 - 502
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (560 KB)

    In this note a necessary and sufficient condition is supplied for a flow table to have the property that every cover composed of maximal compatibles is closed. An example of such a flow table is given to which all sufficient conditions known before do not apply. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Matrix Method for Determining All Pairs of Compatible States of a Sequential Machine

    Publication Year: 1972, Page(s):502 - 503
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (408 KB)

    In this note a matrix method is given that enables one to determine all pairs of compatible states in the case of incompletely specified sequential automata. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple Methods for the Testing of 2-Summability of Boolean Functions and Isobaricity of Threshold Functions

    Publication Year: 1972, Page(s):503 - 507
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (928 KB)

    A simple algorithm for testing the 2-summability of Boolean functions is presented in this note. The concept of asummobility has been extended and the idea of "mutual 2-asummability" has been introduced. The authors show how mutual 2-asummobility can be utilized for the testing of isobaricity of threshold functions containing no more than seven variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lower Bound on the Complexity of Arbitrary Switching Function Realizers

    Publication Year: 1972, Page(s):507 - 510
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (560 KB)

    In this note, arbitrary switching function realizers and their complexity are defined. Then, a lower bound on the complexity is derived in terms of the number of such switching function realizers required to realize all Boolean functions of n variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Design of Diagnosable Iterative Arrays"

    Publication Year: 1972, Page(s): 511
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (216 KB)

    This correspondence shows that, contrary to a statement in the cited paper, fault location is sometimes possible in one-dimensional arrays in which only the outputs of the rightmost cell are observable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Fast Digital Computer Method for Recursive Estimation of the Mean"

    Publication Year: 1972, Page(s):511 - 512
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (392 KB)

    Several algorithms for the computation of the mean value of a random variable have been analyzed. Results have shown that the two previously published techniques and a modified version of one of these, give unbiased estimates of the mean value. Furthermore, although the confidence intervals have been found to be increased in all cases, the actual increase is insignificant, while the possible speed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Simplified Definition of Walsh Functions"

    Publication Year: 1972, Page(s): 512
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (200 KB)

    In the above note,1a method is presented for forming a Walsh function, wal(n,θ), where n is the order and θ is the normalized time. A binary representation of n is converted to a Gray code, after which the Rademacher functions corresponding to the ONE bits in the Gray code are multiplied to synthesize a Walsh function. A simple extension of this method allows evaluation of any... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simply Invertible Matrices

    Publication Year: 1972, Page(s):512 - 513
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (336 KB)

    Properties and construction of a class of test matrices, called " simply invertible matrices," are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Division Algorithms Based on Multiplication

    Publication Year: 1972, Page(s):513 - 514
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (248 KB)

    The algorithm of division based on multiplication is well known [1]-[5]. It permits utilization of fast multiply hardware in the implementation of division. The algorithm defines an iterative process in which numerator and denominator are both multiplied by the same factor misuch that the denominator converges to 1 and the numerator to the quotient. Convergence can be speeded up by find... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contributors

    Publication Year: 1972, Page(s):515 - 516
    Request permission for commercial reuse | |PDF file iconPDF (2643 KB)
    Freely Available from IEEE
  • B72-9 Compiler Construction for Digital Computers

    Publication Year: 1972, Page(s): 517
    Request permission for commercial reuse | |PDF file iconPDF (280 KB)
    Freely Available from IEEE
  • B72-10 PL/I Programming In Technological Applications

    Publication Year: 1972, Page(s): 517
    Request permission for commercial reuse | |PDF file iconPDF (280 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org