By Topic

IEEE Transactions on Computers

Issue 1 • Date Jan. 1978

Filter Results

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

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

    Publication Year: 1978, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (253 KB)
    Freely Available from IEEE
  • A Restructurable Computer System

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

    This paper presents an architecture for a restructurable computer system which reconfigures its resources according to the problem environment for efficient performance. It converts the user's program into an intermediate level language called Realist which is capable of specifying arbitrary resource structures such as an array or a pipeline and the computation to be performed upon these structure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inner Product Computers

    Publication Year: 1978, Page(s):21 - 31
    Cited by:  Papers (35)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4531 KB)

    The inner product computer is a special-purpose computational unit intended to be used as an adjunct to a general-purpose digital computer to perform numerical processing tasks which previously exceeded the capacity of the general-purpose computer. The algorithmic structure of the inner product is briefly reviewed in the first section of this paper. Methods are described for computing the inner pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decision Theory Approach to Picture Smoothing

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

    This paper considers a detection theory approach to the restoration of digitized images. The images are modeled as second-order Markov meshes. This model is not only well suited to a decision approach to smoothing, but it enables computer simulations of images thereby permitting a statistical analysis of restoration techniques. Smoothing procedures that are near optimal in the sense of approaching... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of Optimal Transition Count Tests

    Publication Year: 1978, Page(s):36 - 41
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3132 KB)

    The problem of generating minimum-length transition count (TC) tests is examined for combinational logic circuits whose behavior can be defined by an n-row fault table. Methods are presented for generating TC tests of length n+2 and 2n-1 for fault detection and fault location, respectively. It is shown that these tests are optimal with respect to the class of n-row fault tables in the sense that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Some Dynamical Properties of Finite Cellular Automaton

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

    Some characteristics of the global function of the finite cellular automaton (FCA) are investigated. First, a necessary and sufficient condition for a function from the configuration set to itself to be realized by means of an FCA is given. Next, using these results, the realizability of cycle and tree type transition structures is discussed. Especially, for the system of binary 3-neighbor FCA, th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal Modular Trees: A Design Procedure

    Publication Year: 1978, Page(s):53 - 63
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2868 KB)

    An alternative design procedure is presented for the implementation of finite-state Moore machines as universal modular trees (UMT's). A machine property is shown to provide a design goal in the tree depth. Design specification is made heuristically by labeling transitions on a shift register state diagram. Programming of feedback and output trees is accomplished with a template tree. The procedur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a Shared Resource MIMD Computer Organization

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

    In computer architecture investigations a major interest is in the analysis of organizations which explore parallelism, and therefore, may have multiple instruction and multiple data streams (MIMD). In this paper, a MIMD structure with one shared resource is analyzed for both synchronous and asynchronous request arrivals. Although the analysis is somewhat restricted, it appears that a similar appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loop Properties and Controllability of Linear Congruential Sequences

    Publication Year: 1978, Page(s):68 - 76
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2513 KB)

    Loop properties of linear congruential sequences generated by Xn+1 = AXn + C (mod m) are considered. Existence theorems and procedures are given to single out loops and fixed points, if any, in terms of generator parameters X0,A,C,m. Criteria are found for absolutely and conditionally convergent generators and split generators. The role of parameters in respect of inner structure is investigated. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the Core Point in a Fingerprint

    Publication Year: 1978, Page(s):77 - 81
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3182 KB)

    A procedure for finding the core point in a fingerprint is presented. The search for the core point is done in steps with increasing resolution, each step indicating for the next step in which subarea of the print to search for the core. This results in a sequence of diminishing areas where the core can be found. The present implementation uses three levels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Algorithm for Computing Fourier Texture Descriptors

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

    The description of texture is an important problem in image analysis. Several methods in the literature require that local two-dimensional discrete Fourier transforms be computed as a first step in the texture description process. A chief limitation in these approaches has been the computational complexity of the transform calculation which has tended to limit the resolution of subsequent descript... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Sorting Algorithms for Parallel Computers

    Publication Year: 1978, Page(s):84 - 87
    Cited by:  Papers (77)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (994 KB)

    The problem of sorting a sequence of n elements on a parallel computer with k processors is considered. The algorithms we present can all be run on a single instruction stream multiple data stream computer. For large n, each achieves an asymptotic speed-up ratio of k with respect to the best sequential algorithm, which is optimal in the number of processors used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On an Ordering of Walsh Functions

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

    In addition to the automorphism between the sequency and the Gray-code-of-sequency ordering for Walsh functions there is also one for Kacsmarz ordering. This is shown by using a matrix definition suggested by K. W. Henderson some years ago [4]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autotesting Speed-Independent Sequential Circuits

    Publication Year: 1978, Page(s):90 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (913 KB)

    Speed-independent sequential circuits are characterized by an input-output behavior which is independent of the actual delays of the circuitry; this means that any unbounded delay is allowed in the component gates. This performance is accomplished by means of a control circuit which recognizes when the circuit is ready to accept a next input datum, and therefore a speed independent synthesis is re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Measure of Computational Work" and "Logical Network Cost and Entropy"

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

    This note indicates an observation on the relationship between the independent works of Hellerman on a measure of computational work and of Cook and Flynn on the average minimum cost of logical networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata

    Publication Year: 1978, Page(s):95 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (358 KB)

    For the given directed graphs, a method based on Moore sequential machines (MSM) for solving the graph isomorphism problem was recently proposed. However, that method provides only a necessary (but not a sufficient) condition. This correspondence corrects this error by developing a necessary and sufficient condition. It will be shown that this type of problem can be also solved by using determinis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

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

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