By Topic

IEEE Transactions on Electronic Computers

Issue 5 • Date Oct. 1965

Filter Results

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

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

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

    Publication Year: 1965, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (134 KB)
    Freely Available from IEEE
  • Special Issue on High-Speed Memories

    Publication Year: 1965, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • In Appreciation

    Publication Year: 1965, Page(s): 682
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • An Algorithm for Linear Inequalities and its Applications

    Publication Year: 1965, Page(s):683 - 688
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    An exponentially convergent and finite algorithm is presented for the determination of the solution ¿ of the linear inequalities A¿≫0 for a given matrix A, or for determining the non-existence of solution for A¿≫0. This result is useful in threshold-switching theory and in pattern classification problems. Experiments indicate extremely rapid convergence of the method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal Shift-Register Realizations of Sequential Machines

    Publication Year: 1965, Page(s):688 - 700
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2591 KB)

    This paper is concerned with the problem of mechanizing synchronous sequential machines with the least number of shift registers. An algorithm, suitable for programming on a digital computer, is developed which starts with the state table of the given machine and yields mechanizations having the least possible number of shift registers. The algorithm is based on the fact that there is a one-to-one... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Synthesis of Combinational Logic with NAND or NOR Elements

    Publication Year: 1965, Page(s):701 - 705
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (587 KB)

    A synthesis technique is developed which forms an all NAND or all NOR structure from a combinational logical expression. The resultant structure has a maximum of three logic levels. It is shown that the structure can be obtained directly from the prime implicants describing the logical expression. Also, by grouping prime implicants into any one of three basic patterns, a reduction in the size of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Selecting an Optimum Set of Diagnostic Tests

    Publication Year: 1965, Page(s):706 - 711
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1009 KB)

    In the design of combinational diagnostic testing procedure for a large digital system, some redundant tests are expected. This paper describes an algorithm for selecting a good (locally optimized) set of diagnostic tests which contains no redundancy. The algorithm will in general tend to give a ``fairly good'' set of test patterns, but is not guaranteed to be absolutely minimal. An overall optimi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimates for Best Placement of Voters in a Triplicated Logic Network

    Publication Year: 1965, Page(s):711 - 717
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1005 KB)

    The reliability of a network of elements may be improved by triplicating the network and determining the output using majority voting logic. The reliability of the triplicated network depends on how the network is subdivided for voting purposes and the type of majority voting logic used. The optimum arrangement of elements and voters is established for the single voter scheme, and an estimate of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Analog Comparison for Hybrid Computation

    Publication Year: 1965, Page(s):717 - 719
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1251 KB)

    This paper describes the design of a new exceptionally fast analog comparator with digital output for hybrid computation. A wide-band dc amplifier with regenerative feedback permits high-speed comparator operation within 100 ns of zero crossing for all input rates of change between zero and 5×106 volts/second. Static hysteresis between ±10 mV and ±40 mV improves noise immunity. Drift... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization and Cardinality of Universal Functions

    Publication Year: 1965, Page(s):720 - 721
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Necessary and sufficient conditions that a Boolean function be universal, are established. It is demonstrated that most functions are in fact universal; thus, almost any function is a candidate for building the combinational logic of all computers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method of Determining the Number of Vertices Contained in the SC Network Corresponding to a Given SC Transmission Function

    Publication Year: 1965, Page(s):721 - 723
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Directed graphs are often models for discrete sequential systems like computer programs, code generators, Markov processes, linear sampled-data systems, etc. [1]-[11]. One can study the behavior of such systems in a unified manner by the generating and characteristic functions [1], [2], [9]. We present here certain algorithms, suitable for digital computer mechanization, viz., 1) detection of cert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connectivity Considerations of Graphs Representing Discrete Sequential Systems

    Publication Year: 1965, Page(s):724 - 727
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (879 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.
  • Encoding of Asynchronous Sequential Circuits

    Publication Year: 1965, Page(s):727 - 729
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 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 Note on the Problem of Classifying Vertices of the n Cube into m Categories

    Publication Year: 1965, Page(s):729 - 730
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (410 KB)

    Some methods of synthesis of networks composed of ternary majority elements such as the three-stable-state parametron or twin are studied. It is shown that three-place majority operation and diametrical negation (negation in the strong sense) with constants are functionally complete in three-valued logic. Classes of functions of two variables are studied for which networks realizing them contain n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Networks Composed of Ternary Majority Elements

    Publication Year: 1965, Page(s):730 - 733
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (663 KB)

    Some methods of synthesis of networks composed of ternary majority elements such as the three-stable-state parametron or twin are studied. It is shown that three-place majority operation and diametrical negation (negation in the strong sense) with constants are functionally complete in three-valued logic. Classes of functions of two variables are studied for which networks realizing them contain n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ``Ideally Fast'' Decimal Counters with Bistables

    Publication Year: 1965, Page(s):733 - 737
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    The counting speed is taken as the most important factor in the selection of decimal counter logical arrangements. Decimal counter arrangements with the counting speed equal to that of the basic bistable, termed ``ideally fast,'' are considered. The methods for making ``ideally fast'' counting logics are outlined. A number of ``ideally fast'' decimal counter arrangements with weighted and un-weigh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Critical Comparison of Two Kinds of Adaptive Classification Networks

    Publication Year: 1965, Page(s):737 - 740
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1082 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.
  • Logical Design of Analog-to-Digital Converters

    Publication Year: 1965, Page(s):740 - 741
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 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.
  • Letter to the Editor

    Publication Year: 1965, Page(s): 741
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (205 KB)
    Freely Available from IEEE
  • Contributors

    Publication Year: 1965, Page(s): 742
    Request permission for commercial reuse | PDF file iconPDF (892 KB)
    Freely Available from IEEE
  • Reviews of Books and Papers in the Computer Field

    Publication Year: 1965, Page(s):743 - 746
    Request permission for commercial reuse | PDF file iconPDF (1087 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1965, Page(s):747 - 757
    Request permission for commercial reuse | PDF file iconPDF (2869 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 1965, Page(s):758 - 761
    Request permission for commercial reuse | PDF file iconPDF (820 KB)
    Freely Available from IEEE

Aims & Scope

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

IEEE Transactions on Computers.

Full Aims & Scope