By Topic

IEEE Transactions on Computers

Issue 2 • Date Feb. 1973

Filter Results

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

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

    Publication Year: 1973, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • Multiple Operand Addition and Multiplication

    Publication Year: 1973, Page(s):113 - 120
    Cited by:  Papers (12)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2344 KB)

    The problem of adding k n-bit numbers, where k ≥ 3 is considered. A novel scheme for adding such k numbers is described. Applying the bit-partitioning technique so that each partition contains m bits of each of these k numbers, where m=[log2(k-1)] is an integer ≥ log2(k-1), the final sum can be obtained in m+1 addition cycles. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic Algorithms in a Negative Base

    Publication Year: 1973, Page(s):120 - 125
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3120 KB)

    Algorithms are described for the basic arithmetic operations and square rooting in a negative base. A new operation called polarization that reverses the sign of a number facilitates subtraction, using addition. Some special features of the negative-base arithmetic are also mentioned. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic Division Algorithm in a Negative Base

    Publication Year: 1973, Page(s):125 - 128
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1760 KB)

    Described here is a deterministic division algorithm in a negative-base number system; here, the divisor is mapped into a suitable range by premultiplication, so that the choice of the quotient digit is deterministic. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Video Display System for Image Processing by Computer

    Publication Year: 1973, Page(s):128 - 134
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5136 KB)

    A core-refreshed video display system that can display gray-scale images of 32 intensity levels on a standard monochrome video monitor will be described. The system can also display flicker-free black and white images of more than 800 000 picture elements. There are special features that allow overlaying black and white images on 16-level gray-scale images and manual cursor control via an X-Y tabl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General Division in the Symmetric Residue Number System

    Publication Year: 1973, Page(s):134 - 142
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3336 KB)

    In the residue number system, the arithmetic operations of addition, subtraction, and multiplication are executed in the same period of time without the need for interpositional carry. There is a hope for high-speed operation if residue arithmetic is used for digital computation. The division process, which is one of the difficulties of this operation, is developed in the symmetric residue number ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Balanced Pipelining Approach to Multiprocessing on an Instruction Stream Level

    Publication Year: 1973, Page(s):143 - 148
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2232 KB)

    This paper presents an approach to achieve high central processing unit (CPU) availability with an increase in performance by multiprocessing on an instruction stream level, where instruction fetching/executing is done by closely coupled processing units (PU's). A treatment is given of the necessary control for coordination of the PU's. This processing interaction is accomplished by microcode shar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Micromultiprocessing: An Approach to Multiprocessing at the Level of Very Small Tasks

    Publication Year: 1973, Page(s):149 - 153
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2008 KB)

    The design and performance evaluation of a multiprocessor system are described. The system consists of processing units sharing the processing of the same instruction stream, where tasks consist of individual instructions. The multiprocessing aspect is completely transparent to the user. The system configuration developed calls for two microprogrammed processing units sharing the same local and co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Expandable Ferroelectric Random Access Memory

    Publication Year: 1973, Page(s):154 - 158
    Cited by:  Papers (1)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3280 KB)

    A ferroelectric memory array is described that may be implemented with discrete bits, discrete words, or multiple word components. Binary information is stored as either a positive or negative polarization state in the ferroelectric ceramic material and is read out, with interrogation, by sensing a positive polarity pulse for a " 1" bit, and the lack of a signal for a " 0." The maximum size of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms ror Designing Fault-Detection Experiments ror Sequential Machines

    Publication Year: 1973, Page(s):159 - 167
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2816 KB)

    In this paper we present algorithms for designing fault-detection experiments for sequential machines with special emphasis on the case in which the machine does not possess a distinguishing sequence. The length of an experiment is reduced through: 1) identifying each state with its own unique input/output set rather than using a common set for all states; 2) utilizing overlapping of the required ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dissent in a Majority Voting System

    Publication Year: 1973, Page(s):168 - 171
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2032 KB)

    The reliability of digital computing systems is a significant problem. A scheme using multiply redundant computing devices with a majority voting device to determine the output has been shown to improve the reliability of that output. In this paper, a devices called a dissent detector is suggested as an addition to the system. The function of this device is that of an alarm to indicate the quality... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Augmented Iterative Array for High-Speed Binary Division

    Publication Year: 1973, Page(s):172 - 175
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2072 KB)

    An augmented iterative array for binary division (IAD), is described. It uses carry-save reduction and carry-look-ahead principles to achieve high speed. Logic cost and speed comparisons with two other design techniques are presented. An 8-bit prototype model that operates in under 500 ns has been built from commercially available high-speed MSI TTL integrated circuits to verify the feasibility of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance-2 Cyclic Chaining of Constant-Weight Codes

    Publication Year: 1973, Page(s):176 - 180
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2064 KB)

    The cyclic distance-2 chaining of constant-weight codes has applications in A/ D conversions as well as in combinatorial problems involving the exhaustion of m-out-of-n combinations. It is shown in this paper that such a chaining can be obtained from the Gray code circuit and its transformations. Algorithms based on several theorems derived have been developed and programmed in APL. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tan-Like State Assignments ror Synchronous Sequential Machines

    Publication Year: 1973, Page(s):181 - 187
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2424 KB)

    Recently, Tan developed a heuristic state assignment algorithm for asynchronous sequential machines. In this paper a state assignment algorithm based on Tan's is developed for synchronous sequential machines. It shares with Tan's algorithm the advantages of simplicity of execution and economy of logic elements in the resulting realizations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph

    Publication Year: 1973, Page(s):187 - 193
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3920 KB)

    The compatibility relation occurs in many different disciplines in science and engineering. When a compatibility relation exists between pairs of elements in a set, an important problem is to derive the collection of aU those elements that form maximal compatibles. If the set of elements with the compatibility relation can be visualized as a compatibility graph of which the different nodes represe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modularity in Design: Skit Registers and Counters Used as System Building Blocks

    Publication Year: 1973, Page(s):194 - 197
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1872 KB)

    An algorithm for determining whether or not an arbitrary sequential machine can be synthesized using only shift registers or up-down counters as memory elements is presented. When realization is possible, a basis for state assignment is given. State-partitioning techniques are used to this end and it is concluded that by means of a single test, it is possible to simultaneously check for realizabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MultiFunction Threshold Gates

    Publication Year: 1973, Page(s):197 - 203
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3360 KB)

    Threshold logic gates, up to now, generally have been presumed to provide a single function of the input variables. The threshold gates that have been integrated [1]-4] were naturally double-sided and provided complementary outputs or, more specifically, complemented dual outputs. This paper shows that the inphase and out-of-phase outputs can, in fact, be designed to provide grossly different func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partition of Boolean Functions ror Realization with Multithreshold Threshold Logic Elements

    Publication Year: 1973, Page(s):204 - 215
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4672 KB)

    In this paper, the concept of "primary partition" of Boolean functions has been introduced. A systematic method of obtaining the multithreshold realization of Boolean functions based on this new concept is presented. The problem essentially reduces to a table lookup procedure; the computational labor in finding the minimum-threshold minimum fan-in solution is substantially reduced. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast State Minimization of Incompletely Specified Sequential Machines

    Publication Year: 1973, Page(s):215 - 217
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1712 KB)

    Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single minimum cover with significantly less computation. The factor by which computation is reduced is directly proportional to the complexity of the machine. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Minimization of Fuzzy Functions"

    Publication Year: 1973, Page(s): 217
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    This correspondence points out the insufficiency of the method for minimization of fuzzy functions as presented in a recent short note.1 Two lemmas, which are the basis for a new minimization technique [2], are represented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Next-State Equations of Asynchronous Sequential Machines"

    Publication Year: 1973, Page(s): 218
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    Observations are made relative to the choice of state assignments demonstrated in a recent note' on state assignment selection. Counter examples are given to indicate that the problem of selecting state assignments is not solved as the author implies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Combinatorial Algorithm for Solving Covering Problems

    Publication Year: 1973, Page(s):218 - 220
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    In this correspondence a new combinational algorithm for the covering problems is proposed and computational experiments are analyzed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B73-3 Dynamic Programming and Partial Differential Equations

    Publication Year: 1973, Page(s): 221
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • B73-4 High Level Languages—International Computer State of the Art Report

    Publication Year: 1973, Page(s):221 - 222
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (336 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