By Topic

IEEE Transactions on Electronic Computers

Issue 5 • Date Oct. 1967

Filter Results

Displaying Results 1 - 25 of 47
  • [Front cover]

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

    Publication Year: 1967, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (166 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1967, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (166 KB)
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1967, Page(s): 549
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • Foreword to Special Issue on Aerospace Computers

    Publication Year: 1967, Page(s): 550
    Request permission for commercial reuse | PDF file iconPDF (982 KB)
    Freely Available from IEEE
  • Design Considerations for a Parallel Bit-Organized MOS Memory

    Publication Year: 1967, Page(s):551 - 557
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1052 KB)

    This paper discusses the design trade-offs for a parallel bit-organized MOS memory. A memory capacity of 40K bits can be achieved using LSI techniques. Memory storage capacity is expandable in both word length and number of words stored. The physical dimensions of the memory should be considerably smaller than those of a comparable core design. Power consumption per bit should likewise be less tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of Large Scale Integration on Aerospace Computers

    Publication Year: 1967, Page(s):558 - 561
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (875 KB)

    The continued development of Large Scale Integration (LSI) presages the advent of a fourth generation of computers, and is causing an upheaval at all levels of computer technology¿both technical and managerial. Today's computers use integrated circuit components containing at most ten gates per component; however, LSI is introducing hundreds of gates per component and will eventually evolve into ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Utilization of Large-Scale Integration

    Publication Year: 1967, Page(s):562 - 566
    Cited by:  Papers (15)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (973 KB)

    A new approach to a computer organization promises very effective utilization of the LSI technology. Functional partitioning of both the data path and control is employed. A dramatic reduction in array pin requirements by a factor of two or more is achieved. Arrays as small as a few dozen gates can be effectively utilized. The total system is exceedingly flexible in both performance and instructio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic Circuits

    Publication Year: 1967, Page(s):567 - 580
    Cited by:  Papers (206)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2712 KB)

    Two algorithms are presented: one, DALG-II, computes a test to detect a failure in acyclic logic circuits; the other, TEST-DETECT, ascertains all failures detected by a given test. Both are based upon the utilization of a ``calculus of D-cubes'' that provides the means for effectively performing the necessary computations for very large logic circuits. Strategies for combining the two algorithms i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Checkout Systems for Titan III and Apollo Guidance Computer Programs

    Publication Year: 1967, Page(s):580 - 590
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2056 KB)

    The Automatic Checkout Systems (ACS) were designed and used for the Titan III and Apollo Projects. This article describes the logical design of new approaches to program checkout and the results achieved. These checkout systems are a series of programs written for a large scale commercial computer. When a program for the airborne computer of the inertial guidance system is operated on by the ACS, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundant System Test Point Allocation and Mission Reliability Estimation Procedures

    Publication Year: 1967, Page(s):591 - 596
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1066 KB)

    The steadily increasing complexity of spaceborne digital systems tends to lower the reliability of these systems that operate in an environment where the cost of failure is extremely high. The reliability of digital systems can be increased by redundancy techniques. The majority of work in redundancy has concentrated on the development of synthesis techniques and initial reliability estimation pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability Aspects of the Variable Instruction Computer

    Publication Year: 1967, Page(s):596 - 602
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (955 KB)

    This paper is intended to show how the unique features of the Variable Instruction Computer (VIC) make it valuable for applications requiring high reliability. By careful choice of components, use of error-checking circuits, and selected application of redundant hardware, the basic unextended reliability of the VIC is comparable with the state-of-the-art. This is verified by a standard MIL-HDBK-21... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Monte Carlo Solution of Partial Differential Equations Using a Hybrid Computer

    Publication Year: 1967, Page(s):603 - 610
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1346 KB)

    The analog-hybrid computer Monte Carlo technique for solving elliptic and parabolic partial differential equations has been implemented on a new hybrid computer capable of taking statistics over 1000 two-or three-dimensional random walks per second. This exceptional computing speed and flexible digital control permit direct plotting of partial differential equation solutions; of perhaps even great... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms

    Publication Year: 1967, Page(s):611 - 620
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1495 KB)

    The structure of the algorithms implementing Quine's method for prime implicant determination is analyzed, and a new class of algorithms¿partitioned list algorithms¿for Quine's method is derived. Such algorithms are of particular interest for actual computation because they permit 1) avoiding repetitions while generating clauses, 2) representing each clause by only one binary configuration, 3) r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Correspondence Between Equivalence Classes of Switching Functions and Group Codes

    Publication Year: 1967, Page(s):621 - 624
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (809 KB)

    The correspondence defined below was used to convert Slepian's tabulation of the number of equivalence classes of (m, r) group codes[1] into hitherto unpublished data of relevance to switching theory. Specifically, Table II lists the number of equivalence classes of switching functions of weight m≪ 20 or m≫ 2n-20 in nine or fewer arguments under the group of lin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symmetric Ternary Switching Functions: Their Detection and Realization with Threshold Logic

    Publication Year: 1967, Page(s):624 - 637
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2233 KB)

    A simple, systematic procedure for detecting symmetric ternary switching functions is developed. The detection procedure is essentially based on a derived counting theorem. Other important properties and close bounds on the number of ternary symmetric functions are developed. A design method is given whereby symmetric functions can be readily synthesized with switching networks which are economica... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Synthesis of Signal Switching Networks with Transient Blocking

    Publication Year: 1967, Page(s):637 - 641
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (981 KB)

    Signal switching networks with transient blocking are defined. The number of 2×2 crossbars necessary to synthesize a signal switching network with transient blocking capable of performing all one-to-one connections of N inputs to N outputs is shown to be at least N log2N-N log2 e+(¿) log2 N + log2 2 + 0(1) as N¿ ¿. It is shown that this lower bound c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Plated Wire Content-Addressable Memories with Bit-Steering Technique

    Publication Year: 1967, Page(s):642 - 652
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4903 KB)

    This report describes a new concept of content-addressable memory (CAM) implemented with plated wires and the bit-steering technique. The 5-mil plated wires are insulated with a thin (0.2 to 0.3 mil) coat of polyurethane, and imbedded in a copper plane. A memory array is formed by means of a simple orthogonal arrangement of plated wires and an overlay of copper straps. Because of the low loop impe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Microprogrammed Control in Problem-Oriented Languages

    Publication Year: 1967, Page(s):652 - 658
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1287 KB)

    The application of microprogramming to problem-oriented languages is described in terms of a simulated analog system on a digital computer. Microprogramming facilitates the development of a problem-oriented machine code, which can be simply generated from the problem-oriented source language by simple translation. In the system described a problem defined by differential equations is drawn up in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Memory Allocation for Multiprocessors

    Publication Year: 1967, Page(s):659 - 665
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1209 KB)

    In multiprocessor systems it is desirable to look for and allocate storage without extensive data moving. Two techniques for accomplishing this, associative memory techniques and indirect addressing techniques, are described. It is concluded that the two methods are similar in performance, but that indirect addressing is more economical. An indirect addressing method is described in detail and var... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Computer Solution of Optimal Control Problems by the Maximum Principle

    Publication Year: 1967, Page(s):666 - 670
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (995 KB)

    When the maximum principle is applied to optimal control problems, a two-point boundary value problem must by necessity be solved. This paper discusses a solution method for general problems in which the initial and terminal states of the system are given, but in which the time of arrival at the terminal state is unknown. Various difficulties accompanying the conventional methods used in the past ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graphs of Linear Forms on Modules over Boolean Rings

    Publication Year: 1967, Page(s):670 - 671
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (395 KB)

    This note considers the graphs of linear and affine transformations on modules over Boolean rings. It will be shown that such graphs are similar to those of linear forms on vector spaces over finite fields. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Minimal Modulo 2 Sums of Products for Switching Functions

    Publication Year: 1967, Page(s):671 - 674
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (574 KB)

    The minimal number of terms required for representing any switching function as a modulo 2 sums of products is investigated, and an algorithm for obtaining economical realization is described. The main result is the following: every symmetric function of 2m+1 variables has a modulo 2 sum of products realization with at most 3m terms; but there are functions of n variables which require ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Finding a Minimal Set of Diagnostic Tests

    Publication Year: 1967, Page(s):674 - 675
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    A method is described for constructing a set of input patterns able to detect every given failure of a combinational network. The result may not be a minimal set of tests, but it is surely a complete test. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis of Large Combinational Networks

    Publication Year: 1967, Page(s):675 - 680
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (957 KB)

    A method is described for constructing a set of input patterns able to detect every given failure of a combinational network. The result may not be a minimal set of tests, but it is surely a complete test. The procedure is designed for large networks with high number of independent inputs. It can deal with networks including any elementary logical gates such as AND, OR, NAND, NOR, and NOT. No limi... View full abstract»

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

Aims & Scope

This Transactions ceased publication in 1967. The current retitled publication is 

IEEE Transactions on Computers.

Full Aims & Scope