Journal ArticleDOI
Conversion schemes in residue code
R.K. Arora,Saroj Kaushik +1 more
Reads0
Chats0
TLDR
An implementation scheme involving decoders and residue adders has been suggested to convert input data in fixed radix representation to residue representation and a method dealing with the reverse process is demonstrated.About:
This article is published in Computers & Electrical Engineering.The article was published on 1982-01-01. It has received 3 citations till now.read more
Citations
More filters
Journal ArticleDOI
Improved variable-entered Karnaugh map procedures
TL;DR: In this paper, an improved variable-entered Karnaugh map (VEKM) procedure for obtaining the minimal disjunctive form of a switching function and a dual procedure to obtain its minimal conjunctive form are presented.
Journal ArticleDOI
Implementation schemes for basic modular operations
Saroj Kaushik,R.K. Arora +1 more
TL;DR: The general schemes for implementing the basic modular operations of addition, subtraction and multiplication in the Residue Number System are described and semiconductor logic gates are used in the proposed implementations.
Journal ArticleDOI
Sign detection in residue code
TL;DR: The new approach in this paper completely avoids the expensive process of the mixed radix conversion (MRC), yielding a significant saving in the process time.
References
More filters
Proceedings ArticleDOI
The residue number system
TL;DR: The residue code is probably of little utility for general-purpose computation, but the code has many characteristics which recommend its use for special-purpose computations.
Journal ArticleDOI
On Translation Algorithms in Residue Number Systems
TL;DR: It is shown that relatively simple combinational logic can be used to replace one level of residue addition in translation problems in residue number systems, and the efficiency of the algorithm is studied.
Book
On translation algorithms in residue number systems
TL;DR: In this paper, the conversion from a fixed-base representation to a residue representation can be done using residue adders only, and relatively simple combinational logic can be used to replace one level of residue addition.