Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 5 • May 1973

Filter Results

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

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

    Publication Year: 1973, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (220 KB)
    Freely Available from IEEE
  • Fast Hardware Fourier Transformation Through Counting

    Publication Year: 1973, Page(s):433 - 441
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1512 KB)

    Hardware Fourier transformations are considered with the goal of increasing speed through parallel operation. Two designs in which the basic element is a fast counter are developed. One is applicable when the number of transformed points N is prime while the other, requiring somewhat more hardware, is applicable to all N. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying Probability Measures to Abstract Languages

    Publication Year: 1973, Page(s):442 - 450
    Cited by:  Papers (68)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2656 KB)

    The problem of assigning a probability to each word of a language is considered. Two methods are discussed. One method assigns a probability to a word on the basis of particular measurable features of the language. The second method is applied to languages L(G) generated by a grammar G. A probability is associated with each production of G. These in turn define the word probabilities of each word ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Symmetric Functions with Redundant Variables–Weighted Functions

    Publication Year: 1973, Page(s):450 - 458
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4016 KB)

    Any switching function may be transformed into a completely symmetric switching function with some of its variables repetitive. In this paper we shall discuss certain properties, easily detectable in decomposition charts, that may be applied to reduce the number of repeated variables when such a transformation is performed. An algorithm utilizing lookup tables based on these properties has been de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some New Results on Average Worst Case Carry

    Publication Year: 1973, Page(s):459 - 463
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1856 KB)

    The previous bound on average worst case carry in a two's complement adder found by Burks et al. [1] is tightened, a bound is established for one's complement adders, and exact expressions for average worst case carry are derived and "experimentally" tested. It is found that an n-bit ripple-carry two's complement adder with carry-completion detection is potentially as fast, on the average, as the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a Graphic Generator for Remote Terminal Application

    Publication Year: 1973, Page(s):464 - 468
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2048 KB)

    The design of a graphic display system for remote terminal application is presented. Control data requirements are reduced by generating a useful set of graphic primitives locally at the remote terminals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of an Information System Model with Transfer Penalties

    Publication Year: 1973, Page(s):469 - 480
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3264 KB)

    A general model of systems consisting of "control units" and "passive units" is established. These units could be instructions and data in computer programs, for example, or information processing modules and files in data management systems; other applications are also suggested. The model contains both structural and behavioral information. The sets of units of the model are partitioned, and the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Anticipatory Control of a Cyclically Permutable Memory

    Publication Year: 1973, Page(s):481 - 488
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2400 KB)

    A control method based on anticipatory shift with lookahead is proposed for accessing files stored in a cyclically permutable memory as characterized by, for example, bubble-domain devices. The performance of this method is analyzed and is shown to yield significant reduction of access time. By using a basic simple model, an explicit formula is obtained for relating performance to the size of requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design of a Microprogrammed Self-Checking Processor of an Electronic Switching System

    Publication Year: 1973, Page(s):489 - 500
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4512 KB)

    This paper describes the internal workings of a low-cost microprogrammed processor designed to control electronic switching systems. The machine is structurally regular to ease maintenance difficulties and allow more efficient packaging. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintenance Techniques of a Microprogrammed Self-Checking Control Complex of an Electronic Switching System

    Publication Year: 1973, Page(s):501 - 512
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3744 KB)

    This paper describes the various fault detection, routine exercise, and diagnostic techniques used in the design of a switching complex. Unlike other electronic switching system (ESS) processors, the processor is entirely self-checking. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Diagnosable FET Networks

    Publication Year: 1973, Page(s):513 - 516
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1960 KB)

    With the advent of field-effect transistor (FET) technology it has become practical and economical to employ complex functions as network primitives. This paper describes a synthesis procedure for diagnosable (all single and multiple faults can be detected) FET networks. A companion procedure for generating tests to detect all faults in the resulting network is also described. This methodology doe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Programming for the Partitioning of Numerical Simulations with Hybrid Computer Applications

    Publication Year: 1973, Page(s):516 - 523
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3920 KB)

    The principle of dynamic programming is used to develop a digital computer software package for determining for each of several subsystems the optimal numerical integration algorithm from among given candidate techniques. As by-products, the corresponding optimal step sizes and error contributions of the subsystems are provided to the user. The developed program minimizes subsystem sum-squared err... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Multiple-Input Change Asynchronous Circuits Using Transition-Sensitive Flip-Flops

    Publication Year: 1973, Page(s):524 - 531
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2464 KB)

    Recently, a good deal of research has been conducted on the use of transition-or edge-sensitive elements in the design of asynchronous sequential circuits. Transition-sensitive memory elements have been used extensively in the implementation of synchronous sequential circuits as a means of eliminating the restrictions placed on pulsewidth. Several means are available for achieving multiple-input o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Parallel Evaluation of Arithmetic Expressions Without Division

    Publication Year: 1973, Page(s):532 - 534
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    As computers become capable of executing more arithmetic operations simultaneously, the question of compiling for such machines becomes more important. View full abstract»

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

    Publication Year: 1973, Page(s):534 - 537
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    Families of acceptors, called SS-AFA, are introduced in which the storage structure is of a very general form. For example, SS-AFA include ordinary AFA and all known multitape AFA, as well as families of acceptors whose storage structure is an n-dimensional array, a tree, or a linked structure. It is shown that from the point of view of languages defined, SS-AFA are equivalent to ordinary AFA. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How Big Should a Printed Circuit Board Be?

    Publication Year: 1973, Page(s):537 - 542
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2584 KB)

    This correspondence outlines a theory for choosing printed circuit board dimensions in order to avoid crowding of printed wiring. Given a number of components to be mounted on the board and the dimensions of wiring, the theory predicts a minimum board size that should be easy to lay out. The theory does not tell how many components should be put on a board. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Fast Computer Method for Matrix Transposing" and Application to the Solution of Poisson's Equation

    Publication Year: 1973, Page(s):542 - 543
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB)

    In the above correspondence,1an algorithm has been described that allows the transposing of a 2n× 2nmatrix by reading and writing n times at the most via direct access rows of the matrix and by permuting its data elements. The generalization to arbitrary square matrices has not been described, and the generalization to nonsquare matrices has been reported to b... 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: 1973, Page(s):543 - 544
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    Computer transposition of matrices larger than available main storage is a nontrivial problem. Undoubtedly, the solution to this problem, suggested by Schumann is tractable from a mathematical point of view. However, some comments relating to my correspondence1seem appropriate. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Twiddling Factors

    Publication Year: 1973, Page(s):544 - 545
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    Concepts of group theory are used to explain the difference between two major fast Fourier transform (FFT) algorithms and the relation between FFT and fast Walsh transforms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B73-9 Introduction to Computer Organization and Data Structures

    Publication Year: 1973, Page(s):545 - 546
    Request permission for commercial reuse | PDF file iconPDF (440 KB)
    Freely Available from IEEE
  • B73-10 Time Sharing Systems

    Publication Year: 1973, Page(s): 546
    Request permission for commercial reuse | PDF file iconPDF (296 KB)
    Freely Available from IEEE
  • B73-11 Digital Circuits and Devices

    Publication Year: 1973, Page(s):546 - 547
    Request permission for commercial reuse | PDF file iconPDF (456 KB)
    Freely Available from IEEE
  • B73-12 Fault Detection in Digital Circuits

    Publication Year: 1973, Page(s): 547
    Request permission for commercial reuse | PDF file iconPDF (184 KB)
    Freely Available from IEEE
  • IEEE Computer Society Membership & Publications

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