kernelParserDecoderTop¶
Overview¶
This API is decoder supports the ‘Sequential DCT-based mode’ of ISO/IEC 10918-1 standard. It is a high-performance implementation based-on Xilinx HLS design methodolygy. It can process 1 Huffman token and create 1 non-zero symbol coeffiectsi (before iDCT) within one cycle. It is also an easy-to-use decoder as it can direct parser the JPEG file header without help of software functions.
As an independent IP, L1 API is the key circuit of L2 API, which achieve the JPEG parser and Huffman decoder, without the IDCT module achieved in L2. L2 API runs as a kernel demo, which can also show the overall performance of the circuit.
It can be seen from the benchmark of the API that the decoding speed of huffman decoder(L1 IP) is usually faster than that of iDCT(in L2 kernel). In practical applications, jpeg decoder is often used as the front module of the entire codec board.
Implemention¶
The input JPEG and output Features:
Table 1 : JPEG huffman Decoder Features
| jpegHuffmanDecoder | Status |
|---|---|
| Input | support JPEG that scaned by baseline sequential processing 8-bit precision |
| Output | non-zero symbol coeffiects and run length with the mcu scan order |
| Output info | Image width, image height, scan format 420,422,444 quantization tables, number of mcu, other details… the reason for the decoding error if there is |
| performance | decode one Huffman symbol in 1 cycle Output YUV raw data 8 Byte per cycle with the mcu scan order |
The algorithm implemention is shown as the figure below:
Figure 2 : JPEG Decoder architecture on FPGA
As we can see from the figure:
The design uses the special statistical characteristics of jpeg compression, that is, in most cases, the (huffman length + value length) is less than 15, and each clock cycle can solve a huffman symbol.