IEEE Transactions on Computers

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 ...

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 ...

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. ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

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.

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 ...

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.

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. ...

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

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 ...

It is unusual these days to find a product that does more than expected. Mr. Groner's book not only covers an appropriate subset of the PL/I language, but also imparts much wisdom from the field of scientific computing. It does much to bridge the wide ...

The authors have written an introductory textbook on switching algebra and its application to logic system design. The book contains almost no formal mathematical presentation and, hence, is quite easy to read. The level of the presentation could easily ...