IEEE Transactions on Computers

Issue 4 • April 1972

Filter Results

Displaying Results 1 - 25 of 31
  • [Front cover]

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

    Publication Year: 1972, Page(s): nil1
    Request permission for commercial reuse | |PDF file iconPDF (212 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1972, Page(s): nil1
    Request permission for commercial reuse | |PDF file iconPDF (212 KB)
    Freely Available from IEEE
  • Pseudonoise with Arbitrary Amplitude Distribution--Part I: Theory

    Publication Year: 1972, Page(s):337 - 345
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1226 KB)

    Many cases arise in practice where a versatile hardwired pseudorandom number or pseudonoise generator would be extremely useful. General-purpose pseudonoise devices are not available today. We present a new sampling method, conditional bit sampling, which is suited for hardwired sampling devices because of its generality, simplicity, and accuracy. Random variables sampled from an arbitrary distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pseudonoise with Arbitrary Amplitude Distribution--Part II: Hardware Implementation

    Publication Year: 1972, Page(s):346 - 352
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1162 KB)

    A hardwired device that produces a voltage with arbitrary amplitude distribution was constructed using a "conditional bit" algorithm to sample from an arbitrary voltage amplitude distribution. The sampling algorithm and hardware processor are independent of the distribution sampled. Only a small read-only memory ROM needs to be changed to alter the distribution sampled. It is possible to compute t... View full abstract»

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

    Publication Year: 1972, Page(s):353 - 359
    Cited by:  Papers (424)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1153 KB)

    A new model for associative memory, based on a correlation matrix, is suggested. In this model information is accumulated on memory elements as products of component data. Denoting a key vector by q(p), and the data associated with it by another vector x(p), the pairs (q(p), x(p)) are memorized in the form of a matrix {see the Equation in PDF File} where... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Memories with Enhanced Data Access

    Publication Year: 1972, Page(s):359 - 366
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1365 KB)

    Dynamic memories are commonly constructed as circulating shift registers, and thus have access times that are proportional to the size of memory. When each word in a dynamic memory is connected to r words, r ≥ 2, access time can be proportional to the base r logarithm of the size of memory. A memory that achieves minimum access time for r = 2 is described. The memory can also be operated i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Implementation of the Fast Fourier Transform Algorithm

    Publication Year: 1972, Page(s):366 - 370
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (875 KB)

    For many real-time signal processing problems, correlations, convolutions, and Fourier analysis must be performed in special-purpose digital hardware. At relatively high levels of performance, it becomes necessary for this hardware to perform some of its computations in parallel. A parallel FFT algorithm is described that segments the fast Fourier transform algorithm into groups of identical paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback in Sequential Machine Realizations

    Publication Year: 1972, Page(s):371 - 381
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2075 KB)

    In this paper we study feedback in sequential machines that are implemented with trigger or set-reset flip-flop memory elements. A method is given for determining when a machine can be implemented with either trigger or set-reset flip-flop memory elements where the feedback in the machine is given by a Boolean function f. Several results are presented that compare the feedback when a machine is im... View full abstract»

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

    Publication Year: 1972, Page(s):382 - 385
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (564 KB)

    A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' [1] pattern search. Experimental results for a variety of functions indicate that the random pattern search is more effective than the corresponding deterministic method for a class of problems with hard constraints. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Procedures for Determining Diagnostic Resolution

    Publication Year: 1972, Page(s):385 - 388
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (829 KB)

    The definition of the generalized fault table [1] is expanded to cover a representation employing more than one fault q cube per fault pattern. On the basis of this expanded definition and simple concepts from a cover algebra, a new procedure is developed for finding first- and second-order diagnostic resolutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic Automata and the Problems of Reliability in Sequential Machines

    Publication Year: 1972, Page(s):388 - 391
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (743 KB)

    A stochastic sequential machine model is employed to investigate some of the problems concerning the reliability of sequential machines. Two methods, using the notions of entropy for stochastic automata and principal entries in their transition matrices, are used and compared for reliability estimates. The problem of synthesizing automata of given known reliability through replication and voting i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resident-Bubble Cellular Logic Using Magnetic Domains

    Publication Year: 1972, Page(s):392 - 396
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1007 KB)

    A new approach to the design of complex logic circuitry using magnetic bubbles is described. The method is based on the construction of cells that perform simple logical operations and that can be combined to realize more complex functions. An important property of these cells is that no bubbles ever enter or leave any cell, all intercell communications being accomplished by bubble interactions ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Modified Training Procedure for Linear Threshold Devices

    Publication Year: 1972, Page(s):396 - 397
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (425 KB)

    A modification of conventional training techniques for linear threshold dichotomous pattern recognition is described. The modification is capable of convergence in some cases where the classical training techniques are not. The utility of this technique for signal detection problems is discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Next-State Equations of Asynchronous Sequential Machines

    Publication Year: 1972, Page(s):397 - 399
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    A theorem and two applications are given here to solve the problem of selecting state assignments of asynchronous machines. The assignment has to produce a set of simple next-state equations. The proofs use the algebraic structures defined by Hartmanis. A first illustration is given by Liu's encoding; likewise, Tracey's selection theorems are easily found again and placed in a more general context... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Three-Valued Logic Simulation

    Publication Year: 1972, Page(s):399 - 402
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (535 KB)

    In this note we discuss a few attributes and pitfalls of three-valued (0, 1, u) digital logic simulation. The areas covered include hazard and race detection, fault detection, verifying the reset logic of a machine, and the problems encountered with self-timing circuits and in employing a complement for u. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enumeration of Ternary Threshold Functions of Three Variables

    Publication Year: 1972, Page(s):402 - 407
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1048 KB)

    This note discusses the generation of ternary threshold functions of three variables. Merrill's generation method to generate ternary threshold functions is modified. The number of ternary threshold functions of three variables is counted by a computer, the number is 85629. Tables of characterizing parameters of canonical ternary threshold functions of two and three variables are presented. A tabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Minimization Technique for TANT Networks

    Publication Year: 1972, Page(s): 407
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (151 KB)

    Some comments on a recent note for the synthesis of TANT networks are presented. Counter examples that show some defects of the technique are also included. 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: 1972, Page(s): 408
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (189 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Feature Selection with a Linear Dependence Measure

    Publication Year: 1972, Page(s): 408
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (189 KB)

    First Page of the Article
    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: 1972, Page(s): 409
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (167 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Inequalities Between Distance Measures for Feature Evaluation

    Publication Year: 1972, Page(s):409 - 410
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (368 KB)

    Some inequalities are derived between the Kullback divergence, the Bhattacharyya coefficient, the Matusita distance, and the Kolmogorov variational distance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Extraction of Pattern Features from Imperfectly Identified Samples

    Publication Year: 1972, Page(s):410 - 411
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (323 KB)

    The application of Bhattacharyya coefficient for the selection of effective features from imperfectly labeled patterns is examined. View full abstract»

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

    Publication Year: 1972, Page(s):412 - 413
    Request permission for commercial reuse | |PDF file iconPDF (1803 KB)
    Freely Available from IEEE
  • Book Reviews

    Publication Year: 1972, Page(s):413 - 414
    Request permission for commercial reuse | |PDF file iconPDF (1126 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