IEEE Transactions on Computers

Issue 5 • May 1976

Filter Results

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

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

    Publication Year: 1976, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (219 KB)
    Freely Available from IEEE
  • Autocorrelation Peaks in Congruential Pseudorandom Number Generators

    Publication Year: 1976, Page(s):457 - 460
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1901 KB)

    One of the desirable properties of a pseudorandom number generator is that the sequence of numbers it generates should have very low autocorrelation for all shifts except for zero shift and those that are multiples of its cycle length. Due to the simple methods of constructing random numbers via modulo arithmetic, the ideal is often not quite fulfilled. The results of this paper were obtained by t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Autocorrelation Structure of Tausworthe Pseudorandom, Number Generators

    Publication Year: 1976, Page(s):460 - 464
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3105 KB)

    Given that the autocorrelations for any repeating number sequence are known, this paper gives an algorithm for determining the autocorrelation structure of a new sequence obtained from the original sequence by proper decimation. Therefore, for certain random number generators, it is possible to choose a proper decimation which results in a long interval in which the autocorrelations are small for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rounding and Truncation in Radix (−2) Systems

    Publication Year: 1976, Page(s):464 - 469
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3223 KB)

    Examination of rounding and truncation errors in radix (−2) systems establishes the following facts: 1) truncation error is 33 percent lower than in the positive radix case. 2) There is no 1-bit rounding algorithm. 3) The error bound of the standard (1-bit) positive radix rounding algorithm can be approached asymptotically by using more than one of the discarded bits. For N bits, this error ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Microcomputer with a Shift-Register Memory

    Publication Year: 1976, Page(s):470 - 484
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4522 KB)

    A study of architecture for an 8-bit microprogrammed microcomputer (MPM) is presented in this paper. The control memory of this microcomputer is implemented as a dynamic shift-register memory (SRM). It is shown that the use of the SRM simplifies the processor circuits to such an extent that the entire CPU can be placed on a single LSI module. A new type of instruction (the tabled instruction) intr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Parallel Processable Tasks for a Uniprocessor

    Publication Year: 1976, Page(s):485 - 495
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3249 KB)

    Recent advances in multiprogramming have been concentrated on multiprocessor systems. But overlap in operations is also permissible in uniprocessor systems in which the processor instruction execution and input–output operations are handled by separate units. By maximizing the processor and input–output overlap, a program can be executed faster while the system utilization is highly im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network

    Publication Year: 1976, Page(s):496 - 503
    Cited by:  Papers (59)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1212 KB)

    The shuffle-exchange network is considered as an interconnection network between processors and memory modules in an array computer. Lawrie showed that this network can be used to perform some important permutations in log2 N steps. This work is extended and a network is proposed that permits the realization of any permutation in 0([mi][/mi]N) shuffle-exchange steps. Additional modifications to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Ladder-Structured Decision Tree for Recognizing Tumors in Chest Radiographs

    Publication Year: 1976, Page(s):503 - 513
    Cited by:  Papers (53)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8497 KB)

    We describe a hierarchic computer procedure for the detection of nodular tumors in a chest radiograph. The radiograph is scanned and consolidated into several resolutions which are enhanced and analyzed by a hierarchic tumor recognition process. The hierarchic structure of the tumor recognition process has the form of a ladder-like decision tree. The major steps in the decision tree are: 1) find t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to Organizing Microinstructions which Minimizes the Width of Control Store Words

    Publication Year: 1976, Page(s):514 - 521
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2760 KB)

    This paper suggests a new method for minimizing the width or bit dimension of control store words in microprogrammed digital computers. It is shown that any given problem can be formulated within the framework of linear programming and that there exists a lower limit CLB to the number of bits. The optimal grouping of subcommands which gives this minimal width is also readily obtainable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spline Fit Made Easy

    Publication Year: 1976, Page(s):522 - 527
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2065 KB)

    In this paper, a new algorithm for a cubic spline fit with equally spaced data points and given end conditions is described. It provides a new understanding of how a spline fit works and possesses the following computational advantages: 1) It can solve large size problems (virtually unlimited). 2) The accuracy can be realistically controlled based on the characteristics of data. 3) The computation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Square Roots and Functional Decompositions of Boolean Functions

    Publication Year: 1976, Page(s):528 - 532
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2175 KB)

    A square root of an isotone Boolean function f with respect to a variable xi was defined by Reischer and Simovici [10] as a Boolean function s such that holds identically. More generally, given a partition (T,Y,Z) of the set X = (x1,···,xn) of variables, we may be interested in finding a functional decomposition of the form View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance on a Hexagonal Grid

    Publication Year: 1976, Page(s):532 - 533
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1718 KB)

    A simple formula is derived for the distance between two points on a hexagonal grid, in terms of coordinates with respect to a pair of oblique axes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Fast Fourier Transform Programs for Arbitary Factors with One Step Loop Unscrambling

    Publication Year: 1976, Page(s):534 - 539
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (975 KB)

    This correspondence develops efficient fast Fourier transform (FFT) programs to transform arrays of dimension N, where N can be written as a power of two possibly multiplied by arbitrary factors. Two programs were developed which use radix-2 and radix-4 transformations for the binary factors. These programs call another subprogram to transform with respect to the arbitrary factors, if any. Since t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Readily Computable Decision Rule with Variable Dimensionality

    Publication Year: 1976, Page(s):539 - 542
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Optimal decision strategies such as Bayes and Neyman-Pearson require the computation of likelihood ratios that are difficult to compute in all but a few special cases. In practice, unfounded assumptions are frequently made about the nature of the pattern classes so that these strategies can be used. In this correspondence suboptimal decision strategies are explored that are attractive because they... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matrix Transformations for N-Tuple Analysis of Binary Patterns

    Publication Year: 1976, Page(s):542 - 546
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1044 KB)

    The frequency of occurrence of logic functions of binary N-tuples can be observed from sequences of binary patterns. The logic functions considered here are AND, NOR, NAND, OR, and an odd-even parity check; and the frequency parameters are expressed as real matrix transformations on the probabilities of the patterns. Some properties, inverses, and interrelationships among the parameter sets are gi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Atrubin's Real-Time Iterative Multiplier

    Publication Year: 1976, Page(s):546 - 548
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (562 KB)

    This correspondence presents a new multiplication algorithm for Atrubin's one-dimensional real-time iterative multiplier such that all the cells including the first cell in the array are identical in all respects, for the no-delay case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Parallel Evaluation of Boolean Expressions

    Publication Year: 1976, Page(s):548 - 549
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB)

    A Boolean expression wilth n literals, i.e., n distinct appearances of variables, can be evaluated by a parallel processing system in at most 1.81 log2n steps, or, equivalently, by a network constructed with two-input AND and OR gates and having at most 1.81 log2n levels. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Signed Modified Reflected Binary Code

    Publication Year: 1976, Page(s):549 - 552
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    A signed modified reflected binary (SMRB) code with unique representability of both positive and negative numbers has been proposed in this correspondence. The bit pattern in this code can be defined in a systematic way leading to a simple synchronous up/down counter. Some arithmetic operations for this code have also been considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Announcing the IEEE Computer Society's Standing Subscription Plan [advertisement]

    Publication Year: 1976, Page(s): 552
    Request permission for commercial reuse | PDF file iconPDF (116 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

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

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