By Topic

IEEE Transactions on Computers

Issue 10 • Date Oct. 1980

Filter Results

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

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

    Publication Year: 1980, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (219 KB)
    Freely Available from IEEE
  • Recent Developments in Pattern Recognition

    Publication Year: 1980, Page(s):845 - 854
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3410 KB)

    Extensive research and development has taken place over the last twenty years in the areas of pattern recognition. Areas to which these disciplines have been applied include business (e.g., character recognition), medicine (diagnosis, abnormality detection), automation (robot vision and automatic inspection), military intelligence, communications (data compression, speech recognition), and many ot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintaining Sorted Files in a Magnetic Bubble Memory

    Publication Year: 1980, Page(s):855 - 863
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2966 KB)

    A typical organization of magnetic bubble memories is the major-minor loop structure, where n (minor) loops are connected via switches to another (major) loop, containing the I/O station. We work on a sorted file F, split into subfiles allocated in the minor loops. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Tree Storage Scheme for Magnetic Bubble Memories

    Publication Year: 1980, Page(s):864 - 874
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1857 KB)

    In this paper, we study the problem of maintaining a file in magnetic bubble memories. A memory structure with a special loop ordering scheme is proposed, in which records are stored in a balanced tree form. Algorithms for searching, insertion, and deletion are proposed. They have the property that, after each operation, the file is restored to a balanced tree form. The searching operation takes t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Set Membership Classification: A Unified Approach to Geometric Intersection Problems

    Publication Year: 1980, Page(s):874 - 883
    Cited by:  Papers (115)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3079 KB)

    Many practically important problems in computational geometry may be regarded as a generalization of "clipping," and may be formulated precisely in terms of a function called "membership classification." This function operates on a pair of point sets called the reference and candidate sets; it segments the candidate into three subsets which are "inside," "outside," and "on the boundary of" the ref... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The DIMOND: A Component for the Modular Construction of Switching Networks

    Publication Year: 1980, Page(s):884 - 889
    Cited by:  Papers (6)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2194 KB)

    The DIMOND is a building block for communication networks in which throughput is more important than transmission delay. Its main attraction stems from the fact that it allows the routing of messages through a network to be completely distributed over the individual building blocks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Design of Three-Valued Asynchronous Modules

    Publication Year: 1980, Page(s):889 - 898
    Cited by:  Papers (14)  |  Patents (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3832 KB)

    The use of three-valued signals in the design of asynchronous speed-independent modules is considered. The three-valued Post algebra is used as the mathematical basis for multivalued logic design. Asynchronous operation in a three-valued system is defined. Basis data/control signal detectors and control primitives are developed. It is shown that the design of the nonbinary modules only requires th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms

    Publication Year: 1980, Page(s):899 - 905
    Cited by:  Papers (54)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2406 KB)

    This paper discusses a technique for multiplying numbers, modulo a prime number, using look-up tables stored in read-only memories. The application is in the computation of number theoretic transforms implemented in a ring which is isomorphic to a direct sum of several Galois fields, parallel computations being performed in each field. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of a Simulated Dataflow Computer

    Publication Year: 1980, Page(s):905 - 919
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4949 KB)

    Our goal is to devise a computer comprising large numbers of cooperating processors (LSI). In doing so we reject the sequential and memory cell semantics of the von Neumann model, and instead adopt the asynchronous and functional semantics of dataflow. We briefly describe the high-level dataflow programming language Id, as well as an initial design for a dataflow machine and the results of detaile... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability and Performance of Error-Correcting Memory and Register Arrays

    Publication Year: 1980, Page(s):920 - 927
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1667 KB)

    A brief survey of memory chip failure modes shows that partial chip failures are the dominant failure mode. A single error-correcting (SEC) code memory model is developed based on the results of the survey. The effect of memory support circuitry, often ignored, is included. Examples illustrate that the support circuitry dominates the memory system reliability for wide ranges of memory system param... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Approximating Algorithms to Boolean Matrix Multiplication

    Publication Year: 1980, Page(s):927 - 928
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB)

    Bounded integer matrices are matrices whose entries are bounded integers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ternary Rate-Multipliers

    Publication Year: 1980, Page(s):929 - 931
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1788 KB)

    This correspondence describes an application of COS/MOS integrated circuits in the design of ternary rate-multipliers. The logical implementation of two types of ternary rate-multiplier is described. The first type produces an unevenly spaced output pulse train, while in the second one the output pulses are uniformly spaced. Advantages and disadvantages of the two types are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Read-Only Memory Implementation of Discrete Functions

    Publication Year: 1980, Page(s):931 - 934
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1983 KB)

    Residue-based designs are shown to exist for a particular class of discrete functions called regular functions. If the design uses read-only memories (ROM's) only, it may be shown that the cost of the residue-based design may become significantly smaller than the cost of the straightforward tabular approach when the number of distinct function values is small with respect to the number of points i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Diagnosis with Repair

    Publication Year: 1980, Page(s):934 - 937
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    The model of Preparata et al. [1] is used for system diagnosis. The problem of characterizing systems which are sequentially diagnosable is considered. A new concept (detection set), which gives a new insight to the structure of these systems, is defined in this paper and utilized to prove two theorems which expand the class of known sequentially diagnosable systems. An algorithm for finding a fau... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Complexity of Computational Circuits Versus Radix

    Publication Year: 1980, Page(s):937 - 941
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB)

    The complexity of computational circuits versus radix is analyzed. Necessary and sufficient conditions are given that ensure that the complexity of certain computational circuits will be a monotonically decreasing function of radix. Mechanizations of a higher radix ripple carry adder, look-ahead adder, magnitude comparator, and parallel multiplier are given. Each mechanization is implemented using... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composite Parallel Counters

    Publication Year: 1980, Page(s):942 - 946
    Cited by:  Papers (16)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (989 KB)

    A graphical representation is presented for parallel counters, i.e., multiple input combinatorial modules that count the number of inputs being in a given state (normally logic ONE). View full abstract»

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

    Publication Year: 1980, Page(s):946 - 950
    Cited by:  Papers (59)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (910 KB)

    The concept of merged arithmetic is introduced and demonstrated in the context of multiterm multiplication/addition. The merged approach involves synthesizing a composite arithmetic function (such as an inner product) directly instead of decomposing the function into discrete multiplication and addition operations. This approach provides equivalent arithmetic throughput with lower implementation c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Boolean Algebras

    Publication Year: 1980, Page(s):950 - 953
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (925 KB)

    Switching algebra is unable to represent the dynamic behavior of digital circuits. There are several known methods for modeling the dynamics of circuits, using either multivalued algebras or specialized operators. None of them preserves the framework of switching algebra; therefore, existing analysis and synthesis methods developed by switching theory cannot be used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modification of "A Least Mean Squares Cubic Algorithm for On-Line Differential of Sampled Analog Signals"

    Publication Year: 1980, Page(s): 953
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (170 KB)

    Modification of the original algorithm by Allum1yields a computationally efficient algorithm. The computational improvement, nominally 20 percent, is significant when real-time digital signal processing applications are involved. View full abstract»

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

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

    Publication Year: 1980, Page(s): 953
    Request permission for commercial reuse | PDF file iconPDF (150 KB)
    Freely Available from IEEE
  • Advance Announcement... Tutorial Week 80

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