Date: | August 2nd, 2006 |
---|---|
Location: | DC 2303 |
Time: | 12:30 PM |
Chair: | Ed Lank |
Gabriel Esteves, Elodie Fourquet, Tetsugo Inada, Gilad Israeli, Ed Lank, Curtis Luk, Stephen Mann, Michael McCool, Kevin Moule, Mike Terry, Jie Xu
Date: | August 16th | August 23rd | August 30th | September 6th?? |
---|---|---|---|---|
Location: | DC 2303 | DC 1304 | DC 1304 | DC 1304 |
Chair: | Yi Lin |
Robin Liu |
Curtis Luk |
Stephen Mann |
Technical Presentation: |
Gilad Israeli |
Curtis Luk |
Ed Lank |
Yi Lin |
Tetsugo Inada |
Title Compressed Lossless Texture Representation and Caching Abstract
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
|
---|
Also see other Math and CS postings.