By Topic

IEEE Transactions on Computers

Issue 11 • Nov. 1970

Filter Results

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

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

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (182 KB)
    Freely Available from IEEE
  • Scroll Editing: An On-Line Algorithm for Manipulating Long Character Strings

    Publication Year: 1970, Page(s):1009 - 1015
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2688 KB)

    An algorithm that runs on a 2048-word LINC provides efficient on-line editing of character strings virtually unlimited in length. Fixed-address LINC tape holds the character sequence in the manner of a scroll. Edited characters are spliced directly in or out of the scroll as it moves across a display scope under the viewer's control. A 512-character "playground" created at the splice point provide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Pipeline Fast Fourier Transform

    Publication Year: 1970, Page(s):1015 - 1019
    Cited by:  Papers (50)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2336 KB)

    This paper describes a novel structure for a hardwired fast Fourier transform (FFT) signal processor that promises to permit digital spectrum analysis to achieve throughput rates consistent with extremely wide-band radars. The technique is based on the use of serial storage for data and intermediate results and multiple arithmetic units each of which carries out a sparse Fourier transform. Details... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient MSI Partitioning for a Digital Computer

    Publication Year: 1970, Page(s):1020 - 1028
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5400 KB)

    An efficient partitioning scheme based on current capability of MOS MSI technology was evolved in which four functional building blocks were defined for implementing computer digital architecture. The partitioning employs a bit slice concept to define registers and a universal logic gate for general two-or three-variable logic. A look-ahead carry for fast arithmetic and a heavily buffered OR gate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Decomposition of the States of a Linear Feedback Shift Register Into Cycles of Equal Length

    Publication Year: 1970, Page(s):1029 - 1035
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (992 KB)

    This paper presents a derivation of a linear feedback function for an r-stage feedback shift register that results in branchless less cycles of equal length. The linear recurrence relationship and generating function, which characterize the r-stage feedback shift register's behavior, are used to prove that each of the 2r states lie in cycles of equal length. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding Techniques for Failure- Tolerant Counters

    Publication Year: 1970, Page(s):1035 - 1038
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    This paper delineates an application of two classes of parity-check codes to the design for failure-tolerant counters. They are 1) a modified first-order Reed-Muller code and 2) the perfect Hamming code. The first code employs a majority element for implementing the error-correcting scheme while the second one makes use of a variable 2j-2+1-out-of-2j-1+1 majority element. These coding techniques c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functional Partitioning and Simulation of Digital Circuits

    Publication Year: 1970, Page(s):1038 - 1046
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1560 KB)

    In this paper we present a method for obtaining a functional partitioning of the logic of a computer. It is shown that given a basic function to be performed, such as addition, the computer logic can be partitioned into four disjoint sets, namely the active information logic I, the semiactive flip-flops l, the activated control logic c, and the dormant logic D. Techniques involved in implementing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Apparent Continuity of Processing in a Paging Environment

    Publication Year: 1970, Page(s):1047 - 1054
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1392 KB)

    The page-faulting rate is one of the important criteria measuring the performance of a virtual storage under demand paging. In a multiprogrammed and/or time-sharing environment, a job is not expected to be run from the beginning to the end without interruption. In effect, it is segmented into phases and run piecewise. When running in this "segmented mode," a job phase upon initiation will most lik... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Asymptotic Improvement in the Out- come of Supervised Learning Provided by Additional Nonsupervised Learning

    Publication Year: 1970, Page(s):1055 - 1063
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1688 KB)

    This paper treats an aspect of the learning or estimation phase of statistical pattern recognition (and adaptive statistical decision making in general). Simple mathematical expressions are derived for the improvement in supervised learning provided by additional nonsupervised learning when the number of learning samples is large so that asymptotic approximations are appropriate. The paper consist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analysis Model for Digital System Diagnosis

    Publication Year: 1970, Page(s):1063 - 1073
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2256 KB)

    A model for the representation of diagnostic test-fault relationships is presented which provides increased flexibility over previous models and is adaptable to handling large-scale integrated systems. Several forms of the model are given and methods for transforming from one form to another are presented. Procedures are given for assessing the diagnostic capability of the test set and theorems ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Single-Channel and Multichannel Finite-State Machines

    Publication Year: 1970, Page(s):1073 - 1078
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    This paper is concerned with the transformation of a single-channel (series-operated) finite-state machine into a multichannel (parallel-operated) machine, and conversely. It is shown that every single-channel machine has a multichannel analog with the same number of states. A multichannel machine has a single-channel analog if and only if a so-called "prefix condition" is satisfied. Algorithms ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential Machines Capable of Fault Diagnosis

    Publication Year: 1970, Page(s):1079 - 1085
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB)

    By a checking sequence for a sequential machine, we mean an input-output sequence with a special property such that, when the input sequence is applied to the machine, the decision whether or not the machine operates correctly can be made by comparing the output sequence with the output of the machine. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of a Macro Processor in Logical Design

    Publication Year: 1970, Page(s):1085 - 1089
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB)

    This note describes a technique of logical design using a standard machine-language assembler as the basic tool. An analogy is drawn between the assembly of logic modules by an engineer and the compiling of instructions by a programmer. This analogy can be used to enable an assembler to generate directly, a wiring list, as well as computing such design parameters as the cost, and the power and spa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Synthesis of Multivalued Cellular Cascades

    Publication Year: 1970, Page(s):1089 - 1090
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    This note discusses multivalued cellular cascades, i.e., one-dimensional arrays of multivalued two-input, one-output combinational cells. It is shown that a large class of multivalued combinational switching functions can be realized by such a cascade. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CINTEL—Computer Interface for Television

    Publication Year: 1970, Page(s):1091 - 1095
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3504 KB)

    A television camera represents a standardized sensing system for electronically scanning moving images. There are requirements for converting all or part of the television image into digital form, and there are distinct advantages resulting from the on-line capability. To achieve the high speed conversion and to optimize the tradeoff of all the variables involved, a special computer interface for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use of Contextual Constraints in Recognition of Contour-Traced Handprinted Characters

    Publication Year: 1970, Page(s):1096 - 1099
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    A contour-tracing technique described in an earlier paper [9] was used along with monogram, bigram, and trigram contextual constraints to recognize handprinted characters. Error probabilities decreased by factors ranging from two to four over those which resulted when contextual constraints were ignored. A simple technique for searching over only the most probable bigrams and trigrams was used to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Experience on Partitioned List Algorithms

    Publication Year: 1970, Page(s):1099 - 1105
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1448 KB)

    The main characteristics of some programs implementing a number of different versions of partitioned list algorithms are described, and the results of a systematic plan of experiments performed on these programs are reported. These programs concern the determination of all the prime implicants, a prime implicant covering, or an irredundant normal form of a Boolean function. The experiments perform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Multiple Sequential Machines Having Different Inputs

    Publication Year: 1970, Page(s):1105 - 1108
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    This note deals with the multiple realization of synchronous sequential machines for which the initial states are given. The results given by Smith and Kohavi, who have studied the problem for machines fed by the same input, are generalized to the case of machines having the same clock but different inputs. For these machines, a maximum common factor is defined, and it is shown how, if it exists, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Rule for Reducing CC Tables

    Publication Year: 1970, Page(s):1108 - 1111
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Building on the work of Grasselli and Luccio, a new rule for reducing closure-covering (CC) tables is given and proved. Experience with the use of this new rule on actual problems with computer programs is reported. As an example of the size of problem, one 22-state four-input flow table with 261 prime compatibles and a resulting matrix for the linear integer programming problem of 504 rows and 26... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Minimization of READ-ONLY Memories in Microprogrammed Digital Computers

    Publication Year: 1970, Page(s):1111 - 1114
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    An algorithm for minimizing the bit dimension of READ- ONLY memories employed in the control section of microprogrammed digital computers is illustrated. The algorithm employs techniques which are well known in switching theory, such as compatibility classes and covering tables of the prime implicant type. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Simulation of a Multicomputer System

    Publication Year: 1970, Page(s):1114 - 1118
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2344 KB)

    Some data obtained from the simulation of a multicomputer system are described and compared with results from a semiempirical analysis of the system. The analysis indicates the dependence of system efficiency on the method of scheduling a job and on the job characterization parameters. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RST Flip-Flop Input Equations

    Publication Year: 1970, Page(s):1118 - 1120
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4096 KB)

    In view of the recent communication by Marcus [1], the rules for generation of various combinations of input equations for the RST flip- flop [2] can be modified as in Table 1. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abstracts of Current Computer Literature

    Publication Year: 1970, Page(s):1121 - 1138
    Request permission for commercial reuse | PDF file iconPDF (4884 KB)
    Freely Available from IEEE
  • Blank Page

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