Optimal Bit Split Methods and Performance Analysis for Applying to Multilevel Modulation of Iterative Codes 


Vol. 32,  No. 3, pp. 216-225, Mar.  2007


PDF
  Abstract

This paper presents bit splitting methods to apply multilevel modulation to iterative codes such as turbo code, low density parity check code and turbo product code. Log-likelihood ratio method splits multilevel symbols to bits using the received in-phase and quadrature component based on Gaussian approximation. However it is too complicate to calculate and implement hardware due to exponential and log calculation. therefore this paper presents Euclidean, MAX and Sector method to reduce the high complexity of LLR method. We propose optimal bit splitting method for three iterative codes.

  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. T. Bae, J. W. Jung, S. S. Choi, M. H. Kim, D. I. Chang, "Optimal Bit Split Methods and Performance Analysis for Applying to Multilevel Modulation of Iterative Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 216-225, 2007. DOI: .

[ACM Style]

Jong Tae Bae, Ji Won Jung, Seok Soon Choi, Min Hyuk Kim, and Dae Ig Chang. 2007. Optimal Bit Split Methods and Performance Analysis for Applying to Multilevel Modulation of Iterative Codes. The Journal of Korean Institute of Communications and Information Sciences, 32, 3, (2007), 216-225. DOI: .

[KICS Style]

Jong Tae Bae, Ji Won Jung, Seok Soon Choi, Min Hyuk Kim, Dae Ig Chang, "Optimal Bit Split Methods and Performance Analysis for Applying to Multilevel Modulation of Iterative Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 3, pp. 216-225, 3. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880