© The Institution of Engineering and Technology
In this Letter, a new construction of complementary sequence sets (CSSs) is proposed by concatenating Golay complementary pairs (GCPs) which could have different lengths. The constructed CSSs have flexible sequence lengths, i.e. , where L and N are the lengths of two constituting GCPs. For example, the proposed method can be used to construct quadriphase CSSs of all lengths up to 100, except 87 and 95. The feasibility for practical applications of CSSs will be enhanced due to their flexible lengths and good peak-to-average power ratio property.
References
-
-
1)
-
10. Sarkar, P., Majhi, S., Liu, Z.: ‘A direct and generalized construction of polyphase complementary set with low PMEPR’. Proc. IEEE Int. Symp. Inf. Theory, Paris, France, 2019, pp. 1–5.
-
2)
-
9. Schmidt, K.U.: ‘Complementary sets, generalized Reed-Muller codes, and power control for OFDM’, IEEE Trans. Inf. Theory, 2007, 53, (2), pp. 808–814 (doi: 10.1109/TIT.2006.889723).
-
3)
-
19. Craigen, R., Holzmann, W., Kharaghani, H.: ‘Complex Golay sequences: structure and applications’, Discrete Math., 2002, 252, (1-3), pp. 73–89 (doi: 10.1016/S0012-365X(01)00162-5).
-
4)
-
7. Paterson, K.G.: ‘Generalized Reed-Muller codes and power control in OFDM modulation’, IEEE Trans. Inf. Theory, 2000, 46, (1), pp. 104–120 (doi: 10.1109/18.817512).
-
5)
-
18. Frank, R.: ‘Polyphase complementary codes’, IEEE Trans. Inf. Theory, 1980, IT-26, (6), pp. 647–647.
-
6)
-
7)
-
19. Davis, J.A., Jedwab, L.: ‘Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed–Muller codes’, IEEE Trans. Inf. Theory, 1999, 45, (7), pp. 2397–2417 (doi: 10.1109/18.796380).
-
8)
-
9)
-
13. Wang, Z., Xue, E., Chai, J.: ‘A method to construct complementary sets of non-power-of-two length by concatenation’. Proc. 8th Int. Symp. Workshop on Signal Design Applications in Communications, Sapporo, Japan, 2017, pp. 24–28.
-
10)
-
7. Golay, M.J.E.: ‘Complementary series’, IRE Trans. Inf. Theory, 1961, 7, (2), pp. 82–87 (doi: 10.1109/TIT.1961.1057620).
-
11)
-
15. Huang, Y.W., Li, Y.: ‘16-QAM Golay complementary sequences with new sequence lengths’. Proc. IEEE Int. Symp. on Inf. Theory, St. Petersburg, Russia, 2011, pp. 698–702.
-
12)
-
12. Chen, C.Y.: ‘A novel construction of complementary sets with flexible lengths based on boolean functions’, IEEE Commun. Lett., 2018, 22, (2), pp. 260–263 (doi: 10.1109/LCOMM.2017.2773093).
-
13)
-
17. Tseng, C.C., Liu, C.L.: ‘Complementary sets of sequences’, IEEE Trans. Inf. Theory, 1972, IT-18, (5), pp. 644–652 (doi: 10.1109/TIT.1972.1054860).
-
14)
-
17. Wang, G., Adhikary, A.R., Zhou, Z., et al: ‘Generalized constructions of complementary sets of sequences of lengths non-power-of-two’, IEEE Signal Process. Lett., 2020, 27, pp. 136–140 (doi: 10.1109/LSP.2019.2960155).
-
15)
-
11. Chen, C.Y.: ‘Complementary sets of non-power-of-two length for peak-to-average power ratio reduction in OFDM’, IEEE Trans. Inf. Theory, 2016, 62, (12), pp. 7538–7545 (doi: 10.1109/TIT.2016.2613994).
-
16)
-
4. Popović, B.M.: ‘Synthesis of power efficient multitone signals with flat amplitude spectrum’, IEEE Trans. Commun., 1991, 39, (7), pp. 1031–1033 (doi: 10.1109/26.87205).
-
17)
-
14. Chang, C.Y., Li, Y., Hirata, J.: ‘New 64-QAM Golay complementary sequences’, IEEE Trans Inf. Theory, 2010, 56, (5), pp. 2479–2485 (doi: 10.1109/TIT.2010.2043871).
-
18)
-
5. van Nee, R.: ‘OFDM codes for peak-to-average power reduction and error correction’. Proc. IEEE Global Telecommunications Conf., London, UK, 1996, pp. 740–744.
-
19)
-
4. Adhikary, A.R., Majhi, S.: ‘New constructions of complementary sets of sequences of lengths non-power-of-two’, Commun. Lett., 2019, 23, (7), pp. 1119–1122 (doi: 10.1109/LCOMM.2019.2913382).
-
20)
-
3. Boyd, S.: ‘Multitone signals with low crest factor’, IEEE Trans. Circuits Syst., 1986, CAS-33, (10), pp. 1018–1022 (doi: 10.1109/TCS.1986.1085837).
-
21)
-
8. Chen, C.Y., Wang, C.H., Chao, C.C.: ‘Complementary sets and Reed-Muller codes for peak-to-average power ratio reduction in OFDM’. Proc. 16th Int. Symp. on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (AAECC), Las Vegas, NV, USA, 2006, pp. 317–327.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2020.1407
Related content
content/journals/10.1049/el.2020.1407
pub_keyword,iet_inspecKeyword,pub_concept
6
6