Abstract

DCT/IDCT based source coding and decoding techniques are widely accepted in HDTV systems and other MPEG based applications. We propose a new direct 2-D IDCT algorithm based on the parallel divide-and-conquer approach. The algorithm distributes computation by considering one transformed coefficient at a time and doing partial computation and updating as every coefficient arrives. A novel parallel and fully pipelined architecture with an effective processing time of one cycle per pixel for an N/spl times/N size block is designed to implement the algorithm. An unique feature of the architecture is that it integrates inverse-shuffling, inverse-quantization, inverse-source-coding and motion-compensation into a single compact data-path. The entire block of pixel values are sampled in a single cycle for post processing after decompression. We use only (N/2(N/2+1))/2 multipliers and N/sup 2/ adders. The configuration of the adders is such that motion compensation is realized in a single cycle following decompression. >

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 call

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.