IEEE Transactions on Computers

A high-performance 3-1 interlock collapsing ALU, i.e., an ALU that allows the execution of most execution interlocks in a single machine cycle, is presented. We focus on reducing the Boolean equations describing the device and the incorporation of new ...

Over-redundant digit sets are defined as those ranging from /spl minus/s to +s, with s/spl ges/B, B being the radix. This paper presents new techniques for the direct computation of division, that use an over-redundant digit set for representing the ...

As the name suggests, elementary functions play a vital role in scientific computations. Yet due to their inherent nature, they are a considerable computing task by themselves. Not surprisingly, since the dawn of computing, the goal of speeding up ...

We demonstrate a structure for mutual test among N processing elements. We indicate how this structure might be used to identify the good dice on a semiconductor wafer at a cost below that of current techniques. Under either a digraph or a comparison ...

We study the complexity of two fundamental problems in the testing of finite-state machines. 1) Distinguishing sequences (state identification). We show that it is PSPACE-complete to determine whether a finite-state machine has a preset distinguishing ...

This paper describes a deterministic algorithm for reconfiguring a multibutterfly network with faulty switches. Unlike previous reconfiguration algorithms, the algorithm is performed entirely by the network, without the aid of any off-line computation, ...

We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed token medium access control protocol is employed. Synchronous bandwidth, defined as the maximum time for which a node can transmit its synchronous ...

Pin-efficient single-instruction multiple-data networks, with p/spl ap//spl radic/(2m) pins per cell that can/spl minus/in one clock tick/spl minus/shift data by any amount k in an interval /spl lsqb//spl minus/m,m/spl rsqb/ are considered. Perfect ...

Strings are used to represent a variety of objects such as DNA sequences, text, and numerical sequences. A model for a system for the visualization and analysis of strings was proposed by D. Mehta and S. Sahni (1992). The problem of display conflicts ...

All words in a balanced code have equal number of ones and zeros. Denote by DC(n,k) a balanced (or dc-free) code of length n, and 2/sup k/ code words. We design an efficient DC(k+r, k) code with k=2/sup r+1//spl minus/0.8/spl radic/(r/spl minus/2). ...

A method was presented by A.L. Ruiz, P.P. Trabado, and J.O. Lopera for efficiently generating the solutions of Boolean equations by using tables (i.e., rectangular arrays or matrices) of 0's, 1's, and dashes to represent Boolean expressions. Some ...

Algorithm-based fault tolerance is a scheme of low-cost error protection in real-time digital signal processing environments and other computation-intensive tasks. In this paper, a new method for encoding data is proposed and, furthermore, two kinds of ...

Presents an algorithm that solves the conflict resolution problem in fault-tolerant multicast-connected MINs. Without loss of generality, the authors apply the algorithm to reconfigure a four-path cube-based network. An intensive simulation study is ...

Presents a better way of decomposition of complex multipliers using polynomial encoding than the method presented in the paper, "Decomposition of Complex Multipliers Using Polynomial Encoding.". The decomposition described in this paper makes use of ...

Chakravarty presents a characterization of BDD's in terms of the complexity of some computational problems. In these comments, some incorrectly stated restrictions on the "number of repeated variables" are corrected and results on the translation ...

A new approach called safe system level diagnosis is proposed. With this approach, in the event of a small number of faults, all the faulty nodes can be identified; also, in the event of a large number of faults, the fault condition can be detected. ...