By Topic

IEEE Transactions on Computers

Issue 5 • May 1978

Filter Results

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

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

    Publication Year: 1978, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (252 KB)
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1978, Page(s): 385
    Request permission for commercial reuse | PDF file iconPDF (1246 KB)
    Freely Available from IEEE
  • Rebalancing Height Balanced Trees

    Publication Year: 1978, Page(s):386 - 396
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2786 KB)

    A new balancing technique for binary search trees is presented, based on the repositioning of k + 1 nodes (k-rotation) Some properties of k-rotation are shown, and bounds to k are derived. The performance of such a technique is discussed on the basis of the length of node search and the frequency of tree rebalancing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous State Assignments with Unateness Properties and Fault-Secure Design

    Publication Year: 1978, Page(s):396 - 404
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2551 KB)

    Techniques to construct standard state assignments that yield unate next-state functions are presented. These proposed assignments use Berger codes. It is established that for any N row flow table, it is possible to construct View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of Cold-Start Miss Ratios

    Publication Year: 1978, Page(s):404 - 408
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1979 KB)

    Cold-start miss ratios are miss ratios that are measured with an initially empty first-level store. The values obtained depend on C, the first-level storage capacity, and on T, the number of references. These miss ratios, measured for various values of T, are useful in evaluating the effect of task switching on cache miss ratios when the cache capacity is C. For a particular (C, T) a practical met... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory Hierarchy Configuration Analysis

    Publication Year: 1978, Page(s):408 - 413
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3402 KB)

    This paper presents an analytical study of speed-cost tradeoffs in memory hierarchy design. It develops an optimization criterion by which average access time, i. e., memory system delay, is minimized under a cost constraint for a hierarchy with given memory sizes and access probabilities. Using a power function assumption relating speed and cost of memory units, it is shown that an optimized hier... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Solution of Ordinary Differential Equations

    Publication Year: 1978, Page(s):413 - 420
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3761 KB)

    This paper presents a performance comparison of three parallel algorithms for the solution of sets of coupled first-order differential equations. A general format for comparison of the algorithms is given, and performance equations for the two processor cases are developed. The equations take into account both the computational and intercommunications requirements of the processors. These equation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theoretical Limitations on the Efficient Use of Parallel Memories

    Publication Year: 1978, Page(s):421 - 428
    Cited by:  Papers (57)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2499 KB)

    The effective utilization of single-instruction-multiple-data stream machines depends heavily on being able to arrange the data elements of arrays in parallel memory modules so that memory conflicts are avoided when the data are fetched. Several classes of storage algorithms are presented. Necessary and sufficient conditions are derived which can be used to determine if all conflict can be avoided... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realizations of Sequential Machines Using Random Access Memory

    Publication Year: 1978, Page(s):429 - 441
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3374 KB)

    Modern large scale integration techniques, microcomputers, and programming techniques have made the classical realizations of sequential machines obsolete. These applications of sequential machines all occur in environments where random access memory, whether read-only or writable, is an extremely cost effective device. This paper presents a realization of a sequential machine which preserves the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognition of Spoken Words and Phrases in Multitalker Environment Using Syntactic Methods

    Publication Year: 1978, Page(s):442 - 452
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4005 KB)

    We describe a method of recognizing isolated words and phrases from a given vocabulary spoken by any member in a given group of speakers, the identity of the speaker being unknown to the system. The word utterance is divided into 20-30 nearly equal frames, frame boundaries being aligned with glottal pulses for voiced speech. A constant number of pitch periods are included in each frame. Statistica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Detection of Bridge Faults and Stuck-At Faults in Two-Level Logic

    Publication Year: 1978, Page(s):452 - 455
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1960 KB)

    Bridge faults are caused by permanent circuit failures which result in two signal wires in a logic network becoming accidentally shorted. Such faults cannot be modeled as stuck-at faults. Some of them have the effect of transforming a combinational logic circuit into a sequential circuit. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Class of Linear Codes for Error Control in Byte-per-Card Organized Digital Systems

    Publication Year: 1978, Page(s):455 - 459
    Cited by:  Papers (33)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    To improve the reliability of computer memories error-correcting and/or error-detecting codes have been successfully used. To provide for error control in systems organized to have b bits per card a new class of codes for simultaneous error correction and error detection is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path Complexity of Logic Networks

    Publication Year: 1978, Page(s):459 - 462
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (750 KB)

    The problem of measuring the structural complexity of logic networks is examined. A complexity measure π(N) is proposed which is the total number of input-output paths in an acyclic network N. π(N) is easily computed by representing network structure in matrix form. It is shown that simple upper bounds on the number of tests required by a combinational network N can be derived from π... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of the Keyhole Shaped Tombs by Template Matching Method

    Publication Year: 1978, Page(s):462 - 467
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2247 KB)

    The key-hole shaped tomb mounds have significant information in their characteristic shapes for clarifying the political background in the ancient period of Japan. This correspondence describes the basic research done for applying template matching techniques to the archaeological investigation of such shapes as the ancient tomb mounds. The results of our computer scientific classification are sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Detection of Terminal Stuck-Faults

    Publication Year: 1978, Page(s):467 - 469
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (582 KB)

    Two lower bounds on the length of terminal stuck-fault tests and a technique to facilitate detection of terminal stuck-faults are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suggested Standard Forms for Certain Real Hadamard Matrices

    Publication Year: 1978, Page(s):469 - 471
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (534 KB)

    Any Hadamard matrix constructed by methods of R. E. A. C. Paley can be converted easily by one or two elementary matrix operations to a form sharing at least four desirable properties with standard forms of Walsh matrices: symmetry, zero trace, normal form, and the same number of 1's as −1's in every row and column except the 0th row and 0th column. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1976-1977 List of Referees

    Publication Year: 1978, Page(s):472 - 476
    Request permission for commercial reuse | PDF file iconPDF (480 KB)
    Freely Available from IEEE
  • Books for Computer Professionals

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

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

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