By Topic

IEEE Transactions on Computers

Issue 5 • Date May 1974

Filter Results

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

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

    Publication Year: 1974, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (198 KB)
    Freely Available from IEEE
  • A Class of Push-Down Acceptors for Adjunct Languages

    Publication Year: 1974, Page(s):449 - 455
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2480 KB)

    The local adjunct languages (LAL's) and grammars have been defined so as to characterize many aspects of natural and programming languages. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Computer Algorithm for the Synthesis of Memoryless Logic Circuits

    Publication Year: 1974, Page(s):455 - 465
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3896 KB)

    A method has been investigated for the synthesis of memoryless logical networks using a restricted repertoire of functional modules. The method is based on the reduced general solution to a generalized system of Boolean equations (BE) as applied to the decomposition of Boolean functions. The aim of the synthesis is to obtain the most constrained circuit having at most two levels of gating. The con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for High-Speed Digital Filters

    Publication Year: 1974, Page(s):466 - 469
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1712 KB)

    This paper describes an algorithm that is suitable for fast implementations of nonrecursive and recursive digital filters. High speed is realized at the expense of memory; however, the memory-speed tradeoff is flexible so that many hardware and software implementations are practical. When memory is not limited, the time required to compute a filter output value is independent of the order of the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Restoration, Modelling, and Reduction of Dimensionality

    Publication Year: 1974, Page(s):470 - 476
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3232 KB)

    Recursive restoration of two-dimensional noisy images gives dimensionality problems leading to large storage and computation time requirements on a digital computer. This paper shows a two-dimensional second-order Markov process representation can be used for fast recursive restoration of images with small storage requirements. Advantages of this method over existing techniques are illustrated by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques for the Transformation of Logic Equations

    Publication Year: 1974, Page(s):477 - 480
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1760 KB)

    A generalized DeMorgan's theorem is presented that can be applied to Boolean equations with any number of complementations. The known form of the DeMorgan's theorem is a special case of the generalized theorem with one inversion. This new theorem simplifies and generalizes the transformation of Boolean functions to their equivalent sum of product forms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Contextual Postprocessing System for Error Correction Using Binary n-Grams

    Publication Year: 1974, Page(s):480 - 493
    Cited by:  Papers (21)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4960 KB)

    The effectiveness of various forms of contextual information in a postprocessing system for detection and correction of errors in words is examined. Various algorithms utilizing context are considered, from a dictionary algorithm which has available the maximum amount of information, to a set of contextual algorithms utilizing positional binary n-gram statistics. The latter information differs fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safe Asynchronous Sequential Circuits

    Publication Year: 1974, Page(s):494 - 500
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2368 KB)

    A logic designer may inadvertently select the design equations in such a way that stable states other than those of the flow table are formed. During malfunctions, it is possible for the circuit to assume a set of stable states that are not members of the original flow table, causing improper action. In some cases, it is impossible for the circuit to reassume the stable states of the flow table, c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Theory and Implementation of p-Multiple Sequential Machines

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

    This paper considers a state assignment which permits one to obtain two different realizations of a sequential machine (sm). First, as a result of this assignment we obtain a double shift-register realization of an sm by means of p pairs of shift-registers, each pair of registers having the same number of stages ai(i = 1,...,p). Such realizations are called multiple-variable-length-shif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linearity Testing and Realization of Sequential Machines

    Publication Year: 1974, Page(s):524 - 528
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1112 KB)

    The necessary and sufficient conditions for the linear realizability of a sequential machine are stated. The discussion considers the state transition and output functions separately and thus machines with nonlinear output function can also be tested for linearity of the state transition function. It then goes on to determine the characterizing matrices and corresponding secondary state assignment... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern Recognition by Convolution Polynomial

    Publication Year: 1974, Page(s):528 - 530
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Pattern recognition is considered as a mapping from the set of all inputs to the numbers 0 to 1. The inputs are treated as vectors. A topological group algebra over the vector space is described. The input is treated as avariable in a polynomial of that group algebra. A correspondence between inputs and numbers is established. This correspondence is used to prove that the polynomials in the algebr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of All Closed Partitions on the State Set of a Sequential Machine

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

    This correspondence provides theorems for the existence of a nontrivial closed parition on the state set of a sequential machine and offers an efficient and systematic method for generating all such partitions. The method is based on the concept of the implication or closure dependence relation among some subsets of the state set. View full abstract»

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

    Publication Year: 1974, Page(s):533 - 536
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    A generalized pipeline cellular array has been proposed which can perform all the basic operations such as multiplication, division, squaring, and square rooting. The different modes of operation are controlled by a single control line. An expression for time delay has been obtained. Further, it has been shown that these arithmetic operations can be overlapped in the pipe in any desired sequence, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Experimental Procedure for Handwritten Character Recognition

    Publication Year: 1974, Page(s):536 - 545
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5224 KB)

    Most of the work done so far on recognition of handwritten script uses curve tracing techniques. The present paper describes a recognition scheme which is independent of the dynamics of writing and is suitable both for on-line and off-line systems. New recognition criteria, namely, the distribution of intensity of marking along and perpendicular to the direction of writing are used. Methods for co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Binary Feature Extraction Technique

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

    Numerous schemes are available for feature selection in a pattern recognition problem, but the feature extraction process is largely intuitive. A sequential feature extraction scheme is proposed for binary features. A decision function, which is linear and near optimal, is developed concurrently with each feature. Performance bounds are developed for several design strategies. Experimental results... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary Noise Sources Incorporating Modulo-N Dividers

    Publication Year: 1974, Page(s):550 - 552
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    A clipped Gaussian binary noise source is approximated by a source of independent time intervals with arbitrary distribution. The effects of a divider on this source are examined and the resulting Laplace transforms solved for a particular spectrum and a modulo-2 divider. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Minimally Testable Logic Networks

    Publication Year: 1974, Page(s):552 - 554
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A new technique to modify any logic network to facilitate diagnosis is given. By providing extra controllable inputs (at most six) and observable outputs it is shown that any number of stuck-at-faults in a logic network can be detected by applying only three tests. This number is believed to be minimal for networks using current technologies. Example of logic module that can be used to realize any... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B 74-26 Discrete Mathematical Structures and Their Applications

    Publication Year: 1974, Page(s): 555
    Request permission for commercial reuse | PDF file iconPDF (232 KB)
    Freely Available from IEEE
  • B 74-27 Program Test Methods

    Publication Year: 1974, Page(s):555 - 556
    Request permission for commercial reuse | PDF file iconPDF (512 KB)
    Freely Available from IEEE
  • B 74-28 Computer Hardware and Software: An Interdisciplinary Introduction

    Publication Year: 1974, Page(s): 556
    Request permission for commercial reuse | PDF file iconPDF (304 KB)
    Freely Available from IEEE
  • B 74-29 Currents in the Theory of Computing

    Publication Year: 1974, Page(s):556 - 557
    Request permission for commercial reuse | PDF file iconPDF (592 KB)
    Freely Available from IEEE
  • B 74-30 Foundation of the Theory of Learning Systems

    Publication Year: 1974, Page(s): 557
    Request permission for commercial reuse | PDF file iconPDF (312 KB)
    Freely Available from IEEE
  • B 74-31 Signals, Systems, and the Computer

    Publication Year: 1974, Page(s):557 - 558
    Request permission for commercial reuse | PDF file iconPDF (624 KB)
    Freely Available from IEEE
  • B 74-32 Digital Design

    Publication Year: 1974, Page(s):558 - 559
    Request permission for commercial reuse | PDF file iconPDF (616 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