Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 11 • Nov. 1977

Filter Results

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

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

    Publication Year: 1977, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (228 KB)
    Freely Available from IEEE
  • An Operator Factorization Method for Restoration of Blurred Images

    Publication Year: 1977, Page(s):1061 - 1071
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4292 KB)

    A problem of restoration of images blurred by space-invariant point-spread functions (SIPSF) is considered. The SIPSF operator is factorized as a sum of two matrices. The first term is a polynomial of a noncirculant operator P and the second term is a Hankel matrix which affects only the boundary observations. The image covariance matrix is also factorized into two terms; the covariance of the fir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Incremental Computer

    Publication Year: 1977, Page(s):1072 - 1081
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2800 KB)

    The article describes a variable high-speed incremental computer that adopts the basic concept underlying a digital differential analyzer (DDA). Its structure closely resembles that of a microprocessor and includes the following features: floating-point arithmetic, a word-length transfer with the elimination of a residue (R) register, multibit multiplication, and a flexible software scheme of inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Effect of Asynchronous Inputs on Sequential Network Reliability

    Publication Year: 1977, Page(s):1082 - 1090
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2947 KB)

    Synchronous sequential networks (SSN's) with high-frequency asynchronous inputs are subject to substantial failure rates due to the failure of input synchronizing networks. An apparent solution to this problem is to design asynchronous sequential networks (ASN's) to process the asynchronous inputs directly using the unrestricted input change technique of Unger. It is noted that this technique requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contextual Postprocessing System for Cooperation with a Multiple-Choice Character-Recognition System

    Publication Year: 1977, Page(s):1090 - 1101
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4719 KB)

    The paper describes the design and the optimization of a contextual postprocessing system (CPPS) operating in combination with a multiple-choice single-character recognition system (SCRS). The CPPS is part of the automatic postal-address reading machine for the Federal German Postal Service. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling Trees in Parallel/Pipelined Processing Environments

    Publication Year: 1977, Page(s):1101 - 1112
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4581 KB)

    Scheduling task trees to be executed in parallel and/or pipelined processing systems are examined under individual situations. Processor structural requirements at task nodes are also included in the model of consideration. While simple techniques can serve as heuristics, counterexamples are constructed in some crucial cases. Simple optimal algorithms are presented in two important cases: 1) unist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traversing Binary Tree Structures with Shift-Register Memories

    Publication Year: 1977, Page(s):1112 - 1122
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4474 KB)

    The paper proposes a tree-structured shift-register memory which employs two different data permutation operations to perform pre-/post-order traversals of binary tree structures. View full abstract»

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

    Publication Year: 1977, Page(s):1123 - 1132
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2508 KB)

    Due to the crossbar organization of typical multiprocessors, their cost grows as the square of the number of processors. The distributed pipeline (DP) is a concept which allows the construction and operation of very large multiprocessors; an example having 300 CPU's is described. The DP is an extension of the more traditional pipeline which has been used to implement highly concurrent computers. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encryption Schemes for Computer Confidentiality

    Publication Year: 1977, Page(s):1133 - 1136
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    This is a first attempt to develop shift-register-based encryption methods with nonlinear characteristics. We propose some new stream enciphering schemes composed of standard components which are easy to implement and appear to be difficult to break by either a linear attack or statistical analysis. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adjacency Table Method of Deriving Minimal Sums

    Publication Year: 1977, Page(s):1136 - 1141
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1107 KB)

    Presented in this correspondence is a tabular method for obtaining minimal sum-of-products representations of Boolean functions. The method uses a single table called the adjacency table. This table provides a record of the adjacency properties of the minterms of the given function. In particular, the table records 1) all adjacent pairs of minterms, 2) the variable absent from each product term su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Algorithm for Testing Stuck-at Faults in Random Access Memories

    Publication Year: 1977, Page(s):1141 - 1144
    Cited by:  Papers (32)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (779 KB)

    This correspondence presents an optimal algorithm to detect any single "stuck-at-i," "stuck-at-O" fault and any combination of "stuck-at-I," "stuck-at-O" multiple faults in a random access memory using only the n-bit memory address register input and m-bit memory buffer register input and output lines. It is shown that this algorithm requires 4 X 2n memory accesses. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Store Address Generator with On-Line Fault-Detection Capability

    Publication Year: 1977, Page(s):1144 - 1147
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    A novel technique for address generation is presented in this correspondence. This scheme has two useful features. Addresses are generated with check bits as an integral part of the address in order to provide multi-fault-detection capability. To date, there exists no such scheme with this feature. Secondly, the addresses generated through this scheme are pseudorandom; therefore, they can be used ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity and Efficiency of Decision Functions

    Publication Year: 1977, Page(s):1147 - 1151
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1025 KB)

    Two criteria for comparing the performance of dedision functions are discussed. The first is the capacity as defined by Cover. We extend his definition to allow the calculation of the capacity of hyperboxes (interval complexes), which are shown to have asymptotically lower capacity than hyperplanes. The second criterion is the efficiency. We calculate the efficiency for polynomial functions. The e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correct DDA Register Transfers for Trapezoidal Integration When Solving Nonlinear Equations of the Form ẏ= Ayn

    Publication Year: 1977, Page(s):1151 - 1153
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (562 KB)

    This correspondence shows that when solving differential equations of the form ẏ = Σanyn, DDA's that perform trapezoidal integration for linear equations cannot be directly employed. Modified register transfers are developed for the representative example of ẏ = y2, and results are presented for both accurate numerical solutions and curve generatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Stable, Two-Multiplies-per-Cycle Algorithm for Digital Generation of Sinusoids in Real Time

    Publication Year: 1977, Page(s):1153 - 1154
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB)

    An algorithm for the generation of sinusoids is presented. It is better than other algorithms previously known and used for this purpose, as it is stable and requires only two multiplications per cycle. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis of Intermittent Faults in Combinational Networks

    Publication Year: 1977, Page(s):1154 - 1158
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1009 KB)

    Detection of intermittent faults was considered in a number of publications [1],[2]. Recently, Kamal [3] presented an approach to the diagnosis of intermittent faults in combinational networks. The methods developed so far, however, do not yield a minimal diagnosis experiment. Moreover, complete diagnosis is not obtained even in cases where it is possible. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Grey-Level Transformations in Digitized Images

    Publication Year: 1977, Page(s):1158 - 1161
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (759 KB)

    Grey-level transformations on digitized images are variously used to minimize storage requirements or to enhance low-level contrast information. A graph-theoretic approach is proposed to implement these transformations. In particular, an efficient algorithm is given for transformation leading to almost uniform grey-level distribution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational Work of Combinational Machines

    Publication Year: 1977, Page(s):1161 - 1163
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    In this correspondence we discuss an application of a work measure introduced by Hellerman. Uniform machines are represented by chains of transformations of Boolean functions. The work of any transformation depends only on the rank of a corresponding Boolean matrix. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Handling for the Geometric Correction of Large Images

    Publication Year: 1977, Page(s):1163 - 1167
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (761 KB)

    Several geometric distortions are present in remotely sensed images depending on the type of sensors and the object being observed. It is often desirable to compensate for these distortions and store the images in reference to a standard coordinate system. Digital techniques for correction are versatile and introduce a minimum of radiometric errors. The main problems to be considered in this area ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Focus Number System

    Publication Year: 1977, Page(s):1167 - 1170
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (789 KB)

    This correspondence introduces a new number system, called the Focus number system which "focuses" on available resolution near zero much like an operational amplifier "focuses" on tiny deviations near virtual ground. This number system is supported by algorithms providing addition, multiplication, and higher order functions in a bare microcomputer at speeds rivaling those of existing integer arit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution-Oriented Fault Interrelationships in Combinational Logic Networks

    Publication Year: 1977, Page(s):1170 - 1175
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2665 KB)

    This correspondence considers fault resolution as a process of applying a sequence of input vectors, called tests, to a combinational logic network in order to resolve an existing fault situation from within a given master set of faults. A functional approach based upon an extension of the well-known Boolean difference concept to fault dependent situations is described. The test sets resulting fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Techniques for Photomosaicking

    Publication Year: 1977, Page(s):1175 - 1180
    Cited by:  Papers (44)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6671 KB)

    A previous report described techniques for creating photomosaics: first, the two overlapping images are brought into register; second, a seam from the top of the overlap region to its bottom is tracked one row at a time; finally, the resultant artificial edge introduced by the seam is locally smoothed by a ramp function. This correspondence describes improved methods for gray-scale registration an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Maxwell's Displacement Current"

    Publication Year: 1977, Page(s): 1180
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

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