# IEEE Transactions on Electronic Computers

## Filter Results

Displaying Results 1 - 25 of 54
• ### [Front cover]

Publication Year: 1963, Page(s): c1
| PDF (667 KB)
• ### IEEE Professional Technical Group on Electronic Computers

Publication Year: 1963, Page(s): nil1
| PDF (118 KB)
• ### [Breaker page]

Publication Year: 1963, Page(s): nil1
| PDF (118 KB)
• ### Call for Papers

Publication Year: 1963, Page(s): 182
| PDF (53 KB)
• ### Realization of Arbitrary Logical Functions Using Majority Elements

Publication Year: 1963, Page(s):183 - 191
Cited by:  Papers (21)
| | PDF (1120 KB)

A method is developed for the synthesis of arbitrary combinational logical functions using three-input majority elements. The networks that result are in the form of modified trees. It is shown that an average saving of 30 per cent in majority elements is made on trees of majority elements which individually produce AND'' and OR'' functions. Several variations of the basic method are developed... View full abstract»

• ### Ternary Threshold Logic

Publication Year: 1963, Page(s):191 - 197
Cited by:  Papers (20)
| | PDF (1113 KB)

A new logical algebra, ternary threshold logic, is defined and developed. The system is shown to be capable of representing all three-valued functions, and two methods of synthesizing these functions from their truth tables are given. One of the methods produces a normal form that is analogous to the disjunctive normal form of Boolean algebra. A list of single-threshold-operator equivalents of cer... View full abstract»

• ### A Catalog of Three-Variable Or-Invert and And-Invert Logical Circuits

Publication Year: 1963, Page(s):198 - 223
Cited by:  Papers (52)  |  Patents (2)
| | PDF (2502 KB)

