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...
Guardado en:
Autores principales: | , , , , , |
---|---|
Formato: | Статья |
Lenguaje: | English |
Publicado: |
Springer Science and Business Media Deutschland GmbH
2022
|
Materias: | |
Acceso en línea: | https://dspace.ncfu.ru/handle/20.500.12258/19638 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|