Open AccessLossless Compression Algorithm and Architecture for Reduced Memory Bandwidth Requirement with Improved Prediction Based on the Multiple DPCM Golomb-Rice Algorithm
Author(s) -
Imjae Hwang,
Juwon Yun,
Woonam Chung,
Jaeshin Lee,
Cheong-Ghil Kim,
YoungSik Kim,
Woo-Chan Park
Publication year - 2021
Publication title -
journal of web engineering/journal of web engineering on line
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.151
H-Index - 13
eISSN - 1544-5976
pISSN - 1540-9589
DOI - 10.13052/jwe1540-9589.2065
Subject(s) - golomb coding , lossless compression , computer science , pulse code modulation , algorithm , bandwidth (computing) , data compression , image compression , bandwidth extension , computer hardware , parallel computing , digital signal processing , image processing , telecommunications , artificial intelligence , transmission (telecommunications) , image (mathematics) , audio signal
In a computing environment, higher resolutions generally require more memory bandwidth, which inevitably leads to the consumption more power. This may become critical for the overall performance of mobile devices and graphic processor units with increased amounts of memory access and memory bandwidth. This paper proposes a lossless compression algorithm with a multiple differential pulse-code modulation variable sign code Golomb-Rice to reduce the memory bandwidth requirement. The efficiency of the proposed multiple differential pulse-code modulation is enhanced by selecting the optimal differential pulse code modulation mode. The experimental results show compression ratio of 1.99 for high-efficiency video coding image sequences and that the proposed lossless compression hardware can reduce the bus bandwidth requirement.