IEEE Transactions on Computers

Issue 3 • March 1970

Filter Results

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

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

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (187 KB)
    Freely Available from IEEE
  • Decision-Directed Estimation of a Two-Class Decision Boundary

    Publication Year: 1970, Page(s):197 - 205
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2637 KB)

    A hybrid computer is described for implementing decision-directed estimators for the two-class unsupervised estimation problem. Extensions of the system design to the multiclass problem has significant application to computerized medical diagnosis and other problems in communications and pattern recognition. These problems include resolving multiple target bearings in sonar and radar, clustering d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Solution to the Hidden-Line Problem for Computer-Drawn Polyhedra

    Publication Year: 1970, Page(s):205 - 213
    Cited by:  Papers (35)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1404 KB)

    The "hidden-line problem" for computer-drawn polyhedra is the problem of determining which edges, or parts of edges, of a polyhedra are visible from a given vantage point. This is an important problem in computer graphics, and its fast solution is especially critical for on-line CRT display applications. The method presented here for solving this problem is believed to be faster than previously kn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Design of a Dynamic Microprocessor

    Publication Year: 1970, Page(s):213 - 222
    Cited by:  Papers (14)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1732 KB)

    Dynamic microprogramnming (i. e., utilizing a READ/ WRITE microstorage) allows the structure of a computer to be altered to suit a problem at hand and results in major efficiencies (an order of magnitude) in running time for nonarithmetic programs (e. g., compilers). View full abstract»

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

    Publication Year: 1970, Page(s):222 - 226
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (734 KB)

    Adoption of a negative radix for number representation results in a system that is totally indifferent to the sign of the number. Compared to the sign-magnitude representation, the approach considered here requires one extra digit. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Optimal Ierative Schemes for High-Speed Division

    Publication Year: 1970, Page(s):227 - 231
    Cited by:  Papers (10)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    This paper describes division schemes which are derived from the classical functional iterative schemes. These schemes are compared with t he schemes currently used in the high- speed digital computers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Essential Hazard Correction Without the Use of Delay Elements

    Publication Year: 1970, Page(s):232 - 238
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB)

    A method of essential hazard correction avoiding the insertion of delay elements into the feedback branches of an asynchronous switching circuit was suggested in a recent paper by Armstrong, Friedman, and Menon [4]. This method is always easily applicable when the line stray delays can be neglected, but the resulting circuit often contains branches with more than two levels of logical elements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for the Disjunctive Decomposition of Switching Functions

    Publication Year: 1970, Page(s):239 - 248
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1768 KB)

    An algorithm for obtaining all simple disjunctive decompositions of a switching function is described. The algorithm proceeds by testing for all decompositions with a bound set of size two. Under given conditions, this test for a pair of variables will show that some larger bound sets, containing the two variables for which the test was conducted, cannot yield a decomposition. The remaining bound ... View full abstract»

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

    Publication Year: 1970, Page(s):249 - 254
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The techniques for switching circuit synthesis rely heavily on the representations of the signals in the network. In this note a field-element representation and some synthesis techniques are discussed. An advantage of using field-element representations is that algebraic manipulations can be performed on the descriptions, simplifying some minimization problems. The networks which are minimized us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Finite-Memory Sequential Machines

    Publication Year: 1970, Page(s):254 - 258
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (671 KB)

    This paper shows that 1) there exist at least four types of binary-input binary-output maximum-memory n-state machines for any n; 2) there exist binary-input ternary-output maximum output -memory n-state machines for any n; and 3) there exists a binary- input binary-output maximum output-memory n-state machine for n≤5. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Diagnosis and Repair of Cutpoint Cellular Arrays

    Publication Year: 1970, Page(s):259 - 262
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (742 KB)

    A systematic fault-diagnosis procedure to locate all the faulty main-array columns and faulty rotated-array rows is presented. A simple method for repairing a cutpoint cellular array when the rotated array is not limited to being used as a collector array is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of an Arbitrary Switching Function with a Two-Level Network of Threshold and Parity Elements

    Publication Year: 1970, Page(s):262 - 269
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1596 KB)

    In this short note, the realization of an arbitrary switching function by an interconnection of threshold and parity elements is considered. Using several criteria, it is shown that parity functions and threshold functions are " opposites." This dis- similarity between threshold and parity elements coupled with the useful physical properties of parity elements indicates that a realization employin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transferable FORTRAN Subroutine for Rapid Extended Sorting

    Publication Year: 1970, Page(s):270 - 272
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3176 KB)

    A transferable, utility grade, FORTRAN subroutine is described which sorts lists of arbitrary length and simultaneously resequences up to ten additional lists so as to retain a one-to-one correspondence between the elements of these additional lists and those of the list being sorted. Lists within lists may be sorted. A simple CALL permits all options and parameters to be specified. The code is ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstracts of Current Computer Literature

    Publication Year: 1970, Page(s):273 - 290
    Request permission for commercial reuse | PDF file iconPDF (4361 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1970, Page(s): 290
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Blank Page

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

    Publication Year: 1970, Page(s): 290
    Request permission for commercial reuse | PDF file iconPDF (257 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1970, Page(s): 290
    Request permission for commercial reuse | PDF file iconPDF (27 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