Lossless Compression Algorithm and Architecture for Reduced Memory Bandwidth Requirement with Improved Prediction Based on the Multiple DPCM Golomb-Rice Algorithm
- 13 October 2021
- journal article
- research article
- Published by River Publishers in Journal of Web Engineering
- Vol. 20 (6), 1813-1828
- https://doi.org/10.13052/jwe1540-9589.2065
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Optimized Lossless Embedded Compression for Mobile Multimedia ApplicationsElectronics, 2020
- An Effective Algorithm and Architecture for the High-Throughput Lossless Compression of High-Resolution ImagesIEEE Access, 2019
- Efficient reference frame compression scheme for video coding systems: algorithm and VLSI designJournal of Real-Time Image Processing, 2015
- A New Reference Frame Recompression Algorithm and Its VLSI Architecture for UHDTV Video CodecIEEE Transactions on Multimedia, 2014
- A Lossless Color Image Compression Architecture Using a Parallel Golomb-Rice Hardware CODECIEEE Transactions on Circuits and Systems for Video Technology, 2011