Abstract:The fast Fourier transform (FFT) based on modular arithmetic can compute convolution without round-off errors, which is desirable in many applications such as computational algebra and combinatory pattern matching. One of the critical challenges of the FFT is to enhance the performance. An effective approach is to optimize the high-cost operations. Modular reduction is one of the most frequently used high-cost operations that is a bottleneck of the FFT using modular arithmetic. In this article, we present thre… Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.