By Topic

# IEEE Transactions on Electronic Computers

## Filter Results

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

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

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

Publication Year: 1965, Page(s): nil1
| PDF (132 KB)
• ### IEEE Computer Group Constitution and Bylaws Preface

Publication Year: 1965, Page(s): 1
| PDF (128 KB)
• ### Computer Group of The Institute of Electrical and Electronics Engineers, Inc.

Publication Year: 1965, Page(s):2 - 6
| PDF (1190 KB)
• ### A New Reader Service-Publication of Informational Retrieval Catalog Cards

Publication Year: 1965, Page(s):7 - 8
Cited by:  Papers (2)
| | PDF (387 KB)

A logical design theory for ternary voltage switching circuits is developed. The theory is based on familiar binary switching circuit elements and simplification methods. The theory thus leads to simple electronic realization. The basic system of ternary switching elements consists of function realizable by means of either diode gates or a single triode (transistor). View full abstract»

• ### A Graphical Interpretation of Realization of Symmetric Boolean Functions with Threshold Logic Elements

Publication Year: 1965, Page(s):8 - 18
Cited by:  Papers (13)
| | PDF (1790 KB)

A graphical interpretation of the realization of symmetric Boolean functions with threshold logic elements is presented, from which a systematic synthesis method is developed. Theoretically, symmetric functions of any number of variables can be realized. Examples are given to show that, practically, there is no difficulty at all in realizing symmetric Boolean functions of as many as thirty or fort... View full abstract»

• ### Logical Design of Ternary Switching Circuits

Publication Year: 1965, Page(s):19 - 29
Cited by:  Papers (32)
| | PDF (1608 KB)

A logical design theory for ternary voltage switching circuits is developed. The theory is based on familiar binary switching circuit elements and simplification methods. The theory thus leads to simple electronic realization. The basic system of ternary switching elements consists of function realizable by means of either diode gates or a single triode (transistor). Various simplification methods... View full abstract»

• ### The Use of Analog Techniques in Binary Arithmetic Units

Publication Year: 1965, Page(s):29 - 35
Cited by:  Papers (7)
| | PDF (1047 KB)

A new computing element is described in which binary numbers are added by means of analog techniques. It is shown that when this element, which will be called a quantiser, is used, the design of arithmetic units for digital computers is considerably simplified. In particular, it is possible to build simple parallel adders and multipliers which do not require any external programming and which may ... View full abstract»

• ### Schmoo Plot Analysis of Coincident-Current Memory Systems

Publication Year: 1965, Page(s):36 - 44
Cited by:  Papers (3)  |  Patents (4)
| | PDF (5408 KB)

The disturbed incremental magnetization changes that accompany the read and write operations of coincident-current memories are the cause of a serious noise problem in the attainment of high-speed memory performance. This paper examines the noise problem. Relationships which express the memory driver tolerances in terms of the core characteristics are presented; the operating schmoo is evolved and... View full abstract»

• ### A Design Theory of Recognition Functions in Self-Organizing Systems

Publication Year: 1965, Page(s):44 - 52
Cited by:  Papers (7)
| | PDF (1382 KB)

An analytical method of designing recognition functions in self-organizing systems is discussed in this paper. A mathematical model is defined which embodies recognition and learning processes based on past experiences. The desired function'' is introduced as the most faithful expression of recognition functions based on past experiences, and it is shown how to design the recognition function wh... View full abstract»

• ### The Solution of Lagrange's Equations by Analog Computation

Publication Year: 1965, Page(s):53 - 61
| | PDF (1453 KB)

A procedure for solving Lagrange's equations of motion by analog computation is discussed. The problem of summing loop instabilities is minimized because the coefficient matrix of the acceleration terms in the generalized force equations is positive definite. No computer instabilities occur if external generalized forces do not contain acceleration-dependent terms (from rubbing friction). A two-di... View full abstract»

• ### Correction [to "Some techniques of state assignment for synchronous sequential machines"]

Publication Year: 1965, Page(s): 61
| | PDF (151 KB)

R.M. Karp, author of "Some Techniques of State Assignment for Synchronous Sequential Machines," which appeared on pages 507-518 of the October, 1964, issue of these Transactions, notes corrections on page 511, column 1, line 36, and on page 517, "(2a)-(2d)" should be replaced by "a, b, c, and d" in the following places: column 1, 5 lines from the bottom, column 2, lines 1-2, line 25, and line 28. View full abstract»

