• Journal of Internet Computing and Services
    ISSN 2287 - 1136 (Online) / ISSN 1598 - 0170 (Print)
    https://jics.or.kr/

A Computational Complexity Reduction Scheme for SLM Based OFDM Communication Systems


Soo-Bum Cho, Kwang-Min Hyun, Sang-Kyu Park, Journal of Internet Computing and Services, Vol. 13, No. 2, pp. 13-20, Apr. 2012
10.7472/jksii.2012.13.2.13, Full Text:
Keywords: Inverse Fast Fourier Transform (IFFT), Peak-to-Average Power Ratio (PAPR), Orthogonal Frequency Division Multiplexing (OFDM), Selected Mapping (SLM)

Abstract

SLM (Selected Mapping) is an efficient PAPR (Peak-to-Average Power Ratio) reduction scheme without transmitted signal distortion in OFDM (Orthogonal Frequency Division Multiplexing) systems. However, enormous IFFTs (Inverse Fast Fourier Transforms) are needed to generate sufficient candidate OFDM signals, which cause the SLM to become quite complex. In this paper, we propose a new SLM scheme that replaces the IFFT operations with a conversion of the first candidate OFDM signal. The proposed scheme significantly reduces computational complexity, while it shows almost the same PAPR performance as the conventional SLM scheme.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
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
[APA Style]
Cho, S., Hyun, K., & Park, S. (2012). A Computational Complexity Reduction Scheme for SLM Based OFDM Communication Systems. Journal of Internet Computing and Services, 13(2), 13-20. DOI: 10.7472/jksii.2012.13.2.13.

[IEEE Style]
S. Cho, K. Hyun, S. Park, "A Computational Complexity Reduction Scheme for SLM Based OFDM Communication Systems," Journal of Internet Computing and Services, vol. 13, no. 2, pp. 13-20, 2012. DOI: 10.7472/jksii.2012.13.2.13.

[ACM Style]
Soo-Bum Cho, Kwang-Min Hyun, and Sang-Kyu Park. 2012. A Computational Complexity Reduction Scheme for SLM Based OFDM Communication Systems. Journal of Internet Computing and Services, 13, 2, (2012), 13-20. DOI: 10.7472/jksii.2012.13.2.13.