IEEE Transactions on Computers

Issue 10 • Oct. 1973

Filter Results

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

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

    Publication Year: 1973, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (223 KB)
    Freely Available from IEEE
  • New Matrix Inversion Algorithms Based on Exchange Method

    Publication Year: 1973, Page(s):885 - 890
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2264 KB)

    This paper derives a set of new algorithms based on the exchange method for the computation of matrix inverses including nonsingular, symmetric nonsingular, and rectangular matrices. The symmetric matrix inversion algorithm can save up to 50 percent of the computation time required for the Gauss-Jordan elimination method. The pseudoinverse algorithms derived here are very attractive in terms of sm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Augmented Parity Check Codes for Encoding of Asynchronous Sequential Machines

    Publication Year: 1973, Page(s):891 - 896
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2320 KB)

    Critical races can be avoided in the binary encoding of asynchronous sequential machines by making use of general codes employing-multistep changes in secondary variables to accomplish transitions between states. The shortest length code of this type presently available is Huffman's internmeshed row set code, which encodes race-free any 2SO-row flow table with 2So-1 bits. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Characteristics of Universal Cell Nets

    Publication Year: 1973, Page(s):897 - 903
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3584 KB)

    In this paper, one-output n-input combinatorial nondegenerate networks of cells are analyzed. The networks consist of one-output two-input cells that are universal in that they realize all 16 functions of the two-input variables. Such networks have a number of interesting properties, among which is the fact that if network N realizes F(x), it also realizes the dual function Fd(x). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal and Near-Optimal Universal Logic Modules with Interconnected External Terminals

    Publication Year: 1973, Page(s):903 - 907
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2816 KB)

    A universal logic module (ULM) with interconnected external terminals contains m input terminals and s auxiliary function terminals. The module implements the function U( Z1, Z2,...,Zm) such that every Boolean function of n variables f( x1, x2,* .* * X,n) can be realized by an appropriate substitution of an element of 5= { xl View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Detection in Fanout-Free Combinational Networks

    Publication Year: 1973, Page(s):908 - 914
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2264 KB)

    In this paper, we are concerned with the problem of generating minimal fault-detection experiments for fanout-free combinational logic networks. We establish the greatest lower bound on the necessary number of fault-detecting tests and show in a systematic way how such experiments can be obtained. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of Nonlinear Data Surfaces

    Publication Year: 1973, Page(s):915 - 922
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2736 KB)

    This paper is concerned with the use of "intrinsic dimensionality" in the representation of multivariate data sets that lie on nonlinear surfaces. The term intrinsic refers to the small, local-region dimensionality ( mI) of the surface and is a measure of the number of parameters or factors that govern a data generating process. The number mI is usually much lower than the dimensionalit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Periodic Realization of Synchronous Sequential Machines

    Publication Year: 1973, Page(s):923 - 927
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2112 KB)

    A new realization scheme is proposed for implementing sequential machines with nontrivial periods. The scheme is primarily based on state assignments related to cyclic partitions on internal states of a sequential machine. Operational linkages of cyclic partitions to the input-independent autonomous clocks of sequential machines are established. Special logic design and IC implementation advantage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monotone Functions in Sequential Circuits

    Publication Year: 1973, Page(s):928 - 933
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2376 KB)

    This paper is concerned with the problem of realizing an arbitrary syndconous or asynchronous sequential machine using only monotone AMR (or decreasing) switching functions. It has been found that h ion always exist, that in the asynchronous case only nomal fundamental mode flow tables are considered. Univesl state assignmments resulting in monotone inceasing (or next-state funtions are characteri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for Multiple Shift Register Realizations of Sequential Machines

    Publication Year: 1973, Page(s):933 - 943
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4536 KB)

    This paper considers the problem of realizing synchronous sequential machines with shift registers. The problem is approached in two steps. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Double Adjacencies Between Cycles of a Circulating Shift Register

    Publication Year: 1973, Page(s):944 - 955
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2848 KB)

    A circulating shift register is an n-stage binary shift register with feedback from stage n to stage 1. We refer to the state cycles of the circulating shift register as natural cycles. Two natural cycles are adjacent if there is a state in the first natural cycle that differs from a state in the second only in the first digit. Double adjacencies between natural cycles occur quite frequently. A ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on Hazard Elimination

    Publication Year: 1973, Page(s):955 - 956
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1456 KB)

    This correspondence is concerned with the study of static hazards in combinational systems by means of ( n, k, i) trees and digraphs [1],[2]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Hadamard Transform Using the H Diagram

    Publication Year: 1973, Page(s):957 - 960
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    For the Hadamard matrix, a modified factorization procedure is developed that is likely as economical in storage requirements and in the number of computational operations as the conventional fast Hadamard transform. Using this specific factoring method, the procedure for obtaining the fast Hadamard transform may be interpreted as operations on an H diagram. The H diagram was originally derived by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Statistical Properties of a Class of Linear Product Feedback Shift-Register Sequences

    Publication Year: 1973, Page(s):961 - 962
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    In this correspondence a brief discussion of some structural aspects of a class of linear product feedback shift-register sequences (fsrs) is given. The particular class concerns sequences with a characteristics polynomial that is the product of two relatively prime factors. The autocorrelation function of this class of sequences is evaluated. The results should prove useful to various application... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Autocorrelation Function of the Two Feedback Shift-Register Pseudorandom Source

    Publication Year: 1973, Page(s):962 - 964
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    A method for analytically studying the two feedback shift-register pseudorandom sources is presented. It is proved, that contrary to the experimental results that have been reported by various authors, their autocorrelation function is a many-valued function. As a result, some care should be exercised in using these sources, and simulation results that have been obtained with these generators migh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information for authors

    Publication Year: 1973, Page(s): 964
    Request permission for commercial reuse | PDF file iconPDF (290 KB)
    Freely Available from IEEE
  • Blank Page

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