By Topic

IEEE Transactions on Computers

Issue 5 • May 1977

Filter Results

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

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

    Publication Year: 1977, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (211 KB)
    Freely Available from IEEE
  • ULM Implicants for Minimization of Univers Logic Module Circuits

    Publication Year: 1977, Page(s):417 - 424
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2325 KB)

    In this paper a method is developed for circuit minimization using the universal logic modules (ULM's) of Yau and Tang. This objective is obtained by using an extension of prime implicants termed ULM implicants. Each ULM implicant implies one possible saving of a module in the tree structure implementing a function. The method is developed for the ULM(l) and an extension to the higher order ULM(p)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Storage Reduction Through Minimal Spanning Trees and Spanning Forests

    Publication Year: 1977, Page(s):425 - 434
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2753 KB)

    It is often possible to save storage space in a computer by storing only the differences among data items rather than the entire items. For example, suppose we have two records A and B. We should store all of A, then for B store a pointer to A and the differences between A and B. If A and B are similar, there will be few differences and storage space can be saved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Natural, Dyadic, and Sequency Order Algorithms and Processors for the Walsh-Hadamard Transform

    Publication Year: 1977, Page(s):435 - 442
    Cited by:  Papers (29)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2182 KB)

    The Walsh-Hadamard transform has recently received increasing attention in engineering applications due to the simplicity of its implementation and to its properties which are similar to the familiar Fourier transform. The transform matrices found so far to possess fast algorithms are the naturally ordered and dyadically ordered matrices, whose algorithms are similar to the Cooley-Tukey algorithm,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Suboptimal Wiener Filtering of Markov Sequences

    Publication Year: 1977, Page(s):443 - 449
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1900 KB)

    Computational aspects of Wiener filtering of discrete Markov sequences are studied. It is shown that using lower triangular transformation, an extremely efficient suboptimal Wiener filter can be designed. The performance of the suboptimal filter for a first-, second-, and third-order Markov sequence is evaluated and is compared to the performance of the Wiener filter for these sequences. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Optimal Interconnection of Circuit Modules in Microprocessor and Digital System Design

    Publication Year: 1977, Page(s):450 - 457
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2577 KB)

    This paper studies the problem of interconnecting circuit modules in microprocessor and digital system design. This problem is ever-present and has generally been handled in a heuristic manner. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Indirect Binary n-Cube Microprocessor Array

    Publication Year: 1977, Page(s):458 - 473
    Cited by:  Papers (325)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4108 KB)

    This paper explores the possibility of using a large-scale array of microprocessors as a computational facility for the execution of massive numerical computations with a high degree of parallelism. By microprocessor we mean a processor realized on one or a few semiconductor chips that include arithmetic and logical facilities and some memory. The current state of LSI technology makes this approac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduction of Depth of Boolean Networks with a Fan-In Constraint

    Publication Year: 1977, Page(s):474 - 479
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2533 KB)

    In this paper we presentt family of techniques for the design of combinational networks whose objective is the reduction of the number of levels, subject to a constraint on the fan-in of the logic gates. We show that a Boolean expression with n literals and involving the connectivest AND and OR can be restructured so that the resulting network of AND and OR gates has depth at most Cllog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Effective Bandwidth of Parallel Memories

    Publication Year: 1977, Page(s):480 - 490
    Cited by:  Papers (55)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3195 KB)

    The object of this paper is to bring together several models of interleaved or parallel memory systems and to expose some of the underlying assumptions about the address streams in each model. We derive the performance for each model, either analytically or by simulation, and discuss why it yields better or worse performance than other models (e.g., because of dependencies in the address stream or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SCIRTSS: A Search System for Sequential Circuit Test Sequences

    Publication Year: 1977, Page(s):490 - 502
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4783 KB)

    This paper describes SCIRTSS (a sequential circuit test search system). An analytical basis is given for using tree search techniques in determining test sequences for sequential circuits. The basic algorithm for the system of SCIRTSS programs is described and the extent to which the user can influence the search procedure is discussed. Included are the results of the application of SCIRTSS to eig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method to Generate the Prime Cascades of an Arbitrary Switching Function

    Publication Year: 1977, Page(s):503 - 506
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (931 KB)

    A method is described to generate all prime cascades of the restricted Maitra type with fixed input order, of an arbitrary switching function. The method allows the optimal synthesis of cutpoint cellular arrays. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Performance Issues in Multiprocessor System Design

    Publication Year: 1977, Page(s):506 - 511
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (923 KB)

    Analytic and simulation models of memory interference have been reported in the literature. These models provide tools for analyzing various system architecture alternatives. Some of the design parameters are processor speed, memory speed, number of processors, number of memories, use of cache memories, high-order versus low-order interleaving, and memory allocation. This correspondence applies ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Note on Base –2 Arithmetic Logic"

    Publication Year: 1977, Page(s): 511
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    Recently, Yuen1 has given simple methods for positive-negative base conversion. This correspondence presents a straightforward and complete proof for his algorithmetic steps. A few comments on the choice of negabinary adders with positive twin carries and with positive and negative carries have also been added. View full abstract»

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

    Publication Year: 1977, Page(s):511 - 512
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (298 KB)

    I am grateful to D. P. Agrawal for his enlightening comments, and take the opportunity to add the following remarks for general interest View full abstract»

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

    Publication Year: 1977, Page(s): 512
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (102 KB)

    The solution to the problem of counting of m X n matrices of zeros and ones under 1) row and columns permutations and 2) row and columns permutations together with columns complementations is given in Harrison's1 paper. The first problem is more complicated than the second one, since the author claims the second is "an easy generalization" of the first. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

    Publication Year: 1977, Page(s): 512
    Request permission for commercial reuse | PDF file iconPDF (128 KB)
    Freely Available from IEEE
  • Compcon 77 Fall

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