CRTf-based reverse converter for RNS with low-cost modules { 2n, 2n- 1, 2n + 1- 1 }
In this paper, we propose a reverse converter from the balanced Residue Number System (RNS) with low-cost moduli set {2^n, 2^n−1, 2^(n + 1)−1} to the Binary Number System (BNS). The proposed method is based on the Chinese remainder theorem with fractions (CRTf) for the reverse conversion device. Con...
Сохранить в:
Главные авторы: | Bergerman, M. V., Бергерман, М. В., Lyakhov, P. A., Ляхов, П. А., Semyonova, N. F., Семенова, Н. Ф. |
---|---|
格式: | Статья |
語言: | English |
出版: |
Springer Science and Business Media Deutschland GmbH
2022
|
主題: | |
在線閱讀: | https://dspace.ncfu.ru/handle/20.500.12258/19638 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Design reverse converter for balanced RNS with three low-cost modules
由: Lyakhov, P. A., и др.
出版: (2021) -
Efficient RNS reverse converters for moduli sets with dynamic ranges up to (10 n+ 1) -bit
由: Lyakhov, P. A., и др.
出版: (2018) -
Hardware implementation of the reverse conversion RNS-WNS on FPGA
由: Nazarov, A. S., и др.
出版: (2021) -
A high-speed residue-to-binary converter based on approximate Chinese Remainder Theorem
由: Kucherov, N. N., и др.
出版: (2018) -
Performance Analysis of Hardware Implementations of Reverse Conversion from the Residue Number System
由: Kuchukov, V. A., и др.
出版: (2023)