This paper proposes an algorithm that is based on the application of Algebraic Integer (AI) representation of numbers on
the AAN fast Inverse Discrete Cosine Transform (IDCT) algorithm. AI representation allows for maintaining an error-free
representation of IDCT until the last step of each 1-D stage of the algorithm, where a reconstruction step from the AI
domain to the fixed precision binary domain is required. This delay in introducing the rounding error prevents the
accumulation of error throughout the calculations, which leads to the reported high-accuracy results. The proposed
algorithm is simple and well suited for hardware implementation due to the absence of computationally extensive
multiplications. The obtained results confirm the high accuracy of the proposed algorithm compared to other fixed-point
implementations of IDCT.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.