By Topic

IEEE Transactions on Computers

Issue 2 • Date Feb. 1968

Filter Results

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

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

    Publication Year: 1968, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (168 KB)
    Freely Available from IEEE
  • The Separation Technique: A Method for Simulating Transistors to Aid Integrated Circuit Design

    Publication Year: 1968, Page(s):113 - 116
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1680 KB)

    Abstract—A new technique that uses the transistor itself as a computing element has been developed for simulating transistors on the analog computer. The method is called the separation technique since it separates the high-and low-frequency behavior of the simulated transistor. The high-frequency behavior of the transistor is time scaled by a factor (typically one million) suitable for comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Synthesis of Multiple-Output Combinational Logic

    Publication Year: 1968, Page(s):117 - 128
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2776 KB)

    Abstract—A computer-oriented algorithm for synthesizing combinational logic circuits from a collection of functionally packaged circuits is developed. The algorithm uses a hierarchy of "goals" in an iterative decision process in a manner similar to that employed by theorem proving and gamne playing programs. With each iteration a set of "tasks" finds the circuit package which satisfies the h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of Asynchronous Sequential Circuits Without Inserted Delay Elements

    Publication Year: 1968, Page(s):129 - 134
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB)

    Abstract—In an earlier paper, Unger showed that any normal mode flow table can be realized by an asynchronous sequential circuit without inserted delays in the feedback paths if and only if the flow table contains no essential hazards. No restrictions were placed on the relative magnitudes of line and gate delays. In this paper, we show that if the line delays are less than the minimum gate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Maximum Inversion with Minimum Inverters

    Publication Year: 1968, Page(s):134 - 135
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Abstract—Given a set of n input variables, let D(n) denote the smallest integer y such that n2y. It is shown that the complete set of input variables may be inverted using just D(n) inverters and n+D(n) positive-weight threshold gates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Carry-Propagation Iterative Networks

    Publication Year: 1968, Page(s):136 - 145
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2240 KB)

    Abstract—The operation speed of a one-dimensional, unilateral, iterative switching network with strictly combinational cells is often drastically limited by the propagation delays of carry variables. In this paper an attempt is made to extend to other iterative networks the scheme of a fast carry-propagation circuit proposed by several authors for parallel adder. The class of the networks wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Row Assignment for Delay-Free Realizations of Flow Tables Without Essential Hazards

    Publication Year: 1968, Page(s):146 - 151
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB)

    Abstract—A method is presented for realizing any flow table that does not contain essential hazards with a circuit requiring no delay elements for proper operation. The procedure generally requires considerably fewer state variables than did an earlier technique for achieving the same result. It is based on a modification of a method by Tracey for constructing single-transition-time row assi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure and Function in Polyfunctional Nets

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

    Abstract—This paper investigates various aspects of functional and structural complexity in Boolean polyfunctional nets. These are nets each of whose constituent elements are capable of performing any single function from a prescribed set of functions assigned to the element. Such nets are characterized in the paper as functionally redundant, universal, ultrastable, perfect, imperfect, etc. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Least-Square Dead-Time Approximations

    Publication Year: 1968, Page(s):174 - 178
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    Abstract—A new group of dead-time approximations for use in analog simulations is presented. These approximations were synthesized in the time domain using a least-square norm and a gradient search technique. The combined frequency and transient response of the new approximations is better than that of previously reported approximations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Procedure for Multiclass Pattern Classification

    Publication Year: 1968, Page(s):178 - 182
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    Abstract—A more general adaptive procedure for determining linear or piecewise linear discriminant functions for multiclass pattern classification is proposed. The adaptive procedure is a many-pattern or group-pattern adaptation. The training sequence consists of groups of vectors in matrix form instead of single vectors. The convergence proof shows that this procedure terminates in a finite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Minimization Technique for Multiple-Valued Logic Systems

    Publication Year: 1968, Page(s):182 - 184
    Cited by:  Papers (78)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    Abstract—An algebra for switching circuits that may have multiple values is introduced. A minimization technique suitable for computer implementation is then presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discussion of Some Flaws in the Classical Theory of Two-Level Minimization of Multiple-Output Switching Networks

    Publication Year: 1968, Page(s):184 - 186
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Abstract—Two errors have been found in the classical theory of two-level minimization of multiple-output switching networks. First, the prime implicant theorem must be modified to cover certain degenerate cases, and second, the widely accepted notion that there can always be found a miinimal network corresponding to a set of equations that are entirely sum-of-products or entirely product-of-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SAHYB-2: A Continuous System Simulation Language Compatible with FORTRAN-IV

    Publication Year: 1968, Page(s):187 - 188
    Request permission for commercial reuse | PDF file iconPDF (440 KB)
    Freely Available from IEEE
  • Comment on "An Analog Photoresistive Multiplier"

    Publication Year: 1968, Page(s): 188
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    As a prime example of the difficulty of technical communications in this day, I cite the case of the Review R67-41, on page 380 of the June, 1967, issue of this TRANSACTIONS. This review, by E. Massell of an article entitled "An Analog Photoresistive Multiplier,"1has belatedly come to my attention. In it the reviewer states, quite correctly, that this article "is a very complete descrip... View full abstract»

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

    Publication Year: 1968, Page(s): 188
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    I greatly appreciate V. Azgapetian's bringing to my attention the work that he has done in applying photoresistive elements to analog computation. Unfortunately, his letter does not contain sufficient technical information to permit me to evaluate the situation. My patent attorney will obtain copies of the patents which he cites and we will review them in detail. View full abstract»

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

    Publication Year: 1968, Page(s):189 - 190
    Request permission for commercial reuse | PDF file iconPDF (2778 KB)
    Freely Available from IEEE
  • R68-5 Models of Computational Systems–Cyclic to Acyclic Graph Transformations

    Publication Year: 1968, Page(s):191 - 192
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (552 KB)
    Freely Available from IEEE
  • R68-6 Regression Analysis and Parameter Identification

    Publication Year: 1968, Page(s): 192
    Request permission for commercial reuse | PDF file iconPDF (312 KB)
    Freely Available from IEEE
  • R68-7 Analog Simulation of Ferroresonant System Including Analysis of Hysteresis Loop

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

    Publication Year: 1968, Page(s):193 - 204
    Request permission for commercial reuse | PDF file iconPDF (3824 KB)
    Freely Available from IEEE
  • Information for authors

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