By Topic

Computers, IEEE Transactions on

Issue 11 • Date Nov. 1979

Filter Results

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

    Publication Year: 1979 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (389 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1979 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (227 KB)  
    Freely Available from IEEE
  • An Optimal Solution for the Channel-Assignment Problem

    Publication Year: 1979 , Page(s): 807 - 810
    Cited by:  Papers (36)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2009 KB)  

    Given a set of intervals (pairs of real numbers), we look at the problem of finding a minimal partition of this set such that no element of the partition contains two overlapping intervals. We exhibit a Θ(N log N) algorithm which is optimal. The problem has applications in LSI layout design and job scheduling. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal Multicode STT State Assignments for Asynchronous Sequential Machines

    Publication Year: 1979 , Page(s): 811 - 818
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2372 KB)  

    A universal single transition time (STT) state assignment is a way to give a valid STT state assignment in which all state variables that must change in a given transition are allowed to change simultaneously without critical races for any asynchronous sequential machine regardless of the configuration of its flow table. This paper presents a new systematic procedure for constructing universal STT... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of the Multidimensional Generalized Discrete Fourier Transform

    Publication Year: 1979 , Page(s): 819 - 830
    Cited by:  Papers (10)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3015 KB)  

    In this work the generalized discrete Fourier transform (GFT), which includes the DFT as a particular case, is considered. Two pairs of fast algorithms for evaluating a multidimensional GFT are given (T-algorithm, F-algorithm, and T′-algorithm, F′-algorithm). It is shown that in the case of the DFT of a vector, the T-algorithm represents a form of the classical FFT algorithm based on a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of FFT Structures Using the Residue Number System

    Publication Year: 1979 , Page(s): 831 - 845
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (4706 KB)  

    This paper considers the implementation of a fast Fourier transform (FFT) structure using arrays of read-only memories. The arithmetic operations are based entirely on the residue number system. The most important aspect of the structure relates to the scaling arrays, which are required to prevent overflow. Because of the limitations of the number system, scaling factors have to be chosen on an a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of Faults in Programmable Logic Arrays

    Publication Year: 1979 , Page(s): 845 - 853
    Cited by:  Papers (77)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3931 KB)  

    A new fault model is proposed for the purpose of testing programmable logic arrays. It is shown that a test set for all detectable modeled faults detects a wide variety of other faults. A test generation method for single faults is then outlined. Included is a bound on the size of test sets which indicates that test sets are much smaller than would be required by exhaustive testing. Finally, it is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Design for Multiple-Valued Logic Gates Based on MESFET's

    Publication Year: 1979 , Page(s): 854 - 862
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2242 KB)  

    The majority of the work in the multiple-valued logic (MVL) area has been devoted to the study of various algebras and their properties. One such algebra was proposed by Allen and Givone. This paper is concerned with circuit realizations for this algebra. GaAs MESFET's are used as the basic circuit elements. Several five-valued circuits are proposed including a LITERAL gate, a MAX gate, and a MIN ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosing Single Faults in Fanout-Free Combinational Circuits

    Publication Year: 1979 , Page(s): 863 - 864
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (392 KB)  

    We show how to construct, in a simple manner, a test set having n + 1 tests for a fanout-free combinational circuit with n primary inputs which distinguishes (diagnoses) nonequivalent single faults. This result is an improvement over the upper bound in [1, Theorem 3.9] of n + g (g is the number of primary input gates) and the upper bound in [3, Theorem 4], [5] of 2n for the least number of tests r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Redundancy and Fault Detection in Sequential Circuits

    Publication Year: 1979 , Page(s): 864 - 865
    Cited by:  Papers (23)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (430 KB)  

    In this correspondence we show that the well-known concepts of redundancy and undetectability of a stuck-at fault, which are equivalent in combinational circuits, are not equivalent in sequential circuits. We also show that some faults in sequential circuits, which are undetectable (by "conventional" methods of testing), are detectable by transition count testing methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive Coverage Projection of Test Sets

    Publication Year: 1979 , Page(s): 865 - 870
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1371 KB)  

    In the generation of test sets for the detection of stuck-type faults in combinational switching networks, it is an expedient and reasonably common assumption to consider explicitly faults only of specified sizes (for example, all single faults), and then to assume (or hope) that most or all faults of larger sizes will be covered (that is, detected) as well. This paper systematically addresses thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive Refinement of Raster Images

    Publication Year: 1979 , Page(s): 871 - 874
    Cited by:  Papers (41)  |  Patents (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1888 KB)  

    The transmission of high resolution raster images over low-bandwidth communication lines requires a great amount of time. User interaction in such a transmission environment can be frustrating. The problem can be eased somewhat by transmitting a series of low resolution approximations which converge to the final image. Several methods of computing such a series of images are presented. Each is rel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Computing Irredundant Normal Forms from Abbreviated Presence Functions"

    Publication Year: 1979 , Page(s): 874 - 875
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (379 KB)  

    A theorem about conditionally eliminable prime implicants presented by Chang and Mott1is shown to be incorrect by counterexample. 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): 875
    Cited by:  Papers (107)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (144 KB)  

    The theorem in question, Theorem 4, appears as an auxiliary part of a paper by Chang and Mott,1 whose main result was the presentation and justification of a new method for computing irredundant normal forms based on the concepts of abbreviated presence function, ratio function, and iterated consensus of prime implicants. The validity of the authors' method is unchallenged by the counterexample of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call For Papers

    Publication Year: 1979 , Page(s): 875
    Save to Project icon | Request Permissions | PDF file iconPDF (255 KB)  
    Freely Available from IEEE
  • 5th International Conference on Pattern Recognition

    Publication Year: 1979 , Page(s): 875
    Save to Project icon | Request Permissions | PDF file iconPDF (188 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979 , Page(s): 875
    Save to Project icon | Request Permissions | PDF file iconPDF (153 KB)  
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1979 , Page(s): 875
    Save to Project icon | Request Permissions | PDF file iconPDF (1057 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