By Topic

IEEE Transactions on Computers

Issue 10 • Date Oct. 1972

Filter Results

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

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

    Publication Year: 1972, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (206 KB)
    Freely Available from IEEE
  • An Adaptive Replacement Algorithm for Paged-Memory Computer Systems

    Publication Year: 1972, Page(s):1053 - 1061
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB)

    A general class of adaptive replacement schemes for use in paged memories is developed. One such algorithm, called SIM, is simulated using a probability model that generates memory traces, and the results of the simulation of this adaptive scheme are compared with those obtained using the best nonlookahead algorithms. A technique for implementing this type of adaptive replacement algorithm with st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design or Multipoint Linkages in a Teleprocessing Tree Network

    Publication Year: 1972, Page(s):1062 - 1066
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    The problem of designing a minimum cost network with multipoint linkages which connects several remote terminals to a data processing center is studied. The important aspects of a teleprocessing network are queue behavior at the terminals and the cost and reliability of the entire system. In this paper it is assumed that the rate and manner in which information is requested at the terminals is kno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional Linear Iterative Circuits—General Properties

    Publication Year: 1972, Page(s):1067 - 1073
    Cited by:  Papers (97)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    This paper fornulates a state-space model for linear iterative circuits having more than one spatial dimension. A new type of matrix operation is introduced that allows treatment of such models in a relatively straightforward manner. Finally, a form for the general response is developed in terms of this new matrix operation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Class of Autonomous One-Dimensional Iterative Arrays of Linear Machines

    Publication Year: 1972, Page(s):1073 - 1086
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2144 KB)

    An analysis of the state structure and of the autonomous behavior of iterative systems belonging to the class of one-dimensional unidirectional single-output autonomous iterative arrays with one intercell lead and the cell structure of a linear sequential machine (LSM) is presented. An algorithm is developed for computing the state structure of any such iterative system with the cell structure of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Two-Level Threslold Gate Realizations

    Publication Year: 1972, Page(s):1086 - 1098
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1936 KB)

    This paper deals with the synthesis of two-level networks of threshold gate logic elements for realization of nonlinearly separable switching functions. The realization obtained contains the minimum number of threshold logic elements possible for a two-level realization. An algorithm based on the tree procedure of Coates and Lewis is developed which can be used to obtain the desired network realiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Synthesis of Minimal Hazardless TANT Networks

    Publication Year: 1972, Page(s):1099 - 1108
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1760 KB)

    This paper presents a new algorithm Amfor the synthesis of minimum gate costs TANT networks. This algorithm, which differs in the setting up of the CC table from the known Gimpel's algorithm [1], has some very advantageous features, both in its hand solution and the computer realization. The final stage of this synthesis is the solution of the CC table. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Complete Systems and Finite Automata

    Publication Year: 1972, Page(s):1109 - 1113
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    A production on T* is a rewriting rule σα→σ' for all aϵ T*, where σ, σ' are strings in T* with a' lexicographically earlier than σ. Any finite collection of productions is called a system. This note shows that any system that is consistent, complete, and has the nonprefix property uniquely represents an automaton. This formulation characterizes automata as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Versatile Multiplying Digital-to-Analog Converter

    Publication Year: 1972, Page(s):1113 - 1116
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2832 KB)

    A modified binary-weighted resistor multiplying digital-to-analog (MDAC) converter with a full scale (±12 V) analog bandwidth in excess of 500 kHz is described. Its settling time following changes in digital inputs of either polarity is less than 2 , μs. The dc resolution is 0.01 percent and the dynamic error increases from 0.01 percent at 50 kHz to 0.1 percent at 250 kHz. View full abstract»

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

    Publication Year: 1972, Page(s):1116 - 1119
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    A permuter network is used to arbitrarily change the ordering of the variables of a switching function. A new scheme for permuter arrays is discussed in this note whereby the variables are selected sequentially by a number of "selector cells" according to the required output ordering. A cellular realization of the selector cell is suggested. View full abstract»

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

    Publication Year: 1972, Page(s):1119 - 1124
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    In the search for new methods to realize stochastic automata, additive Bernoulli noise linear sequential circuits (ABNLSC) are constructed from linear sequential circuits fed with Bernoulli noise. The characteristics of the subclass of stochastic automata realizable by ABNLSC's are found. These characteristics include: commutativity with respect to input sequences; state minimality; doubly stochas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular Networks and Nondeterministic Sequential Machines

    Publication Year: 1972, Page(s):1124 - 1129
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    The synthesis of sequential machines by interconnections of copies of a fixed module is considered. A family of modules Mr,pfor positive integers r and p, is defined. Mr,p can be used to synthesize sequential machines with 2Pinput symbols. A nondeterministic sequential machine (NSM) is said to be r-bounded if it has one initial state and for no state and input are there more ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Iterative Technique for Determining the Minimal Number of Variables for a Totally Symmetric Function with Repeated Variables

    Publication Year: 1972, Page(s):1129 - 1131
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    Several analytic procedures exist for transforming a partially symmetric switching function to a totally symmetric switching function by judiciously repeating certain variables. Presumably the best totally symmetric representation for a given function would be the one having the fewest variables. This note presents an iterative technique for finding the totally symmetric realization for a given fu... View full abstract»

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

    Publication Year: 1972, Page(s):1132 - 1133
    Request permission for commercial reuse | PDF file iconPDF (2689 KB)
    Freely Available from IEEE
  • B72-17 Computer Analysis of Circuits

    Publication Year: 1972, Page(s):1133 - 1135
    Request permission for commercial reuse | PDF file iconPDF (1944 KB)
    Freely Available from IEEE
  • B72-18 Computers and Their Uses, 2nd ed.

    Publication Year: 1972, Page(s): 1135
    Request permission for commercial reuse | PDF file iconPDF (304 KB)
    Freely Available from IEEE
  • B72-19 Future Developments in Telecommunications

    Publication Year: 1972, Page(s):1135 - 1136
    Request permission for commercial reuse | PDF file iconPDF (616 KB)
    Freely Available from IEEE
  • B72-20 Computers in Busines–An Introduction, 2nd ed.

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

    Publication Year: 1972, Page(s):1137 - 1152
    Request permission for commercial reuse | PDF file iconPDF (4067 KB)
    Freely Available from IEEE
  • Information for authors

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