Joint source-channel coding of sources with memory using turbo codes and the burrows-wheeler transform

Javier Del Ser, Pedro M. Crespo, Inaki Esnaola, Javier Garcia-Frias

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

Abstract

The Burrows-Wheeler Transform (BWT) [1] is a block sorting algorithm which has been proven to be useful in compressing text data [2]. More recently, schemes based on the BWT have been proposed for lossless data compression using LDPC [3]-[5] and Fountain [6] codes, as well as for joint source-channel coding of sources with memory [7],[8]. In this paper we propose a source-controlled Turbo coding scheme for the transmission of sources with memory over AWGN channels also based on the Burrows-Wheeler Transform. Our approach combines the BWT with a Turbo code and employs different energy allocation techniques for the encoded symbols before their transmission. Simulation results show that the performance of the designed scheme is close (within 1.5 dB) to the theoretical Shannon limit.

Original languageEnglish
Article number5504599
Pages (from-to)1984-1992
Number of pages9
JournalIEEE Transactions on Communications
Volume58
Issue number7
DOIs
Publication statusPublished - Jul 2010

Keywords

  • Burrows-Wheeler transform
  • hidden Markov models
  • Markov processes
  • modulation
  • turbo codes

Fingerprint

Dive into the research topics of 'Joint source-channel coding of sources with memory using turbo codes and the burrows-wheeler transform'. Together they form a unique fingerprint.

Cite this