Table of Contents Author Guidelines Submit a Manuscript
Journal of Sensors
Volume 2018, Article ID 6908760, 17 pages
https://doi.org/10.1155/2018/6908760
Research Article

Fast Algorithm of Truncated Burrows-Wheeler Transform Coding for Data Compression of Sensors

1School of Electronic and Information Engineering, South China University of Technology, Guangdong, China
2Zhaoqing Branch, China Telecom Co., Ltd., Guangdong, China
3School of Software, South China University of Technology, Guangdong, China

Correspondence should be addressed to Lu Yiqin; nc.ude.tucs@ulqyee

Received 6 October 2017; Revised 3 February 2018; Accepted 19 February 2018; Published 16 April 2018

Academic Editor: Joon-Min Gil

Copyright © 2018 Qin Jiancheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Burrows and D. J. Wheeler, A Block-Sorting Lossless Data Compression Algorithm, Systems Research Center, Palo Alto, CA, USA, 1994.
  2. H. Li and R. Durbin, “Fast and accurate short read alignment with Burrows–Wheeler transform,” Bioinformatics, vol. 25, no. 14, pp. 1754–1760, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. Y. Liu, T. Hankeln, and B. Schmidt, “Parallel and space-efficient construction of burrows-wheeler transform and suffix array for big genome data,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 13, no. 3, pp. 592–598, 2016. View at Publisher · View at Google Scholar · View at Scopus
  4. J. C. Qin and Z. Y. Bai, “Design of new format for mass data compression,” The Journal of China Universities of Posts and Telecommunications, vol. 18, no. 1, pp. 121–128, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. Q. Jiancheng, L. Yiqin, and Z. Yu, “Parallel algorithm for wireless data compression and encryption,” Journal of Sensors, vol. 2017, Article ID 4209397, 11 pages, 2017. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Moffat, R. M. Neal, and I. H. Witten, “Arithmetic coding revisited,” ACM Transactions on Information Systems, vol. 16, no. 3, pp. 256–294, 1998. View at Publisher · View at Google Scholar
  7. A. Moffat, “Implementing the PPM data compression scheme,” IEEE Transactions on Communications, vol. 38, no. 11, pp. 1917–1921, 1990. View at Publisher · View at Google Scholar · View at Scopus
  8. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Transactions on Information Theory, vol. 23, no. 3, pp. 337–343, 1977. View at Publisher · View at Google Scholar · View at Scopus
  9. S. J. Puglisi, W. F. Smyth, and A. H. Turpin, “A taxonomy of suffix array construction algorithms,” ACM Computing Surveys, vol. 39, no. 2, p. 4, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. J. Kärkkäinen, P. Sanders, and S. Burkhardt, “Linear work suffix array construction,” Journal of the ACM, vol. 53, no. 6, pp. 918–936, 2006. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Ko and S. Aluru, “Space efficient linear time construction of suffix arrays,” Journal of Discrete Algorithms, vol. 3, no. 2–4, pp. 143–156, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. G. Nong, S. Zhang, and W. H. Chan, “Two efficient algorithms for linear time suffix array construction,” IEEE Transactions on Computers, vol. 60, no. 10, pp. 1471–1484, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. N. Timoshevskaya and W. C. Feng, “SAIS-OPT: on the characterization and optimization of the SA-IS algorithm for suffix Array construction,” in 2014 IEEE 4th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS), pp. 1–6, Miami, FL, USA, 2014. View at Publisher · View at Google Scholar · View at Scopus
  14. U. Baier, Linear-time suffix sorting – a new approach for suffix array construction, [M.S. thesis], Ulm University, Baden-Württemberg, Germany, 2015.
  15. V. Z. Grajeda, C. F. Uribe, and R. C. Parra, “Parallel hardware/software architecture for the BWT and LZ77 lossless data compression algorithms,” Computación y Sistemas, vol. 10, no. 2, pp. 172–188, 2006. View at Google Scholar
  16. U. I. Cheema and A. Khokhar, “A high performance architecture for computing Burrows-Wheeler transform on FPGAs,” in 2013 International Conference on Reconfigurable Computing and FPGAs (ReConFig), pp. 1–6, Cancun, YUC, Mexico, 2013. View at Publisher · View at Google Scholar · View at Scopus
  17. M. Deo and S. Keely, “Parallel suffix array and least common prefix for the GPU,” ACM SIGPLAN Notices, vol. 48, no. 8, p. 197, 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. C. H. Chang, M. T. Chou, Y. C. Wu et al., “sBWT: memory efficient implementation of the hardware-acceleration-friendly Schindler transform for the fast biological sequence mapping,” Bioinformatics, vol. 32, no. 22, pp. 3498–3500, 2016. View at Publisher · View at Google Scholar · View at Scopus