IEEE Transactions on Computers

Issue 8 • Aug. 1979

Filter Results

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

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

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

    Publication Year: 1979, Page(s): 545
    Request permission for commercial reuse | |PDF file iconPDF (1106 KB)
    Freely Available from IEEE
  • Logic Design of Multivalued I2L Logic Circuits

    Publication Year: 1979, Page(s):546 - 559
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2814 KB)

    An algebraic system for designing multivalued (four-level) I2L circuits is presented here. It was necessary to develop this system because the use of existing multivalued logic formalisms does not result in efficient I2L circuits. The close relationship between the algebra and the integrated circuits is stressed throughout the paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Evaluating the Frequency of a Rotating Vector

    Publication Year: 1979, Page(s):560 - 566
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2221 KB)

    In this paper we present a new algorithm for evaluating the frequency F of a complex signal, represented by a rotating vector. We consider the two components of the signal on the real and on the imaginary axis, and we suppose we have for each component a sequence of N samples uniformly spaced at intervals T. Each sample represents a value of the pertinent component of the signal corrupted by noise... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Routing Algorithm for Signal Processing Networks

    Publication Year: 1979, Page(s):567 - 572
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2403 KB)

    Algorithms are described here which are suitable for control of a distributed network of signal processors which are interconnected with dedicated paths using decentralized routing control. This paper discusses the algorithm used to implement the processing required at the switching node processor, which can be realized with any of several LSI technologies. Although centralized systems are more ef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buffer Behavior in Computer Communication Systems

    Publication Year: 1979, Page(s):573 - 576
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1559 KB)

    A buffer has been analyzed in a computer communication system with Poisson arrivals, periodic opportunities for service, and random blocking of service. The solution obtained reflects the waiting a customer must do until a service opportunity arises. Compared to previous solutions for this problem, the average queue length and the variance of queue length are larger by a factor which depends on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FFT Length in Digital Filtering

    Publication Year: 1979, Page(s):577 - 580
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (781 KB)

    When the FFT is employed for nonrecursive digital filtering, the time required to process one block of input data, N samples long, is often approximately of the form N(logr (N) + Q), where Q ≥ 0. Earlier results on determining optimum N have assued Q ≥0, becauese it has long been informally observed that typically little is to be gained by taking the value of Q > 0 into account, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "When to Use Random Testing"

    Publication Year: 1979, Page(s):580 - 581
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (400 KB)

    This correspondence indicates a weakness in forming the criteria used to decide when random testing is practical. The use of average fan-in based on total gate count is an oversimplification and results in too low a threshold for use of random testing in lieu of a complete test of 2N patterns. A modification is given to avoid this difficulty. View full abstract»

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

    Publication Year: 1979, Page(s): 581
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (182 KB)

    P. B. Schneck is right in pointing out that maximum fan-in will lead to a more conservative estimate of the number of random patterns needed for complete testing. It is, however, useful to compare these estimates with practical cases. We will consider two examples. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Application-Oriented Programming Language for Sequential Machine Studies

    Publication Year: 1979, Page(s):582 - 586
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1101 KB)

    Automat is an application-oriented programming language for the study of sequential machines represented as generalized transition tables. The system is implemented as an embedded extension of Snobol4, and includes a large number of operations on sets, partitions, and transition tables. A comprehensive utility system for finite-state machines is a major application of the language; programs implem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Examination of the Cost Function for Programmable Logic Arrays

    Publication Year: 1979, Page(s):586 - 590
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (781 KB)

    Cost functions for combinational switching circuits are commonly defined as monotonically increasing functions of the number of gates and the number of inputs. The structure of programmable logic arrays (PLA's) is such that the cost is more aptly only dependent on gate quantity. The consequences of redefining cost for PLA's are studied with respect to covering algorithms. The major benefits are th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advance Program Announcement

    Publication Year: 1979, Page(s): 590
    Request permission for commercial reuse | |PDF file iconPDF (1312 KB)
    Freely Available from IEEE
  • call for papers

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

    Publication Year: 1979, Page(s): 590
    Request permission for commercial reuse | |PDF file iconPDF (154 KB)
    Freely Available from IEEE
  • Announcing... The IEEE Computer Society's Tutorial Week 79

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