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...
Gardado en:
| Главные авторы: | , , , , , |
|---|---|
| Formato: | Статья |
| Idioma: | English |
| Publicado: |
Springer Science and Business Media Deutschland GmbH
2022
|
| Темы: | |
| Acceso en liña: | https://dspace.ncfu.ru/handle/20.500.12258/19638 |
| Метки: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|