New Adder-Based RNS-to-Binary Converters for the {2n+1+1, 2n+1-1, 2n} Moduli Set. (29th June 2011)

• Record Type: Journal Article
• Authors: Gbolagade, Kazeem Alagbe
• Other Names: Hu C.-C. Academic Editor.; Szolgay P. Academic Editor.
• Is Part Of: ISRN signal processing. Volume 2011(2011)
• Publication Date: 2011-06-29
• Subjects: Signal processing -- Periodicals; Signal processing; Periodicals; 621.3822
• DOI: 10.5402/2011/272768
• Languages: English
• ISSNs: 2090-5041

Abstract

Abstract : We investigate Residue Number System (RNS) to binary conversion, which is an important issue concerning the utilization of RNS numbers in Digital Signal Processing (DSP) applications. We propose two new reverse converters for the moduli set{ 2 n + 1 + 1, 2 n + 1 - 1, 2 n } . First, we simplify the Chinese Remainder Theorem (CRT) to obtain a reverse converter that uses mod-( 2 n + 1 - 1 ) operations instead of mod-( 2 n + 1 + 1 ) ( 2 n + 1 - 1 ) operations required by other state-of-the-art equivalent converters. Next, we further reduce the hardware complexity by making the resulting reverse converter architecture adder based. Two hybrid Cost-Efficient (CE) and Speed-Efficient (SE) reverse converters are proposed. These two hybrid converters are obtained by combining the best state-of-the-art converter with the newly introduced area-delay efficient scheme. The proposed hybrid CE converter outperforms the best state-of-the-art CE converter in terms of delay with similar area cost. Additionally, the proposed hybrid SE converter requires less area cost with smaller delay when compared to the best state-of-the-art equivalent SE converter.