This report gives a complete catalog of minimal NOR circuits and minimal NAND circuits, assuming complements not available, for all logic functions of three variables. Minimal circuits for a function are those that satisfy these conditions: 1) The number of logic blocks of the circuit is least possible for performing the function; 2) The number of connections in the circuit (total number of inputs... View full abstract»

• ### A Study of Feedback and Errors in Sequential Machines

Publication Year: 1963, Page(s):223 - 232
Cited by:  Papers (17)
| | PDF (1748 KB)

The object of this paper is to study feedback in sequential machines, to classify (according to their seriousness) and analyze errors which arise in the state transitions of machines, and to establish some relations between feedback and errors. It is shown that the previously developed algebraic methods1,2 supply the necessary tools and a rigorous basis for this theory, and relate these new result... View full abstract»

• ### Correction

Publication Year: 1963, Page(s): 232
| PDF (154 KB)
• ### The Theory of Definite Automata

Publication Year: 1963, Page(s):233 - 243
Cited by:  Papers (66)
| | PDF (2017 KB)

A definite automaton is, roughly speaking, an automaton (sequential circuit) with the property that for some fixed integer k its action depends only on the last k inputs. The notion of a definite event introduced by Kleene, as well as the related concepts of definite automata and tables, are studied here in detail. Basic results relating to the minimum number of states required for synthesizing an... View full abstract»

• ### Algebraic Properties of Symmetric and Partially Symmetric Boolean Functions

Publication Year: 1963, Page(s):244 - 251
Cited by:  Papers (19)
| | PDF (1293 KB)

Symmetric and partially symmetric functions are studied from an algebraic point of view. Tests are given for detecting these properties. A more general approach involving the concept of ρ-symmetric functions is given. A canonical form is derived for ρ-symmetric functions which leads to synthesis procedures that improve results of Shannon. View full abstract»

• ### A Parallel Computer Organization and Mechanizations

Publication Year: 1963, Page(s):251 - 262
Cited by:  Papers (3)  |  Patents (1)
| | PDF (3250 KB)

This paper describes a type of parallel computer organization which can be regarded as lying at one extreme of a spectrum of possible degrees of parallelism. The organization is dominated by two characteristics, namely, one-bit storage per computational cell and single-level logic at each computational step. The organization is directed specifically toward spatial problems, but is demonstrated to ... View full abstract»

• ### A Memory Organization for an Elementary List-Processing Computer

Publication Year: 1963, Page(s):262 - 265
Cited by:  Papers (1)
| | PDF (793 KB)

This paper presents an elementary computer memory organization capable of direct representation and manipulation of simple linear lists. A conventional random-access memory is used in conjunction with a group of address and word-length registers to store and manipulate single-link list words. Four typical list-processing macroinstructions, INSERT, DELETE, SEARCH, and EXECUTE, are illustrated and a... View full abstract»

• ### The Carry-Dependent Sum Adder

Publication Year: 1963, Page(s):265 - 268
Cited by:  Papers (12)
| | PDF (494 KB)

The correct operation of addition in a digital computer is very important. In this paper, the authors exhibit a checking scheme called carry-dependent sum add'' which is based on the parity prediction method. This scheme assures single-fault detection without duplication of the carry circuit. An example of a binary adder and a decimal adder using this scheme are included. View full abstract»

• ### An Analysis of the Effect of Component Tolerances on the Amplification of the Balanced-Pair Tunnel-Diode Circuit

Publication Year: 1963, Page(s):269 - 274
Cited by:  Papers (1)
| | PDF (905 KB)

The purpose of the present study is to determine for the balanced-pair tunnel-diode circuit the minimum amount of control required when specified parameter imbalances are present in the system. The problem is formulated and the minimum control is determined numerically. These results are compared with an analytic formula for the minimum control which is presented here but is derived in another pap... View full abstract»

• ### Negative-Base Number-Representation Systems

Publication Year: 1963, Page(s):274 - 277
Cited by:  Papers (6)  |  Patents (2)
| | PDF (756 KB)

Number-representation systems employing negative bases, and identical in structure to the usual systems using positive bases, can represent both positive and negative numbers with equal facility. Arithmetic involving both positive and negative operands can also be performed in a negative-base system without special attention to the negative numbers. Determination of whether a number is positive or... View full abstract»

• ### Predicting Signal Degeneration and Gate Compatibility in Logic Circuits

Publication Year: 1963, Page(s):277 - 281
Cited by:  Papers (2)
| | PDF (787 KB)

A simple graphical analysis of the output vs input curves of a digital circuit will show whether the circuit can be used in arbitrarily long logical chains. The analysis uses upper and lower bounds for the output vs input curves, but these bounds can be interpreted as statistical confidence limits. Results of the analysis give necessary and sufficient conditions for various different types of gate... View full abstract»

• ### A High-Speed Direct-Coupled Magnetic Memory Sense Amplifier Employing Tunnel-Diode Discriminators

Publication Year: 1963, Page(s):282 - 295
Cited by:  Papers (4)
| | PDF (3702 KB)

Because of a multiplicity of conflicting requirements, sense amplifier design is probably the most difficult circuit problem in a large, high-speed digital computer memory. The requirements include absence of pattern sensitivity, controllable input impedance, a wide band pass, stable gain, high common mode rejection, the ability to handle bipolar signals, stable reference levels, a fast comparator... View full abstract»

• ### Tunnel-Diode Threshold Discriminator Tolerance Analysis

Publication Year: 1963, Page(s):296 - 299
| | PDF (371 KB)

THE TUNNEL DIODE may be advantageously used as a threshold device in a magnetic memory sense amplifier. A signal voltage is induced in a small segment of a sense line. This induced voltage is propagated through the sense line and amplified. Finally, a current proportional to the signal voltage is compared to a threshold current to determine if the information is binary 1 or binary 0. This threshol... View full abstract»

• ### An Experimental Investigation of a Class of Pattern Recognition Synthesis Algorithms

Publication Year: 1963, Page(s):300 - 306
Cited by:  Papers (2)
| | PDF (2110 KB)

This paper discusses a class of pattern-recognition decision-making procedures which can be efficiently mechanized by a network of linear threshold devices. A theoretical discussion of four decision techniques (which are members of the above-mentione class) is augmented by an experimental program which investigates questions not amenable to analysis. View full abstract»

• ### Rigorous Treatments of Variable Time Delays

Publication Year: 1963, Page(s):307 - 309
Cited by:  Papers (7)
| | PDF (438 KB)

A thermal plant usually consists of various pieces of heat transfer apparatus connected together by pipes. Simulation of the transport delay introduced by these pipes is frequently required. When the fluid velocity through the pipes is constant, the transfer function of the piping lag is easily derived. When the velocity of the fluid is a function of time, however, the transport delay also becomes... View full abstract»

• ### Performance of Operational Amplifiers With Electronic Mode Switching

Publication Year: 1963, Page(s):310 - 312
Cited by:  Papers (2)
| | PDF (518 KB)

The linear-circuit performance equation for an important class of mode-switched operational amplifiers is derived to identify errors caused by finite feedback loop gains, switch resistance, and follower-amplifier source impedance. Errors due to capacitor dielectric absorption, switching spikes, dc leakage, and current limiting are discussed with reference to an electronically switched integrator (... View full abstract»

• ### Dynamic Accuracy and Error in Analog Computations

Publication Year: 1963, Page(s):313 - 316
Cited by:  Papers (1)
| | PDF (1422 KB)

It is shown that a simple circle diagram can be developed which will readily convert the dynamic amplitude ratio and phase shift characteristics of analog computing units (or similar electronic devices) into the corresponding rms-error functions. These rms-error functions which directly conform with the static dc accuracy specifications generally used, can be plotted in a new diagram giving the op... View full abstract»

• ### Effect of Fan-In and Fan-Out Limitations on the Value of Computer Circuits

Publication Year: 1963, Page(s):317 - 318
| | PDF (437 KB)

First Page of the Article
View full abstract»

• ### A Stable Basic Logic Circuit

Publication Year: 1963, Page(s):318 - 319
| | PDF (397 KB)

First Page of the Article
View full abstract»

## Aims & Scope

This Transactions ceased publication in 1967. The current retitled publication is

Full Aims & Scope