A Reverse Converter for Three-Moduli Set (2k, 2n - 1, 2n + 1), k < n
Ahmad Hiasat · 2019 IEEE Jordan International Joint Conference on Electrical Engineering and Information Technology (JEEIT) · 2019
This work proposes a new residue-representation to binary-representation arithmetic converter for the three-moduli set (2k, 2n- 1, 2n+ 1), k <; n, where n and k are positive integers such that 1 <; k <; n. The proposed reverse conversion algorithm uses the Chinese-Reminder-Theorem. The paper also introduces the multiplicative inverses needed to implement the conversion process. The structure suggested in this paper is more efficient than other similar recently proposed structure. Based on VLSI layout simulation results, the proposed structure has a better area, time and power performance by 22.5%, 24.6%, and 20.5%, respectively, when compared with the competitive structure.