Information and Communication Technology for Development for Africa. First International Conference, ICT4DA 2017, Bahir Dar, Ethiopia, September 25–27, 2017, Proceedings

Research Article

Comparative Study of the Performances of Peak-to-Average Power Ratio (PAPR) Reduction Techniques for Orthogonal Frequency Division Multiplexing (OFDM) Signals

Download
213 downloads
  • @INPROCEEDINGS{10.1007/978-3-319-95153-9_6,
        author={Workineh Abera},
        title={Comparative Study of the Performances of Peak-to-Average Power Ratio (PAPR) Reduction Techniques for Orthogonal Frequency Division Multiplexing (OFDM) Signals},
        proceedings={Information and Communication Technology for Development for Africa. First International Conference, ICT4DA 2017, Bahir Dar, Ethiopia, September 25--27, 2017, Proceedings},
        proceedings_a={ICT4DA},
        year={2018},
        month={7},
        keywords={Orthogonal Frequency Division Multiplexing Peak-to-Average Power Ratio Selected Mapping Partial Transmit Sequence},
        doi={10.1007/978-3-319-95153-9_6}
    }
    
  • Workineh Abera
    Year: 2018
    Comparative Study of the Performances of Peak-to-Average Power Ratio (PAPR) Reduction Techniques for Orthogonal Frequency Division Multiplexing (OFDM) Signals
    ICT4DA
    Springer
    DOI: 10.1007/978-3-319-95153-9_6
Workineh Abera1,*
  • 1: Addis Ababa University
*Contact email: workinehgebeye@gmail.com

Abstract

In this paper, two distortionless PAPR reduction techniques, Selected Mapping (SLM) and Partial Transmit Sequences (PTS), are compared in terms of PAPR reduction capability and computational complexity for equal number of candidate OFDM symbols. Using MATLAB simulation, it is shown that SLM outperforms PTS in PAPR reduction capability. For small values of the number of subblock partitions, the overall computational complexity of PTS is less than SLM. However, the required PAPR reduction level may not be achieved using small values of number of subblock partitions. Hence, for large values of number of subblock partitions used in PTS, the overall computational complexity of PTS is greater than SLM. In that case, SLM outperforms PTS both in PAPR reduction capability and computational complexity.