Abstract
SummaryThe new Mersenne number transform (NMNT) can be realized by the fast Fourier transform (FFT) with power‐of‐two length, which results in great flexibility in real‐world fixed‐point computations, such as the convolution‐based signal processing in the embedded device. Yet the FFT realization exists the truncation errors and in order to further reduce the computations, this paper puts forward a novel realization structure for the NMNT, where the Walsh‐Hadamard transform (WHT) is employed to accelerate the NMNT computation. Moreover, we also propose the refined computing structure using the matrix decomposition and multiple constant multiplication (MCM), and then all multiplications can be replaced by the shift‐addition operations without precision loss. Besides, the use of lookup table (LUT) to reduce the complexity is also discussed in our study. A typical convolution application is tested by computer simulations, while the result demonstrates that the proposed scheme produces precise computing results with reduced complexity.
Sign-in/Register to access full text options 
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: International Journal of Circuit Theory and Applications
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.
