We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Residue to binary converter for the extended four moduli set {2<sup>k</sup>, 2<sup>n</sup>−1, 2<sup>n</sup>+1, 2<sup>n+1</sup>+1} for n odd.
- Authors
Latha, M V N Madhavi; Rachh, Rashmi Ramesh; Mohan, P V Ananda
- Abstract
In this paper, we describe a two-stage reverse converter for the four moduli superset {2k, 2n−1, 2n+1, 2n+1+1} for n ≤ k ≤ 2n. In the first stage, a three moduli converter based on Chinese remainder theorem (CRT) is used for the subset {2k, 2n−1, 2n+1} to obtain the decoded number. A second stage obtains the final binary number considering this number and the residue corresponding to the fourth modulus (2n+1+1) using MRC to obtain the final decoded number. Complete architectures is described together with ASIC implementation results as well as comparison with reverse converters described earlier in literature with k = n.
- Subjects
CHINESE remainder theorem; NUMBER systems
- Publication
Sādhanā: Academy Proceedings in Engineering Sciences, 2023, Vol 48, Issue 2, p1
- ISSN
0256-2499
- Publication type
Article
- DOI
10.1007/s12046-023-02118-y