TY - JOUR
T1 - Golay Complementary Sets and Multiple-Shift Complementary Sets with Non-Power-of-Two Length and Bounded PAPRs
AU - Lin, Yu Jen
AU - Huang, Zhen Ming
AU - Chen, Chao Yu
N1 - Funding Information:
Manuscript received June 3, 2021; accepted June 25, 2021. Date of publication July 5, 2021; date of current version September 10, 2021. This work was supported by the Ministry of Science and Technology, Taiwan, under Grants MOST 109–2628–E–006–008–MY3 and 109–2813–C–006–012–E. The associate editor coordinating the review of this letter and approving it for publication was M. Baldi. (Corresponding author: Chao-Yu Chen.) The authors are with the Department of Engineering Science, National Cheng Kung University, Tainan 70101, Taiwan (e-mail: e94064040@gs.ncku.edu.tw; n98101012@gs.ncku.edu.tw; super@mail. ncku.edu.tw). Digital Object Identifier 10.1109/LCOMM.2021.3094580
Publisher Copyright:
© 1997-2012 IEEE.
PY - 2021/9
Y1 - 2021/9
N2 - The Golay complementary set (GCS) has been applied in OFDM systems because of its desirable property of low peak-to-average power ratios (PAPRs). A generalization of GCS which is called the multiple-shift complementary set (MSCS) was also introduced to have bounded PAPRs. In addition, the MSCSs can be used to construct GCSs. In this letter, we first provide a more generalized construction of GCSs with non-power-of-two length. Then, a direct construction of MSCSs of non-power-of-two length is proposed based on the generalized Boolean functions. Moreover, a connection between the constructed GCSs and MSCSs is provided and hence the PAPR upper bound of the constructed MSCSs is derived. The proposed GCSs and MSCSs can have various lengths, set sizes, and bounded PAPRs.
AB - The Golay complementary set (GCS) has been applied in OFDM systems because of its desirable property of low peak-to-average power ratios (PAPRs). A generalization of GCS which is called the multiple-shift complementary set (MSCS) was also introduced to have bounded PAPRs. In addition, the MSCSs can be used to construct GCSs. In this letter, we first provide a more generalized construction of GCSs with non-power-of-two length. Then, a direct construction of MSCSs of non-power-of-two length is proposed based on the generalized Boolean functions. Moreover, a connection between the constructed GCSs and MSCSs is provided and hence the PAPR upper bound of the constructed MSCSs is derived. The proposed GCSs and MSCSs can have various lengths, set sizes, and bounded PAPRs.
UR - http://www.scopus.com/inward/record.url?scp=85112628199&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85112628199&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2021.3094580
DO - 10.1109/LCOMM.2021.3094580
M3 - Article
AN - SCOPUS:85112628199
VL - 25
SP - 2805
EP - 2809
JO - IEEE Communications Letters
JF - IEEE Communications Letters
SN - 1089-7798
IS - 9
M1 - 9474468
ER -