Data compression in hardware - The Burrows-Wheeler Approach

Proceedings of the 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2010

Volumn , Issue , 2010, Pages 60-65

  Arming, S ^a   Fenkhuber, R ^a   Handl, T ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK SIZES; BURROWS-WHEELER TRANSFORM; COMPRESSION ALGORITHMS; COMPRESSION RATES; COMPRESSION SYSTEM; DIGITAL APPLICATIONS; HARDWARE IMPLEMENTATIONS; SOFTWARE IMPLEMENTATION;

HARDWARE; WAVELET TRANSFORMS;

DATA COMPRESSION;

EID: 77954930790     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DDECS.2010.5491817     Document Type: Conference Paper

References (22)

1. D. Adjeroh, T. Bell, and A. Mukherjee, The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. New York: Springer-Verlag, 2008.
2. P. Flicek and E. Birney, "Sense from sequence reads: methods for alignment and assembly," Nature Methods, vol. 6, no. 11s, pp. S6-S12, Nov. 2009.
3. J. Seward. (1996-2007). [Online]. Available: http://www.bzip.org
4. P. Fenwick, "Burrows-Wheeler compression: Principles and reflections," Theor. Comp. Sci., vol. 387, no. 3, pp. 200-219, 2007.
5. H. Kaplan and E. Verbin, "Most Burrows-Wheeler based compressors are not optimal," Lecture Notes in Comput. Sci., vol. 4580, p. 107, 2007.
6. J. Nunez and S. Jones, "Gbit/s lossless data compression hardware," IEEE Trans. VLSI Syst., vol. 11, no. 3, pp. 499-510, June 2003.
7. S. J. Puglisi, W. F. Smyth, and A. H. Turpin, "A taxonomy of suffix array construction algorithms," ACM Comput. Surv., vol. 39, no. 2, p. 4, Jun. 2007.
8. M. Schindler, "A fast block-sorting algorithm for lossless data compression," in Proc. Data Compression Conference (DCC'97), Snowbird, UT, USA, Mar. 1997, p. 469.
9. S. Burkhardt and J. Kärkkäinen, "Fast lightweight suffix array construction and checking," Lecture Notes in Comput. Sci., vol. 2676, pp. 55-69, 2003.
10. G. Nong and S. Zhang, "Efficient algorithms for the inverse sort transform," IEEE Trans. Comput., vol. 56, no. 11, pp. 1564-1574, 2007.
11. M. Schindler, "Method and apparatus for sorting data blocks," U.S. Patent 6,199,064, Mar. 6, 2001.
12. -. (2000). [Online]. Available: http://www.compressconsult.com/st/
13. A. Mukherjee, N. Motgi, J. Becker, A. Friebe, C. Habermann, and M. Glesner, "Prototyping of efficient hardware algorithms for data compression in future communication systems," Rapid System Prototyping, 12th International Workshop on, pp. 58-63, 2001.
14. A. Mukherjee, Introduction to nMOS & VLSI systems design. Upper Saddle River, NJ, USA: Prentice-Hall, 1986.
15. D. E. Knuth, The art of computer programming. Vol. 3, Sorting and Searching. Reading, MA: Addison-Wesley, 1973.
16. J. Martinez, R. Cumplido, and C. Feregrino, "An FPGA-based parallel sorting architecture for the Burrows Wheeler transform," in Proc. International Conference on Reconfigurable Computing and FPGAs. (ReConFig'05)., Sep. 2005.
17. V. Z. Grajeda, C. F. Uribe, and R. A. C. Parra, "Hardware/software processing architecture for statistical data compression algorithms," Master's thesis, Instituto Nacional de Astrofísica, Óptica y Electrónica, Tonantzintla, Puebla, México, Nov. 2005.
18. D. Baron, "Fast parallel algorithms for universal lossless source coding," Ph.D. dissertation, University of Illinois at Urbana-Champaign Champaign, IL, USA, 2003.
19. D. Baron and Y. Bresler, "Antisequential suffix sorting for BWT-based data compression," IEEE Trans. Comput., vol. 54, no. 4, pp. 385-397, Apr. 2005.
20. G. Manzini, "An analysis of the burrows - wheeler transform," J. ACM, vol. 48, no. 3, pp. 407-430, 2001.
21. P. Fenwick, "Block sorting text compression-final report," New Zealand, Tech. Rep. 130, 1996.
22. T. Bell, M. Powell, J. Horlor, and R. Arnold. (1997) The Canterbury corpus. [Online]. Available: http://www.corpus.canterbury.ac.nz