By Topic

IEEE Transactions on Computers

Issue 8 • Date Aug. 1971

Filter Results

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

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

    Publication Year: 1971, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (269 KB)
    Freely Available from IEEE
  • Increasing Digital Computer Efficiency with the Aid of Error-Correcting Analog Subroutines

    Publication Year: 1971, Page(s):831 - 837
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1688 KB)

    A network of passive electrical resistors is connected in a closed loop with a digital computer. This network functions as a parallel-operating subroutine to greatly accelerate the digital computer solution of certain classes of numerical problems. Computer systems employing the analog subroutine concept are "digital-computer-oriented" hybrid computers. Problems are programmed for conventional dig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TOPI—A Special-Purpose Computer for Boolean Analysis and Synthesis

    Publication Year: 1971, Page(s):837 - 842
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2784 KB)

    TOPI is a special-purpose computer for the synthesis and analysis of Boolean functions. The algorithms executed by TOPI have been developed specifically for this computer and are an evolution of the iterative consensus method. They allow the determination and classification of the prime implicants of a given Boolean function, as well as the determination of a number of irredundant normal coverings... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Fourier Transform for High-Speed Signal Processing

    Publication Year: 1971, Page(s):843 - 846
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    An arbitrary-radix fast Fourier transform algorithm and a design of its implementing signal processing machine are introduced. The algorithm yields an implementation with a level of parallelism proportional to the radix r of factorization of the discrete Fourier transform, allows 100 percent utilization of the arithmetic unit, and yields properly ordered Fourier coefficients without the need for p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and Synthesis of Asynchronous Sequential Networks Using Edge-Sensitive Flip-Flops

    Publication Year: 1971, Page(s):847 - 855
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1920 KB)

    Standard flow table methods for analysis and synthesis of asynchronous sequential switching networks are difficult to apply when edge-sensitive flip-flops are used. Use of a differential mode (DM) state table, which specifies the next state as a function of the present state and input change, avoids such difficulties. Difference operators, which are used to specify changes in logic variables, prov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Universal STT State Assignment Method for Pulse Input Asynchronous Sequential Circuits

    Publication Year: 1971, Page(s):856 - 861
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1688 KB)

    Methods to realize race-free asynchronous sequential circuits by using appropriate single transition time (STT) state assignments have been described in the literature. This paper deals with that restricted class of asynchronous circuits (called pulse-input asynchronous circuits) for which in every input sequence each input state liis always followed by a special input state l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High Speed Decimal Addition

    Publication Year: 1971, Page(s):862 - 866
    Cited by:  Papers (50)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    Parallel decimal arithmetic capability is becoming increasingly attractive with new applications of computers in a multi-programming environment. The direct production of decimal sums offers a significant improvement in addition over methods requiring decimal correction. These techniques are illustrated in the eight-digit adder which appears in the System/360 Model 195. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Diagnosable Iterative Arrays

    Publication Year: 1971, Page(s):867 - 877
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3112 KB)

    One-and two-dimensional iterative arrays of identical cells are becoming more important in the design of digital systems using large-scale integrated circuits because of the advantages that they provide in design, fabrication, and testing. Since arrays containing hundreds or thousands of gates on one chip are now considered possible, the task of finding procedures for the testing of such arrays fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • G101—A Remote Time Share Terminal with Graphic Output Capabilities

    Publication Year: 1971, Page(s):878 - 881
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2408 KB)

    A remote terminal with graphical output capability has been designed for use with time-shared computer systems. The terminal contains a small computer to provide local picture storage and the ability to employ picture encoding techniques which greatly reduce transmission times. A storage oscilloscope is used to view the output. Terminal cost is currently about $10 000. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes for Error Correction in High-Speed Memory Systems—Part I: Correction of Cell Defects in Integrated Memories

    Publication Year: 1971, Page(s):882 - 888
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1848 KB)

    This paper introduces two schemes to correct bit errors caused by defective memory cells in high-speed random-access memory systems. The schemes are addressed to word-organized memories produced by the integrated technologies. One of the two schemes calls for encoding of input information and the other does not. The schemes are simple, economical for the technologies concerned, and exhibit a regul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization of Stochastic Automata

    Publication Year: 1971, Page(s):889 - 893
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    Using the convex combination of random binary variables, stochastic vectors and stochastic matrices are systematically realized. The techniques are extended to the realization of stochastic automata as randomly fed deterministic automata. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Variational Approach to Digital Integration

    Publication Year: 1971, Page(s):894 - 900
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB)

    Variational equations are derived as a preliminary step in determining efficient digital integration techniques for nonlinear dynamical systems. The variational approach is applied initially to linear time-invariant systems to introduce the basic concept and then to nonlinear time-varying systems. For systems containing both linear and nonlinear parts, a combination technique which uses the exact ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Digital Computers to Solve Analytically a Class of Second-Order Non-linear Ordinary Differential Equations

    Publication Year: 1971, Page(s):901 - 910
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1392 KB)

    This note is concerned with the application of digital computers to solve analytically a class of second-order nonlinear ordinary differential equations. Programs, written in the FØRMAC language, are described, which employ the perturbation methods of Krylov, Bogoliubov, and Mitropolsky. Solutions of Duffing's equation and van der Pol's equation are included as examples. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Method of Decomposition for Unstable Two-Point Boundary Value Problems

    Publication Year: 1971, Page(s):910 - 914
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    The method of decomposition offers a means to overcome the computational difficulty associated with unstable two-point boundary value problems. The basic idea is to decompose systematically an unstable differential equation into a sequence of differential equations of a lower order, which are each stable either in the forward or in the backward direction of computer integration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Digital Computers to Three-Dimensional Field Determination

    Publication Year: 1971, Page(s):914 - 917
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    An iterative procedure consisting of successive point relaxation of the vector potentials with the use of over-and underrelaxation factors is described for the determination of the three-dimensional flux distribution in the end zone of a high-speed aerospace alternator. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Two-Dimensional Display for the Classification of Multivariate Data

    Publication Year: 1971, Page(s):917 - 923
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB)

    The properties of a two-dimensional display whose coordinates are the Euclidean distances from two points in a multivariate space are presented. When used in conjunction with three linear normalization procedures, this display is a useful tool in both supervised and unsupervised classification problems. In addition, some geometric structure is preserved by this mapping. Examples using well-known I... View full abstract»

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

    Publication Year: 1971, Page(s):923 - 925
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Logic design problems that have inessential variables as inputs are often encountered. The required logic can be implemented without the use of these inessential variables. Such variables occur most frequently in incompletely specified functions due to the presence of DON'T CARE conditions. A circuit with a minimal number of inputs would simplify many interconnection problems. This note presents a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization of Boolean Functions

    Publication Year: 1971, Page(s):925 - 929
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    The Quine–McCluskey method of minimizing a Boolean function gives all the prime implicants, from which the essential terms are selected by one or more cover tables known as the prime implicant tables. This note describes a tabular method where the essential prime implicants are selected during the process of forming the combination tables, and other essential terms are selected from what hav... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Decomposition of Periodic Representations of Sequential Machines

    Publication Year: 1971, Page(s):929 - 933
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    In this note a sequential machine decomposition implied by the fact that this machine possesses a nontrivial periodic representation is discussed. If it is fulfilled, then for the state behavior of such a sequential machine there exists a nontrivial serial decomposition into two machines, where one of them is autonomous. Moreover, if for a sequential machine there exists a reducible periodic repre... View full abstract»

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

    Publication Year: 1971, Page(s):933 - 938
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1216 KB)

    The irredundant prime closed sets play an important role in the simplification of an incompletely specified flow table. In this note, an algebraic method for deriving the irredundant prime closed sets corresponding to any given flow table has been presented. It has been shown that the complete set of irredundant prime closed sets is obtained following the procedure suggested. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Simplifying Truth Functions: A Preliminary Reduction of Coreless Formulas

    Publication Year: 1971, Page(s):938 - 941
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    The core of a truth function ø consists of those prime implicants of ø which are terms of every disjunctive normal formula equivalent to ø. The notion of core is generalized here: a class of prime implicants of ø is defined, called its "pseudo core." The pseudo core of ø consists of those prime implicants of ø which are terms of every one of a class Γ of normal e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Previous Investigation of Realization of an Arbitrary Switching Function with a Network of Threshold and Parity Elements

    Publication Year: 1971, Page(s):941 - 942
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Attention is called to previous research on realization of an arbitrary switching function by a network of threshold gates (or threshold elements) and modulo-2 gates (or parity elements), establishment of greatest lower bounds on the number of gates needed, artifices that lead to further network reduction in special cases, and systematic minimization of the number of modulo-2 gates required. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral Effects in the Use of Newton—Cotes Approximations for Computing Discrete Fourier Transforms

    Publication Year: 1971, Page(s):942 - 943
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    It is possible to view the discrete Fourier transform as the result of approximating the Fourier integral by a trapezoidal rule integration formula. In this correspondence the effects of using higher ordered Newton–Cotes integration formulas are examined. It is shown that in computing the spectrum of a bandlimited process, the trapezoidal rule is preferred when judged by the criterion of cho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Towards a New Theory of Sequential Switching Networks"1

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

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