Approximated Soft-Decision Demapping Algorithm for Coded 4+12+16 APSK 


Vol. 37,  No. 9, pp. 738-745, Sep.  2012


PDF Full-Text
  Abstract

This paper proposes an approximated soft decision demapping algorithm with low computational complexity for coded 4+12+16 amplitude phase shift keying (APSK) in an additive white Gaussian noise (AWGN) channel. To derive the proposed algorithm, we approximate the decision boundaries for 4+12+16 APSK symbols, and then decide the log likelihood ratio (LLR) value for each bit from the approximated decision boundaries. Although the proposed algorithm shows about 0.6∼1.1dB degradation on the error performance compared with the conventional max-log algorithm, it gives a significant result in terms of the computational complexity.

  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. Lee, Y. Jang, D. Yoon, "Approximated Soft-Decision Demapping Algorithm for Coded 4+12+16 APSK," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 9, pp. 738-745, 2012. DOI: .

[ACM Style]

Jaeyoon Lee, Yeonsoo Jang, and Dongweon Yoon. 2012. Approximated Soft-Decision Demapping Algorithm for Coded 4+12+16 APSK. The Journal of Korean Institute of Communications and Information Sciences, 37, 9, (2012), 738-745. DOI: .

[KICS Style]

Jaeyoon Lee, Yeonsoo Jang, Dongweon Yoon, "Approximated Soft-Decision Demapping Algorithm for Coded 4+12+16 APSK," The Journal of Korean Institute of Communications and Information Sciences, vol. 37, no. 9, pp. 738-745, 9. 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