- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
High-speed hardware algorithms for Chinese remainder theorem
Description
A residue number system (RNS) is one of the candidates for high-speed digital signal processing, because of its parallelism property with carry-free operation. However, RNS possesses a drawback that it requires time-consuming extra modules, binary to residue (B/R) and residue to binary (R/B) converters. To realize the R/B converter, the Chinese remainder theorem (CRT) are often employed. In hardware realization, the CRT can be reduced to multi-operand modular addition, which has usually been realized as several stages of carry propagate adder (CPA). In this paper, high-speed hardware algorithms for the CRT are proposed. We can reduce a number of CPA stage to one with carry save adders (CSA), and two methods, speed or size intensive versions are shown.
Journal
-
- 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96
-
1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96 2 265-268, 2002-12-23
IEEE