Lossless Compression Algorithm and Architecture for Reduced Memory Bandwidth Requirement with Improved Prediction Based on the Multiple DPCM Golomb-Rice Algorithm

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 bandwidt...

Full description

Saved in:
Bibliographic Details
Published inJournal of web engineering Vol. 20; no. 6; p. 1813
Main Authors Hwang, Imjae, Yun, Juwon, Chung, Woonam, Lee, Jaeshin, Kim, Cheong-Ghil, Kim, Youngsik, Park, Woo-Chan
Format Journal Article
LanguageEnglish
Published Milan River Publishers 13.10.2021
Subjects
Online AccessGet full text
ISSN1540-9589
1544-5976
DOI10.13052/jwe1540-9589.2065

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1540-9589
1544-5976
DOI:10.13052/jwe1540-9589.2065