IEEE Transactions on Electronic Computers

The purpose of this paper is to derive the optimum word length for the simultaneous digital transmission of a number of continuous signals in real time, through a single communication channel. The transmission introduces sampling and quantization errors; the relation between the fineness of the quantization and the sampling rate, as a function of word length, for a given capacity of the channel, i... View full abstract»

Error analysis in the computer simulation of dynamic systems is fundamentally a variational problem. The computing errors are small variations of the computed solutions with respect to the exact solution of the differential equations being integrated. It is not surprising, therefore, that many of the mathematical tools used to perform error analysis in the computer simulation of dynamic systems ar... View full abstract»

A system of IBM 7090 Data Processing System computer programs was developed for the purpose of normal and/or fault simulation of the Saturn computer. This paper will describe the design of the simulator and cite several applications in the development of the Saturn computer. The architecture, plus several important characteristics of the simulator, are presented. These include the Design Automatio... View full abstract»

A model is presented for evaluating the electrical loss (assuming the head medium is not infinitely permeable) and loading effect of the readback process in magnetic recording. The technique is based on the fact that the readback process can be approximated as linear and that the read head is a linear frequency-variant device. After approximating the open-circuit readback signal by a Fourier serie... View full abstract»

This paper presents an approach to the problem of assigning binary input codes so that the combinatorial circuits necessary to realize the given output functions may be minimized. The approach is based on binary partitions and binary set systems, which provide a natural language for dealing with the problem. First, a lower bound is established for the realization of each output function, with the ... View full abstract»

There are several different usable combinations of the inputs of an RST flip-flop. It is shown how all of the possible combinations can be displayed simultaneously on three Karnaugh maps, facilitating the choice of the simplest input equations. The application equation for flip-flop Q characterized by a sequential problem is plotted on a map designated Qn+1. Additional maps, (Qn+1<... View full abstract»

Given two implicants of a Boolean function, we can, by performing their consensus, find a third implicant. This operation has been used for finding the prime implicants of a Boolean function. In this paper, the consensus is extended from two to any number of terms. A property of these generalized consensus relations leads to a systematic way of finding them. It is shown that any prime implicant of... View full abstract»

A modification of Akers' method of realizing Boolean functions with three-input majority gates is presented. One of the fundamental parts in Akers' procedure is the construction of a logically passive self-dual, or LPSD. This paper presents a more precise construction of the LPSD. In addition, a procedure is described to adapt the method to minimization of the number of delay elements. A delay ele... View full abstract»

A computer-programmable algorithm is presented for the design of general feed-forward nets of threshold logic gates, which realize arbitrary digital switching functions. The algorithm is proved to be convergent for all switching functions. A simplified version of the algorithm is presented for the case of symmetric switching functions. Both algorithms are proved minimal for single-gate nets; a nec... View full abstract»

A sequential machine for which any input sequence of a specified length is a distinguishing sequence is said to be definitely diagnosable. A method is developed to obtain for any arbitrary sequential machine a corresponding machine which contains the original one and which is definitely diagnosable. Similarly, these techniques are applied to embed machines which are not information lossless of fin... View full abstract»

A system design is given for a computer capable of direct execution of FORTRAN language source statements. The allowed types of statements are the FORTRAN DO, GO TO, computed GO TO, Arithmetic, READ, PRINT, arithmetic IF, CONTINUE, PAUSE, DIMENSION and END statements. Up to two subscripts are allowed for variables and no FORMAT statement is needed. The programmer's source program is converted to a... View full abstract»

This paper discusses certain concepts and sample results in the techniques of system effectiveness analysis with particular attention to availability. It turns out that the contemporary concept of system effectiveness can be usefully viewed as a generalization of prior concepts relating to system availability. Central to the paper's approach is a presentation of the need for redefinition of system... View full abstract»

A new method for shift register design based on a tunnel diode-charge storage diode combination is described. The tunnel diode acts as the permanent store with the charge storage diode as the temporary store to hold information while the main store is cleared. The circuit has very good tolerances and high rejection of extraneous pickup. Clock frequencies in excess of 100 MHz have been used with 10... View full abstract»

Two-dimensional arrays of logic elements of the general type attributed to parallel computing structures [1]-[9] can be mechanized by means of charge image storage techniques. This note describes the principles of the mechanization and presents some rudimentary examples of parallel logic. View full abstract»

A step in state minimization requires the selection of a minimal class of compatible sets of internal states which covers the given machine and is closed. Grasselli and Luccio have presented a solution of this problem which has certain drawbacks. This paper presents a simpler and shorter algorithm, guaranteed to yield all solutions, based upon their work and that of Paull and Unger. View full abstract»

A new reduction technique conceived by Gimpel can be applied to any covering problem with costs that has a column with exactly two 1's, in rows of equal cost. Gimpel's plurality restriction is unnecessary. The technique is illustrated and proved. View full abstract»

Field-recorded data are often most conveniently recorded on magnetic tapes without interblock gaps. Gapless tapes cannot be read by certain types of computers. A simple modification to a KDF 9 computer enables it to transcribe from gapless to conventional format as a time-shared monitor operation. The counter which increases peripheral transfer addresses and detects the completion of a block is ti... View full abstract»