IEEE Transactions on Computers

Issue 5 • May 1979

Filter Results

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

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

    Publication Year: 1979, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (227 KB)
    Freely Available from IEEE
  • Very Fast Fourier Transform Algorithms Hardware for Implementation

    Publication Year: 1979, Page(s):333 - 341
    Cited by:  Papers (77)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1972 KB)

    A new method of deriving very fast Fourier transform (FFT) algorithms is described. The resulting algorithms do not employ multiplication and have a form suitable for high performance hardware implementations. The complexity of the algorithms compares favorably to the recent results of Winograd [1]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis of Faults in Modular Trees

    Publication Year: 1979, Page(s):342 - 353
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3825 KB)

    Diagnosis of stuck-at faults (s-a-f's) in modular trees is studied. Detection conditions for each distinguishable s-a-f in a module are derived. For single s-a-f's, the detection conditions are easily partitioned to achieve fault location by performing a small number of additional tests. A multiple s-a-f that produces the same test result as a single s-a-f can be located by applying additional tes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System

    Publication Year: 1979, Page(s):354 - 361
    Cited by:  Papers (154)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2376 KB)

    Queueing models for a simple heterogeneous multiple processor system are presented, analyzed, and compared. Each model is distinguished by a job routing strategy which is designed to reduce the average job turnaround time by balancing the total load among the processors. In each case an arriving job is routed by a job dispatcher to one of m parallel processors. The job routing strategies are divid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and Optimal Design of Self-Diagnosable Systems with Repair

    Publication Year: 1979, Page(s):362 - 365
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    A new approach to the problem of diagnosability with repair of digital systems composed of n units, of which at most t are faulty, is introduced. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial Merging and Huffman's Algorithm

    Publication Year: 1979, Page(s):365 - 367
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    Huffman's algorithm produces an optimal weighted r-ary tree on a given set of leaf weights, where the weight of any parent node is the maximum of the son weights plus some positive constant. If the weights are viewed as (parallel) completion times, the algorithm has useful applications to combinatorial circuit design— especially for merging, or "fanning-in," a set of inputs with varying read... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Design of Easily Testable Iterative Systems of Combinational Cells

    Publication Year: 1979, Page(s):367 - 371
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    A design procedure is shown which allows the construction of one-dimensional iterative systems of combinational cells with good single stuck-at fault test complexity. Let S be a system where one of the M input words and two of the N states are defined for test purposes and the cells are realized as AND–EXOR normal form circuits, then S is testable with at most [log2(M x N) + 6] te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Number of Multivalued Switching Functions Realizable by Cascades

    Publication Year: 1979, Page(s):371 - 374
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    Butler [6] gave recurrence relations for computing the number Nr(n) of r-valued (r ≥ 2) switching functions of n variables realizable by a cascaded network of n - 1 r-valued cells. The cascades are assumed to have a fixed-input variable assignment. In this correspondence similar recurrence relations are presented for the number Mr(n) of such cascade realizable functions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal System Diagnosis Algorithms

    Publication Year: 1979, Page(s):374 - 378
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1153 KB)

    A class of simple digital system diagnosis algorithms is presented, and two members of the class are examined in detail. The algorithms are based on the assumption that good units can be replaced during the diagnosis process. Information pertaining to the system testing structure is not used by the two principal algorithms, so they can be applied regardless of system structure. The efficiency of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Announcing a new Quarterly IEEE Transactions ... IEEE Transactions on Pattern Analysis and Machine Intelligence

    Publication Year: 1979, Page(s): 378
    Request permission for commercial reuse | PDF file iconPDF (104 KB)
    Freely Available from IEEE
  • if your computer engineering library doesn't subscribe to all 4 it's not complete.

    Publication Year: 1979, Page(s): 378
    Request permission for commercial reuse | PDF file iconPDF (1319 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979, Page(s): 378
    Request permission for commercial reuse | PDF file iconPDF (158 KB)
    Freely Available from IEEE
  • Advance Program Announcement

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