Abstract
Proposed is a scaled zero coefficient-aware fast inverse discrete cosine transform (IDCT) algorithm that substantially outperforms the existing fixed-point 8×8 IDCT standard. The concept of the fixed-point approximation with accurate dyadic terms is applied to the zero coefficient-aware IDCT algorithm, improving the computational complexity of the authors' previous work. The experimental results show that the running time of the proposed scaled zero coefficient-ware algorithm is faster than that of the fixed-point 8×8 IDCT standard by a speed-up factor of 2.0 times on average and up to 2.6 times for the HD sequences.
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.
