# IRE Transactions on Electronic Computers

## Filter Results

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

Publication Year: 1961, Page(s): c1
| PDF (783 KB)
• ### IRE Professional Group on Electronic Computers

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

Publication Year: 1961, Page(s): nil1
| PDF (117 KB)
• ### The Cascade Decomposition of Sequential Machines

Publication Year: 1961, Page(s):587 - 592
Cited by:  Papers (25)
| | PDF (858 KB)

This paper studies composite sequential machines obtained from smaller component machines by their connection in cascade, that is, the outputs from one component are the inputs to the next. Given the specification of a deterministic, completely specified, synchronous, sequential machine (Mealy model), a criterion is derived for such a specification to be decomposable into specifications of smaller... View full abstract»

• ### On the State Assignment Problem for Sequential Machines II

Publication Year: 1961, Page(s):593 - 603
Cited by:  Papers (63)
| | PDF (1890 KB)

The object of this paper is to find state assignments for the internal states of a sequential machine such that the logical equations representing the machine are relatively simple. This is done by finding assignments for which the computation of a particular state variable depends only on the previous values of a small subset of the variables. The chief tool is the concept of a partition pair, wh... View full abstract»

• ### A Truth Table Method for the Synthesis of Combinational Logic

Publication Year: 1961, Page(s):604 - 615
Cited by:  Papers (16)
| | PDF (2046 KB)

This paper describes a method for synthesizing a switching function directly from its: ruth table. A switching function is defined as any mapping of a set of binary input combinations onto 0 and 1. Hence, the procedures apply equally well to the don't care cases. The method rests on the concept alogically passive function (LPF). Roughly speaking, an LPF is a truth table which can be realized with ... View full abstract»

• ### The Use of the Simplex Algorithm in the Mechanization of Boolean Switching Functions by Means of Magnetic Cores

Publication Year: 1961, Page(s):615 - 622
Cited by:  Papers (2)
| | PDF (1263 KB)

An algorithm is described for mechanizing Boolean switching functions by means of a net of magnetic toroidal cores. The algorithm is referred to as Simplex and, in this application, is programmed for a digital computer. Computer solutions specify the wiring configuration for a core or net of cores yielding a device for performing combinational logic. Switching functions are realizable in essential... View full abstract»

• ### An Algorithm for Automatic Design of Logical Cryogenic Circuits

Publication Year: 1961, Page(s):623 - 630
Cited by:  Papers (5)
| | PDF (1194 KB)

Logical cryogenic circuits differ from the circuitry used with other devices as paths for both the required function and its denial must be provided. Present techniques for logical design of cryogenic circuits either rely on the experience of the designer to achieve a minimal circuit or are derived from analogous relay circuits. An algorithm to develop minimal (or near minimal) circuits by collaps... View full abstract»

• ### Geometric Mapping of Switching Functions

Publication Year: 1961, Page(s):631 - 637
| | PDF (1304 KB)

The geometric map described in this paper is a graphic representation, using vectors, of the conditions desired in the design of switching networks. This mapping technique makes the well-known techniques such as Boolean algebra, the Quine-McCluskey minimization chart, and Huffman's flow table more effective when designing optimum circuits. Its degree of flexibility in the selection of vectors is a... View full abstract»

• ### Bibliography on Switching Circuits and Logical Algebra

Publication Year: 1961, Page(s):638 - 661
Cited by:  Patents (3)
| | PDF (6728 KB)

This bibliography, which covers material published through 1958, contains nearly 700 references to articles, books, seminars, and other bibliographies pertaining to the theory of switching circuits and logical algebra. A relatively large number of the references are to foreign works, of which the Russian contribution is by far the greatest. An effort has been made to give exact bibliographical ref... View full abstract»

• ### An Algorithm for Rapid Binary Division

Publication Year: 1961, Page(s):662 - 670
Cited by:  Papers (16)  |  Patents (2)
| | PDF (1422 KB)

A new algorithm is given for reducing the number of additions and subtractions required in binary division in a computer. The algorithm is presented in two parts. A simplified algorithm, which can significantly reduce the number of operations with minimal additional circuitry, is used to develop the justification of the method. The complete algorithm introduces modifications which allow the minimu... View full abstract»

• ### A General Junction-Transistor Equivalent Circuit for Use in Large-Signal Switching Analysis

Publication Year: 1961, Page(s):670 - 679
Cited by:  Papers (7)
| | PDF (2012 KB)

This paper describes a general medium-speed junction-transistor equivalent circuit that is valid for large- and small-signal operation. Solutions of nonlinear differential equations written from the equivalent circuit for its response to large-signal driving pulses are obtained by graphical, analytic, and analog computer techniques. The static base-to-emitter V-I characteristic is used extensively... View full abstract»

• ### Using Digital Computers in the Design and Maintenance of New Computers

Publication Year: 1961, Page(s):680 - 690
Cited by:  Papers (4)
| | PDF (2192 KB)

To conserve manpower and reduce the time needed for designing, assembling, and maintaining new large-scale computers, existing computers have been used to produce design and maintenance data for the new machines automatically. This paper describes some techniques that were devised at the National Bureau of Standards for automatically converting a logical design into detailed wiring plans which spe... View full abstract»

• ### Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic Units

Publication Year: 1961, Page(s):691 - 698
Cited by:  Papers (82)  |  Patents (3)
| | PDF (1343 KB)

