Number systems in modular rings and their applications to "error-free" computations
The article introduces and explores new systems of parallel machine arithmetic associated with the representation of data in the redundant number system with the basis, the formative sequences of degrees of roots of the characteristic polynomial of the second order recurrence. Such number systems ar...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Samara National Research University
2019-10-01
|
| Series: | Компьютерная оптика |
| Subjects: | |
| Online Access: | http://computeroptics.ru/KO/PDF/KO43-5/430522.pdf |
| Summary: | The article introduces and explores new systems of parallel machine arithmetic associated with the representation of data in the redundant number system with the basis, the formative sequences of degrees of roots of the characteristic polynomial of the second order recurrence. Such number systems are modular reductions of generalizations of Bergman's number system with the base equal to the "Golden ratio". The associated Residue Number Systems is described. In particular, a new "error-free" algorithm for calculating discrete cyclic convolution is proposed as an application to the problems of digital signal processing. The algorithm is based on the application of a new class of discrete orthogonal transformations, for which there are effective “multipication-free” implementations. |
|---|---|
| ISSN: | 0134-2452 2412-6179 |