Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 10 • Oct. 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 (465 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1978, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (244 KB)
    Freely Available from IEEE
  • On the Computational Complexity of System Diagnosis

    Publication Year: 1978, Page(s):881 - 885
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1956 KB)

    In this paper we analyze the computational complexity of system diagnosis. We show that several problems for instantaneous and sequential fault diagnosis of systems are polynomially complete and that for single-loop systems these problems are solvable in polynomial time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Control of a Three-Stage Switch Matrix in the Presence of Fan-Out

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

    Recent advancements in high-speed sold-state switching technology have created considerable interest in automatic switching of computation modules within analog computers under the control of digital computers. In this description of work done in "autopatching" of analog computers, relationships are derived among the parameters of a 3-stage asymmetrical connection network which will minimize the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controllability and Fault Observability in Modular Combinational Circuits

    Publication Year: 1978, Page(s):896 - 903
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2334 KB)

    An extension of a methodology based on Boolean equations to fault detection in modular combinational networks is described. The resulting method allows for the use of cataloged module tests, and it is applicable under the single-faulty-module constraint. The conceptual and computational framework is rather simple, and it is independent of any particular data structure for representing Boolean func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis of Computational Cost in Image Processing: A Case Study

    Publication Year: 1978, Page(s):904 - 910
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2576 KB)

    Picture processing includes a variety of algorithms employed at different stages within a recognition process. Although single parallel algorithms have been suggested, no systematic comparison with sequential algorithms is available. We propose here some parallel algorithms solving a selected set of picture-processing tasks and compare their speed, when implemented on a CLIP machine, with that of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer-Aided Logic Design of Two-Level MOS Combinational Networks with Statistical Results

    Publication Year: 1978, Page(s):911 - 923
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2834 KB)

    Metal-oxide-semiconductor (MOS) logic elements offer advantages over bipolar logic elements, such as smaller size, complexity, and power consumption, as well as more flexibility and versatility. Since MOS is playing a major role in large-scale integration (LSI), synthesis of MOS networks with a large number of variables is very important. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Hough Technique for Curve Detection

    Publication Year: 1978, Page(s):923 - 926
    Cited by:  Papers (124)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1708 KB)

    The usual Hough procedure for detecting curves embedded in digitized images involves a transformation from image space I to parameter space P. In this note we suggest that insight into this transformation may be enhanced by mapping P back into I. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multicode Single Transition-Time State Assignment for Asynchronous Sequential Machines

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

    A multicode single transition-time state assignment for normal mode asynchronous sequential machines is given. The proposed state assignment requires less than or equal to 2[log2 n] state variables for flow tables with n states. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sieve Method for Real-Time Computer-Aided Extraction of Multivalued Analog Signals in the Presence of Noise

    Publication Year: 1978, Page(s):935 - 944
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2368 KB)

    This paper presents a method used to separate the real values of analog signals encoded together with noise in a number of signal measurements (samples). The method is based on two selection norms: the norm of acceptance of a real signal value, and the separation norm used to iteratively regroup the samples and eliminate the samples containing the noise only. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator

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

    In this paper, the use of an efficient sparse minor expansion method to directly compute the subresultants needed for the greatest common denominator (GCD) of two polynomials is described. The sparse minor expansion method (applied either to Sylvester's or Bezout's matrix) naturally computes the coefficients of the subresultants in the order corresponding to a polynomial remainder sequence (PRS), ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Machine Implementations Using Universal Logic Modules

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

    The paper discusses the properties of universal logic modules and introduces their use for sequential machine implementation. Expressions for the maximum number of modules required to realize a given function are given. The decomposition technique is shown to be relevant to a modular realization and is a powerful tool in reducing the total number of modules required. Limits on the state splitting ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduction of CC-Tables Using Multiple Implication

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

    Gimpel has presented a minimization algorithm which realizes a minimal TANT network for any Boolean function, under a NAND gate cost criterion. Gimpel uses a covering closure (CC)-table and reduces this table with the reduction techniques of Grasselli and Luccio to find a least cost subset of implicants. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Computing the Discrete Cosine Transform

    Publication Year: 1978, Page(s):966 - 968
    Cited by:  Papers (44)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    Haralick has shown that the discrete cosine transform of N points can be computed more rapidly by taking two N-point fast Fourier transforms (FFT's) than by taking one 2N-point FFT as Ahmed had proposed. In this correspondence, we show that if Haralick had made use of the fact that the FFT's of real sequences can be computed more rapidly than general FFT's, the result would have been reversed. A m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Practical Approach to Fault Detection in Combinational Networks

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

    In this correspondence the advantages of exhaustive testing of combinational networks are investigated. The method consists of applying all possible input combinations and checking only some attributes of the output vector. It is shown that by abandoning the requirement of minimal testing time (practically insignificant for medium sized networks) a substantial reduction of testing data to be store... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analog-to-Gray Code Conversion

    Publication Year: 1978, Page(s):971 - 973
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (475 KB)

    A method for the direct conversion of multilevel values to their Gray code representations is presented. This eliminates the need for binary-to-Gray code conversion. The method is particularly suited for parallel implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Announcing a new Quarterly IEEE Transactions ... IEEE Transactions on Pattern Analysis and Machine Intelligence

    Publication Year: 1978, Page(s): 973
    Request permission for commercial reuse | PDF file iconPDF (107 KB)
    Freely Available from IEEE
  • IEEE Transactions on Pattern Analysis and Machine Intelligence

    Publication Year: 1978, Page(s): 973
    Request permission for commercial reuse | PDF file iconPDF (113 KB)
    Freely Available from IEEE
  • The IEEE Computer Society announces Tutorial and Selected Papers in Digital Image Processing

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

    Publication Year: 1978, Page(s): 973
    Request permission for commercial reuse | PDF file iconPDF (139 KB)
    Freely Available from IEEE
  • Call for Papers

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