Fast Sign Detection Algorithm for the RNS Moduli Set {2n+1 − 1, 2n − 1, 2n} - 2014 PROJECT TITLE: Fast Sign Detection Algorithm for the RNS Moduli Set {2n+1 − 1, 2n − 1, 2n} - 2014 ABSTRACT: Sign arithmetic is ineluctable in Digital Signal Processing algorithms. Due to the way signed integer is represented in Residue Number System (RNS), sign detection has been a difficult operation similar to the residue-to-binary conversion. In this project, a new sign detection method for the three moduli set RNS {2n, 2n-1, 2n +1} is proposed. It leverages the one complement and circular left shift properties of modulo 2n and 2n±1 arithmetic in the new modified Chinese Remainder Theorem for sign detection. Compared with the sign detector based on the most efficient reverse conversion algorithm, our proposed sign detector saves on average 24.5% of area and accelerates the computation by 45.6% for n = 5, 10, 15, 20. Did you like this research project? To get this research project Guidelines, Training and Code... Click Here facebook twitter google+ linkedin stumble pinterest Efficient Integer DCT Architectures for HEVC - 2014 Fault Tolerant Parallel Filters Based on Error Correction Codes - 2014
