Study on a New Joint Source-Channel Decoder Design

Article Preview

Abstract:

To improve upon the Low-Density Parity-Check (LDPC) codes , incorporating compressed sensing (CS) and information redundancy, a new joint decoding algorithm frame is presented. The proposed system exploits the information redundancy by CS reconstruction during the iterative decoding process to correct decoding of LDPC codes. The simulation results show that the algorithm presented can improve system decoding performance and obviously make bit error ratio (BER) lower then traditional LDPC codes. In addition, a relatively short argument is given on different CS reconstructed algorithms in proposed system, the new design is shown to benefit from different CS reconstructed algorithms.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

471-475

Citation:

Online since:

July 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] D. Donoho(2006), Compressed sensing, IEEE Trans. Inf. Theory, 52: 1289-1306.

Google Scholar

[2] E. Candés(2006), Compressive sampling, in Proc. Int. Congress of Mathematicians, Madrid, Spain: 1433-1452.

Google Scholar

[3] Shannon C E (1948), A mathematical theory of communication. Bell Syst Tech J, 27: 379–423; 623–656.

Google Scholar

[4] R G. Gallager (1962), Low density parity check codes , Trans. of the IRE Professional Group on Information Theory, 8 :. 21-28.

DOI: 10.1109/tit.1962.1057683

Google Scholar

[5] E. Candés, J. Romberg, T. Tao(2006), Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inf. Theory : 489-509.

DOI: 10.1109/tit.2005.862083

Google Scholar

[6] Tropp J, Gilbert A. (2007), Signal recovery from partial information via orthogonal matching pursuit[J].IEEE Trans. Inf. Theory, 53: 4566-4666.

DOI: 10.1109/tit.2007.909108

Google Scholar

[7] B. Zhu D.F. Huang(2008), S. Nordholm, Enhanced verification-based decoding for packet-based LDPC codes, IEEE Commun. Lett, 12: 136-138.

DOI: 10.1109/lcomm.2008.071668

Google Scholar

[8] Donoho D L, Tsaig Y, Drori I, et a(2006). Sparse solution of underdetermined linear equations by Stagewise Orthogonal Matching Pursuit[R]. Technical Report.

DOI: 10.1109/tit.2011.2173241

Google Scholar

[9] 9 W. Ryan (2002), A low-density parity-check codes: tutorial, University of Arizona.

Google Scholar