Joint source-channel turbo coding for binary Markov sources

被引：0

作者：

IEEE ^{[1
]}

不详 ^{[2
]}

不详 ^{[3
]}

不详 ^{[4
]}

不详 ^{[5
]}

不详 ^{[6
]}

不详 ^{[7
]}

不详 ^{[8
]}

机构：

[1] Dept. of Mathematics and Computer Science, Lawrence Technological University, Southfield, MI

[2] Dept. of Mathematics and Statistics, Queen's University, Kingston, Ont.

[3] Department of Mathematics and Statistics, Queen's University, Kingston

来源：

IEEE Trans. Wireless Commun. | 2006年 / 5卷 / 1065-1075期

基金：

加拿大自然科学与工程研究理事会;

关键词：

AWGN and Rayleigh fading channels; Bit error rate; Iterative decoding; Joint source-channel coding; Markov sources; Shannon limit; Turbo codes;

D O I：

10.1109/TWC.2006.1633359

中图分类号：

学科分类号：

摘要：

We investigate the construction of joint source-channel (JSC) Turbo codes for the reliable communication of binary Markov sources over additive white Gaussian noise and Rayleigh fading channels. To exploit the source Markovian redundancy, the first constituent Turbo decoder is designed according to a modified version of Berrou's original decoding algorithm that employs the Gaussian assumption for the extrinsic information. Due to interleaving, the second constituent decoder is unable to adopt the same decoding method; so its extrinsic information is appropriately adjusted via a weighted correction term. The Turbo encoder is also optimized according to the Markovian source statistics and by allowing different or asymmetric constituent encoders. Simulation results demonstrate substantial gains over the original (unoptimized) Turbo codes, hence significantly reducing the performance gap to the Shannon limit. Finally, we show that our JSC coding system considerably outperforms tandem coding schemes for bit error rates smaller than 10 -4, while enjoying a lower system complexity. © 2006 IEEE.

引用

页码：1065 / 1075

页数：10

共 36 条

[1] Adrat M., Picard J.-M., Vary P., Softbit-source decoding based on the turbo-principle, Proc. Veh. Tech. Conf, 4, pp. 2252-2256, (2001)
[2] Alajaji F., Phamdo N., Farvardin N., Fuja T., Detection of binary Markov sources over channels with additive Markov noise, IEEE Trans. Inform. Theory, 42, pp. 230-239, (1996)
[3] Alajaji F., Phamdo N., Fuja T., Channel codes that exploits the residual redundancy in CELP-encoded speech, IEEE Trans. Speech and Audio Processing, 4, pp. 325-336, (1996)
[4] Bahl L.R., Cocke J., Jelinek F., Raviv J., Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Inform. Theory, 20, pp. 248-287, (1974)
[5] Bauer R., Hagenauer J., On variable length codes for iterative source/channel decoding, Proc. Data Compression Conf, pp. 273-282, (2001)
[6] Berger T., Rate Distortion Theory: A Mathematical Basis for Data Compression, (1971)
[7] Berrou C., Glavieux A., Thitimajshima P., Near Shannon limit error-correcting coding and decoding: Turbo-codes(1), Proc. IEEE Int. Conf. Commun., pp. 1064-1070, (1993)
[8] Berrou C., Glavieux A., Near optimum error correcting coding and decoding: Turbo-codes, IEEE Trans. Commun., 44, pp. 1261-1271, (1996)
[9] Blahut R.E., Principles and Practice of Information Theory, (1988)
[10] Cabarcas F., Souza R.D., Garcia-Frias J., Source-controlled turbo coding of nonuniform memoryless sources based on unequal energy allocation, Proc. Int. Symp. Inform. Theory, (2004)

← 1 2 3 4 →