Results 221 to 230 of about 8,051 (256)

Optical arithmetic/logic unit based on residue arithmetic and symbolic substitution

Applied Optics, 1988
There has been difficulty in achieving a fully parallel, digital optical adder or multiplier. The primary obstacle is the carry operation inherent in any fixed-radix number system. The concepts of residue number representation and symbolic substitution can be combined to produce a parallel optical arithmetic/logic unit.
C D, Capps, R A, Falk, T L, Houk
openaire   +2 more sources

Residue arithmetic bases for reducing delay variation

Proceedings of 2010 IEEE International Symposium on Circuits and Systems, 2010
In this paper the utilization of Residue Number System (RNS) is investigated as a tool for variation-tolerant design. In particular circuits using various RNS bases are compared in terms of their sensitivity to the variation of process parameters. Furthermore, RNS advantages are quantitatively illustrated by considering a timing model. It is shown that
Ioannis Kouretas, Vassilis Paliouras
openaire   +1 more source

A residue arithmetic extension for reliable scientific computation

IEEE Transactions on Computers, 1997
A reliable scientific computation approach, substantially different from the known ones, based on Residue Number System (RNS) floating-point arithmetic is described. In the approach, the real number is represented by an expression which consists of two parts, the approximate part and the interval error part.
Eisuke Kinoshita, Ki-Ja Lee
openaire   +1 more source

On the impact of encoding on the complexity of residue arithmetic circuits

2011 18th IEEE International Conference on Electronics, Circuits, and Systems, 2011
In this paper we explore the impact of data encoding on the design of arithmetic circuits based on residue number system (RNS). Specifically, we show that departing from the conventional representation of residues as integers in weighed binary format and appropriately selecting a non-weighed encoding, efficient circuits in terms of power, area and ...
E. Theodorakis, Vassilis Paliouras
openaire   +1 more source

A new residue arithmetic error correction scheme

IEEE Transactions on Computers, 1996
Summary: Automatic detection and correction of errors in the residue number system involves the conversion ot residue representations to integers and base extension. The residue number system is generally restricted to moduli that are pairwise relatively prime.
openaire   +2 more sources

On the structure of IIR filters using residue arithmetic

ICASSP '81. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
The classic digital filter architecture, often referred to as the Jackson-Kaiser-McDonald (JMK) filter, realizes a filter in terms of general purpose multipliers, adders, and shift-registers. In the mid-1970's, the memory-intensive linear shift invariant filter architectures, known as the distributed filter (or Peled and Liu PL filter) and Monkewich ...
A. S. Ramnarayanan, Fred J. Taylor
openaire   +1 more source

Computation of Pseudoinverse Matrices Using Residue Arithmetic

SIAM Review, 1972
This paper discusses the use of residue (single and multiple modulus) arithmetic in computing the Moore-Penrose pseudoinverse of a matrix. The process can significantly reduce roundoff error. Proper selection of the modulus (or moduli) is critical. Necessary and sufficient criteria for modulus selection are developed.
Stallings, W. T., Boullion, T. L.
openaire   +2 more sources

Residue arithmetic circuits based on the signed-digit multiple-valued arithmetic circuits

Proceedings. 1998 28th IEEE International Symposium on Multiple- Valued Logic (Cat. No.98CB36138), 2002
Multiple-valued residue arithmetic circuits using integers 4/sup p/ and 4/sup p//spl plusmn/1 as moduli of residue number system (RNS) are presented. Conventional residue arithmetic circuits have been designed using binary number arithmetic system, but the carry propagation arises which limits the speed of arithmetic operations in residue modules.
Shugang Wei, Kensuke Shimizu
openaire   +1 more source

Arithmetic Codes in Residue Number Systems with Magnitude Index

IEEE Transactions on Computers, 1978
Summary: The idea of adding a magnitude index to the residue representation of numbers is reconsidered. The range of a given residue number system is supposed to be divided into intervals of equal width, and the magnitude index of a number \(X\) is defined as an integer locating \(X\) into one of such intervals.
Ferruccio Barsi, Piero Maestrini
openaire   +2 more sources

A more efficient residue arithmetic implementation of the FFT

1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), 1985
After 20 years, the FFT remains restricted in its real time capabilities. To overcome this throughput obstacle, fast residue arithmetic units are studied based on several recent innovations in the field of complex finite rings. A dedicated machine is designed which makes use of these new results and is compared to conventional FFT designs.
openaire   +1 more source