By Topic

IEEE Transactions on Computers

Issue 6 • Date June 1970

Filter Results

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

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

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • On the Representation of Arbitrary Functions and Their Generation

    Publication Year: 1970, Page(s):483 - 486
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    Three methods are described for the representation of continuous functions as lattice polynomials in terms of a set of generators. They are two-stage-parallel, three-stage-parallel, and series- parallel. Each representation is in direct correspondence with an analog function generator. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Nonlinear Process Stabilization and Control

    Publication Year: 1970, Page(s):487 - 492
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1024 KB)

    Automized stabilization and control of computer-controlled nonlinear processes is considered. A new algorithm which constitutes a combination of Popov's and of Jury and Lee's stability criteria with a nonlinear programming approach is proposed. The algorithm is applied to a digitally controlled antenna tracking system and the operation is simulated on an IBM 360/91 computer. The solution involves ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Static Memory Allocation in Computer Systems

    Publication Year: 1970, Page(s):492 - 503
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1920 KB)

    An algorithm for allocation of memory resources is presented making use of a priori information about a computer program. This static allocation algorithm is based on a directed graph model of computations with particular attention to the memory allocation of programs assigned for execution on multiprocessor systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive Operators for Prime Implicant and Irredundant Normal Form Determination

    Publication Year: 1970, Page(s):504 - 509
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1176 KB)

    A common recursive formulation is presented for determining: 1) all the prime implicants, and 2) an irredundant normal form of any completely or incompletely specified Boolean function given in canonical form. Formulas for specific operators Pi and lrr2 solving these problems are given and recursive partitioned list algorithms are described for them. The solution of both of the above problems thro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complementary Function Approach to the Synthesis of Three-Level NAND Network

    Publication Year: 1970, Page(s):509 - 514
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1224 KB)

    In the present paper efforts have been made to arrive at the three-level NAND network of any general Boolean function by utilizing its complementary function. It has been shown that the knowledge of the complementing gates of the three-level NAND circuit with minimum number of gates in the AND level can readily be obtained from the study of the prime implicants of the complementary function. A red... View full abstract»

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

    Publication Year: 1970, Page(s):515 - 529
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3088 KB)

    The problem of decomposing an asynchronous sequential circuit into the serial connection of two asynchronous sequential circuits is considered. Six types of serial connections are defined, and necessary and sufficient conditions are derived for making five of the six types of serial decomposition, while sufficient conditions are derived for the sixth. Systematic and constructive procedures are pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buffer Behavior for Poisson Arrivals and Multiple Synchronous Constant Outputs

    Publication Year: 1970, Page(s):530 - 534
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    A queuing model with a limited waiting room (buffer), Poisson arrivals, multiple synchronous servers (synchronous transmission channels), and constant services is studied. Using traffic intensity and number of transmission lines as parameters, the relationships among overflow probabilities, buffer size, and expected queuing delay due to buffering are obtained. These relationships are represented i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Swap-Time Considerations in Time-Shared Systems

    Publication Year: 1970, Page(s):534 - 540
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    Solved for is the expected swap time expended for those customers in the system of queues in general models of time- shared systems. This quantity is expressed in terms of the expected queueing time conditioned on required service time and is applied to a number of examples of interest. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for Recognizing Contour-Traced Handprinted Characters

    Publication Year: 1970, Page(s):541 - 546
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    A contour-tracing technique originally devised by Clemens and Mason was modified and used with several different classifiers to recognize upper case handprinted characters. Recognition accuracies obtained compare favorably with other published results, particularly when additional simple tests are performed to differentiate commonly confused characters. One suboptimum classifier, in addition to yi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Sonic Pen: A Digital Stylus System

    Publication Year: 1970, Page(s):546 - 548
    Cited by:  Papers (4)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1736 KB)

    An inexpensive computer graphical input device giving Cartesian coordinates with better than 1-mm resolution is described. The technique works equally well for two-or three-dimensional input variants of the device. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Information-Lossless Discrete-Time Systems

    Publication Year: 1970, Page(s):548 - 551
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The concept of lossless state or system is generalized by the definition of k-losslessness. If k>N( N-1)/2 for an N-state machine, k-lossless implies lossless. The series connection of a set of discrete time systems {Ai}, where Ai is ki-lossless, results in a system which is min{ki}-lossless. This result is a simple verification of the intuitive notion that a noiseless communication channel is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for the Design of Fault Detection Experiments

    Publication Year: 1970, Page(s):551 - 558
    Cited by:  Papers (76)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1456 KB)

    A methodical procedure for organization of fault detection experiments for synchronous sequential machines possessing distinguishing sequences (DS) is given. The organization is based on the transition checking approach. The checking experiment is considered in three concatenative parts: 1) the initial sequence which brings the machine under test into a specific state, 2) the α-sequence to re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is There Any Advantage of Ternary Logic as Compared with Binary?

    Publication Year: 1970, Page(s): 559
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    This correspondence describes a way to compare binary with ternary logic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "A Transform for Logic Networks"

    Publication Year: 1970, Page(s):559 - 560
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    The above-mentioned paper by K. S. Menger1 presents a restatement of logic functions in terms of the "macroelements" of Galois field (GF) arithmetic. Against the current background of LSI technology, this high- level hardware is going to be a welcome development. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's Reply

    Publication Year: 1970, Page(s): 560
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (73 KB)

    As R. Reeves points out, use of the SQUARE module can simplify realizations and save on the more expensive TIMES module. (However, the TIMES module requires only 2n inputs, not 7n.) Indeed, my final paragraph in Section VI mentions assignments by Edwards for which the SQUARE module (as well as the FOURTH POWER module, EIGHTH POWER module, etc.) require no logic gates whatsoever. Their usefulness a... View full abstract»

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

    Publication Year: 1970, Page(s):561 - 562
    Request permission for commercial reuse | PDF file iconPDF (2585 KB)
    Freely Available from IEEE
  • R70-9 A Graph-Theoretic Model for Periodic Discrete Structures

    Publication Year: 1970, Page(s): 563
    Request permission for commercial reuse | PDF file iconPDF (232 KB)
    Freely Available from IEEE
  • R70-10 The Minimalization of Tree Automata

    Publication Year: 1970, Page(s): 563
    Request permission for commercial reuse | PDF file iconPDF (232 KB)
    Freely Available from IEEE
  • R70-11 Representation of Events in the von Neumann Cellular Model

    Publication Year: 1970, Page(s):563 - 564
    Request permission for commercial reuse | PDF file iconPDF (512 KB)
    Freely Available from IEEE
  • R70-12 Diagnosis of Single-Gate Failures in Combinational Circuits

    Publication Year: 1970, Page(s):564 - 565
    Request permission for commercial reuse | PDF file iconPDF (544 KB)
    Freely Available from IEEE
  • R70-13 Multigate Synthesis of General Boolean Functions by Threshold Logic Elements

    Publication Year: 1970, Page(s): 565
    Request permission for commercial reuse | PDF file iconPDF (264 KB)
    Freely Available from IEEE
  • R70-14 Some Results on Cascade Decomposition of Automata

    Publication Year: 1970, Page(s): 565
    Request permission for commercial reuse | PDF file iconPDF (264 KB)
    Freely Available from IEEE
  • R70-15 Realization of Sequential Machines with Threshold Elements

    Publication Year: 1970, Page(s):565 - 566
    Request permission for commercial reuse | PDF file iconPDF (416 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