Bit-mapping Schemes of LDPC Codes for Partial Chase Combining 


Vol. 37,  No. 5, pp. 311-316, May  2012


PDF Full-Text
  Abstract

In this paper, a bit-mapping scheme is proposed for partial Chase combining in LDPC-coded systems. Contrary to the previously known bit mapping that assigns the information bits to more reliable channels, the proposed mapping assigns the codeword bits of irregular LDPC codes to distinct Gaussian channels by considering the characteristics of LDPC codes and channels. The recursion equation for partial Chase combining is derived by using the density evolution technique, based on it, the best bit mapping among the various bit-mapping schemes is derived, and the validity of them is confirmed through simulation.

  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]

H. Joo and D. Shin, "Bit-mapping Schemes of LDPC Codes for Partial Chase Combining," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 5, pp. 311-316, 2012. DOI: .

[ACM Style]

Hyeong-Gun Joo and Dong-Joon Shin. 2012. Bit-mapping Schemes of LDPC Codes for Partial Chase Combining. The Journal of Korean Institute of Communications and Information Sciences, 37, 5, (2012), 311-316. DOI: .

[KICS Style]

Hyeong-Gun Joo and Dong-Joon Shin, "Bit-mapping Schemes of LDPC Codes for Partial Chase Combining," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 5, pp. 311-316, 5. 2012.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880