High-speed real-time processing arithmetic entropy coding system based on JPEG2000

Abstract

The invention discloses a high-speed real-time processing arithmetic entropy coding system based on JPEG2000, mainly solving the problem that the traditional coding system has high complexity and low coding speed. The coding system comprises a probability interval value predictor, a code value predictor, a code stream cache and an output selector, wherein the probability interval value predictor judges the type of a coded identification according to input dual context code pairs and sends an updated probability interval value and a code necessary parameter to the code value predictor; the code value predictor updates the code value, judges a current uniformization type, selects different uniformization processors for uniformization operation, respectively caches four types of code streams into the code stream cache according to bytes, and sequentially serially outputs the parallel input code streams according to a special priority order through the output selector. The invention has the advantages of high coding speed and low complexity and can be used for image compression coding of various high-speed digital equipment, particularly for the coding of a high-speed real-time satellite remote sensing image.

Description

technical field [0001] The invention belongs to the technical field of image processing and relates to compression coding, in particular to an arithmetic entropy coding system involving high-speed real-time processing, which is used for image compression coding of various digital devices, especially high-speed real-time satellite image compression coding. Background technique [0002] With the development of multimedia and network technology and its application in medical imaging, remote sensing images and digital image / video transmission, the existing still image compression standard JPEG can no longer meet the requirements of current practical applications. In November 2000, a new still image compression standard JPEG2000 was formulated. One of the core technologies of this standard is to use the arithmetic entropy coding method to encode the data after wavelet transformation, so as to realize the compression processing of image data. [0003] The basic coding process of ...

AI Technical Summary

Problems solved by technology

[0009] The fourth is the arithmetic given in the article "A Dual-Symbol Coding Arithmetic Coder Architecture Design for High Speed ​​EBCOTCoding Engine in JPEG2000" published by Xu Chao at the 2005 Int.Conf.Image Process. (ICIP'05) International Conference Entropy coding structure, which can achieve a single clock to process 2 context symbol pairs when different contexts are input, but when the same context is input, the coding structure cannot process simultaneously

Although this structure can realize parallel processing of double-context symbol pairs, there are many storage bits in the corresponding structure, which causes certain difficulties in chip design and the implementation complexity is too high

[0011] The sixth is the article "VLSI implementation of a high-speed MQ encoder suitable for JPEG2000" published by some domestic scholars such as Hua Lin and others in the journal "Research and Progress in Solid State Electronics" in 2003 (Volume 23, 2003 , No. 4, pp. 421-426) gives the arithmetic entropy coding structure, which adopts dynamic pipeline technology, and the processing speed is 0.625 context symbol pairs processed by a single clock, and the coding speed is low

[0012] The seventh is the article "VLSI Design of a High-Speed ​​and Area-Efficient JPEG2000Encoder" published by Mei Kuizhi et al. in the 2007 IEEE Trans.on Circuits and System for VideoTechnology journal (Volume 17, Issue 8, 2007 , pp. 1065-1078) gives the arithmetic entropy coding structure, which adopts multi-input synchronous pipeline technology to realize arithmetic entropy coding, and the processing speed is 0.625 context symbol pairs processed by a single clock, and the coding speed is low

[0013] The above seven high-speed arithmetic entropy coding hardware implementation structures have the following defects: if the implementation complexity is low, the processing speed is also low, such as structures 6 and 7; if the processing speed is increased, the implementation complexity increases sharply, such as structure one to five

Images