Research Article
Article:A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 7 - Issue 7 |
| Published: October 2010 |
| Authors: M. Lahmer, M. Belkasmi |
10.5120/1265-1697
|
M. Lahmer, M. Belkasmi . Article:A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes. International Journal of Computer Applications. 7, 7 (October 2010), 12-18. DOI=10.5120/1265-1697
@article{ 10.5120/1265-1697,
author = { M. Lahmer,M. Belkasmi },
title = { Article:A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes },
journal = { International Journal of Computer Applications },
year = { 2010 },
volume = { 7 },
number = { 7 },
pages = { 12-18 },
doi = { 10.5120/1265-1697 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2010
%A M. Lahmer
%A M. Belkasmi
%T Article:A New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes%T
%J International Journal of Computer Applications
%V 7
%N 7
%P 12-18
%R 10.5120/1265-1697
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The performance of iterative decoding algorithm for one-step majority logic decodable (OSMLD) codes is investigated. We introduce a new soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. However the computation time of the proposed algorithm is very low. The developed algorithm can also be applied to product codes and parallel concatenated codes based on block codes. Numerical results on both AWGN and Rayleigh channels are provided. The performance of iterative decoding of parallel concatenated code (17633,8595) with rate 0.5 is only 1.8 dB away from the Shannon capacity limit at a BER of 10-5.
References
- C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding : Turbo-codes (1),” IEEE Int. Conf. on Comm. ICC’93, Geneva, May 1993, pp. 1064-1071.
- R. Pyndiah, “Near-Optimum Decoding of Product Codes: Block Turbo Codes,” IEEE Trans. Commun., Aug. 1998, Vol. 46, N° 8, pp. 1003-1010.
- R. Lucas, M. Bossert and M. Breitbach, “On Iterative Soft-Decision Decoding of Linear Binary Block Codes and Product Codes, “ IEEE Journal on selected areas in communications, February 1998, Vol.
- M. P. C. Fossorier and S. Lin. “Soft-Input Soft-Output Decoding of Linear Block Codes Based on Ordered Statistics,” Proc. 1998 IEEE Global Telecomm. Conf. (GLOBECOM’98), Sydney, Australia Nov. 1998. pp. 2828-2833,
- J. Hagenauer, E. Offer, and L. Papke, “iterative decoding of binary block and convolutional codes,” IEEE Trans. Inform. Theory, Mar. 1996, Vol. 42, pp. 429-446.
- R. Lucas, M. P. C. Fossorier, Yu Kou, and Shu Lin, “Iterative Decoding of One-Step Majority Logic Decodable Codes Based on Belief Propagation,“ IEEE Trans. Commun, June 2000, VOL. 48, NO. 6, pp.931-937.
- Yuri V. Svirid and Sven Riedel, “Threshold Decoding of Turbo-Codes,” IEEE Int. Symposium on Information Theory, 1995, pp. 39.
- J.L Massey, “Threshold Decoding,” Cambridge, Ma, M.I.T. Press, 1963.
- C. Clark and B. Cain, “Error-Correction Coding for digital communications,” Plenum Press, 1981.
- S. Lin and D. J. Costello, “Error Control Coding, Fundamentals and Applications,” Englewood Cliffs, NJ: Prentice-Hall, 1983.
- R. Lucas, M. P. C. Fossorier, Yu Kou, and Shu Lin, “Iterative Decoding of One-Step Majority Logic Decodable Codes Based on Belief Propagation,“ IEEE Trans. Commun, June 2000, VOL. 48, NO. 6, pp.931-937
- S. A. Barbulescu, “Iterative decoding of turbo codes and other concatenated codes,” thesis, University of South Australia, Februry 1996, pp 869-870.
Index Terms
Keywords