By Topic

IEEE Transactions on Computers

Issue 4 • Date April 1980

Filter Results

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

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

    Publication Year: 1980, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (217 KB)
    Freely Available from IEEE
  • A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points

    Publication Year: 1980, Page(s):269 - 277
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2458 KB)

    An alternate algorithm to compute the discrete cosine transform (DCT) of sequences of arbitrary number of points is proposed. The algorithm consists of partitioning the DCT kernel into submatrices which by proper row and column shuffling and negations can be made equivalent to the group tables (or parts of them) of appropriate Abelian groups. The computations pertaining to the submatrices can be c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Systematically Designed Binary Array Processor

    Publication Year: 1980, Page(s):278 - 287
    Cited by:  Papers (26)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2506 KB)

    A class of binary array processors (BAP) have evolved over the past 20 years primarily intended for image-processing applications. The advent of large-scale integrated-circuit technology makes the construction of these processors feasible. In this paper three basic instruction types that characterize a BAP are defined and the systematic design of a processor called BASE is described in detail. Two... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generic Fault Characterizations for Table Look-Up Coverage Bounding

    Publication Year: 1980, Page(s):288 - 299
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3375 KB)

    Given any combinational, internal fan-out-free network and any complete single fault detection test set (SFDTS) for the network, we consider in this paper the problem of determining the minimal extent to which that SFDTS will cover multiple faults in the network. The basis of our approach is the development of a generic perspective to multiple faults which uses a representation of such faults call... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Control Overhead—A Performance Metric for Evaluating Control-Unit Designs

    Publication Year: 1980, Page(s):300 - 308
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2890 KB)

    The basic goal in the design of computer control units is the efficient, high-speed allocation, orchestration, and synchronization of the computer resources. The key concept to meeting the above requirements is the continual optimization of the control structure during the design process. This paper defines an approach to control optimization which is independent of the particular control structur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic Scheduling with Pipelined Processors

    Publication Year: 1980, Page(s):308 - 316
    Cited by:  Papers (19)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3747 KB)

    In this paper several results are proven showing a correspondence between problems involving task systems with single-stage processors and similar ones using pipelined processors. For example, an optimal schedule for a task system with arbitrary precedence constraints using a single pipelined processor with two stages is found by the familiar Coffman–Graham algorithm for a system with two si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Symmetric Cosine Transform

    Publication Year: 1980, Page(s):317 - 323
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1757 KB)

    A new discrete cosine transform is developed in such a way that its closeness to the Karhunen–Loeve transform can be established straightforwardly. The transform is characterized by a symmetric matrix and will be referred to as the symmetric cosine transform (SCT). It is shown that a simple window on the data vector makes its covariance matrix more tractable for the SCT. Since the derivation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Uniquely Decipherable Codes with Two Codewords

    Publication Year: 1980, Page(s):324 - 325
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (497 KB)

    It is shown that every uniquely decipherable code with just two codewords has finite delay. In addition, if a uniquely decipherable code with just two codewords is full, then it is trivial. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis of Instruction-Fetching Strategies in Pipelined Computers

    Publication Year: 1980, Page(s):325 - 329
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1125 KB)

    The performance of pipelined processors is heavily influenced by the effects of control-transfer, or branching, instructions, and various strategies have been used to reduce the delays incurred by these instructions. The position of the "control point" in the pipeline is an important factor that must also be taken into account, however, and this paper presents an analysis of its effects. Results a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Technique for Generating Specialized Gray Codes

    Publication Year: 1980, Page(s):329 - 331
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (591 KB)

    Gray codes with specialized properties, such as equalized change numbers for general logic circuits or desired statistical properties for experimental designs, can be developed from standard n-bit Gray codes by an efficient block-insertion technique guided by a scalar quality measure. Solutions for n = 5 through 8 are shown. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Fourier Transforms Over Extensions of Finite Rings

    Publication Year: 1980, Page(s):331 - 333
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A divisibility criterion is given for the existence of a Fourier transform over algebraic extensions of the ring of integers mod M which is generally easy to apply. We also present examples of how such transforms may be used to compute two-dimensional convolutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "An Algorithm for Fast Evaluation of Time Functions"

    Publication Year: 1980, Page(s): 333
    Request permission for commercial reuse | PDF file iconPDF (82 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings of the Conference on Specifications of Reliable Software

    Publication Year: 1980, Page(s): 333-a
    Request permission for commercial reuse | PDF file iconPDF (1232 KB)
    Freely Available from IEEE
  • 254: Proceedings: COMPCON 79 Fall "Using Microprocessors—Extending our Reach"

    Publication Year: 1980, Page(s): 333-b
    Request permission for commercial reuse | PDF file iconPDF (1296 KB)
    Freely Available from IEEE
  • 256 Proceedings: Symposium on Machine Processing of Remotely Sensed Data

    Publication Year: 1980, Page(s): 333-c
    Request permission for commercial reuse | PDF file iconPDF (1288 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1980, Page(s): 333
    Request permission for commercial reuse | PDF file iconPDF (154 KB)
    Freely Available from IEEE
  • The 10th International Symposium on Multiple-Valued Logic

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