Abstract
RA code, using BP iterative decoding algorithm for decoding in AWGN channel, is linear time encoding and decoding algorithm and its performance is closer to the Shannon limit. In order to improve decoding speed and reduce decoding complexity, this paper studies the simplified decoding algorithm of RA code, puts forward the minimal sum algorithm of RA code, and proposes the poly-line decoding algorithm based on BP algorithm. The simulation results show that error code rate of the system reduces and its performance closes to channel capacity with increasing message length. When the number of iterations increases, the error code rate drops with better system performance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gao, H.: RA codes encoding and decoding algorithms. Journal of Luoyang Normal University 2, 69–73 (2004)
Fossorier, M.P.C., Mihaljevic, T., Dholakia, A.: Reduced complexity iterative decoding of lowdensityparity check codes based on belief propagation. IEEE Trans. Commun. 47(5), 673–680 (1999)
Chen, J.: Reduced complexity decoding algorithms for low-density parity check codes and turbo codes. PhD Thesis. University of Hawaii (2003)
Gao, H.: RA code decoding simplifies the algorithm. Journal of Sichuan University (Engineering Science Edition) 36(1), 107–110 (2004)
Gao, H., Xu, Z., Wu, Y.: IRA code decoding algorithm to simplify. Journal of University of Electronic Science and Technology of China 34(1), 40–43 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shen, Y., Zhang, Y., Zhang, J. (2011). Research on Simplified Decoding Algorithm of RA Code . In: Liu, B., Chai, C. (eds) Information Computing and Applications. ICICA 2011. Lecture Notes in Computer Science, vol 7030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25255-6_79
Download citation
DOI: https://doi.org/10.1007/978-3-642-25255-6_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25254-9
Online ISBN: 978-3-642-25255-6
eBook Packages: Computer ScienceComputer Science (R0)