Compressed Lossless Texture Representation and Caching
Loading...
Date
2006
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
A number of texture compression algorithms have been proposed to reduce texture storage size and bandwidth requirements. To deal with the requirement for random access, these algorithms usually divide the texture into tiles and apply a fixed rate compression scheme to each tile. Fixed rate schemes are by nature lossy, and cannot adapt to local changes in image complexity. Multiresolution schemes, a form of variable-rate coding, can adapt to varying image complexity but suffer from fragmentation and can only compress a limited class of images. On the other hand, several lossless image compression standards have been established. Lossless compression requires variable-rate coding, and more efficient lossy algorithms also use variable-rate coding. Unfortunately, these standards cannot be used directly as texture compression schemes since they do not allow random access. We present a block-oriented lossless texture compression algorithm based on a simple variable-bitrate differencing scheme. A B-tree index enables both random access and efficient O(1) memory allocation without external fragmentation. Textures in our test suite compressed to between 6% and 95% of their original sizes. We propose a cache architecture designed to support our compression scheme. Cycle-accurate simulation shows that this cache architecture consistently reduces the external bandwidth requirements as well as the storage size without significantly affecting latency.
Description
@inproceedings{:10.2312/EGGH/EGGH06/111-120,
booktitle = {Graphics Hardware},
editor = {Marc Olano and Philipp Slusallek},
title = {{Compressed Lossless Texture Representation and Caching}},
author = {Inada, Tetsugo and McCool, Michael D.},
year = {2006},
publisher = {The Eurographics Association},
ISSN = {1727-3471},
ISBN = {3-905673-37-1},
DOI = {/10.2312/EGGH/EGGH06/111-120}
}