IEEE Transactions on Computers

Issue 2 • Feb. 1970

Filter Results

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

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

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (274 KB)
    Freely Available from IEEE
  • Generation of Products and Quotients Using Approximate Binary Logarithms for Digital Filtering Applications

    Publication Year: 1970, Page(s):97 - 105
    Cited by:  Papers (64)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1734 KB)

    An approximate method for rapid multiplication or division with relatively simple digital circuitry is described. The algorithm consists of computing approximate binary logarithms, adding or subtracting the logarithms, and computing the approximate anti- logarithm of the resultant. Using a criteria of minimum mean square error, coefficients for the approximations are developed. An error analysis i... View full abstract»

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

    Publication Year: 1970, Page(s):105 - 116
    Cited by:  Papers (39)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1920 KB)

    A procedure for factoring of the N×N matrix representing the discrete Fourier transform is presented which does not produce shuffled data. Exactly one factor is produced for each factor of N, resulting in a fast Fourier transform valid for any N. The factoring algorithm enables the fast Fourier transform to be implemented in general with four nested loops, and with three loops if N is a power... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Scheme for Synchronizing High-Speed Logic Part II

    Publication Year: 1970, Page(s):116 - 124
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1801 KB)

    In this paper we concern ourselves with the problem of obtaining high sequence rate sequential machines, machines which are constructed from realistic devices to operate at an input sequence rate which is independent of the machine complexity. To accomplish this result we have only to show a construction to realize acceptably synchronous devices from badly timed, restricted fan-in and fan-out devi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solution of Linear Inequalities

    Publication Year: 1970, Page(s):124 - 131
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2607 KB)

    A method for solving systems of linear inequalities, consistent and inconsistent, corresponding to the separable and nonseparable cases in pattern recognition is presented. Attempts are made to evaluate the speed and efficiency of the algorithm. It seems to compare in speed with the best algorithms for consistent systems of inequalities in the consistent case and retains remarkable speed in the in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization of Exclusive or and Logical Equivalence Switching Circuits

    Publication Year: 1970, Page(s):132 - 140
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2076 KB)

    This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In particular, algorithms are presented for obtaining minimal modulo 2 or complement modulo 2 sum-of- products (or sums) expressions of any arbitrary single-output or multiple-output switching function with fixed polarities of the input variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal Logic Modules and Their Applications

    Publication Year: 1970, Page(s):141 - 149
    Cited by:  Papers (51)  |  Patents (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2167 KB)

    Recent advances in integrated circuit technology and its potential advantage in logical design have motivated the search for modular synthesis techniques for logic networks. This problem may be divided into two parts: find appropriate modules; and develop efficient synthesis techniques for logic networks using a minimum number of modules. In this paper a new type of universal logic modules (ULM's)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Proposed Hybrid-Computer Method for Functional Optimization

    Publication Year: 1970, Page(s):149 - 153
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB)

    To obtain successively improved control-variable functionsku(t), we propose to add a random perturbation δu(t) toku(t). A fast analog-computer run then solves the dynamical system equations and computes the given criterion function. If the latter has been improved, thenk+1u(t)=u(t)+δu(t) is stored digitally for the next iteration; otherwise 5u( t) is disc... View full abstract»

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

    Publication Year: 1970, Page(s):153 - 157
    Cited by:  Papers (47)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2056 KB)

    A number of schemes for implementing a fast multiplier are presented and compared on the basis of speed, complexity, and cost. A parallel multiplier designed using the carry-save scheme and constructed from 74 series integrated circuits is described. This multiplier multiplies 10-bit by 12-bit binary numbers with a worst- case multiplication time of 520 ns. The cost of the integrated circuits was ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Range-Transformation Techniques for Division

    Publication Year: 1970, Page(s):157 - 160
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    This note points out the close relationship between some of the recently described division techniques, in which the divisor is transformed to a range close to unity. A brief theoretical analysis is presented which examines the choice of quotient digit when this type of division technique is used for conventional and signed-digit number systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pictorial Output with a Line Printer

    Publication Year: 1970, Page(s):160 - 162
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2080 KB)

    An improved method for the production of pictorial output on a line printer is described. A reasonable black-white contrast ratio is obtained by overprinting up to eight characters, and pseudorandom noise is used to smooth out discontinuities in the range of print densities. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Necessity of Closed Circuit Loops in Minimal Combinational Circuits

    Publication Year: 1970, Page(s):162 - 164
    Cited by:  Papers (23)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    A cellular-logic approach is used to generate a family of multiple-output combinational switching circuits containing closed loops ( of the type that normally generate sequential behavior) and composed of simple gates. These networks contain fewer gates than any loop-free realizations. Some members of the family are oscillatory, while others are stable with multiple stable states, but the outputs ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Uniqueness of Minimal-State Stochastic Sequential Machines

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

    A necessary and sufficient condition for a minimal- state stochastic sequential machine to be unique (up to renumbering the states) is described. Furthermore, a geometric characterization of the class of state-equivalent machines is given. View full abstract»

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

    Publication Year: 1970, Page(s):166 - 167
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    The complete solution to a number theoretic problem which has applications in relay contact networks is given. As a corollary, a conjecture by Harrison is shown to be true. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General Repetitive Events and Machines

    Publication Year: 1970, Page(s):167 - 169
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A finite automaton is a general repetitive machine if there is a path in the state graph from every final state to the start state. In this paper general repetitive events are defined in terms of certain factorization properties of the associated regular expressions, and a one-to-one onto correspondence is shown between general repetitive machines and general repetitive events. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for the Fast Approximate Solution of Large Prime Implicant Charts

    Publication Year: 1970, Page(s):169 - 173
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1232 KB)

    A method is presented which uses easily calculated probabilities to determine complete covers of prime implicant charts. Apparently the underlying principle of incomplete branching has not been applied previously to prime implicant charts. This principle differs in that branching is not carried out to complete covers, but only to a specified level, at which point each position is evaluated. All po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Synthesis of Binary Sequence Detectors"

    Publication Year: 1970, Page(s):173 - 174
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    In the above mentioned paper,1Perlman has given a method of state assignment of binary sequence detectors on the assumption that "the BSD represents a very special class of sequential networks and may be treated accordingly." (The BSD's are in fact a special class of networks, and their flow tables are much more ordered, resulting in a comparative ease in choosing an economical assignme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Computation of the Fast Walsh-Fourier Transform"1

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

    J. L. Shanks1has given an algorithm for computing the discrete Walsh transform (abstract Fourier transform) of a sampled periodic function whose domain of definition is the set of integers modulo 2n. An algorithm of the same efficiency, using a much simpler notation, was given for the abstract Fourier transform in my correspondence published in 1963 in this TRANSACrIONS.... 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):175 - 176
    Request permission for commercial reuse | PDF file iconPDF (2372 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

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

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

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