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...
保存先:
主要な著者: | , , , , , |
---|---|
フォーマット: | Статья |
言語: | English |
出版事項: |
Springer Science and Business Media Deutschland GmbH
2022
|
主題: | |
オンライン・アクセス: | https://dspace.ncfu.ru/handle/20.500.12258/19638 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|