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

IEEE Transactions on Computers

Issue 12 • Dec. 1970

Filter Results

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

    Publication Year: 1970, Page(s):c1 - 1297
    Request permission for commercial reuse | PDF file iconPDF (546 KB)
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (294 KB)
    Freely Available from IEEE
  • Linear System Identification Using Real-Time Deconvolution

    Publication Year: 1970, Page(s):1139 - 1145
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1441 KB)

    It is shown that the inverse transform of a rational fraction (in s or z frequency variable) can be computed by a "real-time deconvolver." Previous techniques (such as those of Fielder, Pierre, Stanley–Reis, and Ahmed–Rao) are deduced in a natural way both for continuous and sampled-data systems. Since the new method is obtained by considering the ratio of a transformed output sequence... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Special-Purpose Computer Organization for Double-Precision Realization of Digital Filters

    Publication Year: 1970, Page(s):1146 - 1152
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1747 KB)

    This paper concerns the design, implementation, and testing of a stored-programmed special-purpose computer that, when employed as a digital filter, satisfies the requirement of reduced deadband for the input interface element (the analog-to-digital converter). This is accomplished by using a double precision arithmetic process which employs shorter word lengths; and consequently, the physical siz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Check Schemes for Integrated Microprogrammed Control and Data Transfer Circuitry

    Publication Year: 1970, Page(s):1153 - 1159
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1673 KB)

    The choice of fault detection methods to be used in control and data transfer circuits is strongly dependent on system organization. This paper presents a unified parity check scheme for both. View full abstract»

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

    Publication Year: 1970, Page(s):1160 - 1173
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3359 KB)

    Languages for describing digital systems have two messages to convey. They must provide enough information about the behavior of the system to permit simulation, and enough information about the structure of the system to indicate how it might be built. This double requirement distinguishes system description languages from conventional programming languages and necessitates special methods for do... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Associative Memory System Utilizing Holography

    Publication Year: 1970, Page(s):1174 - 1181
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4339 KB)

    A new associative memory utilizing holography is described, which has advantages such as higher density and larger capacity storage, simpler peripheral devices, and reciprocal translation between different kinds of information. The advantages of the holographic associative memory were achieved by use of associative translation function of a hologram and spatial logical operations. Two types of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of an Adaptive Threshold Logic Unit

    Publication Year: 1970, Page(s):1181 - 1192
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1926 KB)

    In this paper an adaptive threshold logic unit is analyzed. The unit consists of a set of self-adjusting weights, a summing device, and a comparator. Its dynamic and steady-state behavior is made clear by investigating the solutions of a system of nonlinear differential equations which describes changes in the weights. In the steady state the unit separates its inputs into a family of principal co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimation, Prediction, and Smoothing in Discrete Parameter Systems

    Publication Year: 1970, Page(s):1193 - 1203
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2368 KB)

    Deterministic and probabilistic sequential machine theory is used to solve the estimation, prediction, and smoothing problem encountered in noisy discrete parameter systems such as digital data processors and information processing systems. Using Bayes' theorem, the equations describing the ideal estimator, predictor, and smoother are developed. These equations are used to define an infinite-state... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

    Publication Year: 1970, Page(s):1204 - 1209
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1349 KB)

    A homomorphism of the de Bruijn graph that maps a graph of order n onto one of order n-1 and its applications to the design of nonsingular feedback shift registers are discussed. The properties preserved under this mapping suggest a new design technique whose main advantage is due to the fact that the problem of designing a desired n-stage shift register may be reduced to a problem of order n-1 or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A General Approach for Generating Natural Random Variables

    Publication Year: 1970, Page(s):1210 - 1213
    Cited by:  Papers (18)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    Simulation, Monte Carlo method, and other forms of stochastic computation consume random numbers in vast quantity and at high speed. Pseudorandom numbers or numbers generated from natural random phenomena—shot noise, thermal noise, radio-active decay, etc.,—can be used. The advantages and disadvantages of the two methods are discussed; natural random numbers are concluded to be superio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Construction Techniques for (d, k) Graphs

    Publication Year: 1970, Page(s):1214 - 1216
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB)

    Some attention is currently directed toward maximizing the number of nodes in a graph, each node of which receives no more than d branches and may be reached from any other node along a path of no more than k branches. This note introduces two improved techniques for construction and provides a table (with 1≤d, k≤10) indicating the current status of this problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on Feedforward Inverses for Linear Sequential Circuits

    Publication Year: 1970, Page(s):1216 - 1221
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1103 KB)

    A necessary and sufficient condition for the existence of a feedforward inverse for a linear sequential circuit is presented. As a result of the proof of this existence condition, a procedure for construction of feedforward inverses, when they exist, is developed. It is shown that the delay of the inverse that is realized by the construction procedure is minimal over all inverse circuits. This wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Determination of Multipliers Mapping an Arbitrary Integer into a Range of Certain Type

    Publication Year: 1970, Page(s):1221 - 1222
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    Results pertaining to the existence and choice of a suitable multiplier for a class of range transformations of multiple precision floating-point numbers with integral mantissa are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Search for a Definition of Partition Pair for Stochastic Automata

    Publication Year: 1970, Page(s):1222 - 1223
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (394 KB)

    The concept of "partition pair" is important for the decomposition of deterministic machines. The theory of stochastic machines would be enhanced with a suitable generalization. The definition of partition pairs presented by Bacon fails in that it does not reduce to the deterministic definition for a stochastic machine which is actually deterministic. A natural definition of partition pair is pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method to Determine the Expressive Power of a Set of Connectives

    Publication Year: 1970, Page(s):1223 - 1225
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    If a set of connectives is not functionally complete, then there is no simple way of deciding whether or not an arbitrary truth-function is expressible by a proposition-letter formula which has only the connectives in this set. In order to assert that a set of connectives is not complete with respect to a particular truth-function, it is often necessary to give a formal proof by some inductive arg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Complexity of Inversions

    Publication Year: 1970, Page(s):1225 - 1226
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    The inversion process which entails the interchange of two adjacent elements in a list is fundamental to most practical sorting algorithms.Consequently, one can utilize the inversions associated with a given permutation as its measure of complexity. To this end a recurrence relation is established. View full abstract»

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

    Publication Year: 1970, Page(s):1227 - 1228
    Request permission for commercial reuse | PDF file iconPDF (2693 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1970, Page(s):1229 - 1297
    Request permission for commercial reuse | PDF file iconPDF (18675 KB)
    Freely Available from IEEE
  • Blank Page

    Publication Year: 1970, Page(s): 1297
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • 1970 Index IEEE Transactions on Computers Vol. C-19

    Publication Year: 1970, Page(s): 1297
    Request permission for commercial reuse | PDF file iconPDF (3310 KB)
    Freely Available from IEEE
  • Information for authors

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