By Topic

IEEE Transactions on Computers

Issue 10 • Date Oct. 1974

Filter Results

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

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

    Publication Year: 1974, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (196 KB)
    Freely Available from IEEE
  • Fourier Transform Computers Using CORDIC Iterations

    Publication Year: 1974, Page(s):993 - 1001
    Cited by:  Papers (114)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2784 KB)

    The CORDIC iteration is applied to several Fourier transform algorithms. The number of operations is found as a function of transform method and radix representation. Using these representations, several hardware configurations are examined for cost, speed, and complexity tradeoffs. A new, especially attractive FFT computer architecture is presented as an example of the utility of this technique. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight-Preserved Single-Error-Correcting Scheme for Binary Adders

    Publication Year: 1974, Page(s):1002 - 1007
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2240 KB)

    A new single-error-correcting scheme for binary adders is devised in this paper. A new weight function [called the Arithmetic Series Weight Function (ASWF)] of binary integers is defined. By using this weight function, a simple weight-preserved relation among the operands, sums and carries of binary adders is obtained. The error-correcting scheme is based on this relation. The redundancy of this s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unate Cascade Realization of Synchronous Sequential Machines

    Publication Year: 1974, Page(s):1008 - 1019
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3040 KB)

    In this paper the problems associated with the minimal realization of synchronous sequential machines by unate cellular cascades have been studied. Given the sequential machine in the form of a flow table, a systematic procedure is followed to generate all the selectable sets. Compatible sets consisting of these selectable sets are next determined and the different secondary variables are assigned... View full abstract»

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

    Publication Year: 1974, Page(s):1020 - 1029
    Cited by:  Papers (4)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3304 KB)

    This paper introduces a class of programmable cellular arrays, called control arrays, and presents a technique for programming these arrays to realize asynchronous control systems. Control arrays are two-dimensional uniform networks composed of a collection of identical cells that can be independently programmed to one of two internal states. A control system is a device that controls one or more ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundancy Testing in Combinational Networks

    Publication Year: 1974, Page(s):1029 - 1047
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5176 KB)

    A simple, necessary and sufficient test is developed for testing whether a single connection in a tree-type NAND network is redundant. A procedure is presented for testing every connection in the network. The computational complexity of the procedure is mi2 where m = the number of gates and i = the average number of inputs per gate in the network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Direct Transition Memory and its Application in Computer Design

    Publication Year: 1974, Page(s):1048 - 1061
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3352 KB)

    This paper investigates a potential application of microprogrammable memories to the problem of sequential network synthesis and computer design. It is shown that by allowing a controllable amount of memory redundance, a microprogrammed emulation of a state table can be organized such that decision branches in the microprogram are achieved in an immediate multiport manner, without the need of addi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Routing in a Packet-Switched Computer Network

    Publication Year: 1974, Page(s):1062 - 1069
    Cited by:  Papers (55)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2856 KB)

    The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Procedures for Eliminating Static and Dynamic Hazards in Test Generation

    Publication Year: 1974, Page(s):1069 - 1078
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4424 KB)

    One problem associated with test generation algorithms for sequential circuits is that they often produce tests which, when applied to the circuit under test, create static and/or dynamic hazards which may invalidate the test. Usually, for static hazards, but not dynamic hazards, these situations can be predicted using a logic simulator. In this paper we present procedures which can be added to pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effects of Races, Delays, and Delay Faults on Test Generation

    Publication Year: 1974, Page(s):1078 - 1092
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3752 KB)

    Test sequences constructed by most test generation procedures often create time dependent results when applied to a circuit. These dependencies often invalidate the test. The main cause for this situation is that the test generation procedures and circuit models employed do not take into account many aspects of delay associated with a circuit. In this paper we present modeling techniques to be use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Solving Polynomial Equations by Continued Fractions

    Publication Year: 1974, Page(s):1093 - 1097
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A method for the approximation of all the real roots of an n-order polynomial equation is developed. It is assumed that intervals containing the solutions are known. Bilinear transformations are used to approximate the solution. Convergence is achieved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Solution of Boolean and Pseudo-Boolean Relations

    Publication Year: 1974, Page(s):1098 - 1100
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    This correspondence deals with collections of n binary relations between Boolean and/or pseudo-Boolean functions which are combined by an n-ary relation. A new algorithm is described for solving these relations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on Self-Checking Checkers

    Publication Year: 1974, Page(s):1100 - 1102
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    Totally self-checking checkers for k-out-of-(2k + 1), (k + 1)-out-of-(2k + 1), and k-out-of-2k codes are given. The new checkers for the k-out-of-2k codes require only 2k tests to detect all stuck-at faults. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B74-41 The Metaphorical Brain, an Introduction to Cybernetics as Artificial Intelligence and Brain Theory

    Publication Year: 1974, Page(s):1103 - 1104
    Request permission for commercial reuse | PDF file iconPDF (456 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1974, Page(s): 1104-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • IEEE Computer Society Membership & Publications

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