Papers
Topics
Authors
Recent
Search
2000 character limit reached

Deterministic Selection of Phase Sequences in Low Complexity SLM Scheme

Published 16 Oct 2012 in cs.IT and math.IT | (1210.4247v1)

Abstract: Selected mapping (SLM) is a suitable scheme, which can solve the peak-to-average power ratio (PAPR) problem. Recently, many researchers have concentrated on reducing the computational complexity of the SLM schemes. One of the low complexity SLM schemes is the Class III SLM scheme which uses only one inverse fast fourier transform (IFFT) operation for generating one orthogonal frequency division multiplexing (OFDM) signal sequence. By selecting rotations and cyclic shifts randomly, it can generate $N3$ alternative OFDM signal sequences, where $N$ is the FFT size. But this selection can not guarantee the optimal PAPR reduction performances. Therefore, in this paper, we propose a simple deterministic cyclic shifts selection method which is optimal in case of having low variance of correlation coefficient between two alternative OFDM signal sequences. And we show that cyclic shifts are highly dependent on the PAPR reduction performance than rotations. For small FFT size and the number of alternative signal sequences is close to $N/8$, simulation results show that the proposed scheme can achieve better PAPR reduction performance than the Class III SLM scheme.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.