IEEE Transactions on Computers

Issue 3 • March 1971

Filter Results

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

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

    Publication Year: 1971, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (263 KB)
    Freely Available from IEEE
  • System Segmentation for the Parallel Diagnosis of Computers

    Publication Year: 1971, Page(s):261 - 270
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2093 KB)

    In this paper we develop methods of segmenting a large system into smaller subsystems so that the letter can be diagnosed in parallel. Two basic techniques called serial segmentation and parallel segmentation are introduced. Furthermore, an algorithm is developed for the purpose of reducing the complexity and the size of the large subsystem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of Waveforms Obtained by Nonrecursive Digital Filtering of Pseudorandom Binary Sequences

    Publication Year: 1971, Page(s):270 - 281
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2188 KB)

    This paper derives and discusses statistical properties (probability density function, moments, power spectrum, and autocorrelation function) of waveforms obtained by nonrecursive digital filtering of pseudorandom linear binary sequences. This filtering may be achieved in practice by forming a weighted summation of binary digits passing along a shift register. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Sequential Decision Model for Selecting Feature Subsets in Pattern Recognition

    Publication Year: 1971, Page(s):282 - 290
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1609 KB)

    This paper deals with a sequential decision model for selecting feature subsets in pattern recognition. Based upon this model, a number of selection strategies are proposed and their properties are investigated. The basic criterion of these selection strategies, which depend only on the last r (r finite) recognition samples, is to maximize the long-run proportion of correct recognition, the maximi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realization Methods for Asynchronous Sequential Circuits

    Publication Year: 1971, Page(s):290 - 297
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1648 KB)

    This paper gives a unified approach for describing various systematic ways of using built-in delays in normal fundamental mode circuits. The transition of the circuit from one total stable state to another is characterized by the constraints imposed upon the next-state functions, and the realization method is characterized by the conditions under which these constraints can be satisfied simultaneo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Associative Algebraic Structures in the Set of Boolean Functions and Some Applications in Automata Theory

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

    A class of linear algebraic structures over the set of Boolean functions is presented. Afterwards, from these structures a new one is studied—the right-weak algebra. By using the properties of this algebra, some new results are established about the commutativity of the superposition, the ideals, the annulators, and the properties of the iteration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Algorithm for the Disjunctive Decomposition of Switching Functions

    Publication Year: 1971, Page(s):304 - 309
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1041 KB)

    An algorithm for obtaining all simple disjunctive decompositions of a switching function is described. It operates on a function given as an expression using the operations AND, EXCLUSIVE OR, and complementation. It uses necessary conditions for the existence of a decomposition to eliminate sets of bound sets from consideration. Thus this technique differs from existing methods in that it attempts... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Relationship Between Two Fast Fourier Transforms

    Publication Year: 1971, Page(s):310 - 317
    Cited by:  Papers (76)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1728 KB)

    The purpose of this note is to show as clearly as possible the mathematical relationship between the two basic fast methods used for the calculation of discrete Fourier transforms and to generalize one of the methods a little further. This method applies to all those linear transformations whose matrices are expressible as direct products. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Universal Cellular Array

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

    A new type of fixed-cell fixed-interconnection homogeneous cellular array that is capable of realizing any switching network is developed. The array is composed of identical combinational logic cells with three inputs and three outputs. The logic cells are arranged in a rectangular array with uniform interconnection structure. The signal flow is unilateral in the vertical direction and bilateral i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine Complexity Versus Interconnection Complexity in Iterative Arrays

    Publication Year: 1971, Page(s):321 - 323
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (773 KB)

    A procedure is given for the construction of a von Neumann neighborhood iterative array to simulate a Moore neighborhood array in real time for the cases of up to three-dimensional arrays. The increase in the typical machine complexity accompanying this neighborhood complexity reduction is significantly less than that found in the general n-dimensional study of Cole [1]. View full abstract»

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

    Publication Year: 1971, Page(s):323 - 330
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1988 KB)

    The basic properties and realization of failsafe combinational logic nets and failsafe sequential machines are discussed. The present note concerns totally asymmetric faiiure nets which are composed only of (+) elements and/ or (-) elements, where a (+) element is an asymmetric failure element which never fails to logical zero and a (-) element is defined similarly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral Properties of Waveforms Generated by Smooth Sequences

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

    We investigate the spectral component at a desired frequency (f= p/2q) of two-level waveforms constrained to change level only at integer values of time. We conclude that the component at the frequency is maximized if and only if the level changes coincide with the pulses of a smooth sequence of rate p/q. View full abstract»

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

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

    A special aspect of sequential machine identification is treated in this paper. Given an input signal sequence to an unknown sequential machine and the resulting output signal sequence of the machine, it is necessary to find a state table or any other description of the machine and all other machines which response to the given input sequence with the given output sequence. The main objective of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebra for Logic Systems—Switching Circuits Application

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

    The goal of this note is to present a new logical variable, the "degree of freedom," which is more refined than the usual Boolean variable, and also the very general algebra which may be formulated using the concept of "degree of freedom." View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Detecting Total or Partial Symmetry of Switching Functions

    Publication Year: 1971, Page(s):352 - 355
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1320 KB)

    This note presents a method for identifying total or partial symmetry of switching functions based on the application of the principle of residue test by numerical methods. The invariance of a switching function under a single interchange of two variables can be readily detected from the equality of some of the residues of expansion about these two variables. This procedure of detecting invariance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation

    Publication Year: 1971, Page(s):355 - 359
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1594 KB)

    There exist a number of methods for finding minimal or nonminimal irredundant solutions of switching functions. Recently in a paper by Marcovitz and Shub, an improved algorithm for simplifying switching functions using a Karnaugh map is suggested. The present study extends the basic idea of the authors in finding minimal and nonminimal irredundant solutions by using the cover table representation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BCD and Radi x-2 Conversions

    Publication Year: 1971, Page(s):360 - 361
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    An algorithm for the conversion of BCD numbers to numbers in the -2 radix system is presented. This algorithm consists of simple arithmetic operations such as division by two and addition of the constants one and five. These operations may easily be performed in a -2 radix computer by shifting a number right for division by two and a table look-up procedure for the additions. The reverse conversio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Parallel-Acting Index Registers

    Publication Year: 1971, Page(s): 361
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    It is shown how index registers can be made so as to act parallel to the computer instruction flow, thus not requiring a programmed instruction to decrement (or increment) and jump. This method would save one instruction per loop but would require more hardware. View full abstract»

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

    Publication Year: 1971, Page(s):362 - 363
    Request permission for commercial reuse | PDF file iconPDF (2335 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1971, Page(s):364 - 380
    Request permission for commercial reuse | PDF file iconPDF (6213 KB)
    Freely Available from IEEE
  • Information for authors

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