Parallel Lossless Data Compression Based on the Burrows-Wheeler Transform

Author(s):  
Jeff Gilchrist ◽  
Aysegul Cuhadar
Author(s):  
Elie Fute Tagne ◽  
Hugues Marie Kamdjou ◽  
Alain Bertrand Bomgni ◽  
Armand Nzeukou

The expansion of sensitive dataderiving from a variety of applications has requiredthe need to transmit and/or archivethem with increased performance in terms of quality, transmission delay or storage volume. However, lossless compression techniques are almost unacceptable in the application fields where data does not allow alterations because of the fact that loss of crucial information can distort the analysis. This paper introduces MediCompress, a lightweight lossless data compression approach for irretrievable data like those from the medical or astronomy fields. The proposed approachis based on entropic Arithmetic coding, Run-length encoding, Burrows-wheeler transform and Move-to-front encoding. The results obtained on medical images have an interesting Compression Ratio (CR) in comparison with the lossless compressor SPIHT and a better Peak Signal to Noise Ratio (PSNR) and Mean Squared Error (MSE) than SPIHT and JPEG2000.


2010 ◽  
Vol 56 (4) ◽  
pp. 351-355
Author(s):  
Marcin Rodziewicz

Joint Source-Channel Coding in Dictionary Methods of Lossless Data Compression Limitations on memory and resources of communications systems require powerful data compression methods. Decompression of compressed data stream is very sensitive to errors which arise during transmission over noisy channels, therefore error correction coding is also required. One of the solutions to this problem is the application of joint source and channel coding. This paper contains a description of methods of joint source-channel coding based on the popular data compression algorithms LZ'77 and LZSS. These methods are capable of introducing some error resiliency into compressed stream of data without degradation of the compression ratio. We analyze joint source and channel coding algorithms based on these compression methods and present their novel extensions. We also present some simulation results showing usefulness and achievable quality of the analyzed algorithms.


Author(s):  
Sanjana Rao ◽  
Vidyashree T S ◽  
Manasa M ◽  
Bindushree V ◽  
C. Gururaj

Sign in / Sign up

Export Citation Format

Share Document