A high-speed division algorithm for modular numbers based on the chinese remainder theorem with fractions and its hardware implementation
In this paper, a new simplified iterative division algorithm for modular numbers that is optimized on the basis of the Chinese remainder theorem (CRT) with fractions is developed. It requires less computational resources than the CRT with integers and mixed radix number systems (MRNS). The main idea...
Uloženo v:
| Hlavní autoři: | , , , , , , , , , , , , , |
|---|---|
| Médium: | Статья |
| Jazyk: | English |
| Vydáno: |
MDPI AG
2019
|
| Témata: | |
| On-line přístup: | https://www.scopus.com/record/display.uri?eid=2-s2.0-85063445845&origin=resultslist&sort=plf-f&src=s&st1=%09A+high-speed+division+algorithm+for+modular+numbers+based+on+the+chinese+remainder+theorem+with+fractions+and+its+hardware+implementation&st2=&sid=892029d19f7c728d4bff772c02120f7f&sot=b&sdt=b&sl=153&s=TITLE-ABS-KEY%28%09A+high-speed+division+algorithm+for+modular+numbers+based+on+the+chinese+remainder+theorem+with+fractions+and+its+hardware+implementation%29&relpos=0&citeCnt=0&searchTerm= https://dspace.ncfu.ru/handle/20.500.12258/5079 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
Internet
https://www.scopus.com/record/display.uri?eid=2-s2.0-85063445845&origin=resultslist&sort=plf-f&src=s&st1=%09A+high-speed+division+algorithm+for+modular+numbers+based+on+the+chinese+remainder+theorem+with+fractions+and+its+hardware+implementation&st2=&sid=892029d19f7c728d4bff772c02120f7f&sot=b&sdt=b&sl=153&s=TITLE-ABS-KEY%28%09A+high-speed+division+algorithm+for+modular+numbers+based+on+the+chinese+remainder+theorem+with+fractions+and+its+hardware+implementation%29&relpos=0&citeCnt=0&searchTerm=https://dspace.ncfu.ru/handle/20.500.12258/5079