An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code,International Journal of Computational Methods

当前位置： X-MOL 学术 › Int. J. Comput. Methods › 论文详情

Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)

An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
International Journal of Computational Methods ( IF 1.7 ) Pub Date : 2019-11-18 , DOI: 10.1142/s0219876220500048
Mikhail Selianinau ₁

Affiliation

The Chinese remainder theorem (CRT), which appeared in ancient China, is widely used in many modern computer applications. This paper presents the CRT implementation by using the interval-index characteristic and minimum redundancy residue code. The proposed algorithm does not use large modulo addition operations and provides low computational complexity compared to conventional non-redundant RNS. The efficiency factors of using the minimally redundant RNS increase with the number [Formula: see text] of non-redundant moduli, asymptotically approaching the threshold [Formula: see text]. The new approach presented here will have a significant impact on many non-modular operations in RNS arithmetic, which currently use the CRT.

更新日期：2019-11-18

点击分享查看原文

点击收藏

阅读更多本刊最新论文本刊介绍/投稿指南

全部期刊列表>>