Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 4 • April 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 (396 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1978, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (255 KB)
    Freely Available from IEEE
  • Aspects of Applicative Programming for Parallel Processing

    Publication Year: 1978, Page(s):289 - 296
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2782 KB)

    Early results of a project on compiling stylized recursion into stackless iterative code are reviewed as they apply to a target environment with multiprocessing. Parallelism is possible in executing the compiled image of argument evaluation (collateral argument evaluation of Algol 68), of data structure construction when suspensions are used, and of functional combinations. The last facility provi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory of Computer Addition and Overflows

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

    Computer addition is a groupoid. If an additive identity exists it is unique. If(and only if) addition is defined with the compute through the overflow (CTO) property, then a finite ring of integers is the homomorphic image of the computer number system and addition. Stated another way, the necessary and sufficient condition for CTO is a congruence relation on the integers. Also, if the number sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of Storage Errors in Mass Memories Using Low-Cost Arithmetic Error Codes

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

    Arithmetic error codes constitute a class of error codes that are preserved during most arithmetic operations. Effectiveness studies for arithmetic error codes have shown their value for concurrent detection of faults in arithmetic processors, data transmission subsystems, and main storage units in fault-tolerant computers. In this paper, it is shown that the same class of codes is also quite effe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Combinational Networks with Restricted Fan-Out

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

    Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free networks and functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of the LSI on High-Speed Computer Packaging

    Publication Year: 1978, Page(s):319 - 325
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4818 KB)

    The effect of the logic LSI on high-speed computer packaging and relevant problems are described from the standpoint of obtaining effective logic speed and packaging density in system environments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Residue Number Scaling and Other Operations Using ROM Arrays

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

    Over the last two decades there has been considerable interest in the implementation of digital computer elements using hardware based on the residue number system. This paper considers implementing such systems with arrays of look-up tables placed in high density read-only memories. The type of system discussed is restricted to one in which the only operations are addition, subtraction, multiplic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a Raster Display Processor for Office Applications

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

    In recent years there has been a pronounced emphasis to develop alphanumeric display systems for document creation, filing, and text editing applications. This paper describes the design of a raster scan Display Processor which was specifically implemented to produce full page images ( 8½ in × 11 in or 11 in × 8½ in) which emulate typewriter output. A dual data path architectur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Location in a Semiconductor Random-Access Memory Unit

    Publication Year: 1978, Page(s):349 - 358
    Cited by:  Papers (15)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2622 KB)

    A semiconductor random-accessor memory (RAM) unit is a connection of RAM chips, data cable, chip select cable, and address cable so that each storage element can be selected for writing or reading independent of previous writes or reads. The faulty RAM unit is represented by a model consisting of four types of faults: stuck-at-0 or 1 fault on data cable, chip select cable, address cable, and stora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Hierarchical Scene Matching

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

    The general approach to matching two scenes by a digital computer is usually costly in computations. A match is determined by selecting the position of maximum cross correlation between the window and each possible shift position of the search region. A new approach which is logarithmically efficient is presented in this paper. Its logarithmic efficiency and computational savings will be demonstra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of Incomplete Pattern Vectors Using Modified Discrminant Functions

    Publication Year: 1978, Page(s):367 - 375
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2656 KB)

    The problem of classifying incomplete pattern vectors with the discriminant function classifier designed using the MSE criterion design approach is considered. A method for modifying the complete space parameter matrix of the discriminant functions is developed. The method allows the classifier to maintain MSE optimality for operating in any subspace of the pattern space. For full flexibility, onl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Piecewise Approximation of Pictures Using Maximal Neighborhoods

    Publication Year: 1978, Page(s):375 - 379
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5368 KB)

    Suppose that we are given a picture having approximately piecewise constant gray leveL Each point P has a largest neighborhood N(P) that is entirely contained in one of the constant regions, and the set of maximal N(P)'s (i.e., N(P)'s not contained in other N(P)'s) constitutes an economical description of the picture, generalizing the Blum "skeleton" or medial axis transformation. This description... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Existence Theorems for Probabilistically Diagnosable Systems

    Publication Year: 1978, Page(s):379 - 384
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2245 KB)

    This correspondence is concerned with probabilistic fault diagnosis for digital systems. The model considered in this correspondence is the diagnostic model introduced by Maheshwari and Hakimi where each unit has a probability of failure. For this model under both fault assumptions by Maheshwari-Hakimi and by Barsi-Grandoni-Maestrini, some existence theorems are obtained for probabilistically diag... 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): 384
    Request permission for commercial reuse | PDF file iconPDF (133 KB)
    Freely Available from IEEE
  • Advance Program Announcement

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