A parallel Huffman coder on the CUDA architecture

Habibelahi Rahmani, Cihan Topal, Cuneyt Akinlar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Citations (Scopus)

Abstract

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 22× speedups compared to the serial CPU implementation without any constraint on the maximum codeword length or data entropy.

Original languageEnglish
Title of host publication2014 IEEE Visual Communications and Image Processing Conference, VCIP 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages311-314
Number of pages4
ISBN (Electronic)9781479961399
DOIs
Publication statusPublished - 27 Feb 2015
Externally publishedYes
Event2014 IEEE Visual Communications and Image Processing Conference, VCIP 2014 - Valletta, Malta
Duration: 7 Dec 201410 Dec 2014

Publication series

Name2014 IEEE Visual Communications and Image Processing Conference, VCIP 2014

Conference

Conference2014 IEEE Visual Communications and Image Processing Conference, VCIP 2014
Country/TerritoryMalta
CityValletta
Period7/12/1410/12/14

Bibliographical note

Publisher Copyright:
© 2014 IEEE.

Keywords

  • CUDA
  • GPGPU
  • Huffman coding
  • JPEG
  • parallel computing
  • variable length coding

Fingerprint

Dive into the research topics of 'A parallel Huffman coder on the CUDA architecture'. Together they form a unique fingerprint.

Cite this