Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Modified sum-product algorithms for decoding low-density parity-check codes

Modified sum-product algorithms for decoding low-density parity-check codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors deal with the sum–product algorithm (SPA) based on the hyperbolic tangent (tanh) rule when it is applied for decoding low-density parity-check (LDPC) codes. Motivated by the finding that, because of the large number of multiplications required by the algorithm, an overflow in the decoder may occur, two novel modifications of the tanh function (and its inverse) are proposed. By means of computer simulations, both methods are evaluated using random-based LDPC codes with binary phase shift keying (BPSK) signals transmitted over the additive white Gaussian noise (AWGN) channel. It is shown that the proposed modifications improve the bit error rate (BER) performance up to 1 dB with respect to the conventional SPA. These results have also shown that the error floor is removed at BER lower than 10−6. Furthermore, two novel approximations are presented to reduce the computational complexity of the tanh function (and its inverse), based on either a piecewise linear function or a quantisation table. It is shown that the proposed approximations can slightly improve the BER performance (up to 0.13 dB) in the former case, whereas small BER performance degradation is observed (<0.25 dB) in the latter case. In both cases, however, the decoding complexity is reduced significantly.

References

    1. 1)
      • (2004) Digital Video Broadcasting (DVB): Second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications.
    2. 2)
      • Luby, M.G., Shokrolloahi, A.M., Mizenmacher, M., Spielman, D.A.: `Improved low-density parity-check codes using irregular graphs and belief propagation', Proc. IEEE Int. Symp. on Inform. Theory, August 1998, Cambridge, USA, p. 117.
    3. 3)
      • Special issue on capacity approaching codes design and implementation. IEE Proc. Commun. , 6
    4. 4)
      • S.B. Wicker , S. Kim . (2003) Fundamentals of codes, graphs, and iterative decoding.
    5. 5)
      • D.J.C. MacKay . Online database of low-density parity-check codes.
    6. 6)
      • M.R. Tanner . A recursive approach to low complexity codes. IEEE Trans. Inform. Theory , 5 , 533 - 547
    7. 7)
      • A.J. Blanksby , C.J. Howland . A 960-mW 1 Gb/s 1024-b, rate 1/2 low-density parity-check code decoder. IEEE Journal of Solid-State Circuits , 3 , 404 - 412
    8. 8)
      • Papaharalabos, S., Sweeney, P., Evans, B.G., Albertazzi, G., Vanelli-Coralli, A., Corazza, G.E.: `Performance evaluation of a modified sum-product decoding algorithm for LDPC codes', Proc. 2nd Int. Symp. Wireless Commun. Systems (ISWCS), September 2005, Siena, Italy, p. 800–804.
    9. 9)
      • W.E. Ryan , B. Vasic . (2004) An introduction to LDPC codes’, in, CRC Handbook for coding and signal processing for recording systems.
    10. 10)
      • M.P.C. Fossorier , M. Mihaljevic , H. Imai . Reduced complexity iterative decoding of low-density parity check codesbased on belief propagation. IEEE Trans. Commun. , 5 , 673 - 680
    11. 11)
      • C. Sae-Young , G.D. Forney , T.J. Richardson , R.A. Urbanke . On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Commun. Lett. , 2 , 58 - 60
    12. 12)
      • Robertson, P., Villebrun, E., Hoeher, P.: `A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain', Proc. IEEE Int. Conf. Commun. (ICC), June 1995, Seattle, USA, p. 1009–1013.
    13. 13)
      • Howard, S.L., Schlegel, C., Gaudet, V.C.: `A degree-matched check node approximation for LDPC decoding', Proc. IEEE Int. Symp. Inform. Theory (ISIT), September 2005, Adelaide, Australia, p. 1131–1135.
    14. 14)
      • T.J. Richardson , R.L. Urbanke . The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory , 2 , 599 - 618
    15. 15)
      • Liao, E., Yeo, E., Nokolic, B.: `Low-density parity-check code constructions for hardware implementation', Proc. IEEE Int. Conf. Commun. (ICC), June 2004, Paris, France, p. 2573–2577.
    16. 16)
      • L. Chen , A. Dholakia , E. Eleftheriou , M.P.C. Fossorier , X.-Y. Hu . Reduced complexity decoding of LDPC codes. IEEE Trans. Commun. , 8 , 1288 - 1299
    17. 17)
      • N. Wiberg , H.A. Loeliger , R. Koetter . Codes and iterative decoding on general graphs. Eur. Trans. Telecommun. , 513 - 526
    18. 18)
      • R.G. Gallager . Low-density parity-check code. IRE Trans. Inform. Theory , 1 , 21 - 28
    19. 19)
      • Special issue on codes on graphs and iterative algorithms. IEEE Trans. Inform. Theory , 2
    20. 20)
      • G. Masera , F. Quaglio , F. Vacca . Finite precision implementation of LDPC decoders. IEE Proc., Commun. , 6 , 1098 - 1102
    21. 21)
      • E. Casini , R. De Gaudenzi , A. Ginesi . DVB-S2 modem algorithms design and performance over typical satellite channel. Int. J. Satell. Commun. Netw. , 3 , 281 - 318
    22. 22)
      • Hu, X.-Y., Eleftheriou, E., Arnold, D.-M., Dholakia, A.: `Efficient implementations of the sum–product algorithm for decoding LDPC codes', Proc. IEEE Globecom, November 2001, San Antonio, USA, p. 1036–1036E.
    23. 23)
      • D.J.C. MacKay . Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory , 3 , 399 - 431
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20060173
Loading

Related content

content/journals/10.1049/iet-com_20060173
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address