By Topic

Computers, IEEE Transactions on

Issue 6 • Date June 1982

Filter Results

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

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

    Publication Year: 1982 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (258 KB)  
    Freely Available from IEEE
  • Announcement

    Publication Year: 1982 , Page(s): 477
    Save to Project icon | Request Permissions | PDF file iconPDF (1341 KB)  
    Freely Available from IEEE
  • On k-Nearest Neighbor Voronoi Diagrams in the Plane

    Publication Year: 1982 , Page(s): 478 - 487
    Cited by:  Papers (39)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3064 KB)  

    The notion of Voronoi diagram for a set of N points in the Euclidean plane is generalized to the Voronoi diagram of order k and an iterative algorithm to construct the generalized diagram in 0(k2N log N) time using 0(k2(N − k)) space is presented. It is shown that the k-nearest neighbor problem and other seemingly unrelated problems can be solved efficiently with the diagram. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution of Programs for a System with Dynamic Architecture

    Publication Year: 1982 , Page(s): 488 - 514
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (7012 KB)  

    This paper elaborates on basic software techniques for distributing the hardware resource among user programs computed by a multicomputer system with a dynamic architecture. The system can switch the hardware resources into the minimal sized computers required for computations and initiate the unused resources into execution of additional program streams. Thus it maximizes the number of parallel p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Good Layouts for Pattern Recognizers

    Publication Year: 1982 , Page(s): 514 - 520
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3733 KB)  

    A system to lay out custom circuits that recognize regular languages can be a useful VLSI design automation tool. This paper describes the algorithms used in an implementation of a regular expression compiler. Layouts that use a network of programmable logic arrays (PLA's) have smaller areas than those of some other methods, but there are the problems of partitioning the circuit and then placing t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory of Unidirectional Error Correcting/Detecting Codes

    Publication Year: 1982 , Page(s): 521 - 530
    Cited by:  Papers (73)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2682 KB)  

    In this paper we present some basic theory on unidirectional error correcting/detecting codes. We define symmetric, asymmetric, and unidirectional error classes and proceed to derive the necessary and sufficient conditions for a binary code to be unidirectional error correcting/detecting. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exception Handling and Software Fault Tolerance

    Publication Year: 1982 , Page(s): 531 - 540
    Cited by:  Papers (41)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3386 KB)  

    Some basic concepts underlying the issue of fault-tolerant software design are investigated. Relying on these concepts, a unified point of view on programmed exception handling and default exception handling based on automatic backward recovery is constructed. The cause–effect relationship between software design faults and failure occurrences is explored and a class of faults for which defa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A VLSI Residue Arithmetic Multiplier

    Publication Year: 1982 , Page(s): 540 - 546
    Cited by:  Papers (43)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (3195 KB)  

    Recently, residue arithmetic has received increased attention in the open literature. Using table lookup methods and high-speed memory, modular arithmetic has been demonstrated. However, the memory size limitation of ECL, bipolar, and high-speed MOS limits the admissible size of the moduli used in the numbering system. In this paper the moduli size limitation is overcome using VLSI technology, spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Interference Analysis of Shuffle/Exchange Networks"

    Publication Year: 1982 , Page(s): 546 - 547
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1426 KB)  

    The above paper1 claims to present an exact discrete time Markov chain model for interference analysis of shuffle exchange networks. We show that the solutions presented are inaccurate. This problem has also been considered in [1]–[3], where simpler and more general solutions are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convolutionally Encoded Memory Protection

    Publication Year: 1982 , Page(s): 547 - 551
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1069 KB)  

    A memory protection technique is described in which individually code-protected memory cells are supplemented with redundant memory cells derived from the basic cells according to the rules of a short constraint length convolutional code. The technique is found to be far more protective against faults than memory duplication. The method of clearing up faults is extremely simple—only slightly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Tolerant Design of Multivalued Logic Functions

    Publication Year: 1982 , Page(s): 551 - 554
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (721 KB)  

    The effect of component errors on the behavior of polylogic circuits is considered. A design procedure which minimizes these effects is developed. An example design exhibiting improved performance is presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single Asymmetric Error-Correcting Cyclic AN Codes

    Publication Year: 1982 , Page(s): 554 - 555
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (443 KB)  

    A class of single asymmetric error-correcting cyclic AN codes is proposed. These codes are designed for use on asymmetric channels, such as LSI memory protection. It is shown that they are equivalent to the Constantin–Rao codes generted by a prime field in which 2 is a primitive element. The advantage of these AN codes is that error correction can be easily made using arithmetic operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Complexity of Fault Detection Problems for Combinational Logic Circuits

    Publication Year: 1982 , Page(s): 555 - 560
    Cited by:  Papers (71)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1355 KB)  

    In this correspondence we analyze the computational complexity of fault detection problems for combinational circuits and propose an approach to design for testability. Although major fault detection problems have been known to be in general NP-complete, they were proven for rather complex circuits. In this correspondence we show that these are still NP-complete even for monotone circuits, and thu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Reliability of Memory with Single-Error Correction

    Publication Year: 1982 , Page(s): 560 - 564
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (913 KB)  

    This correspondence contains the derivation of the reliability, as a function of time, of semiconductor memory with single-error correction. The results are applicable to a wide range of memory organizations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Unidirectional Error Detecting/Correcting Codes

    Publication Year: 1982 , Page(s): 564 - 568
    Cited by:  Papers (44)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1078 KB)  

    In this correspondence a class of t-error correcting and multiple unidirectional error detecting systematic codes is presented. These codes are significantly more efficient than the earlier codes. The efficiency of these codes approaches the efficiency of the BCH codes, asymptotically. Furthermore, it is shown that these codes can be easily decoded. Also in this correspondence we have presented a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Computers Planned Special Issues

    Publication Year: 1982 , Page(s): 568
    Save to Project icon | Request Permissions | PDF file iconPDF (81 KB)  
    Freely Available from IEEE
  • Announcing The 3rd International Conference on Distributed Computing Systems

    Publication Year: 1982 , Page(s): 568
    Save to Project icon | Request Permissions | PDF file iconPDF (177 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Press Checklist of New Titles December 1982

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

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

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

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