IEEE Transactions on Computers

Issue 12 • Dec. 1973

Filter Results

Displaying Results 1 - 22 of 22
  • IEEE Transactions on Computers - Table of contents

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

    Publication Year: 1973, Page(s): c2
    Request permission for commercial reuse | |PDF file iconPDF (222 KB)
    Freely Available from IEEE
  • A Two's Complement Parallel Array Multiplication Algorithm

    Publication Year: 1973, Page(s):1045 - 1047
    Cited by:  Papers (319)  |  Patents (22)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1664 KB)

    An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complement multiplication is converted to an equivalent parallel array addition problem in which each partial product bit is the AND of a multiplier bit and a multiplicand bit, and the signs of all the partial product bits are positive. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Number of Classes of Binary Matrices

    Publication Year: 1973, Page(s):1048 - 1052
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1984 KB)

    Cellular switching theory gives rise to the problems of counting the number of equivalence classes of m X n matrices of zeros and ones under: 1) row and column permutations; and 2) row and column permutations together with column complementations. A number of techniques are given for the solution of these problems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Algorithm for the Generation of Nonparametric Curves

    Publication Year: 1973, Page(s):1052 - 1060
    Cited by:  Papers (12)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3504 KB)

    Generation of curves using incremental steps along fixed coordinate axes is important in such diverse areas as computer displays, digital plotters, and numerical control. Direct implementation of a nonparametric representation of a curve, f(x, y) = 0, has been shown to be attractive for digital generation. The algorithm in this paper is developed directly from the nonparametric representation of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Easily Testable Iterative Systems

    Publication Year: 1973, Page(s):1061 - 1064
    Cited by:  Papers (190)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (768 KB)

    It has been shown that the number of tests required to detect all faults in a one-dimensional unilateral combinational iterative array consisting of p cells will, in general, be proportional to p. In this paper we consider properties of such systems that enable them to be tested with a fixed constant number of tests independent of p, the number of cells in the system. Such systems are referred to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for the Optimal Solution of Linear Inequalities and its Application to Pattern Recognition

    Publication Year: 1973, Page(s):1065 - 1075
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3304 KB)

    An algorithm for the optimal solution of consistent and inconsistent linear inequalities is presented, where the optimality criterion is the maximization of the number of satisfied constraints. The algorithm is developed as a nonenumerative search procedure based on two new theorems established in this paper. It is shown that the number of iterative steps before termination is strictly less than t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Picture Processing Machine

    Publication Year: 1973, Page(s):1075 - 1087
    Cited by:  Papers (49)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (4416 KB)

    A parallel picture processing machine (PPM) is presented. The proposed machine can perform local operations of both logical and arithmetical character on three by three neighborhoods of digitized pictures. It is essentially a two-dimensional machine but in a restricted sense it can be regarded as three-dimensional. The instruction repertoire is thoroughly discussed and several program examples are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree Systems for Syntactic Pattern Recognition

    Publication Year: 1973, Page(s):1087 - 1099
    Cited by:  Papers (55)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (6392 KB)

    An approach of representing patterns by trees rather than by strings is described. A review of tree systems that include tree grammars, transformations, and mappings on trees and tree automata is briefly presented. The tree system is then applied to the problem of syntactic pattern recognition. Tree grammars are used for pattern description, and tree automata are used for classification. Illustrat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State Reduction in Incompletely Specified Finite-State Machines

    Publication Year: 1973, Page(s):1099 - 1102
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2864 KB)

    The problem of reducing the number of states in an arbitrary incompletely specified deterministic finite-state machine to k states (for a given k) has proven intractible to solution within "reasonable" time; most techniques seem to require exponential time. Two reduction techniques–state assignment to the DON'T CARE entries, and so-called "state splitting"–are investigated. For both of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops

    Publication Year: 1973, Page(s):1103 - 1109
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2464 KB)

    A synthesis method for multiple-input change asynchronous sequential machines is proposed. The method is based on the self-synchronization principle. The internal states are realized with edge-sensitive flip-flops which are triggered selectively. The new concept of selective triggering or controlled excitation results in considerable saving in logic and more flexible design. The state assignment i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Closure Partition Method for Minimizing Incomplete Sequential Machines

    Publication Year: 1973, Page(s):1109 - 1122
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (4904 KB)

    A new method based on a closure partition over a set of some compatibles is proposed for selecting a minimal machine from mutualy independent closure aggregates by simply checking only the trivial covering condition. The closure aggregates are derived from some closure related classes. The latter classes are derived from the closure classes by replacing aU superseded elements with their greatest s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study of Trigger Machines

    Publication Year: 1973, Page(s):1123 - 1131
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2824 KB)

    A synchronous sequential machine realizable in the form of a loop-free circuit of trigger flip-flops and combinational gates is called a trigger machine. This paper studies the properties of this class of machines. Most importantly, canonical circuit forms and canonical algebraic representations are presented. Other basic properties of trigger machines, many of which closely parallel those of defi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boundary Points of Threshold Functions

    Publication Year: 1973, Page(s):1132 - 1139
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2608 KB)

    Boundary points of a threshold function fare those vertices of the n-cube that produce a minimal irredundant set of inequalities for the realization of f. In this paper they are shown to be those vertices that can be contained in separating hyperplanes. With this theorem it is shown that knowledge of canonical boundary points of self-dual canonical threshold functions allows complete determination... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Another Proof of the Two-Dimensional Cayley-Hamilton Theorem

    Publication Year: 1973, Page(s): 1140
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (168 KB)

    Givone and Roesser [1] state a "two-dimensional" analog of the Cayley-Hamilton theorem: every square matrix satisfies its characteristic equation. Readers may be interested in a proof different from the one given in [1]. View full abstract»

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

    Publication Year: 1973, Page(s): 1140
    Request permission for commercial reuse | |PDF file iconPDF (158 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Future of Parallel Processing

    Publication Year: 1973, Page(s):1140 - 1143
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1032 KB)

    This correspondence considers the cost and performance factors in computer architecture and how they apply to parallel processors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on Review of Operating Systems Survey

    Publication Year: 1973, Page(s): 1143
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (264 KB)

    In the above-mentioned review1of Sayers' book2I commented favorably n Chapters 6-9 and the Appendixes but found the first 5 chapters unsatisfactory. I have since learned that Chapters 6-9 and the Appendixes are essentially word for word copies of two reports prepared for the Air Force by the Comtre Corporation. In the preface to Operating Systems Survey there is indeed an ack... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reply by M. James Errico3,4(415) 1143

    Publication Year: 1973, Page(s):(210) Reply by M. James Errico<sup>3,4</sup> 1143 - 1144
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB)

    The Comtre Corporation expended development funds that led to the award of several Air Force contracts. In turn, the Corporation hired technical employees to deliver reports against a specific statement of work to the Air Force. The technical people involved were paid a salary by the Corporation to work on these particular contracts. No individual was hired as an author for what was to become the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1973 Index IEEE Transactions on Computers Vol. C-22

    Publication Year: 1973, Page(s): 1144
    Request permission for commercial reuse | |PDF file iconPDF (3570 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1973, Page(s): 1144
    Request permission for commercial reuse | |PDF file iconPDF (289 KB)
    Freely Available from IEEE
  • Peripherals

    Publication Year: 1973, Page(s): 1144-n
    Request permission for commercial reuse | |PDF file iconPDF (1080 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org