Scheduled Maintenance on May 24th, 2018:
IEEE Xplore will undergo system maintenance from 1:30 PM - 3:00 PM ET. During this time there may be intermittent impact on performance. We apologize for any inconvenience.

# IEEE Transactions on Electronic Computers

## Filter Results

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

Publication Year: 1965, Page(s): c1
| PDF (760 KB)
• ### IEEE Computer Group

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

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

Publication Year: 1965, Page(s): nil2
| PDF (43 KB)
• ### New Associate Editor for Analog and Hybrid Computers

Publication Year: 1965, Page(s): 123
| PDF (664 KB)
• ### Generation and Asymmetry of Self-Dual Threshold Functions

Publication Year: 1965, Page(s):125 - 136
Cited by:  Papers (5)
| | PDF (2232 KB)

Properties of self-dual threshold functions are discussed because of the importance of self-dual functions in threshold logic. Since any threshold function can be easily converted into or reduced from a positive self-dual threshold function, we will not lose generality in discussion by exploring the properties of positive self-dual threshold functions. First functions generated by additively or su... View full abstract»

• ### Lower Bounds of the Number of Threshold Functions and a Maximum Weight

Publication Year: 1965, Page(s):136 - 148
Cited by:  Papers (16)
| | PDF (1921 KB)

A lower bound on the number of threshold functions and a lower bound on the maximum of minimum weights of a threshold element are derived from a recursively constructed family of threshold elements. All threshold functions of n variables are difficult to construct for a general value of n, but it is shown that a large number of them can be constructed recursively from threshold functions of fewer ... View full abstract»

• ### Regular Expressions for Linear Sequential Circuits

Publication Year: 1965, Page(s):148 - 156
Cited by:  Papers (7)
| | PDF (1489 KB)

This paper considers the class of linear sequential circuits from the regular expression point of view. The circuits studied do not have special starting units which are necessary in the conventional construction of circuits from regular expressions. Since conventional regular expressions are only indirectly related to the circuit structure, a new regular language is developed. Using this language... View full abstract»

• ### Completeness of Sets of Delayed-Logic Devices

Publication Year: 1965, Page(s):157 - 172
Cited by:  Papers (8)
| | PDF (2814 KB)

This paper concerns a property of sets of delayed-logic devices. This property, called completeness, characterizes sets of logic devices that can be used for the construction of networks to represent any finite-state machine. Associated with this property is a rate of completeness, which is the maximum input sequence rate for which any finite-state machine can be constructed from the given set of ... View full abstract»

• ### On Complete Sets of Logic Primitives

Publication Year: 1965, Page(s):173 - 174
Cited by:  Papers (10)
| | PDF (305 KB)

A complete set of logic primitives is a set of devices which can be connected to represent any Boolean function of binary variables. This paper deals with the number of devices required in a complete set of logic primitives. It is well known that a complete set of logic primitives may contain as few as one element, e.g., NOR. It is the purpose of this paper to establish a least upper bound on the ... View full abstract»

• ### A Diagrammatic Approach to Multilevel Logic Synthesis

Publication Year: 1965, Page(s):174 - 181
Cited by:  Papers (5)
| | PDF (1112 KB)

A diagrammatic approach to the problem of synthesizing multilevel logic functions is presented. It has the advantage of giving a visual interpretation to such abstract concepts as fan-in, levels of logic, decomposition, and two-level forms. View full abstract»

• ### Minimal Square Rooting

Publication Year: 1965, Page(s):181 - 185
Cited by:  Papers (21)
| | PDF (767 KB)

Binary square rooting algorithms which yield a root in a redundant representation using digits 1, -1, and 0 are analyzed, particularly those yielding a root in a representation in which the number of nonzero digits is minimal. An algorithm which may lead to any possible minimal representation of the square root is developed. View full abstract»

• ### Bulk Processing in Distributed Logic Memory

Publication Year: 1965, Page(s):186 - 196
Cited by:  Papers (20)  |  Patents (5)
| | PDF (2244 KB)

Use of a content-addressable memory as a highly parallel digital computer is described. The ability to perform any arithmetic operation on many sets of data at the same time is shown. The memory organization and the storage of data are such that many operations are performed parallel by bit as well as parallel by word, resulting in more efficient algorithms and shorter execution times. Considerati... View full abstract»

• ### A Magnetically Scanned Magnetic Tape Transducer

Publication Year: 1965, Page(s):196 - 203
Cited by:  Papers (1)
| | PDF (2471 KB)

A new digital magnetic tape transducer intended to provide megabit per second data transfer speeds with moderate tape speed is described. This magnetic tape transducer contains no moving parts, but records on the tape along transverse tracks. Sweep of the effective or operative area of the transducer across the tape is accomplished by selectively controlling the permeability of one of the magnetic... View full abstract»

• ### Linear, Passive, Matched Filter for Digital Magnetic Recording

Publication Year: 1965, Page(s):204 - 209
Cited by:  Papers (2)
| | PDF (2153 KB)

