New Simplified Sum-Product Algorithm for Low Complexity LDPC Decoding 


Vol. 34,  No. 3, pp. 322-328, Mar.  2009


PDF
  Abstract

This paper proposes new simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes. The proposed SSP algorithm can replace multiplications and divisions with additions and subtractions without extra computations. In addition, the proposed SSP algorithm can simplify both the ln[tanh(x)] and tanh-1[exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Moreover, the simulation results show that the proposed SSP algorithm can improve about 0.3 ~ 0.8 dB of BER performance compared with the existing modified sum-product algorithms.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. H. Han and M. H. Sunwoo, "New Simplified Sum-Product Algorithm for Low Complexity LDPC Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 3, pp. 322-328, 2009. DOI: .

[ACM Style]

Jae Hee Han and Myung Hoon Sunwoo. 2009. New Simplified Sum-Product Algorithm for Low Complexity LDPC Decoding. The Journal of Korean Institute of Communications and Information Sciences, 34, 3, (2009), 322-328. DOI: .

[KICS Style]

Jae Hee Han and Myung Hoon Sunwoo, "New Simplified Sum-Product Algorithm for Low Complexity LDPC Decoding," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 3, pp. 322-328, 3. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880