%0 Conference Paper %1 T.Richter2013 %A Richter, T. %A Simon, S. %B Applications of Digital Image Processing XXXVI %D 2013 %E Tescher, Andrew G. %I SPIE %K %P 14 pages %R 10.1117/12.2022398 %T Comparison of CPU and GPU Based Coding on Low-Complexity Algorithms for Display Signals %U http://spie.org/Publications/Proceedings/Paper/10.1117/12.2022398 %V 8856 %X Graphics Processing Units (GPUs) are freely programmable massively parallel general purpose processing units and thus offer the opportunity to off-load heavy computations from the CPU to the GPU. One application for GPU programming is image compression, where the massively parallel nature of GPUs promises high speed benefits. This article analyzes the predicaments of data-parallel image coding on the example of two high-throughput coding algorithms. The codecs discussed here were designed to answer a call from the Video Electronics Standards Association (VESA), and require only minimal buffering at encoder and decoder side while avoiding any pixel-based feedback loops limiting the operating frequency of hardware implementations. Comparing CPU and GPU implementations of the codes show that GPU based codes are usually not considerably faster, or perform only with less than ideal rate-distortion performance. Analyzing the details of this result provides theoretical evidence that for any coding engine either parts of the entropy coding and bit-stream build-up must remain serial, or rate-distortion penalties must be paid when offloading all computations on the GPU. %@ 9780819497062

@inproceedings{T.Richter2013, abstract = {Graphics Processing Units (GPUs) are freely programmable massively parallel general purpose processing units and thus offer the opportunity to off-load heavy computations from the CPU to the GPU. One application for GPU programming is image compression, where the massively parallel nature of GPUs promises high speed benefits. This article analyzes the predicaments of data-parallel image coding on the example of two high-throughput coding algorithms. The codecs discussed here were designed to answer a call from the Video Electronics Standards Association (VESA), and require only minimal buffering at encoder and decoder side while avoiding any pixel-based feedback loops limiting the operating frequency of hardware implementations. Comparing CPU and GPU implementations of the codes show that GPU based codes are usually not considerably faster, or perform only with less than ideal rate-distortion performance. Analyzing the details of this result provides theoretical evidence that for any coding engine either parts of the entropy coding and bit-stream build-up must remain serial, or rate-distortion penalties must be paid when offloading all computations on the GPU.}, added-at = {2016-03-03T17:45:04.000+0100}, author = {Richter, T. and Simon, S.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/20fa2e309a2cd7a291449888471514bdf/rainerreichel}, booktitle = {Applications of Digital Image Processing XXXVI}, doi = {10.1117/12.2022398}, editor = {Tescher, Andrew G.}, interhash = {1c214f842d3f6bafc3be0b32e40c4d75}, intrahash = {0fa2e309a2cd7a291449888471514bdf}, isbn = {9780819497062}, keywords = {}, month = oct, organization = {SPIE}, pages = {14 pages}, publisher = {SPIE}, timestamp = {2016-03-04T09:57:29.000+0100}, title = {{C}omparison of {CPU} and {GPU} {B}ased {C}oding on {L}ow-{C}omplexity {A}lgorithms for {D}isplay {S}ignals}, url = {http://spie.org/Publications/Proceedings/Paper/10.1117/12.2022398}, volume = 8856, year = 2013 }