A linear, passive matched filter is developed for the readback portion of digital magnetic recording systems. The filter, by maximizing the signal-to-noise ratio (SNR), improves the reliability of digital magnetic recording. This is necessary because the continuous improvement in magnetic recording resolution has brought about a consequent deterioration in the SNR. For the worst case, namely, when... View full abstract»

• ### Computer Recognition of Handwritten First Names

Publication Year: 1965, Page(s):210 - 217
Cited by:  Papers (5)
| | PDF (1220 KB)

Alearning program incorporating a version of stimulus-sampling theory was prepared for a digital computer. Handwritten first name signatures coded in a 20 by 48 grid served as inputs to study the effects of parameter changes in the program. Under one main condition the computer with its program examined only those grid cells in which any part of a given pattern fell. Under a second main condition ... View full abstract»

• ### Economical Circuits for the Analog Solution of Algebraic Equations

Publication Year: 1965, Page(s):217 - 229
| | PDF (2007 KB)

The only methods previously available for the design of stable analog circuits for the solution of algebraic equations involved extensive preparatory calculations or the use of an excessive number of amplifiers. This paper examines the causes of instability and gives a method which enables a stable circuit using the minimum of equipment to be designed for any nonsingular set of algebraic equations... View full abstract»

• ### Frequency Analysis of Truncation Errors in RC Networks

Publication Year: 1965, Page(s):229 - 233
| | PDF (693 KB)

This paper provides guidelines for the discretizing of the space variables in continuous systems governed by the second-order partial differential diffusion equation. Such lumping is necessary in all digital and many analog methods. To analyze the truncation error resulting from lumped analog or digital modelling, the authors demonstrate the applicability of an upper-bound criterion combining ampl... View full abstract»

• ### On Using an Analog Computer to Study Hydrodynamic Stability

Publication Year: 1965, Page(s):233 - 238
Cited by:  Papers (2)
| | PDF (965 KB)

The use of analog computers to study hydrodynamic stability is complicated by the fact that the governing differential equation has two rapidly varying solutions (one growing and one decaying), and two which are well behaved. Thus, errors in setting initial conditions and noise in an analog computer excite the rapidly growing solution, making the computer behave in an unstable way. This unstable b... View full abstract»

• ### Improved Methods of Simulating Time Delays

Publication Year: 1965, Page(s):239 - 243
Cited by:  Papers (8)
| | PDF (731 KB)

A new group of time-delay polynomial approximations are obtained by trial and error methods. The results of the trial and error procedure suggest an analytic method for finding the new approsimations. The new approximations and their usable bandwidths are tabulated for second-through sixth-order polynomials. Delay vs. frequency graphs of the fourth-and fifth-order polynomials are compared with sev... View full abstract»

Publication Year: 1965, Page(s):243 - 247
Cited by:  Papers (1)
| | PDF (677 KB)

A new principle and circuit for the generation of the product of two variables is described in which the required result is a linear combination of readily produced secondary variables. The product of two variables can be expanded in a series in which each term is derived from the preceding one and from an auxiliary variable by linear operations and by maximum and minimum selection. Two converte... View full abstract»

• ### Correction [to "An approach to single-threshold-element synthesis"]

Publication Year: 1965, Page(s): 247
| | PDF (130 KB)

M.L. Dertouzos, author of the paper "An Approach to Single-Threshold-Element Synthesis," which appeared on pp. 519-528 of the October, 1964, issue of these Transactions has called the following corrections to the attention of the Editor. On page 520, (3), the summation endpoints are corrected; on page 523, following (21), the equation is corrected; on page 525, the expression for Theorem 2 is corr... View full abstract»

• ### A Ternary Storage Element Using a Conventional Ferrite Core

Publication Year: 1965, Page(s): 248
Cited by:  Papers (2)
| | PDF (958 KB)

A new group of time-delay polynomial approximations are obtained by trial and error methods. The results of the trial and error procedure suggest an analytic method for finding the new approximations. The new approximations and their usable bandwidths are tabulated for second-through sixth-order polynomials. Delay vs. frequency graphs of the fourth-and fifth-order polynomials are compared with sev... View full abstract»

• ### Using a Decision-Table Structure as the Input Language Format for Programming Automatic Test Equipment Systems

Publication Year: 1965, Page(s):248 - 250
Cited by:  Papers (1)
| | PDF (1441 KB)

Compiler programs are used to convert engineering test specifications to a digital code which can be interpreted by the automatic test equipment system. A programming language based upon decisiontable techniques allows the test engineer to write his test statements in an extremely convenient fashion and permits him to program any test specification with only a minimum of knowledge about the specif... View full abstract»

• ### Chebyshev Approximation and Threshold Functions

Publication Year: 1965, Page(s):250 - 252
Cited by:  Papers (9)
| | PDF (633 KB)

Where previous authors have considered linear approximations with a minimum sum of squared differences, we consider, instead, Chehyshev linear approximations, which minimize the maximum deviation. We obtain thus: 1) A new characterization of threshold functions, 2) A characterization of optimal threshold realizations as being virtually identical to the Chebyshev-best linear approximations, and 3) ... View full abstract»

## Aims & Scope

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

Full Aims & Scope