IEEE Transactions on Computers

Issue 3 • March 1968

Filter Results

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

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

    Publication Year: 1968, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (231 KB)
    Freely Available from IEEE
  • Transport Time-Delay Simulation for Transmission Line Representation

    Publication Year: 1968, Page(s):205 - 214
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3579 KB)

    Abstract—Two practical methods for obtaining a pure transport time delay are described which are well suited for analog computer applications. Examples of transmission line simulations are given where traveling wave phenomena are of interest. An alternate approximare method of transmission line representation is derived utilizing the natural frequencies of the primitive line and requiring on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theory of Completely Monotonic Functions and its Applications to Threshold Logic

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

    Abstract—As an approach to clarifying the basic properties of threshold logic, the completely monotonic function is investigated. Its testing procedure, functional form, etc., are discussed by using a new concept, mutual monotonicity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Concatenative Decompositions of Regular Events

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

    Abstract—Finding simple or "canonical representations" for regular events is one of the important problems concerning finite automata. The present paper is an attempt to find concatenative canonical decompositions for regular events. Five different decomposition types of regular events are defined, imustrated by examples, and their properties investigated. The main tool in our investigations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic Hazards in Threshold Networks

    Publication Year: 1968, Page(s):238 - 251
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3031 KB)

    Abstract—This paper is concerned with the study of logic hazards in threshold gate networks. Eichelberger has proved that logic hazards are not present in a sum-of-product (product-of-sum) realization which realizes all of the 1(0) prime implicants of the given Boolean function.[2]Logic gates of the AND or NOR (OR or NAND) variety realize single l(0) prime implicants; therefore, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polylinear Sequential Circuit Realizations of Finite Automata

    Publication Year: 1968, Page(s):251 - 259
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1896 KB)

    Abstract—This paper considers the problem of obtaining realizations of synchronous finite automata from their regular expression specifications. A polylinear sequential circuit realization is defined, and it is proven that every synchronous finite automaton has such a realization. A method is developed for the derivation of a polylinear sequential circuit realization of any automaton specifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A 48-Channel PCM Tape Data-Acquisition System

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

    Abstract—A high-performance data-acquisition system, now operational, combining analog and digital techniques is described. Up to 48 channels of information can be digitized continuously at rates up to 240K samples per second and then divided into standard contiguous computer records by a tape shuttling method. Various input and output modes permit the tailoring of data gathering and matchin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Improving the Analog Computer Solutions of Linear Systems

    Publication Year: 1968, Page(s):268 - 270
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (610 KB)

    Abstract—In the solution of a system of equations of the form X=-AX by analog computers, errors will result due to the nonideal characteristics of the integrators and summing amplifiers. In this note a method is given which predistorts the coefficient potentiometers in a manner governed by the models of the active elements which forces the output to be the same as the expected analytical sol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theorem on Linearity

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

    Abstract—A system is linear if and only if it is zero-state linear, zero-input linear, and its input-output state equation has the decompostion property. In this note, it is shown that zero-state linearity is sufficient to imply that the set of states accessible from the zero state can be made into a vector space over the output field and the zeroinput response is a homomorphism on this vect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Determination of Complete Sets of Logical Functions

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

    Abstract—A procedure is described, based on a theorem of Post, for determining the nonredundant complete sets of logical functions. Kudielka and Oliva's determination of these functions for two and three variables was verified by means of this procedure in less than a minute of computer time. The procedure requires the computation of irredundant coverings, and novel features of the algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assumptions in the Threshold Synthesis of Symmetric Switching Functions

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

    Abstract—This note establishes the fact that an optimal synthesis technique (even for a small number of variables) must abandon the basic assumption of assigning only +1 weights to the primary inputs. Examples are presented where both negative primary weights and/or nonunitary primary weights are required to achieve minimality. A method of network analysis is presented which leads to optimal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Slide Rule Device for Checking 2-Summability

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

    Abstract—A switching function which is 2-summable is not linearly separable (a threshold function). A test for 2-summability is given which uses the decimal numbers corresponding to the standard products (minterms) of a function, a slide rule like device, and a preformed chart. The device may be used with functions of up to six variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Reversibility of Computations in a Digital Differential Analyzer

    Publication Year: 1968, Page(s):283 - 284
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    The numerical integration performed in a digital differential analyzer (DDA) is always associated with a truncation error [1,2]. This correspondence deals with truncation errors generated when the direction of the independent variable (the sign of the △X) is reversed, which will be subsequently referred to as reversibility errors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstracts of Current Computer Literature

    Publication Year: 1968, Page(s):285 - 297
    Request permission for commercial reuse | PDF file iconPDF (3569 KB)
    Freely Available from IEEE
  • R68-8 Language Directed Computer Design

    Publication Year: 1968, Page(s): 298
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • R68-9 A Computer Simulation of Electrical Loss and Loading Effect in Magnetic Recording

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

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