By Topic

IEEE Transactions on Computers

Issue 7 • July 1968

Filter Results

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

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

    Publication Year: 1968, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (245 KB)
    Freely Available from IEEE
  • Horizons in Guidance Computer Component Technology

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

    Abstract—An extensive survey of logic and memory component manufacturers conducted by the NASA Electronic Research Center and the industry has resulted in estimates of the state-of-the-art of components available to designers of on-board guidance and control computers for long-term deep-space missions for the 1970-72 period. The vehicle for the survey were the mission requirements for the sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Visual Image Processor

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

    Abstract—A computer, the Visual Image Processor, is described which is designed to process visual images. Images are read by a vidicon camera and stored in any of three identical cathode-ray electrostatic storage tubes. Two storage systems are read simultaneously, with the reading beams spatially displaced from each other, and a signal which is a function of the reading signals is written in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Aided Memory Design Using Transmission Line Models

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

    Abstract—This paper describes a computer program for analyzing a class of transmission line configurations which arise in the design of memory arrays. The systems analyzed by the program consist of interconnected pairs of mutually coupled distributed parameter transmission lines driven and terminated by linear lumped element networks. A brief discussion of the mathematical model and its impl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convolutional Transformation and Recovery of Binary Sequences

    Publication Year: 1968, Page(s):649 - 655
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1401 KB)

    Abstract—This paper analyzes invertible length-preserving convolutional transformations of binary sequences, when the perfect inverse feedback transducer is replaced by a finite feedforward (i. e., convolutional) transducer which represents an approximation of the former. This replacement eliminates the error propagation effect, but the finiteness of the "inverse" transducer (decoder) result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable-Threshold Threshold Elements

    Publication Year: 1968, Page(s):656 - 667
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2402 KB)

    Abstract—Variable-threshold threshold elements (V-T threshold elements) are threshold elements in which the weights are fixed while the threshold may be varied. When the threshold is varied, a set of functions is generated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nets of Variable-Threshold Threshold Elements

    Publication Year: 1968, Page(s):667 - 676
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1978 KB)

    Abstract—A variable-threshold net is a network of variable-threshold threshold elements in which the threshold of all elements is a common variable parameter. Synthesis of such nets to realize a given set of functions not realizable by a single element is discussed. An application to realizing sequential machines is described. The problem of prevention of malfunction due to component drift i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing Errors with the Boolean Difference

    Publication Year: 1968, Page(s):676 - 683
    Cited by:  Papers (120)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1425 KB)

    Abstract—The Boolean difference is defined. It is shown through example how the Boolean difference is used to analyze the effect of errors on the outputs of logic circuits. Examples are given of error detection problems, analysis of redundant logic, and the generation of diagnostic sequences. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to Optimum Tolerance Adaptive Threshold Elements

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

    Abstract—A definition of the tolerance for the weights of adaptive threshold elements is given which is more relevant to the characteristics of real adaptive components. A learning procedure is then proposed, which employs a sequence of different and increasing values of dead zone. This procedure achieves the determination of the set of maximum tolerance weights and its soundness is shown by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path Finding with Associative Memory

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

    Abstract—This note discusses possible advantages to be gained through use of associative memory in finding the shortest path through a large graph having edges of unequal lengths. An algorithm is described which exploits associative memory's highly parallel search and arithmetic capabilities and which is economical in storage requirements. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Algorithm for Inner Product

    Publication Year: 1968, Page(s):693 - 694
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    Abstract—In this note we describe a new way of computing the inner product of two vectors. This method cuts down the number of multiplications required when we want to perform a large number of inner products on a smaller set of vectors. In particular, we obtain that the product of two n×n matrices can be performed using roughly n3/2 multiplications instead of the n3 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Variable Counter Design Technique

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

    Abstract—Two design techniques are presented which allow one counter circuit to divide a fixed-reference frequency by a wide range of counts. In the examples used the output frequency is preselected on three 10-position selector switches, providing for division of the input reference frequency by N, where 1≤N≤999. The techniques described are not dependent on the type of digital ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Characterizing Parameters of a Threshold Function

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

    Abstract—A switching function A is viewed as a subset of vertices of the unit n-cube. The power parameter of A is the number of vertices comprising A and the characterizing vector is the vector sum of the vertices of A. It is shown that the characterizing vector (without the power parameter) uniquely determines a threshold function within parity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines

    Publication Year: 1968, Page(s):697 - 699
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Abstract—A "synthesis technique" is presented for "realizing" any arbitrary binary input-binary output "synchronous sequential Moore machine" in the form of a network composed of identical 2-state "component machines." With slight modification the synthesis technique presented can be used to realize any given n-input-p-output synchronous sequential Moore machine in the form of a network comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Complete Axiom Systems for the Extended Language of Regular Expressions

    Publication Year: 1968, Page(s):700 - 701
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    Abstract—Two consistent and complete formal systems for the algebraic transformation of regular expressions involving intersections and complements are given. Both systems are extensions of the system F1presented in Salomaa [5]. As a result, a method of eliminating intersections and complements from regular expressions is obtained. This solves a problem proposed by Eggan. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "RST Flip-Flop Input Equations"

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

    In a recent paper Graham and Distler1have shown how all the possible combinations of the input equations of an RST flip-flop can be displayed simultaneously on the Karnaugh maps. This claim is valid only if a1, a2on the R map and a3, a4on the S map are replaced by ai, and each aican be chosen independently of the others. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Basic Properties and a Construction Method for Fail-Safe Logical Systems"

    Publication Year: 1968, Page(s): 702
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    The paper by Mine and Kogal appears to have some unstated assumptions and inconsistencies which affect the validity of their claim to have presented "an effective method of logical design for fail-safe systems." View full abstract»

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

    Publication Year: 1968, Page(s): 702
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    In Theorem 3, it is clearly stated that the fail-safe output of a basic function is severely restricted by the failed output of the preceding basic functions (though two Iff's in the statement of Theorem 3 should be If's). It is obvious, as a matter of course, that a single failure of an element in a logical circuit may cause different effects on its following logical functions. It should be noted... View full abstract»

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

    Publication Year: 1968, Page(s):703 - 704
    Request permission for commercial reuse | PDF file iconPDF (2766 KB)
    Freely Available from IEEE
  • Abstracts of Current Computer Literature

    Publication Year: 1968, Page(s):705 - 717
    Request permission for commercial reuse | PDF file iconPDF (3539 KB)
    Freely Available from IEEE
  • R68-32 The IADIC: A Hybrid Computing Element

    Publication Year: 1968, Page(s): 718
    Request permission for commercial reuse | PDF file iconPDF (328 KB)
    Freely Available from IEEE
  • R68-33 PHENO: A New Concept of Hybrid Computing Elements

    Publication Year: 1968, Page(s):718 - 719
    Request permission for commercial reuse | PDF file iconPDF (592 KB)
    Freely Available from IEEE
  • R68-34 Hybrid Apollo Docking Simulation

    Publication Year: 1968, Page(s): 719
    Request permission for commercial reuse | PDF file iconPDF (288 KB)
    Freely Available from IEEE
  • R68-35 Optimal Generation of Arbitrary Functions

    Publication Year: 1968, Page(s):719 - 720
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (408 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