By Topic

Computers, IEEE Transactions on

Issue 11 • Date Nov. 1978

Filter Results

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

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

    Publication Year: 1978 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (252 KB)  
    Freely Available from IEEE
  • Error-Correcting Codes in Binary-Coded-Decimal Arithmetic

    Publication Year: 1978 , Page(s): 977 - 984
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2256 KB)  

    Error-correcting coding schemes devised for binary arithmetic are not in general applicable to BCD arithmetic. In this paper, we investigate the new problem of using such coding schemes in BCD systems. We first discuss the general characteristics of arithmetic errors and define the arithmetic weight and distance in BCD systems. We show that the distance is a metric function. Number theory is used to construct a class of single-error-correcting codes for BCD arithmetic. It is shown that the generator of these codes possesses a very simple form and the structure of these codes can be analytically determined. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods

    Publication Year: 1978 , Page(s): 985 - 997
    Cited by:  Papers (28)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2942 KB)  

    A new mathematically based method of synthesis for combinational digital networks is presented, based upon the recognition of symmetry patterns in the functions being synthesized. The design procedure is structured such that at each stage of the synthesis a relevant gate assembly is indicated, which leaves a simplified "remainder" function to be synthesized at the next stage of the realization. This decomposition procedure optimally uses gates with a fan in of two, but post-synthesis reconfiguration for amalgamation into larger fan-in gates is available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some New Types of Logical Completeness

    Publication Year: 1978 , Page(s): 998 - 1005
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2632 KB)  

    In this paper, we consider the problem of determining if a given set of simple combinational functions, called logic primitives, can be used to realize any arbitrarily complex combinational function. The complex combinational function is realized by suitably interconnecting the primitives, and in most cases several copies of the primitives. Such a set of primitives is said to be complete in some sense. Two important types of logical completeness that have been previously studied are: 1) strong completeness where the circuit inputs are the uncomplemented variables x1,x2,···,xn, and 2) weak completeness where the circuit inputs are 0,1,x1,x2,···,xn. In this paper, we discuss two new types of logical completeness: strong c-completeness with inputs x1, x̄1, x2, x̄2,···,xn, x̄n and weak c-completeness with inputs 1, 0, x1, x̄1, x2, x̄2,···, xn, x̄n, and we derive necessary and sufficient conditions for a set of primitives to be strong c-complete or weak c-complete. We also discuss the relations between the above four types of completeness. Finally, we consider two more types, complement completeness and dual completeness, which may have applications to some recent technologies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Problem-Oriented Redefinition of Computer Architecture via Microprogramming

    Publication Year: 1978 , Page(s): 1006 - 1014
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2961 KB)  

    The instruction sets of most contemporary, commercially available computers are designed to provide "general purpose" capabilities. In solving specific problems, the instruction sets of these computers often prove to be inefficient. With a dynamically microprogrammable machine this problem can be alleviated by letting the language processor 1) define a set of "machine" instructions better suited for the particular problem at hand and 2) generate the microprograms to interpret the newly defined instruction set. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing by Data and Program Blocks

    Publication Year: 1978 , Page(s): 1015 - 1028
    Cited by:  Papers (1)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4048 KB)  

    A processing system is presented that implements simultaneously the efficiency of the special-purpose processor and the total applicability of the general-purpose computer—characteristics commonly thought of as being mutually exclusive. This is achieved through specializing the machine by programming the hardware structure, rather than by adding software systems to it. Data are organized in circulating pages which form a multiplicity of local dynamic memories for each process. Programs are made up of modules, each describing a transient special-purpose machine. A characteristic of this approach is that the processes are data-driven, rather than program-driven. The programming language presents significant flexibility and efficiency in modeling certain classes of problems, and it may be of interest as an implementation model in a broader context. Applications to real-time processing of radar signals are reported. The relevance of characteristics of this system to problems in multiprogramming and multiprocessing systems is discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmable Logic Arrays

    Publication Year: 1978 , Page(s): 1028 - 1039
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3733 KB)  

    This paper describes an algorithm for minimizing an arbitrary Boolean function. The approach differs from most previous procedures in which first all prime implicants are found and then a minimal set is then determined. This procedure imposes a set of conditions on the selection of the next prime implicant in order to obtain a near minimal sum-of-products realization. Extension to the multiple output and incompletely specified function cases is given. An important characteristic of the proposed procedure is the relatively small amount of computer time spent to solve a problem, as compared to other procedures. The MINI algorithm may give better results for a large number of inputs and outputs if relatively few product terms are needed. This procedure is also well suited to find a solution for programmable logic arrays (PLA's) which internally implement large Boolean functions as a sum-of-products. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-Correcting Tree Automata for Syntactic Pattern Recognition

    Publication Year: 1978 , Page(s): 1040 - 1053
    Cited by:  Papers (6)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2569 KB)  

    The syntax errors on trees are defined in terms of five types of error transformations, namely, substitution, stretch, split, branch, and deletion. The distance between two trees is the least cost sequence of error transformations needed to transform one to the other. Based on this definition, a class of error-correcting tree automata (ECTA) is proposed. The operation of ECTA is illustrated by a character recognition example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • When to Use Random Testing

    Publication Year: 1978 , Page(s): 1054 - 1055
    Cited by:  Papers (13)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (400 KB)  

    A probabilistic method for deciding whether a combinational circuit should be tested by random inputs, is given. This decision is based upon certain easily observable circuit parameters, such as, the number of primary inputs, the number of levels, and the average fan in. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cellular Array for Multivalued Logic Functions

    Publication Year: 1978 , Page(s): 1055 - 1059
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (659 KB)  

    An algebraic generalization of the well-known binary q-function array to a multivalued q-function array is presented. It is possible to associate tree-structure realizations for binary q-functions and multivalued q-functions. Synthesis of multivalued functions using this array is very simple. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Fault Diagnosis Algorithm for Symmetric Multiple Processor Architectures

    Publication Year: 1978 , Page(s): 1059 - 1063
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (752 KB)  

    A new diagnosis algorithm for determining the existing fault situation in a symmetric multiple processor architecture is given. The algorithm assumes that there are n processors, each of which is tested by at least t other processors, and at most t of which are faulty. The existing fault situation is always diagnosed if n ≥ 2t + 1 and, in some cases, can still be diagnosed if n < 2t + 1. The implementation of the algorithm is straightforward and suitable for microprocessor applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irredundant Normal Forms and Minimal Dependence Sets of a Boolean Function

    Publication Year: 1978 , Page(s): 1064 - 1068
    Cited by:  Papers (17)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (812 KB)  

    A new method is presented for determining all minimal dependence sets, irredundant normal forms, and irredundant normal forms of minimal dependence sets of a Boolean function f. The method reduces the above problems into those of determining all minimal positive dependence sets, irredundant positive normal forms, and irredundant positive normal forms of minimal positive dependence sets, respectively, of a Boolean function f* corresponding to f. For each problem a corresponding cover formula is developed such that the prime implicants of it are in one-to-one correspondence to all possible solutions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Multiple Operand Addition of Signed Binary Numbers

    Publication Year: 1978 , Page(s): 1068 - 1070
    Cited by:  Papers (5)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (502 KB)  

    Recent application of negabinary number systems in signal processing has evoked the question of the suitability of binary base. Many proposals for multioperand addition of unsigned binary numbers are available in the literature. Here, the addition of two numbers in 2's complement notation-has been extended to n signed summands. The time delay remains the same as that of processing n unsigned numbers. This method shows new promises for its application to signal processing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Higher Radix Technique for Fault Detection in Many-Valued Multithreshold Networks

    Publication Year: 1978 , Page(s): 1070 - 1073
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (612 KB)  

    A technique for fault detection of many-valued multithreshold switching networks is presented. An arbitrary network, implemented with R-valued multithreshold gates, called MT(R), can be transformed into an MT(R + 1) or an MT(R + 2) network which uses additional truth values for fault detection purposes. The technique leads to reduced test sets, which are usually simpler to derive. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal TANT Networks of Functions with DON'T CARE'S and Some Complemented Input Variables

    Publication Year: 1978 , Page(s): 1073 - 1078
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1145 KB)  

    The minimization algorithm of Gimpel realizes a minimal TANT network for any Boolean function under a NAND gate cost criterion. A TANT network is a three-level network composed of AND-NOT (i.e., NAND) gates, having only true (i.e., uncomplemented) input variables. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition of Polygons into Convex Sets

    Publication Year: 1978 , Page(s): 1078 - 1082
    Cited by:  Papers (20)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (723 KB)  

    A method is presented for decomposing polygons into convex sets. The method is based upon a Delaunay tessellation of the polygon. It is implemented as a divide-and-conquer technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions

    Publication Year: 1978 , Page(s): 1083 - 1087
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (751 KB)  

    This correspondence considers the efficiency of some algorithms for the evaluation of monotonic Boolean functions. It is shown that algorithms based on the criterion of maximizing the local information gain about the Boolean function with n variables may sometimes require a number of computational steps which is n/log n times the computational steps of the optimal algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distribution of Runs in Binary Words

    Publication Year: 1978 , Page(s): 1087 - 1089
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (417 KB)  

    The number of n-bit words with a given longest run of 1's is computed. A relation between these numbers and the Fibonacci numbers is outlined and investigated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Pattern Analysis and Machine Intelligence

    Publication Year: 1978 , Page(s): 1089
    Save to Project icon | Request Permissions | PDF file iconPDF (107 KB)  
    Freely Available from IEEE
  • Announcing a new Quarterly IEEE Transactions ... IEEE Transactions on Pattern Analysis and Machine Intelligence

    Publication Year: 1978 , Page(s): 1089
    Save to Project icon | Request Permissions | PDF file iconPDF (107 KB)  
    Freely Available from IEEE
  • The IEEE Computer Society Announces Tutorial and Selected Papers in Digital Image Processing

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

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

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