Abstract
The fast polynomial transform (FPT) for computing 2-D cyclic convolutions is modularized into identical modules. In the new method, the 1-D cyclic polynomial convolution is decomposed into cycle convolutions of polynomials, all of the same length. Thus, only FPTs and FFT's of the same length are required. As a consequence, the architecture is more regular and naturally suitable for a VLSI implementation. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Acoustics, Speech, and Signal Processing
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.