IEEE Transactions on Electronic Computers

Issue 5 • Oct. 1964

Filter Results

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

    Publication Year: 1964, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (768 KB)
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1964, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1964, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • New Associate Editor for Logic and Switching Theory

    Publication Year: 1964, Page(s): 505
    Request permission for commercial reuse | PDF file iconPDF (711 KB)
    Freely Available from IEEE
  • Some Techniques of State Assignment for Synchronous Sequential Machines

    Publication Year: 1964, Page(s):507 - 518
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1951 KB)

    This paper is an extension of the work of Hartmanis and Stearns on sequential machine state assignments with reduced dependence. In Section II the critical partition pairs of transition-incomplete sequential machines are defined, and methods are given for computing them. Section III pursues certain combinatorial problems associated with the construction of assignments with reduced dependence, once... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to Single-Threshold-Element Synthesis

    Publication Year: 1964, Page(s):519 - 528
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1739 KB)

    An approach based on correlation techniques is developed for the analysis and synthesis of threshold elements. A necessary and sufficient condition for linear separability is derived. Single-threshold-element realizability of arbitrary Boolean functions of n variables is shown to be dependent on a (n+1)-tuple of real numbers (characteristic vector), derivable solely from the given Boolean function... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Invertible Boolean Functions

    Publication Year: 1964, Page(s):529 - 541
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1849 KB)

    A Boolean function has an inverse when every output is the result of one and only one input. There are 2n! Boolean functions of n variables which have an inverse. Equivalence classes of these functions are sets of equivalent functions in the sense that they are identical under a group operation on the input and output variables. This paper counts through five variables the number of equ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State-Logic Relations for Autonomous Sequential Networks

    Publication Year: 1964, Page(s):542 - 548
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1076 KB)

    A new theoretical approach to the description of state-logic relations is presented, which applies to linear as well as nonlinear autonomous networks. A formal link, based on a matrix algorithm, is found between the internal logic of the network and its terminal behavior. The application of matrix algebra is the most attractive and encouraging aspect of this theory, in view of possible systematic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Coding of Internal States of Sequential Circuits

    Publication Year: 1964, Page(s):549 - 562
    Cited by:  Papers (61)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2832 KB)

    This paper considers the problem of economical assignment of codes to the internal states of sequential circuits. The only restriction placed on these circuits is the fact that they are assumed to be clocked. The internal logic is realized with two-level diode or transistor circuitry, and the methods given here minimize both the number of gates and of gate inputs (diodes) required to realize a giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-Speed Adders and Comparators Using Transistors and Tunnel Dioes

    Publication Year: 1964, Page(s):563 - 575
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3090 KB)

    Comparators and adders are among the circuits that can take best advantage of the combined properties of transistors and tunnel diodes. The paper describes a transistor-tunnel diode complementary output pair module that is used as a basis for several configurations of comparators, half adder and full adder circuits. The comparators and half adders are discussed qualitatively. A detailed design and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fields in Strip-Lines for Film Memory Application

    Publication Year: 1964, Page(s):576 - 580
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (657 KB)

    This paper is of a semitutorial nature in that the transverse fields in a transmission system of the type existing in magnetic thin-film memories are shown to be obtainable by solution of the two-dimensional Laplace equation. The solution is carried out for the symmetrical shielded strip-line having a zero-thickness center conductor. Application of the specific results, which have not appeared bef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Coincident Current Magnetic Core Memory

    Publication Year: 1964, Page(s):580 - 585
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1649 KB)

    This paper describes a coincident current magnetic core memory with a capacity of 16,384 words, of 27 bits each and a cycle time of 1.2 μsec. It utilizes 30-mils ferrite toroid cores with low temperature coefficient, allowing operating temperature up to 75°C, thus eliminating the need for cooling equipment. The drive and sense system of the memory is unusually simple. The main concept... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Programmed Algorithm for Designing Multifont Character Recognition Logics

    Publication Year: 1964, Page(s):586 - 593
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1540 KB)

    This paper contains a discussion of a programmed algorithm for designing multifont recognition logics. This design algorithm automatically derives effective recognition logics from representative samples of characters. It has been applied to design. translational invariant logics for upper and lower case typewritten alphabets. Recognition performances in the order of a few errors per thousand char... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Systematic Approach to Programming an Analog Computer to Generate a Large Class of Trajectories

    Publication Year: 1964, Page(s):594 - 597
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB)

    The negative gradient method is extended to the stable analog computer programming of a class of nonlinear time-varying trajectory problems defined by ø(x, t) = 0, f(u, x, t) = 0, u = x = dx/dt, where x and u are n-dimensional vectors, ø is an m-dimensional position vector function (m View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Computer Technique for Treating Nonlinear Partial Differential Equations

    Publication Year: 1964, Page(s):597 - 605
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1405 KB)

    When digital computers are employed to solve linear and nonlinear partial differential equations using implicit finite-difference approximations, the most time-consuming portion of the calculation is the solution of the large system of simultaneous difference equations which must be carried out for each time increment. Recognizing that an analog computer system, by virtue of its parallel mode of o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Logical Gain

    Publication Year: 1964, Page(s):606 - 608
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (513 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Base 3 vs Base 2 Synchronous Arithmetic Units

    Publication Year: 1964, Page(s):608 - 609
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (438 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Proposal for Input of Hand-Drawn Information to a Digital System

    Publication Year: 1964, Page(s):609 - 611
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (606 KB)

    Much progress has been made in speeding up communications between input-output digital equipment and the central processing unit. Faster and faster card readers, printers and tape drives have been developed to match the vastly increased internal processing speeds of modern digital computers. In contrast, direct man-machine communication still lags far behind machine-machine data exchange. Much wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Proposal for an Associative Memory Using Magnetic Films

    Publication Year: 1964, Page(s): 611
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study of a Parametron on an Analog Computer

    Publication Year: 1964, Page(s):612 - 614
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (585 KB)

    It is possible to describe the behavior of a parametron [1] by Mathieu's equation after introducing certain simplifications. However, for an accurate, quantitative analysis, one has to take into account the nonlinear periodic change of parameters. In order to study the behavior more accurately, especially the transient behavior, an analog computer was employed to simulate a low-speed parametron. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolving Multiple Responses in an Associative Memory

    Publication Year: 1964, Page(s):614 - 616
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (602 KB)

    An interrogation routine is described which retrieves k multiple responses in, at best, (k+1) memory cycles and, at worst, (2k-1) memory cycles. In comparison, the fastest routine described in the literature, Lewin's routine5, always requires (2k-1) memory cycles. The reduction in number of memory cycles achieved by this interrogation routine is at the expense of some sophistication in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rise and Fall Times of Transistors in Switching Operation Regardless of the Driving Source Impedance

    Publication Year: 1964, Page(s):616 - 620
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (797 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel Diode Logic Circuits

    Publication Year: 1964, Page(s):620 - 623
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple Equivalent Circuits for a Step Recovery Diode and a Switching Transistor

    Publication Year: 1964, Page(s):623 - 625
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Extension of the Method of Cohn and Lindaman

    Publication Year: 1964, Page(s):625 - 629
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (598 KB)

    The merit of the method of Cohn and Lindaman for the synthesis of combinational logical functions using three-input majority elements depends mainly on the specialty of the function. An extension of the method of Cohn and Lindaman, which is effective even in the case that the specialty above mentioned does not hold, is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

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

IEEE Transactions on Computers.

Full Aims & Scope