Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Computers, IEEE Transactions on

Issue 2 • Date Feb. 1979

Filter Results

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

    Publication Year: 1979 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (415 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1979 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (251 KB)  
    Freely Available from IEEE
  • Toggle-Registers Generating in Parallel k kth Decimations of m-Sequences xP+ xk+ 1 Design Tables

    Publication Year: 1979 , Page(s): 89 - 101
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2480 KB)  

    For the class of primitive trinomials xP+ xk+ 1 with (k, 2P-1) = 1, shift register constructions are presented which are designed to produce in parallel consecutive patterns, of k-consecutive bits each, of the corresponding m-sequence. The resultant class of register structures preserves the function of equivalent feedback shift registers (FSR's) with composite feedback logic while allowing a saving in the physical implementation which amounts to the complete elimination of modulo-2 adders. This accounts for the high-speed performance of the toggle-registers presented, and makes them suitable for a broad range of applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture of a Hardware Data Interpreter

    Publication Year: 1979 , Page(s): 101 - 109
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3761 KB)  

    Data interpretation refers to the execution of the data declarations of a high-level language program which declare the data variables, the data types, and the data structures in the high-level language program. This paper introduces the direct-execution computer architecture and presents the architecture of a hardware data interpreter. The data interpreter scans the data declaration, and stores the type, structural, and referencing information about the data in an associative memory. It then interprets the data when the data name is referred to. It also performs the data operations of the data types of the high-level programming language. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines

    Publication Year: 1979 , Page(s): 109 - 120
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4348 KB)  

    The problem of determining the existence of a simplex which covers a given convex polytope inside another given convex polytope in two-dimensional Euclidean space is shown to be efficiently solvable, and an effective procedure is derived to find a suitable covering simplex or show that none exists. This solution provides a finite algorithm for satisfying a necessary condition in the search for a simplicial (fewest states) stochastic sequential machine (SSM) which either covers or is covered by a given SSM of rank three. Theorems are proved which establish necessary and sufficient conditions restricting the class of corresponding simplexes through which a search must proceed to those whose vertices lie in the boundary of the bounding polytope and whose facet-supporting flats contain certain specified vertices of the polytope to be covered. The problem is then reduced to testing roots in the finite solution tree of a set of second degree algebraic equations against a finite table of linear constraints. An algorithm to generate the constraint sets for the equations to be solved is also presented along with examples of its application. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Digital Systems Using a New Measure of System Diagnosis

    Publication Year: 1979 , Page(s): 121 - 133
    Cited by:  Papers (45)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3579 KB)  

    A new measure of system diagnosis, t/s diagnosability, originally proposed by Friedman, is used to study the diagnosability of digital systems. This new measure incorporates the concept of possible replacement of fault-free units in system repair, whereas the previous measures have only considered the replacement of faulty units. Two categories of the new measure, one-step t/s diagnosability and sequential t/s diagnosability, are investigated. Two canonical classes of systems, single loop systems and DδAsystems (⌊t/2⌋ < A ≤ t), are examined based on these two categories of diagnosability. For each system class, the necessary and sufficient condition for one-step ts diagnosability is obtained and related to some previous results on t-fault diagnosability; also, an efficient one-step t/s repair procedure is presented. For both these system classes, optimal one-step t/s diagnosable system designs, which minimize the number of units and test links, are considered. Several sequential diagnosis strategies are presented for each system class. For all these diagnosis strategies optimal system designs are also considered. Finally, all the diagnosis strategies are compared and the tradeoff between the number of units replaced and the number of test iterations performed is discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use Bit Scanning in Replacement Decisions

    Publication Year: 1979 , Page(s): 133 - 141
    Cited by:  Papers (4)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4108 KB)  

    In paged storage systems, page replacement policies generally depend on a use bit for each page frame. The use bit is automatically turned on when the resident page is referenced. Typically, a page is considered eligible for replacement if its use bit has been scanned and found to be off on µ consecutive occasions, where µ is a parameter of the algorithm. This investigation focuses on the dependence of the number of bit-scanning operations on the value of µ and on properties of the string of page references. The number of such operations is a measure of the system overhead incurred while making replacement decisions. In particular, for several algorithms, the number of scans per reference is shown to be approximately proportional to µ However, empirical results from single-program traces show that the value of µ has little effect on the miss ratio. Although the miss ratios for the bit-scanning algorithms are close to those of least recently used (LRU), it is pointed out that increasing the value of µ need not bring the bit-scanning policies closer to LRU management. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast-Converging Algorithm for Nonlinear Mapping of High-Dimensional Data to a Plane

    Publication Year: 1979 , Page(s): 142 - 147
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (854 KB)  

    An iterative algorithm for nonlinear mapping of high-dimensional data is developed. The step size of the descent algorithm is chosen to assure convergence. Steepest descent and Coordinate descent are treated. The algorithm is applied to artificial and real data to demonstrate its excellent convergence properties. View full abstract»

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

    Publication Year: 1979 , Page(s): 147 - 150
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (667 KB)  

    A procedure is described for generating a two-parameter orthogonal transformation matrix which reduces to the Fourier and Hadamard transformation matrices under special conditions. This generalized transformation matrix is particularly useful for multidimensional signal processing on a real-time basis because it preserves a proper relationship in the transform domain. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm for Generating a Digital Straight Line on a Triangular Grid

    Publication Year: 1979 , Page(s): 150 - 152
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (370 KB)  

    An algorithm is presented for generating the optimum straight-line approximation for a plotter constrained to move a unit distance at a time in one of six equi-spaced directions. The algorithm facilitates the drawing of digital straight lines on a triangular grid. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Algorithm for Deriving Checking Experiments

    Publication Year: 1979 , Page(s): 153 - 156
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (806 KB)  

    This correspondence provides improvements to the design of checking experiments for sequential machines. Checking experiments can be divided into three parts: an initialization part, a validating part, and a diagnosing part. For synchronous machines not possessing a distinguishing sequence, the longest part of a checking experiment usually is the validating part. Using linking homing sequences as a replacement for locating sequences [1] or valid homing sequences [2], this correspondence shows that the validating part of an experiment can be significantly reduced for such machines. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference in Multiprocessor Systems with Localized Memory Access Probabilities

    Publication Year: 1979 , Page(s): 157 - 163
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1182 KB)  

    Past studies of memory interference in multiprocessor systems have generally assumed that the references of each processor are uniformly distributed among the memory modules. In this paper we develop a model with local referencing, which reflects more closely the behavior of real-life programs. This model is analyzed using Markov chain techniques and expressions are derived for the multiprocessor performance. New expressions are also obtained for the performance in the traditional uniform reference model and are compared with other expressions-available in the literature. Results of a simulation study are given to show the accuracy of the expressions for both models. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization of Modulo-2 Sum of Products

    Publication Year: 1979 , Page(s): 163 - 167
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (910 KB)  

    This correspondence attempts to solve the problem of expressing an arbitrary switching function in a modulo-2 sum-of-product terms form, having a minimum number of product terms. Each product term may contain variables in complemented or uncomplemented form. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Positive Fail-Safe Realization of Synchronous Sequential Machines

    Publication Year: 1979 , Page(s): 167 - 172
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1116 KB)  

    The correspondence deals with the fail-safe realization of synchronous sequential machines under the assumption that the next-state functions are in any positive form. This leads to new classes of assignments called positive fail-safe assignment's (PFSA) The feasibility conditions of such assignments are given and systematic procedures are presented for deriving them using k-out-of-n codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Word-Level Recognition of Cursive Script

    Publication Year: 1979 , Page(s): 172 - 175
    Cited by:  Papers (20)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (677 KB)  

    Recognition of cursive script has been attempted by discovering the letters forming each word, and consequently recognizing the word. The work done in this area has employed several techniques to enhance recognition results; examples of these techniques include use of topological features and use of context. View full abstract»

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

    Publication Year: 1979 , Page(s): 175
    Save to Project icon | Request Permissions | PDF file iconPDF (1511 KB)  
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979 , Page(s): 175
    Save to Project icon | Request Permissions | PDF file iconPDF (133 KB)  
    Freely Available from IEEE
  • Call for Papers

    Publication Year: 1979 , Page(s): 175
    Save to Project icon | Request Permissions | PDF file iconPDF (1195 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