An universal input and output RNS converter

Meehan, S.; O'Neil, Sean; Vaccaro, J.J.

doi:10.1109/31.55037

Cited by 28 publications

(11 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In such cases, smaller radix designs tend to be attractive, wherein, the proposed computational techniques are believed to be effective. Note that we have also described a faster implementation of the binary-to-RNS conversion algorithm of Meehan et al [9], taking more bits in a step.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Fast Algorithms for Implementation of Montgomery's Modular Multiplication Technique

Mohan

2004

Circuits Syst Signal Process

View full text Add to dashboard Cite

In this paper, algorithms for fast implementations of Montgomery's modular multiplication algorithm are proposed. These algorithms use nonredundant multibit recoding. Two techniques, one based on multiplication followed by estimation of scaled residue and the other involving integrated multiplication with scaled residue estimation, have been considered in detail. Techniques for simplifying the computation to estimate the multiple of the modulus to be added have been described. The area and computation time requirements of the proposed techniques are estimated for a general radix in order to highlight the timespace trade-offs.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Next, (A · B · 2 −n ) mod M is evaluated. The latter can be considered to be the binary-to-scaled residue conversion problem addressed in residue number system (RNS)-based digital signal processors [1], [9]. Evidently, the word length of the product is 2n bits.…”

Section: Introductionmentioning

confidence: 99%

Fast Algorithms for Implementation of Montgomery's Modular Multiplication Technique

Mohan

2004

Circuits Syst Signal Process

View full text Add to dashboard Cite

show abstract

“…The most commonly used R/B conversion algorithms are CRT, MRC, or their derivations [16][17][18][19], among which MRC is a recursive processing. When the number of moduli is large, and the magnitudes of moduli are small while the scaling factor is large, the processing latency will be pretty long with MRC.…”

Section: Conversion For the N Lsbsmentioning

confidence: 99%

A 2 n scaling scheme for signed RNS integers and its VLSI implementation

et al. 2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

High efficient implementation of scaling in residue number system (RNS) is one of the critical issues for the applications of RNS in digital signal processing (DSP) systems. In this paper, an efficient scaling algorithm for signed integers in RNS is proposed firstly through introducing a correction constant in negative integers scaling procedure. Based on the proposed scaling algorithm, an efficient RNS 2 n scaling implementation method is presented, in which Chinese remainder theorem (CRT) and a redundant modulus are used to perform the base extension to obtain the least significant n bits of RNS integers. With the redundant modulus, the RNS sign detection can be achieved by the parity detection. And then, an approach to update the residue digit of the redundant channel is also proposed. Meanwhile, this paper provides a method of computing the correction constant of the redundant channel in negative integers scaling. The analysis results indicate that the complexity of the proposed scaling algorithm grows linearly with the word-length of the RNS dynamic range without using Look-up Table (LUT). Furthermore, the proposed algorithm is employed for a specific moduli set 2 n scaling. The synthesis results show that the critical path of the proposed algorithm is shortened by 12%, the area and power consumption performance is improved by about 35%, compared to the existing cascading 2 n scaling method for very large scale integration (VLSI) implementation under the same restriction. Besides, the VLSI layout indicates that the parallel structure is simpler. CitationMa S, Hu J H, Ye Y L, et al. A 2 n scaling scheme for signed RNS integers and its VLSI implementation.

show abstract

“…The New CRT II [9] is the most representative among the algorithms based on CRT [9,18,[20][21][22]. The converter based on the New CRT II can use arbitrary moduli set.…”

Section: Comparison With the New Crt IImentioning

confidence: 99%

“…The New CRT II proposed by Wang [9] reduces the modular size to not more than √ M and is applied to converters using arbitrary moduli sets. The converter using restricted moduli set proposed by Conway [17] is based on Meehan's algorithm [18]; it only requires the operations modulo each modulus of the moduli set. The drawback of Conway's converters is that a large-size multiplier is needed to obtain the conversion result at the last stage.…”

Section: Introductionmentioning

confidence: 99%

Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

Chen

Yao

2010

Sci. China Inf. Sci.

View full text Add to dashboard Cite

The conversion from residue to weighted binary representation plays an important role in the residue number system. Based on Chinese Remainder Theorem, a new residue-to-binary converter using arbitrary moduli set is proposed. The new converter uses the difference-correction algorithm for the conversion output and eliminates the modulo M operation, where M is the dynamic range of the residue number system. The sizes of the multipliers and modular multipliers in the new converter are small, thereby reducing the area and delay of the proposed converter. Simulation and synthesis results indicate that the new converter is more area-time efficient than the published converters based on Chinese Remainder Theorem.

show abstract

An universal input and output RNS converter

Cited by 28 publications

References 2 publications

Fast Algorithms for Implementation of Montgomery's Modular Multiplication Technique

Fast Algorithms for Implementation of Montgomery's Modular Multiplication Technique

A 2 n scaling scheme for signed RNS integers and its VLSI implementation

Efficient CRT-based residue-to-binary converter for the arbitrary moduli set

Contact Info

Product

Resources

About