After a very brief summary of the various well-known methods of expediting carry-propagation in binary arithmetic units, the paper discusses and develops the anticipated-carry'' or carry-skip'' technique originally due in decimal form to Babbage, much used in mechanical calculators and lately revived for use in binary units. Various degrees of refinement are possible. It appears that for a giv... View full abstract»

• ### Some Properties of Binary Counters with Feedback

Publication Year: 1961, Page(s):699 - 701
Cited by:  Papers (4)
| | PDF (488 KB)

Properties of binary counters which have feedback connections are discussed. Various methods of determining the cyclic period have been reported, as well as techniques for synthesizing feedback connections to obtain a specific period. This paper presents a somewhat different approach to the period determination. It also includes a discussion of a simple method for determining the numerical values ... View full abstract»

• ### A Magnetostrictive Delay-Line Shift Register

Publication Year: 1961, Page(s):702 - 708
Cited by:  Papers (3)
| | PDF (1469 KB)

A brief theory of correlation, as applied to the recognition of a specific pattern in a binary signal, is presented. The digital shift register, which lends itself well to the practical application of the theory of correlation, is discussed. By digitizing the binary input signal and applying it to a closed-loop delay line, a time-compressed version of the input signal circulates on the line, and t... View full abstract»

• ### Proposal for Magnetic Domain-Wall Storage and Logic

Publication Year: 1961, Page(s):708 - 711
Cited by:  Papers (5)
| | PDF (716 KB)

Magnetic storage of binary digital information is currently accomplished by utilizing the two stable and degenerate energy states corresponding to opposite spatial directions of a magnetic domain. However, a second type of magnetic-energy degeneracy exists since a domain wall separating two domains has the same energy regardless of the sense (clockwise or counter-clockwise) of rotation of the magn... View full abstract»

• ### Cryosar Memory Design

Publication Year: 1961, Page(s):712 - 717
| | PDF (1749 KB)

The compensated cryosar is a negative-resistance two-terminal device utilizing a bulk effect in germanium at liquid helium temperatures. Its bistable nature, and the ease with which it can be fabricated in large arrays recommend it for application to computer memory systems. However, careful consideration of device and circuit parameters is necessary if a successful large memory is to be achieved. View full abstract»

• ### A Method for Resolving Multiple Responses in a Parallel Search File

Publication Year: 1961, Page(s):718 - 722
Cited by:  Papers (21)  |  Patents (1)
| | PDF (956 KB)

It is possible to build memories in which the contents of all registers are tested simultaneously, and in which there is a single indication of the presence or absence of any number of positive responses to the test criterion. A method is described for separately identifying the members of a set of responses by presenting sequences of tests which generate an identification number for each member. ... View full abstract»

• ### Drum Organization for Strobe Addressing

Publication Year: 1961, Page(s):722 - 729
Cited by:  Papers (2)
| | PDF (1652 KB)

In strobe addressing, a pulse from the memory drum or disk forces the control unit to accept a program word. Strobe addressing for drums or disks costs less than 20 per cent of conventional addressing for real-time control programs, but becomes impractical for very complex problems. A comparison of various forms of strobe and conventional addressing shows that simple strobe addressing uses the mem... View full abstract»

• ### Computer Languages for Symbol Manipulation

Publication Year: 1961, Page(s):729 - 735
Cited by:  Papers (6)
| | PDF (1515 KB)

Complex, flexible, computer programs can be written easily in list-processing languages. Storage registers are linked together in arbitrary sequences to form lists and list structures, which are the units of the languages. Special provisions are made for recursive subroutines and for hierarchical programs. These particular languages have been used to write game-playing, problem-solving, and other ... View full abstract»

• ### Computer Synthesis of Character-Recognition Systems

Publication Year: 1961, Page(s):735 - 747
| | PDF (2395 KB)

A SAP (Symbolic Assembly Program) package has been developed for the IBM 704 computer to simulate the logical tree of circuitry associated with a character-recognition device. The program has two major inputs: a particular set of logic statements (of AND and OR type) on cards, for flexibility, and tape reels of binary images of ideal or real characters. The output is the score'' of the logic: ho... View full abstract»

• ### An Incremental Computer Technique for Solving Coordinate-Rotation Equations

Publication Year: 1961, Page(s):748 - 751
Cited by:  Papers (1)
| | PDF (715 KB)

A method for solving coordinate rotation equations on an incremental digital computer is described in this paper. The method employs the basic incremental techniques used in a digital differential analyzer (DDA). However, the method differs from the usual DDA approach in that it takes full advantage of the possibilities for combining remainder,'' or R'' registers. This results in a reduction o... View full abstract»

• ### Two-Level Correlation on an Analog Computer

Publication Year: 1961, Page(s):752 - 758
Cited by:  Papers (2)
| | PDF (1043 KB)

It has been known for some time that an approximate correlation analysis of a random process can be performed using quantized values of the signal. The simplest form possible is a two-level correlation, wherein merely the polarities of the process at two sampling times, T1 and T2=T1+τ are compared. This report describes a study of this technique, using anal... View full abstract»

• ### Soviet Cybernetics and Computer Sciencesߞ1960

Publication Year: 1961, Page(s):759 - 776
Cited by:  Papers (2)
| | PDF (5159 KB)

This is the author's report of his visit to the Soviet Union in June and July, 1960. The purpose of the trip was to attend the First Congress of the International Federation of Automatic Control (IFAC) as an official American delegate. The author also arranged to meet with certain scientists in psychology, physiology, and the computer sciences, and to visit some Russian research institutions doing... View full abstract»

## Aims & Scope

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

Full Aims & Scope