Abstract
Prime factor fast algorithms are computationally efficient for various discrete transforms. However, they generally need an index mapping process to convert a one-dimensional input sequence into a two-dimensional array, which results in a substantial computational overhead and an irregular computational structure. The author attempts to minimise the computational overhead by a simple and general mapping procedure.
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 callDisclaimer: 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.
