A low-complexity frame memory compression algorithm and its implementation for MPEG-2 video decoder

An algorithm and its implementation to compress video frame data to be stored in external memory are proposed, thereby enabling a reduction of memory requirements and bandwidth. To support random access capability, frames are organized as 1/spl times/8 fixed-length segments, which are used as compression units. For both compression efficiency and low complexity, modified Hadamard transform (MHT) and Golomb-Rice (GR) coding are utilized. The compression ratio is fixed at 50% and objective and subjective video quality assessments are performed. Efficient ASIC implementation including Golomb-Rice encoding/decoding is also proposed to reduce the total compression/decompression latency time.

[1]  P.H.N. de With,et al.  An MPEG Decoder with Embedded Compression for Memory Reduction , 1998, International 1998 Conference on Consumer Electronics.

[2]  Nasir D. Memon.  Adaptive coding of DCT coefficients by Golomb-Rice codes , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[3]  A. Chimienti,et al.  A Novel Adaptive Vector Quantization Method For Memory Reduction In Mpeg-2 Hdtv Decoders , 1998, International 1998 Conference on Consumer Electronics.

[4]  Peter Pirsch,et al.  Architecture and memory requirements for stand-alone and hierarchical MPEG2 HDTV-decoders with synchronous DRAMs , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[5]  Kyeong Ho Yang,et al.  A fast and memory efficient algorithm for down-conversion of an HDTV bitstream to an SDTV signal , 1999, IEEE Trans. Consumer Electron..

[6]  Anthony Vetro,et al.  Frequency domain down-conversion of HDTV using adaptive motion compensation , 1997, Proceedings of International Conference on Image Processing.