Residue to binary converter for the extended four moduli set {2k, 2n−1, 2n+1, 2n+1+1} for n odd

In this paper, we describe a two-stage reverse converter for the four moduli superset {2 k , 2 n −1, 2 n +1, 2 n +1 +1} for n ≤ k  ≤ 2 n . In the first stage, a three moduli converter based on Chinese remainder theorem (CRT) is used for the subset {2 k , 2 n −1, 2 n +1} to obtain the decoded number....

Full description

Saved in:
Bibliographic Details
Published in:Sadhana (Bangalore) 2023-04, Vol.48 (2), Article 66
Main Authors: Latha, M V N Madhavi, Rachh, Rashmi Ramesh, Mohan, P V Ananda
Format: Article
Language:English
Subjects:
Engineering
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we describe a two-stage reverse converter for the four moduli superset {2 k , 2 n −1, 2 n +1, 2 n +1 +1} for n ≤ k  ≤ 2 n . In the first stage, a three moduli converter based on Chinese remainder theorem (CRT) is used for the subset {2 k , 2 n −1, 2 n +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 (2 n +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 .
ISSN:0973-7677
0973-7677
DOI:10.1007/s12046-023-02118-y