Construction of the near optimal PRT set using the cyclic difference set in TR scheme

  • Lim, Dae Woon
  • Noh, Hyung Suk
  • Heo, Seok Joong
  • No, Jong Seon
  • Shin, Dong Joon
Citations

SCOPUS

6

초록

In the tone reservation (TR) scheme, it is known that the set of randomly selected peak reduction tones (PRT's) performs better than the contiguous PRT set and the interleaved PRT set in the PAPR reduction of orthogonal frequency division multiplexing (OFDM) signals. It is also known that finding the optimal PRT set is equivalent to solving the secondary peak minimization problem in the TR scheme. However, this problem cannot be solved for the practical number of tones because choosing k tones out of N subcarriers requires O(k) computational complexity. In this paper, the near optimal PRT set of the TR scheme is proposed, which is constructed from the cyclic difference set

키워드

Computational complexityOptimal systemsOptimizationProblem solvingRandom processesPeak minimization problemPeak reduction tones (PRT)Tone reservation (TR) schemeOrthogonal frequency division multiplexing
제목
Construction of the near optimal PRT set using the cyclic difference set in TR scheme
저자
Lim, Dae WoonNoh, Hyung SukHeo, Seok JoongNo, Jong SeonShin, Dong Joon
DOI
10.1109/PIMRC.2007.4394088
발행일
2007-09
유형
Conference Paper
저널명
IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
페이지
1 ~ 5