IEEE Transactions on Computers

Issue 7 • July 1978

Filter Results

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

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

    Publication Year: 1978, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • Announcement

    Publication Year: 1978, Page(s): 585
    Request permission for commercial reuse | PDF file iconPDF (1288 KB)
    Freely Available from IEEE
  • The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution

    Publication Year: 1978, Page(s):586 - 593
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2584 KB)

    Necessary and sufficient conditions for a direct sum of local rings to support a generalized discrete Fourier transform are derived. In particular, these conditions can be applied to any finite ring. The function O(N) defined by Agarwal and Burrus for transforms over ZN is extended to any finite ring R as O(R) and it is shown that R supports a length m discrete Fourier transform if and only if m i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals

    Publication Year: 1978, Page(s):594 - 604
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2994 KB)

    In this paper we consider the optimization of teleprocessing (TP) networks with concentrators. Each terminal may in general have multiple connections to several concentrators. The first part of the paper is concerned with the optimal assignment of terminals to a given set of concentrators. A sequential assignment algorithm is presented with its efficiency and optimality established. The second par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-Correcting Parsers for Formal Languages

    Publication Year: 1978, Page(s):605 - 616
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2741 KB)

    This paper describes error-correcting parsers for context-free and context-sensitive languages with substitution, insertion and deletion errors. Furthermore, it is shown that the ability of the proposed parsers can be expressed in terms of the weighted Levenshtein metric. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Testing of Control Units

    Publication Year: 1978, Page(s):617 - 623
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2196 KB)

    The goal of the paper is to propose test methods for wired or microprogrammed control units without special test facilities: no special access path, i.e., no direct and exhaustive observation means. Consequently, the control unit will be tested through the current control algorithms under "normal" sequencing facilities and through the controlled operative part; the proposed methodology consists of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sift-Out Modular Redundancy

    Publication Year: 1978, Page(s):624 - 627
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1961 KB)

    A fault-tolerance technique for digital systems, Sift-Out Modular Redundancy, is proposed and designed. An appropriate number of identical channels are provided for each module. The number of channels depend upon the particular application, and all channels are active as long as they are fault-free. Upon the failure of a channel, its contribution to the module output ceases. The configuration tole... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Heuristics in a Multiprogramming Environment

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

    Utilization of a uniprocessor system in a multiprogramming environment can be optimized by maximizing the overlap of processor and input-output operations. A computational process can be modeled by a directed graph each node of which represents a task comprising processor and input-output segments. Any optimal schedulng algorithm for the model cannot be polynomially bounded, but the optimal criter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations

    Publication Year: 1978, Page(s):637 - 647
    Cited by:  Papers (94)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3989 KB)

    The Benes binary network can realize any one-to-one mapping of its 2ninlets onto its 2noutlets. Several authors have proposed algorithms which compute control patterns for this network from any bijection assignment. However, these algorithms are both time-consuming and space-consuming. In order to meet the time constraints arising from the use of a Benes network as the alignm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning Algorithms for Nonparametric Solution to the Minimum Error Classification Problem

    Publication Year: 1978, Page(s):648 - 659
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2784 KB)

    This paper discusses the two class classification problem using discriminant function solution that minimizes the probability of classification error. Learning algorithms using window function techniques are presented. The convergence rates are estimated and a particular strategy is proposed. Within this strategy it is recommended to use a triangular window function. The proposed algorithms are te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Phase-Shift Analysis of Linear Feedback Shift Register Structures Generating Pseudorandom Sequences

    Publication Year: 1978, Page(s):660 - 669
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4056 KB)

    We propose a systematic way for analyzing split-up feedback shift register structures which generate parallel p-n sequences. The analysis aims towards determining the relative phase shifts among the various realizations of the same p-n sequence. The main design criterion is derived when such systems are used as pseudorandom number generators. The results of this analysis are incorporated in the pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Parallel-Sorting Schemes

    Publication Year: 1978, Page(s):669 - 673
    Cited by:  Papers (80)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3256 KB)

    In this paper, we describe a family of parallel-sorting algorithms for a multiprocessor system. These algorithms are enumeration sortings and comprise the following phases: 1) count acquisition: the keys are subdivided into subsets and for each key we determine the number of smaller keys (count) in every subset; 2) rank determination: the rank of a key is the sum of the previously obtained counts;... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-Tolerant Asynchronous Networks Using Read-Only Memories

    Publication Year: 1978, Page(s):674 - 679
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    In this paper, we present techniques for the construction of certain redundant state assignments suitable for fault-tolerant asynchronous network design. These assignments have certain characteristics that make them well-suited for error-control in asynchronous networks, using read-only memories, and are as follows: only a small number of additional state variables are required for incorporating f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions On Software Engineering

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

    Publication Year: 1978, Page(s): 679
    Request permission for commercial reuse | PDF file iconPDF (137 KB)
    Freely Available from IEEE
  • Advance Program Announcement

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