JPEG compression/decompression via parallel processing

Patrick, J; Sanders, Jerry L.; DeBrunner, L.S.; DeBrunner, V.; Radharkrishnan, S.

doi:10.1109/acssc.1996.601094

Cited by 5 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6], the authors present different hardware architectures for dynamic Huffman coding. Making the Huffman coding faster in the context of JPEG and MPEG encoding is also a widely researched topic [7][8][9][10][11][12].…”

Section: Introductionmentioning

confidence: 99%

A parallel Huffman coder on the CUDA architecture

Rahmani¹,

Topal

Akınlar³

2014

2014 IEEE Visual Communications and Image Processing Conference

View full text Add to dashboard Cite

We present a parallel implementation of the widely-used entropy encoding algorithm, the Huffman coder, on the NVIDIA CUDA architecture. After constructing the Huffman codeword tree serially, we proceed in parallel by generating a byte stream where each byte represents a single bit of the compressed output stream. The final step is then to combine each consecutive 8 bytes into a single byte in parallel to generate the final compressed output bit stream. Experimental results show that we can achieve up to 22x speedups compared to the serial CPU implementation without any constraint on the maximum codeword length or data entropy.

show abstract