Abstract
Selective mapping (SLM) has been proposed for peak to average power reduction (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. With SLM, multiple sequences are generated by multiplying independent phase se- quences with the original data and the sequence with the lowest PAPR is chosen for transmission. Hence, to determine the selected sequence at the receiver, side information must be sent along with the data. Previously, a maximum-likelihood (ML) decoder was proposed to eliminate this side information. However, this adds significant complexity to the receiver. In this paper, we first propose a partial SLM (P-SLM) technique using combinations of time-domain sequences. We then show that P-SLM can significantly reduce the ML decoder complexity. We examine the bit error rate (BER) performance of the simplified decoder over additive white Gaussian noise (AWGN) and fading channels. The results show that the proposed decoder has almost identical BER performance to that of the previous decoding algorithm while achieving very low computational complexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
