Design of non-systematic turbo codes for universal source controlled channel decoding

Non-systematic turbo codes have a large potential advantage over systematic codes when coding redundant sequences. However, to utilize this potential universally, when sequence statistics are unknown in advance, they need to be properly designed. We consider design criteria for non-systematic turbo codes that can allow universal utilization of redundancy in the encoded messages. We apply these criteria to decoding of independently identically distributed (i.i.d.) nonuniform sequences, and of piecewise stationary memoryless sequences. Simulation results are presented for both classes for rate 1/2 and 1/3 codes. They demonstrate that with proper designs, full (or almost full) utilization of the redundancy can be achieved for these source classes even universally, and the performance with unknown statistics is (almost) as good as that with initially known statistics.

[1]  Fady Alajaji,et al.  Transmission of nonuniform memoryless sources via nonsystematic turbo codes , 2004, IEEE Transactions on Communications.

[2]  Tsachy Weissman,et al.  Channel decoding of systematically encoded unknown redundant sources , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[3]  Daniel J. Costello,et al.  Nonsystematic turbo codes , 2005, IEEE Transactions on Communications.

[4]  Gil I. Shamir,et al.  Universal lossless source controlled channel decoding for i.i.d. sequences , 2005, IEEE Communications Letters.

[5]  S. Verdú,et al.  Noiseless Data Compression with Low-Density Parity-Check Codes , 2003, Advances in Network Information Theory.

[6]  Shlomo Shamai,et al.  The empirical distribution of good codes , 1997, IEEE Trans. Inf. Theory.

[7]  D. J. Costello,et al.  Turbo codes with recursive nonsystematic quick-look-in constituent codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[8]  Michelle Effros,et al.  Universal lossless source coding with the Burrows Wheeler transform , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[9]  Daniel J. Costello,et al.  Nonsystematic convolutional codes for sequential decoding in space applications , 1971, IEEE Transactions on Communication Technology.

[10]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[11]  Javier Garcia-Frías,et al.  Joint turbo decoding and estimation of hidden Markov sources , 2001, IEEE J. Sel. Areas Commun..

[12]  Joachim Hagenauer.  Source-controlled channel decoding , 1995, IEEE Trans. Commun..

[13]  G. I. Shamir,et al.  Asymptotically optimal threshold based low complexity sequential lossless coding for piecewise stationary memoryless sources , 1999, 1999 Information Theory and Networking Workshop (Cat. No.99EX371).

[14]  Fady Alajaji,et al.  Turbo codes for nonuniform memoryless sources over noisy channels , 2002, IEEE Communications Letters.

[15]  Daniel J. Costello,et al.  Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case , 2000, IEEE Trans. Inf. Theory.