Scheduled System Maintenance
On Tuesday, February 28, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (18:00-22:00 UTC).
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

IEEE Transactions on Computers

Issue 9 • Sept. 1978

Filter Results

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

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

    Publication Year: 1978, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (247 KB)
    Freely Available from IEEE
  • Tandem Networks of Universal Cells

    Publication Year: 1978, Page(s):785 - 799
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3166 KB)

    The tandem network, a row-like interconnection of cells is described. Such networks are more general than the widely studied irredundant cascade, but less general than a universal network based on, for example, the Shannon decomposition. The analysis is facilitated by the introduction of three cell-network interconnections, whose functions are characterized by certain attributes of the partition m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Design of a Fast Cellular Associative Memory for Ordered Retrieval

    Publication Year: 1978, Page(s):800 - 815
    Cited by:  Papers (29)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3699 KB)

    In this paper, we design some simple schemes for a variety of searches, each of which may be performed in one complete memory cycle using bit-memory logic primarily. The searches we study include the basic equality search, the threshold searches (both greater than and less than searches), and most importantly, the greatest value and the least value searches. For each kind of search, we present bot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques of Program Execution with a Writable Control Memory

    Publication Year: 1978, Page(s):816 - 827
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3142 KB)

    The objective of the present paper is to investigate possible methods to reduce a program's execution time by detecting and converting automatically the more frequently executed program parts, mostly inner loops, into microcode. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Testing of Redundant Logic Networks

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

    This paper is concerned with the detection of redundant leads in redundant logic networks. The concept of dynamic testing is introduced. We shall show that some traditionally caled undetectable faults may become detectable in dynamic testing, or how to make them become detectable in dynamic testing. Conditions for certain redundancies to be definitely untestable are also discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined Binary Code Translation and Parallel-to-Serial Conversion Using Stored Logic Arrays

    Publication Year: 1978, Page(s):833 - 841
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2354 KB)

    Two general classes of machines for performing code translation and serialization are considered;namely Translate-Table and State machines. The Translate-Table machine is a conventional two-stage machine comprising a translation stage folowed by a serialization stage. Two kinds of State machines are examined: 1) counter-driven and 2) microprogrammed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Description of Bodies Bounded by Quadric Surfaces from a Set of Imperfect Projections

    Publication Year: 1978, Page(s):841 - 854
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6292 KB)

    This paper describes a computer program for constructing a description of solid bodies from a set of pictures taken from different vantage points. The bodies are assumed to be bounded by faces which are planar or quadric, and to have vertices formed by exactly three faces It is assumed that a preprocessor provides the program with line and junction information which it has extracted from the pictu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective Pipelining of Digital Systems

    Publication Year: 1978, Page(s):855 - 865
    Cited by:  Papers (51)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2728 KB)

    This paper presents quantitative techniques for the evaluation and comparison of pipelined digital systems. They are based on three measures of effectiveness: delay, average time/operation, and average cost/operation. Moreover, the techniques do not assume that there is an unbounded stream of operations to be performed, although this case is considered. The use of the analysis methods to compare d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive Methods for Matrix Inversion in Pattern Recognition Environments

    Publication Year: 1978, Page(s):866 - 869
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (657 KB)

    Simple recursive methods for inverting an n x n matrix A + E in terms of A-1and E are presented, where E represents a matrix of modifications of the matrix A. Algorithms for rank one and rank r matrix modifications are given. In addition, simple methods for determining if A + E is invertible are developed. Applications of these methods to pattern recognition problems where the inversion... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinational Logic Design with Decoders

    Publication Year: 1978, Page(s):869 - 875
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1086 KB)

    The MSI decoder chip has had significant impact on heuristic logic design. The intention of this correspondence is to begin to open the classical theory of combinational logic to include design with decoders. Several new kinds of implicants are introduced and a variation on the Karnaugh map is shown to be a useful tool. Examples are given (admittedly carefully chosen) to show the possible cost red... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Segmentation by Pixel Classification in (Gray Level, Edge Value) Space

    Publication Year: 1978, Page(s):875 - 879
    Cited by:  Papers (53)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4133 KB)

    Image segmentation can be treated as a pixel classification problem. This classification may be done by measuring a set of features at each point and defining a decision surface in the feature space. This method is commonly used in multispectral images, but there is no obvious choice for the feature set in the case of monochromatic images. Ihis paper makes use of a two-dimensional feature set cons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "1976-1977 List of Referees"

    Publication Year: 1978, Page(s): 879
    Request permission for commercial reuse | PDF file iconPDF (1229 KB)
    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): 879
    Request permission for commercial reuse | PDF file iconPDF (105 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

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

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