Abstract
In this paper, we enhance and investigate the performance of some bandwidth efficient coding schemes with iteratively decodable structure and cycles in their graph representation. In particular, we deal with bit-interleaved coded modulation and transmit diversity, using low-density parity-check and turbo codes as component codes. Simulation results show that the suboptimality of iterative decoding for moderate length codes can be at least partially compensated. Hence they allow us to also measure partially this suboptimality.
Résumé
Dans cet article, nous mettons en évidence les performances de certains schémas de codage à bonne efficacité spectrale associés à des structures de décodage itératives et contenant des cycles dans leur représentation à base de graphes.
En particulier, nous nous intéressons à la modulation codée à entrelacement de bits et à un système contenant de la diversité à l’émission, pour lesquels la fonction de codage est réalisée à l’aide de codes de parité à faible densité (LDPC) et de turbocodes. Des résultats de simulation montrent que la sous-optimalité du décodage itératif pour des codes de longueur modérée peut être, au moins partiellement, compensée. Par conséquent ils nous permettent également de mesurer partiellement cette sous-optimalité.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Berrou (C.),Glavieux (A.),Thitimajshima (P.), “Near Shannon limit error-correcting coding: Turbo codes”, inProc. of IEEE International Conference on Communications (ice 93), Geneva, Switzerland, pp. 1064–1070, May 1993.
Gallager (R. G.), “Low-density parity-check codes”,IRE Trans. Inform. Theory,8, no 1, pp.21–28, Jan. 1963.
Fossorier (M. P. C.), “Iterative reliability-based decoding of low-density parity check codes”,IEEE J. Sel. Areas in Commun.,19, no 5, pp. 908–917, May 2001.
Isaka (M.), Fossorier (M.), Imai (H.), “On the suboptimality of iterative decoding for turbo-like and LDPC codes with cycles in their graph representations”,IEEE Trans. Commun,52, no 5, pp. 845–854, May 2004.
Caire (G.), Tarrico (G.), Biglieri (E.), “Bit-interleaved coded modulation”,IEEE Trans. Inform, Theory,44, no 3, pp.927–946, May 1998.
Le Goff (S.),Glavieux (A.),Berrou (C.), “Turbocode and high spectral efficiency modulation”, inProc. of International Conference on Communications (ICC 94), pp. 645–649, New Orleans, USA, May 1994.
Alamouti (SM.), “A simple transmit diversity technique for wireless communications”,IEEE J. Sel. Areas in Commun.,44, no 10, pp. 1451–1458, Oct. 1998.
Douillard (C.),Picart (A.),Didier (P.),Jezequel (M.),Berrou (C.),Glavieux (A.), “Iterative correction of intersymbol interference: Turbo-equalization”,Eur. Trans. Telecommun.,6, no 5, Sep/Oct. 1995.
Fossorier (M.P.C.), Lin (S.), “Soft-decision decoding of linear block codes based on ordered statistics”,IEEE Trans. Inform. Theory,41, no 5, pp. 1379–1396, Sept. 1995.
Divsalar (D.),Jin (H.),McEliece (R. J.), “Coding theorems for ‘turbo-like’ codes”, inProc. of 36th Allerton Conf., pp. 201–210, Monticello, IL, Sept. 1998.
Bauch (G.),Hagenauer (J.),Seshadri (N.), “Turbo-tcm and transmit antenna diversity in multipath fading channels”, inProc. of 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, Sep. 2000.
Divsalar (D.), Dolinar (S.), Pollara (F.), “Iterative turbo decoder analysis based on density evolution”,IEEE J. Sel. Areas in Commun.,19, no 5, pp. 891–907, May 2001.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Isaka, M., Fossorier, M. Iterative reliability-based decoding in bandwidth efficient coding schemes. Ann. Télécommun. 60, 132–146 (2005). https://doi.org/10.1007/BF03219810
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF03219810
Key words
- Error correcting code
- Decoding
- Reliability
- Iteration
- Interleaving
- Code modulation
- Diversity
- Turbo code
- Parity check
- Sparse matrix
- Rayleigh fading
- Radio channel
- Intersymbol interference