By Topic

IEEE Transactions on Computers

Issue 7 • Date July 1979

Filter Results

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

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

    Publication Year: 1979, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (226 KB)
    Freely Available from IEEE
  • Finite Field Arithmetic on an Array Processor

    Publication Year: 1979, Page(s):461 - 471
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2915 KB)

    We develop algorithms for implementing finite field arithmetic on general signal processing machines. Our emphasis is on achieving practical approaches compatible with a wide range of computer systems. The techniques easily mix with normal signal processing algorithms obviating the need for appendages of special finite field hardware to information processing systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Minimal Binary Decision Trees

    Publication Year: 1979, Page(s):472 - 482
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2749 KB)

    The concept of binary decision trees is extended to include multiple output Boolean functions. A systematic and programmable method is then developed for the minimization of trees realizing multiple output incompletely specified functions. Further simplification of minimal trees can be achieved through state reduction methods to obtain subminimal decision algorithms. Possible physical realizations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decrypting a Stream Cipher Based on J–K Flip-Flops

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

    Pless has proposed a stream cipher based on J–K flip-flops that uses 8 linear shift registers with feedback, having a combined length of 97 bits, 4 J–K flip-flops, and a 4-stage cycling counter. The cipher has 2.54 × 1051initial states (keys), and generates a presumably pseudorandom stream whose period is 1.52 × 1029bits. Despite these impressive statist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform

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

    In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplisbed by performing the cyclic convolution, required by Winograd's method, with the Mersenne prime number-theoretic transform developed originally by Rader. This new algorithm requires fewer multiplications than either the standard fast ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Reliable Spaceborne Memory with a Single Error and Erasure Correction Scheme

    Publication Year: 1979, Page(s):493 - 500
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3883 KB)

    A program for the development of a highly reliable memory has been underway for a number ofyears at ESTEC. Plated wire and ferrite core spaceborne memories have been developed and qualified, and the more recent advent of low power LSI memory devices has made the semiconductor memory an attractive proposition for spaceborne applications. These technologies are briefly discussed and compared. Howeve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically Optimal Interconnection Networks from Two-State Cells

    Publication Year: 1979, Page(s):500 - 505
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3023 KB)

    Some special classes of interconnection networks for n terminals are considered, namely, partitioning networks and full switches. Constructions for them are presented. For the former, the resulting total count of (two-state) cels is n log2n + n − log2n − 1, and the maximum delay is 6 log2n − 4. For the latter, the cell count is (n/2)log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Fast Evaluation of Time Functions

    Publication Year: 1979, Page(s):506 - 513
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2028 KB)

    Linear ordinary differential equations with constant coefficients (LODECC's) represent the mathematical model of a class of dynamic systems. The solutions of LODECC, often used in digital simulation of continuous systems, belong to a class of functions with certain properties. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability Analysis of N-Modular Redundancy Systems with Intermittent and Permanent Faults

    Publication Year: 1979, Page(s):514 - 520
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2234 KB)

    It is well known that static redundancy techniques are very efficient against intermittent (transient) faults which constitute a large portion of logic faults in digital systems. However, very little theoretical work has been done in evaluating the reliability of modular redundancy systems which are subject to intermittent malfunction occurrences. In this paper we present a statistical model for i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees

    Publication Year: 1979, Page(s):521 - 528
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1135 KB)

    Recently, an algorithm has been developed for deriving optimal NAND array realizations of complete Boolean functions [1]. The algorithm has two defects. It often requires a cumbersomely large amount of computations and does not handle incomplete functions. The short-cut method presented here is free from those defects. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Area Shading Graphics Display System

    Publication Year: 1979, Page(s):528 - 531
    Cited by:  Papers (4)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (826 KB)

    A computer graphics display system for rapidly shading areas on a raster scan screen is described. With the system, the host computer provides the display controller with the parameters of a set of component trapezoids which cover the area to be shaded. The paper gives an algorithm for use in the host to decompose an arbitrary polygon into component trapezoids and it describes a microcomputer base... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines

    Publication Year: 1979, Page(s):531 - 535
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1034 KB)

    Two classes of incompletely specified sequential machine (ISSM) are described, which contain the class of input-restricted machines defined by McCluskey [1] and Unger [2] as special cases. These new classes of machine can be identified at the conclusion of a modified (and more efficient) version of the standard compatible pairs-table analysis of Paull and Unger [3]. For such machines only maximal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization of Reed–Muller Canonic Expansion

    Publication Year: 1979, Page(s):535 - 537
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (511 KB)

    It is shown that Swamy's [1] approach to generate generalized Reed–Muller canonic expansion is in error. A different algorithm is presented which uses a single Boolean matrix and successive modifications in function vector to generate all the solutions sequentially. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Design of Small-Diameter Networks by Local Search

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

    A local search algorithm for the design of small-diameter networks is presented for both directed and undirected regular graphs. In all cases the resulting graphs are at least as good as any previously known, in the sense that they have at least as small a diameter and average shortest distance for a given number of nodes and degrees. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Generalization of Consensus Theory and Application to the Minimization of Boolean Functions"

    Publication Year: 1979, Page(s):542 - 543
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    An algorithm for finding a minimal irredundant disjunctive form representation for an incompletely specified multiple-output switching function presented by P. Tison1is shown to be incorrect by counterexample and corrected. View full abstract»

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

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

    Publication Year: 1979, Page(s): 543
    Request permission for commercial reuse | PDF file iconPDF (155 KB)
    Freely Available from IEEE
  • Announcing... The IEEE Computer Society's Tutorial Week 79

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