A method of paired zeroing of numbers in a residue system
The paper studies the problem of determining the lower boundary of number correction speed in computing systems operating in the basis of non-positional arithmetic of residual classes. The topicality of the problem is necessitated by the search of methods allowing reducing the time for digital proce...
Sparad:
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Статья |
| Språk: | English |
| Publicerad: |
Institute of Physics Publishing
2020
|
| Ämnen: | |
| Länkar: | https://www.scopus.com/record/display.uri?eid=2-s2.0-85077777794&origin=resultslist&sort=plf-f&src=s&st1=A+method+of+paired+zeroing+of+numbers+in+a+residue+system&st2=&sid=454db2659ff8ab2825719fcf6f897454&sot=b&sdt=b&sl=72&s=TITLE-ABS-KEY%28A+method+of+paired+zeroing+of+numbers+in+a+residue+system%29&relpos=0&citeCnt=0&searchTerm= https://dspace.ncfu.ru/handle/20.500.12258/11214 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
| Sammanfattning: | The paper studies the problem of determining the lower boundary of number correction speed in computing systems operating in the basis of non-positional arithmetic of residual classes. The topicality of the problem is necessitated by the search of methods allowing reducing the time for digital processing of signals in non-positional neuroprocessors. The study considers several variants of error correction with a single and multiple control bases of the residue system. The calculations were performed that allowed determining the time necessary for zeroing operation. The method of paired zeroing of numbers in a system of residual classes was modified. It was demonstrated that the suggested solutions allow appreciably reducing the time consumption by digital processing of signals in neuroprocessors destined for operations of summation and multiplication |
|---|