By Topic

IEEE Transactions on Electronic Computers

Issue 1 • Feb. 1966

Filter Results

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

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

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

    Publication Year: 1966, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (139 KB)
    Freely Available from IEEE
  • Editorial

    Publication Year: 1966, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (151 KB)
    Freely Available from IEEE
  • New Associate Editors and Reviews Editor

    Publication Year: 1966, Page(s): 2
    Request permission for commercial reuse | PDF file iconPDF (1105 KB)
    Freely Available from IEEE
  • Three Variable Multiple Output Tree Circuits

    Publication Year: 1966, Page(s):3 - 13
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1355 KB)

    This article treats the tree circuit synthesis problem for families F = {f1, f2, . . ., fm} of Boolean functions fj of the same three variables. In addition to the development of criteria for determining the most economical of the three possible tree circuit decompositions: fj(X3, X2, X1) = F3j,(G View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach for the Realization of Linearly-Separable Switching Functions

    Publication Year: 1966, Page(s):14 - 20
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1018 KB)

    A distinct and straightforward method to test and realize linearly-separable switching functions is presented. This method makes use of a universal map which facilitates the generation of inequalities and the detection of contradictions. It also eliminates any preprocessing (such as positivizing and ordering) of a given function. The concept of composite level is first defined. A map is then devel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Linearity of Sequential Machines

    Publication Year: 1966, Page(s):21 - 29
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1515 KB)

    This paper presents a method for determining, from the flow table of a sequential machine, whether the machine is linearly realizable using the minimum number of unit delay elements. The method is an extension of a previously presented method for autonomous machines. A linearity algorithm is presented for each of two cases: 1) where the output is given and is to be linear, and 2) where the output ... View full abstract»

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

    Publication Year: 1966, Page(s):29 - 35
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1186 KB)

    Conditions for equilibrium states in Boolean nets by delay-free feedback are investigated. The result is a new class of circuits called memories, the simplest member of which is the ordinary set-reset flip-flop. A memory is defined as an asynchronous sequential machine with specific properties. The need for gain in feedback loops and the assumption that each amplifier is a NOT operator make it pos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-Line Turing Machine Computations

    Publication Year: 1966, Page(s):35 - 44
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2086 KB)

    This paper investigates 1) the problem of finding lower bounds on the computation times of on-line Turing machines, and 2) the trade-off relationship between computation time and tape dimensionality. It considers problems in which a Turing machine is supplied with a sequence of inputs representing data to be stored on the machine's tape(s), followed by a sequence of inputs requesting the machine t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-threshold threshold elements

    Publication Year: 1966, Page(s):45 - 65
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3905 KB)

    A multi-threshold element is one in which several thresholds are used to separate the true inputs from the false inputs. Many circuit elements and configurations can be described by this model. An approach, based on conventional single-threshold threshold elements, is developed for the analysis and synthesis of multithreshold threshold elements. It is shown that the basic properties of such elemen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic Nets

    Publication Year: 1966, Page(s):66 - 73
    Cited by:  Papers (136)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1555 KB)

    A procedure is described for finding, by shortcut methods, a near-minimal set of tests for detecting all single faults in a combinational logic net. The procedure should prove useful for nets which are too large to be treated by more exact methods [2]. The set of tests so found also appears useful for diagnosing (i.e., locating) faults. The class of faults considered is that which causes connectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • COBLOC-A Program for All-Digital Simulation of a Hybrid Computer

    Publication Year: 1966, Page(s):74 - 82
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1667 KB)

    The COBLOC programming system was written to enable all-digital simulation of the operation of large mode-controlled hybrid computers. The COBLOC programming language is block-oriented and is easily learned, even by those without prior analog or digital computer programming experience. The inclusion of patchable logic simulation in COBLOC has extended the application of digital simulation techniqu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Processing of Algebraic Expressions

    Publication Year: 1966, Page(s):82 - 91
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1588 KB)

    A classification of the objectives and types of parallel processing gives the context of the prinicipal subjects of this paper. A compiler and machine organization which are capable of detecting opportunities for parallel processing in algebraic expressions and executing these by multiple processing units operating concurrently are described. The compiler algorithm, based on a tree structure of al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognition of Printed Chinese Characters

    Publication Year: 1966, Page(s):91 - 101
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2067 KB)

    The problem of recognizing a large alphabet (1000 different characters) is approached using a two stage process. In the first stage of design, the data is partitioned into groups of similar characters by means of heuristic and iterative algorithms. In the second stage, peephole templates are generated for each character in such a way as to guarantee discrimination against other characters in the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Corrections [to "An algorithm for linear inequalities and applications" and to "Logical design of analog-to-digital converters"]

    Publication Year: 1966, Page(s): 101
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (137 KB)

    Two corrections are presented: (1) The authors of the paper "An Algorithm for Linear Inequalities and Applications," which appeared on pages 683-688 of the October, 1965, issue of these Transactions, has called the following to the attention of the Editor. It was established in this paper that the algorithm converges to the solution (if one exists) in a finite number of steps and that the converge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical pairs and set systems

    Publication Year: 1966, Page(s):102 - 104
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 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.
  • Synchronizing Sequences for Incompletely Specified Flow Tables

    Publication Year: 1966, Page(s):104 - 105
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (363 KB)

    This paper presents a synthesis method of ternary digital systems by means of a threshold algebra. The method is based on the fact that the K operations of any ternary function can be expressed as threshold operations on a set of functions called midterms. Such midterms can be easily generated from the outputs of the ternary multivibrators described by the authors in a previous paper [4]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Threshold Synthesis of Ternary Digital Systems

    Publication Year: 1966, Page(s):105 - 107
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    This paper presents a synthesis method of ternary digital systems by means of a threshold algebra. The method is based on the fact that the K operations of any ternary function can be expressed as threshold operations on a set of functions called midterms. Such midterms can be easily generated from the outputs of the ternary multivibrators described by the authors in a previous paper [4]. The Quin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Series-to-Parallel Transformation of Linear Sequential Circuits

    Publication Year: 1966, Page(s):107 - 108
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB)

    In a recent paper,1 Hsiao and Sih proposed a method for transforming binary linear feedback shift registers (initially cleared) into a binary linear circuit with f input terminals and f output terminals which operates f times faster. In this manner, the availability of f channels, rather than one, can be exploited to process (and, in particular, encode and decode) data at a rate proport... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time Loss Through Gating of Asynchronous Logic Signal Pulses

    Publication Year: 1966, Page(s):108 - 111
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    The gating of asynchronous signals causes logical errors. It is possible to reduce the frequency of these errors, but the price paid is a severe loss of time and extra cost in hardware. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Reliability of a Sequential Machine by Error-Correcting State Assignments

    Publication Year: 1966, Page(s):111 - 113
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (626 KB)

    The problem considered in this paper is the design of a checking experiment which will determine from observation of input-output behavior whether a sequential switching circuit is operating correctly. An input sequence is applied to the circuit, and the output sequence is observed and compared to the correct output sequence which has been determined from the state table corresponding to the corre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An organization for checking experiments on sequential circuits

    Publication Year: 1966, Page(s):113 - 115
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (603 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.
  • Closed sets of boolean functions and the reliability problem for polyfunctional nets

    Publication Year: 1966, Page(s):115 - 117
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (639 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.
  • Simultaneous Multiple Response in Associative Memories and Readout of the Detector Matrix

    Publication Year: 1966, Page(s):117 - 118
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (497 KB)

    One of the time-consuming procedures in the operation of a digital computer arises from the need to rearrange portions of words during the execution of certain instructions. In a typical situation, the first stage of a complex control sequence is concerned with the disassembly of the word prior to sending the parts to registers for appropriate arithmetic treatment, and the last stage with reassemb... 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