Issue No. 01 - January (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.363406
<p><it>Abstract—</it>Systolic array architectures for self-organizing linear lists under the transpose update heuristic are presented. The first model has linear delay and restricts input on every other system cycle. The second system combines a systolic array with trees to provide logarithmic delay and input on every clock cycle. These preliminary designs can be the basis of hardware used to achieve high-speed lossless data compression for data communication and storage. On large files (greater than 40 kilobytes), our designs provide better compression than other systolic list compression schemes.</p><p><it>Index Terms—</it>Self-organizing lists, transpose, systolic array, dictionary compression, lossless data compression</p>
D. S. Hirschberg and L. M. Stauffer, "Systolic Self-Organizing Lists Under Transpose," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 102-105, 1995.