Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 4 • April 1968

Filter Results

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

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

    Publication Year: 1968, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (171 KB)
    Freely Available from IEEE
  • Computor Simulation of Narrowband Systems

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

    Abstract—Any narrowband signal can be represented by two low-frequency functions, containing only frequencies lower than the bandwidth, which represent the envelopes of the in-phase (cosine) and quadrature ( sine) components of the carrier frequency. To obtain the transient response of a narrowband system efficiently by computer simulation, the system can be represented by a low-frequency eq... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Shift-Register Realizations of Sequential Machines and Finite-State Universal Sequential Machines

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

    Abstract—It is shown that there exist finite-state universal sequential machines which are also feedback-shift-register realizable. This proves from another point of view the recently proved fact that any arbitrary sequential machine can be realized with two shift registers: one which is not always binary, stores the input, and has no feedback; and the other which is always binary, is driven... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unitary Shift-Register Realizations of Sequential Machines

    Publication Year: 1968, Page(s):312 - 324
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2821 KB)

    Abstract—The problem of determining secondary state assignments for sequential machines such that the binary memory elements are connected in the form of shift registers is studied. An algorithm for finding such state assignments is developed. One or more code words may be assigned to a state of the sequential machine. The only restriction is that the realizations be unitary. A single shift-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irreducible Decompositions of Transformation Graphs by Assignment Techniques

    Publication Year: 1968, Page(s):325 - 329
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1392 KB)

    Abstract—Autonomous sequential networks are represented by transformation graphs, i.e., finite directed graphs, each vertex of which has outdegree one. A network that can be realized by a set of simpler, parallel networks corresponds to a transformation graph representable as a Cartesian product of simpler graphs. An algorithm for obtaining the various decompositions of a given transformatio... View full abstract»

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

    Publication Year: 1968, Page(s):330 - 337
    Cited by:  Papers (145)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1762 KB)

    Abstract—This paper states the necessary and sufficient conditions for the existence of a feedforward inverse for a feedforward linear sequential circuit and gives an implicit procedure for constructing such inverses. It then goes on to give the necessary and sufficient conditions for the existence of general inverses with finite delay and gives procedures for constructing a class of such in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic

    Publication Year: 1968, Page(s):338 - 351
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2611 KB)

    Abstract—The concept of mutual monotonicity developed in the previous paper[1] is applied to the compound synthesis of an arbitrary logic function by a combination of completely monotonic functions or in most cases by threshold functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Testing and Diagnosis in Combinational Digital Circuits

    Publication Year: 1968, Page(s):352 - 366
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2782 KB)

    Abstract—he problem of designing test schedules for the testing or diagnosis of a small number of nontransient faults in combinational digital circuits (switching networks) is considered in detail. By testing and diagnosis we mean the following: 1) detection of a fault, 2) location of a fault, and 3) location of a fault within the confines of a prescribed package or module. It is shown that ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern Classifier Design by Linear Programming

    Publication Year: 1968, Page(s):367 - 372
    Cited by:  Papers (82)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1403 KB)

    Abstract—A common nonparametric method for designing linear discriminant functions for pattern classification is the iterative, or "adaptive," weight adjustment procedure, which designs the discriminant function to do well on a set of typical patterns. This paper presents a linear programming formulation of discriminant function design which minimizes the same objective function as the "fixe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A High-Speed Algorithm for the Computer Generation of Fourier Transforms

    Publication Year: 1968, Page(s):373 - 375
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    Abstract—An efficient algorithm is presented for performing the Fourier transformation operation on a digital computer. This algorithm completes the transform calculation with Nlog2N complex additions (complex additions include complex subtractions) and ½N [log2(N)-2]+1 complex multiplications. This is a considerable savings over a brute-force method of N2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensitivity-Function Calculation in Linear Systems Using Time-Shared Analog Integration

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

    Abstract—Sensitivity functions which relate the effect of parameter variations to system variables may be calculated for linear systems by simultaneous integration of two sets of first-order linear differential equations. These sets have the same homogeneous part. This note describes how an analog computer may be used to solve these equations without using two distinct simulations wired toge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Voltage Selector and Cascade Multiplier Circuits

    Publication Year: 1968, Page(s):380 - 382
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (510 KB)

    Abstract—Generally applicable accurate diode voltage selectors are described as well as means for the reduction of static errors in cascade multipliers and in multiplier input converters. An analysis of static errors is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of Pseudorandom Noise Having a Gaussian Spectral Density

    Publication Year: 1968, Page(s):382 - 385
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (683 KB)

    Abstract—A method is described for modifying pseudorandom noise generators to obtain normally distributedor Gaussian spectral densities. This is achieved by using digital filtering techniques of weighted summation of digits stored in the shift register. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "State-Space Methods for Designing Digital Simulations of Continuous Fixed Linear Systems"

    Publication Year: 1968, Page(s): 385
    Request permission for commercial reuse | PDF file iconPDF (264 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Autonomous Logic Nets of Threshold Elements

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

    Abstract—A model of autonomous logic nets composed of n threshold elements is presented and several properties of a single threshold element are generalized to this model. The number of these nets is shown to be 2kn³(½≤k≤l) for completely specified machines. The capacity of the net is defined and conjectured to be 2, similar to the case of a single threshold ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of a Class of Switching Functions by Threshold-Logic Networks

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

    Abstract—In this note, a class of switching functions, called threshold-product functions, whose definition is analogous to that of threshold functions (which will be called threshold-sum functions), is studied in detail. It is shown that both threshold functions and parity functions are special cases of threshold-product functions. A simple and economical threshold-logic realization method ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experiments with Highleyman's Data

    Publication Year: 1968, Page(s):399 - 401
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (943 KB)

    Abstract—The results of three experiments with Highleyman's hand-printed characters are reported. Nearest-neighbor classification is used to explain the high error rates (42 to 60 percent) obtained by general statistical procedures. An error rate of 32 percent is obtained by preceding piecewise-linear classification by edge-detecting preprocessing. The minimum human error rate is estimated, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Computation of Time-Phase Displacements of Binary Linear Sequence Generators"

    Publication Year: 1968, Page(s): 402
    Request permission for commercial reuse | PDF file iconPDF (176 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contributors

    Publication Year: 1968, Page(s):403 - 404
    Request permission for commercial reuse | PDF file iconPDF (2974 KB)
    Freely Available from IEEE
  • R68-10 SODAS and a Methodology for System Design

    Publication Year: 1968, Page(s): 405
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • R68-11 Intercommunication of Processors and Memory

    Publication Year: 1968, Page(s):405 - 406
    Request permission for commercial reuse | PDF file iconPDF (648 KB)
    Freely Available from IEEE
  • R68-12 An Experimental Model of System/ 360

    Publication Year: 1968, Page(s):406 - 407
    Request permission for commercial reuse | PDF file iconPDF (696 KB)
    Freely Available from IEEE
  • R68-13 An Introduction to Computer Graphic Terminals

    Publication Year: 1968, Page(s): 407
    Request permission for commercial reuse | PDF file iconPDF (296 KB)
    Freely Available from IEEE
  • R68-14 Microprogrammed Control in Problem-Oriented Languages

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