Proc. of Int. Conf. on Advances in Computer Science 2010
involved in building and searching strings in the dictionary. Some applications may not work well with the time required to compress the data. If the data is the right fit and your system can tolerate the time required to run the algorithm, the LZW compression algorithm might be the right fit for your application. ACKNOWLEDGMENT The authors wish to thank A, B, C. This work was supported in part by a grant from XYZ.
© 2010 ACEEE DOI: 02.ACS.2010.01.145
REFERENCES [1] New LZW Data Compression Algorithm and its FPGA implementation Wei Cui [2] Embedded.com The official cite for embedded development community [3] Dipankar Das, Rajeev Kumar, and P.P. Chakrabarti. Dictionary based codecompression for variable length instruction encodings. In Proceedings of VLSI Design (VLSID), pages 545– 550, 2005. [4] C. Lin, Y. Xie, and W. Wolf. Lzw-based code compression for vliw embedded systems. In Proceedings of Design Automation and Test in Europe (DATE), pages 76–81, 2004 [5] J. Prakash, C. Sandeep, P. Shankar, and Y. Srikant. A simple and fast scheme for code compression for vliw processors. In Proceedings of Data Compression Conference (DCC), page 444,2003.
212