Abstract
The selection of special-form moduli and their corresponding primitive roots have been proposed, which provide for a simplified structure of arithmetic devices using number-theoretic transforms. A method for determining moduli has been developed that ensures a minimum number of arithmetic operations when performing the modulo addition and multiplication operations. The structures of special-form modulo adders have been developed and modeled, which make it possible to perform the addition operation as quickly as possible. The modulo adders for the Fermat, Mersenne, and Golomb numbers have been synthesized and tested, which could be used in the arithmetic units of high-speed correlators and filters. Real-time correlation and convolution calculation become a rather time-consuming task in the case of long input sequences. To solve this task, it is advisable to apply the so-called fast algorithms. However, this requires the high-performance calculators of convolution and correlation, which often exceed the capabilities of modern computer equipment, Therefore, the proposed procedure for determining the modulus, as well as the designed structural circuits for special-form modulo adders, make it possible to accelerate the computation of correlations and convolutions using number-theoretic transforms. Since the operation of modulo multiplication is performed using the addition and shift operations, the complexity of calculating the number-theoretic transformations largely depends on the number of unities in the binary representation of the degrees of the primitive root. The operation of multiplication is typically reduced to the multiple addition of numbers, which is why the complexity and speed performance of arithmetic devices for numeric-theoretic transformations is determined by the characteristics of the modulo adders. The proposed method for designing computing moduli for the digital devices that calculate correlation and convolution, based on rapid theoretical-numerical transformations, provides the simplified hardware and software implementation of these structures, resulting in high-speed processing of signals and images
Highlights
The tasks of estimating correlation functions and convolution computing c arise in various fields of digital signal processing
It is advisable to use the socalled fast algorithms. This requires the high-performance calculator of convolutions and correlations, which often exceed the capabilities of current computer equipment. This task can be solved by the hardware implementation based on programmable logic integrated circuits (PLIC)
A procedure has been proposed for choosing the optimal moduli for calculating number-theoretic transforms (NTT), which could make it possible to increase by two times, and larger, the number of moduli for NTT, as well as to better adjust the NTT processor parameters for specific requirements for accuracy and performance speed
Summary
The tasks of estimating correlation functions and convolution computing c arise in various fields of digital signal processing. Real-time correlation and convolution calculation become a rather time-consuming task in the case of long input sequences To solve this task, it is advisable to use the socalled fast algorithms. It is advisable to use the socalled fast algorithms This requires the high-performance calculator of convolutions and correlations, which often exceed the capabilities of current computer equipment. This task can be solved by the hardware implementation based on programmable logic integrated circuits (PLIC). There are known examples of the hardware implementation of correlation and convolution processors on PLICs [1] They do not fully use the capabilities of mathematical methods for accelerating computations
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Eastern-European Journal of Enterprise Technologies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