• ### The Relationship of Algorithms Used with Adjustable Threshold Elements to Differential Equations

Publication Year: 1965, Page(s):62 - 63
Cited by:  Papers (6)
| | PDF (402 KB)

First Page of the Article
View full abstract»

• ### NAND-AND Circuits

Publication Year: 1965, Page(s):63 - 65
Cited by:  Papers (8)
| | PDF (567 KB)

Threshold functions and statistical recognition have been the subjects of many papers and, although the threshold functions have frequently been used as a logic implementation in empirical studies of pattern recognition [1], most, if not all, of the reported theoretical investigations treat these two subjects separately. The purpose of this paper is to present an equivalence between threshold func... View full abstract»

• ### The Boundary Matrix of Threshold Functions

Publication Year: 1965, Page(s):65 - 66
Cited by:  Papers (4)
| | PDF (410 KB)

In the design of registers for controlling a digital process, it is often desired to count through a sequence of specified length and terminate the count by returning to the initial state. A penalty is associated with the use of a straightforward binary code for such counters because of the large number of diodes required to implement the counter, and because of the pyramiding effect which heavily... View full abstract»

• ### Statistical Independence and Threshold Functions

Publication Year: 1965, Page(s):66 - 68
Cited by:  Papers (31)
| | PDF (606 KB)

The memory we describe here is a logical and practical outgrowth of the content addressable distributed logic memory of Lee and Paull.1 However, there are several significant differences: the inclusion of a "match" flip-flop and a "control" flip-flop in each cell of the memory, the addition of a "Mark" line to activate many cells simultaneously, and the control of the propagation of the marking si... View full abstract»

• ### Synthesis of Nonconstant Weight Binary Codes for Minimum Diode Counters

Publication Year: 1965, Page(s):69 - 72
| | PDF (685 KB)

First Page of the Article
View full abstract»

• ### An Improved Cell Memory

Publication Year: 1965, Page(s):72 - 75
Cited by:  Papers (11)
| | PDF (736 KB)

First Page of the Article
View full abstract»

• ### Microwave Readout of Ferrite Memory Storage

Publication Year: 1965, Page(s):75 - 76
Cited by:  Papers (2)
| | PDF (1318 KB)

Logic circuits composed of NOR or NAND elements are now being used extensively in digital systems, mainly because of their economy; one type of element may be used throughout an entire circuit. Assuming that the basic decision to use such "universal" elements has been made, the main design objective will usually be to produce either the fastest or the most economical circuit possible. The fastest ... View full abstract»

• ### On an Improved Diagnosis Program

Publication Year: 1965, Page(s):76 - 79
Cited by:  Papers (90)  |  Patents (1)
| | PDF (1844 KB)

One of the more promising areas of computer use involves the coupling of a man to a computer system for real-time problem-solving where the procedure for solution of the problem is either unknown or involves complex tasks, such as pattern recognition, that can best be performed by humans [1]. Unfortunately, a straightforward approach to such use commits significant amounts of computer time most of... View full abstract»

• ### Minimal Three-Variable NOR and NAND Logic Circuits

Publication Year: 1965, Page(s):79 - 81
Cited by:  Papers (9)
| | PDF (407 KB)

Cantor, Estrin and Turn have described a special-purpose structure to implement sequential table look-up (STL) algorithms for the evaluation of ln x and exp x.1 Tables of precomputed constants are used to transform the argument into a range where the function may be approximated by a simple polynomial. The transformation for ln x, originally proposed by Bemer,2 is where the set of constants ai are... View full abstract»

• ### An Experimental Study of an On-Line Man-Computer System

Publication Year: 1965, Page(s):82 - 85
Cited by:  Papers (2)
| | PDF (1516 KB)

An on-line man-computer program has been described and experimental results concerning the demands made upon the computer are reported. For this particular system it would appear unwise to attempt a time-sharing with other programs on most systems. The use, however, as a single multicomponent program is quite reasonable. It is felt that the functions that are defined and measured here are sufficie... View full abstract»

• ### A Class of Algorithms for Ln x, Exp x, Sin x, Cos x, Tan-1 x, and Cot-1 x

Publication Year: 1965, Page(s):85 - 86
Cited by:  Papers (27)  |  Patents (4)
| | PDF (237 KB)

First Page of the Article
View full abstract»

• ### Contributors

Publication Year: 1965, Page(s):87 - 88
| PDF (1399 KB)

## Aims & Scope

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

Full Aims & Scope