Abstract
Efficient algorithms, based on prime factor decomposition, for the calculation of the discrete cosine transform (DCT) and the discrete sine transform (DST) are presented. The proposed algorithms are an extension to the previously published algorithms and include corrections to inaccuracies found therein. Two hardware architectures, based on the proposed algorithms, are presented and shown to be superior, in terms of complexity, throughput and latency, to the existing hardware implementations.
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.