Abstract
An efficient prime factor algorithm for the discrete cosine transform is introduced. In this approach, we formulate the decomposition directly, by using the proposed input and output mapping, and derive a novel in-place address generation scheme, whilst the formulations in the literature require multiple stages or have to be done via the DFT. This approach requires one output index mapping only while the conventional algorithms require two mappings. Hence, by using the proposed mappings and address generation techniques, less temporary storage is required during the computation. A comparison of the address generation time between our approach and the conventional non-in-place approach is also shown.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.