By Topic

IEEE Transactions on Computers

Issue 10 • Date Oct. 1987

Filter Results

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

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

    Publication Year: 1987, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (192 KB)
    Freely Available from IEEE
  • Optimal Partitioning and Redundancy Removal in Computing Partial Sums

    Publication Year: 1987, Page(s):1137 - 1143
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2374 KB)

    Two novel algorithms for simultaneous computation of a large number of partial sums are introduced, their performance assessed, and architectures for their implementation suggested. The direct computation of D operations are replaced by O(D/log D). The new approach is based on a new concept of optimal partitioning and redundancy removal in arithmetic intensive, high throughput computing that is ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Way to Build Efficient Carry-Skip Adders

    Publication Year: 1987, Page(s):1144 - 1152
    Cited by:  Papers (53)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3767 KB)

    In this paper, we present a way to obtain efficient carry-skip adders, built with blocks of different sizes in VLSI technologies. We give some results about two-level carry-skip adders. We reduce our optimization problem to a geometrical problem, solved by means of an algorithm easily implemented on a microcomputer. Then we present an example of the realization of such an adder. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms to Process Distributed Queries in Fast Local Networks

    Publication Year: 1987, Page(s):1153 - 1164
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3680 KB)

    We propose a scheme to make use of semantic information to process distributed queries locally without data transfer with respect to the join clauses of the query. Since not all queries can be processed without data transfer, we give an algorithm to recognize the "locally processable queries." For nonlocally processable queries, a simple "fragment and replicate" algorithm is used. The algorithm ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Construction Method of High-Speed Decoders Using ROM's for Bose–Chaudhuri–Hocquenghem and Reed–Solomon Codes

    Publication Year: 1987, Page(s):1165 - 1171
    Cited by:  Papers (28)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2131 KB)

    In this paper, some efficient methods of solving equations over Galois field GF(2m) are proposed. Using these algorithms, decoders for triple-and quadruple-error-correcting Bose–Chaudhuri–Hocquenghem (BCH) codes are shown. More- over, we propose a new method of making high-speed decoders for double-error-correcting/triple-error-detecting BCH or Reed- Solomon (RS) codes by adding a simp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance

    Publication Year: 1987, Page(s):1172 - 1182
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3211 KB)

    An approach to the design of reconfigurable tree architectures is presented in which spare processors are allocated at the leaves. The approach is unique in that spares are associated with subtrees and sharing of spares between these subtrees can occur. The Subtree Oriented Fault Tolerance (SOFT) approach is more reliable than previous approaches capable of tolerating link and switch failures for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic-Specific Interconnection Networks for Multicomputers

    Publication Year: 1987, Page(s):1183 - 1196
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3886 KB)

    Special-purpose networks of processors and intelligent switching devices can be programmed to solve problems with inherent parallelism. The target algorithm is coded into a number of asynchronously executing parallel tasks, and assigned to specific processors. For well-known algorithms, information about the data communicated between these tasks (traffic) can be characterized and used by a heurist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Reliability of Voting Mechanisms

    Publication Year: 1987, Page(s):1197 - 1208
    Cited by:  Papers (73)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2916 KB)

    In a faulty distributed system, voting is commonly used to achieve mutual exclusion among groups of isolated nodes. Each node is assigned a number of votes, and any group with a majority of votes can perform the critical operations. Vote assignments can have a significant impact on system reliability. In this paper we address the problem of selecting vote assignments in order to maximize the proba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree-Based Broadcasting in Multihop Radio Networks

    Publication Year: 1987, Page(s):1209 - 1223
    Cited by:  Papers (69)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4184 KB)

    This paper considers the issue of broadcasting protocols in multihop radio networks. The objective of a broadcasting protocol is to deliver the broadcasted message to all network nodes. To efficiently achieve this objective the broad- casting protocol in this paper utilizes two basic properties of the multihop radio network. One is the broadcast nature of the radio which allows every single trasmi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods

    Publication Year: 1987, Page(s):1224 - 1232
    Cited by:  Papers (77)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2607 KB)

    Symbolic terminal reliability algorithms are important for analysis and synthesis of computer networks. In this paper, we present a simple and efficient algorithm, SYREL, to obtain compact terminal reliability expressions between a terminal pair of computers of complex networks. This algorithm incorporates conditional probability,, set theory, and Boolean algebra in a distinct approach in which mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Complexity of Table Lookup for Iterative Division

    Publication Year: 1987, Page(s):1233 - 1236
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    We show that except for a few special cases allowing smaller tables, the lookup table used for achieving k digits of convergence after the initial multiplication (or for obtaining the approximate reciprocal of the divisor with k − 1 digits of accuracy) in iterative division methods must have at least (r−-l) rk words of k + I digits, r being the number representation base. In the import... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite Field Fault-Tolerant Digital Filtering Architectures

    Publication Year: 1987, Page(s):1236 - 1242
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1079 KB)

    Digital filtering architectures that simultaneously offer advantages for VLSI fabrication and contain distributed error control are presented. Such structures require parallelism as well as inherent error- control capabilities because VLSI implementations are susceptible to temporary and intermittent hardware errors. The filtering convolution operation is similar to the formation of cyclicerror-co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast 1-D Serial-Parallel Systolic Multiplier

    Publication Year: 1987, Page(s):1243 - 1247
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (845 KB)

    Based on the modified Booth's algorithm, a fast 1-D serial- parallel systolic multiplier is designed for multiplying two's complement numbers. The circuit with countercurrent data flow pattern accepts the multiplicand serially, the multiplier in parallel, and outputs the product serially. It requires a complementer and N/2 cells, each of which contains a ripple-carry adder and some gates, where N ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounding Signal Probabilities in Combinational Circuits

    Publication Year: 1987, Page(s):1247 - 1251
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1063 KB)

    In [2] Savir, Ditlow, and Bardell presented an algorithm for estimating the signal probability of a line in combinational circuits, but were unable to show that the algorithm always produced correct results. This paper shows that their algorithm for cutting reconvergent fan-out lines in a circuit eventually produces a circuit without reconvergent fan- out that can be used to estimate signal probab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable High-Speed Arbitration and Synchronization

    Publication Year: 1987, Page(s):1251 - 1255
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1103 KB)

    Numerous papers have discussed the behavior of flip-flops in synchrronization and arbitration circuits. Here, a nonconventional machine, which avoids completely synchronization failures by using metastability detectors in conjunction with a stretchable clock, is evaluated. The core of the paper focuses on the quantitative evaluation of the performance and reliability of this unconventional kind of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Complex Integer Multiplier Using the Quadratic-Polynomial Residue Number System with Numbers of Form 22n+ 1

    Publication Year: 1987, Page(s):1255 - 1258
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (813 KB)

    A quadratic-polynomial Fermat residue number system (QFNS) can be used to compute the complex multiplications needed to perform a DFT. The advantage of such a QFNS is that complex multiplication can be accomplished with only two integer multiplications. In this paper, it is shown that a new set of numbers of the form Tn = 22n + 1 can be used in place of the set of Fermat numbers. This new quadrati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM

    Publication Year: 1987, Page(s):1258 - 1263
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1137 KB)

    Parallel algorithms for finding the connected components (CC) and a minimum spanning FOREST (MSF) of an undirected graph are presented. The primary model of computation considered is that called "shuffle-exchange network" in which each processor has its own local memory, no memory is shared, and communication among processors is done via a fixed degree network. This model is very convenient for ac... View full abstract»

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

    Publication Year: 1987, Page(s): 1264
    Request permission for commercial reuse | PDF file iconPDF (212 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1987, Page(s): 1264
    Request permission for commercial reuse | PDF file iconPDF (183 KB)
    Freely Available from IEEE
  • Information for authors

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