High Speed Algorithm for Number Sign Detection in Residue Number System Based on Akushsky Core Function

High Speed Algorithm for Number Sign Detection in Residue Number System Based on Akushsky Core Function

Lutsenko V.V. (NCFU, Stavropol, Russia)
Geryugova A.E. (NCFU, Stavropol, Russia)
Babenko M.G. (NCFU, Stavropol, Russia)

Abstract

This paper proposes a high-speed algorithm for sign detection in the residue number system based on the Akushsky core function. The method utilizes a set of moduli {2^n-1,2^(n+1)-1,2^(n+a) } to efficiently determine the sign of a number. Key advantages include reduced operand sizes and replacement of costly modulo operations with efficient bitwise manipulations. Experimental results show that the Akushsky core function-based approach outperforms the traditional method, achieving an average speedup of 25.6%. The algorithm shows consistent performance across all tested bit widths, making it particularly suitable for applications requiring high-speed residue number system arithmetic, such as digital signal processing and cryptography.

Keywords

residue number system; high performance computing; Akushsky core function; sign detection.

Edition

Proceedings of the Institute for System Programming, vol. 38, issue 3, part 2, 2026, pp. 15-32

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

DOI: 10.15514/ISPRAS-2026-38(3)-19

For citation

Lutsenko V.V., Geryugova A.E., Babenko M.G. High Speed Algorithm for Number Sign Detection in Residue Number System Based on Akushsky Core Function. Proceedings of the Institute for System Programming, vol. 38, issue 3, part 2, 2026, pp. 15-32 DOI: 10.15514/ISPRAS-2026-38(3)-19.

Full text of the paper in pdf Back to the contents of the volume