Parallel design for error-resilient entropy coding algorithm on GPU

doi:10.1016/j.jpdc.2012.12.008

2013-04-01

PRE

DOI：10.1016/j.jpdc.2012.12.008

原文链接

原文求助

摘要

En 中文

The error-resilient entropy coding (EREC) algorithm is an effective method for combating error propagation at low cost in many compression methods using variable-length coding (VLC). However, the main drawback of the EREC is its high complexity. In order to overcome this disadvantage, a parallel EREC is implemented on a graphics processing unit (GPU) using the NVIDIA CUDA technology. The original EREC is a finer-grained parallel at each stage which brings additional communication overhead. To achieve high. efficiency of parallel EREC, we propose partitioning the EREC (P-EREC) algorithm, which splits variable-length blocks into groups and then every group is coded using the EREC separately. Each GPU thread processes one group so as to make the EREC coarse-grained parallel. In addition, some optimization strategies are discussed in order to obtain higher performance using the GPU. In the case that the variable-length data blocks are divided into 128 groups (256 groups, resp.), experimental results show that the parallel P-EREC achieves 32x to 123x (54x to 350x, resp.) speedup over the original C code of EREC compiled with the 02 optimization option. Higher speedup can even be obtained with more groups. Compared to the EREC, the P-EREC not only achieves a good speedup performance, but it also slightly improves the resilience of the VLC bit-stream against burst or random errors. (C) 2013 Elsevier Inc. All rights reserved.

Keyword:

P-EREC

EREC

Parallel processing

GPU

CUDA