Open AccessAn algorithm based on the dichotomy for quickly identifying whether a sequence is a PAPR sequence
Author(s) -
Yaoqi Yang,
Lei Zhang,
Xueshi Guo,
Renhui Xu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1486/3/032025
Subject(s) - orthogonal frequency division multiplexing , sequence (biology) , computer science , wireless , algorithm , field (mathematics) , binary number , multiplexing , telecommunications , channel (broadcasting) , mathematics , arithmetic , genetics , pure mathematics , biology
With the development of communication technology, OFDM (Orthogonal Frequency Division Multiplexing) technology has become one of the core technologies in the field of wireless communication. Although OFDM has many advantages, it has a problem that the ratio of peak-to-average ratio is too large, that is, the PAPR problem. Despite the achievements in the technical means of suppressing PAPR (Peak to Average Power Ratio), the implementation of new technologies often requires the introduction of excessive IFFT calculations. Based on this situation, this paper proposes a new algorithm based on binary search to solve this problem.