By Topic

IEEE Transactions on Computers

Issue 12 • Dec. 1969

Filter Results

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

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

    Publication Year: 1969, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1969, Page(s): 1091
    Request permission for commercial reuse | PDF file iconPDF (1000 KB)
    Freely Available from IEEE
  • A Method for Solving Arbitrary-Wall Mazes by Computer

    Publication Year: 1969, Page(s):1092 - 1097
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3640 KB)

    A method for solving mazes with extended open areas and arbitrarily placed walls is described. This method reduces large open areas containing many possible paths to a small set of shortest paths. It is then possible to use Moore's algorithm of which the paper includes a summary. A computer simulation of a vehicle exploring an unknown maze is discussed. Crude navigation and measurement are suffici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for NAND Decomposition Under Network Constraints

    Publication Year: 1969, Page(s):1098 - 1109
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2608 KB)

    A branch-and-bound algorithm is presented for the synthesis of multioutput, multilevel, cycle-free NAND networks to realize an arbitrary given set of partially or completely specified combinational switching functions. In a programmed version of the algorithm, fan-in, fan-out, and level constraints may be specified. Cost may be specified as a nonnegative integer linear combination of gates and gat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Asynchronous Circuits Assuming Unbounded Gate Delays

    Publication Year: 1969, Page(s):1110 - 1120
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2112 KB)

    This paper considers the general problem of the synthesis of asynchronous combinational and sequential circuits based on the assumption that gate delays may be unbounded and that line delays are suitably constrained. Certain problems inherent to circuit realizations with unbounded gate delays are discussed and methods of solving them are proposed. Specific synthesis techniques are presented for bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part I

    Publication Year: 1969, Page(s):1121 - 1127
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1456 KB)

    This paper is Part I of a two-part study of systematic procedures for realizing synchronous sequential machines using flip-flop memory. In this study the methods of Dolotta and McCluskey, and Weiner and Smith are generalized so that they can be used to obtain directly good realization of machines using flip-flop memory. In Part I the generalizations are simple, straightforward, and require a minim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relationship of Poisson Transform to Laguerre Expansions

    Publication Year: 1969, Page(s):1128 - 1131
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Sequences with properties which make them attractive discrete-time signals for simulating analog signals are generated by the Poisson transform. It is shown that a finite number of Poisson transform sequence elements gives a signal representation equivalent to a best mean square representation with either Laguerre polynomials or functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for a Fast Hadamard Matrix Transform of Order Twelve

    Publication Year: 1969, Page(s):1131 - 1132
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    a matrix factorization is presented for a Hadamard matrix of order twelve that permits a Hadamard transform of this order to be computed with substantially fewer operations than by simple matrix multiplication. The matrix factorization is extended to Hadamard matrices of order 2nX 12 where n is an integer. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multiple Computer Linkage

    Publication Year: 1969, Page(s):1132 - 1134
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    A system of memory sharing is proposed as a means for computer communication. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiments with the n-tuple Method of Pattern Recognition

    Publication Year: 1969, Page(s):1135 - 1137
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    The n-tuple method of pattern recognition has been simulated on a somewhat larger and more comprehensive scale than previously reported. The nonweighted version has been found to work better than the maximum likelihood weighted version, and to achieve about 93 percent successful recognition of unconstrained hand-printed numerals, but at the cost of about 42 million bits of storage. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Solution of Nonlinear Equations"

    Publication Year: 1969, Page(s): 1138
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A recently proposed approach to the solution of non-linear equations gives the same computing formulas as the generalized secant method. The effect of rounding-off errors is shown to be less than might be feared. References are given to the quasi-Newton forn of the method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Note on "Solution of Nonlinear Equations"

    Publication Year: 1969, Page(s):1138 - 1140
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    The method for solution of a system of simultaneous nonlinear equations proposed by Kuo [1] gives the same results as one proposed by Wolfe [2]. Correct equations for Wolfe's method of matrix inversion are given. References to other methods of the non-derivative type are also given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's Reply

    Publication Year: 1969, Page(s):1140 - 1142
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    I wish to thank J. T. Taylo for his comment on my recent Correspondence item, "Solution of nonlinear equations." It was interesting to discover that the iterative formula, which I derived, was the same as that developed by Wolfe whose paper was not previously known to me. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Methods Used in an Automatic Logic Design Generator (ALERT)"

    Publication Year: 1969, Page(s):1142 - 1143
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital Engineering

    Publication Year: 1969, Page(s): 1144
    Request permission for commercial reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • Contributors

    Publication Year: 1969, Page(s): 1145
    Request permission for commercial reuse | PDF file iconPDF (1206 KB)
    Freely Available from IEEE
  • B69-1 Digital Computer System Principles

    Publication Year: 1969, Page(s): 1146
    Request permission for commercial reuse | PDF file iconPDF (208 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1969, Page(s):1147 - 1222
    Request permission for commercial reuse | PDF file iconPDF (18676 KB)
    Freely Available from IEEE
  • 1969 Index IEEE Transactions on Computers Vol. C-18

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

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

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