Abstract
A matrix method is proposed for constructing a simple order-32 integer cosine transform. Based on the method, a one-norm simple order-32 integer transform is constructed and its fast algorithms of low computational complexity are developed that require only integer operations and whose computational complexity is 4.9 times less than that of well-known algorithms and is 21.6 times less than that of the standard H.265. This transform is close to the discrete cosine transform and has good coding performance.
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.
