Details

Autor(en) / Beteiligte

• Li, Yubo
• Tian, Liying
• Liu, Tao
• Xu, Chengqian

Titel

Constructions of Quasi-Complementary Sequence Sets Associated With Characters

Ist Teil von

• IEEE transactions on information theory, 2019-07, Vol.65 (7), p.4597-4608

Ort / Verlag

IEEE

Erscheinungsjahr

2019

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE Electronic Library (IEL)

Beschreibungen/Notizen

• An <inline-formula> <tex-math notation="LaTeX">(\boldsymbol {M},\boldsymbol {K},\boldsymbol {N},\delta _{\max }) </tex-math></inline-formula>-quasi-complementary sequence set (QCSS) is referred to as a set of <inline-formula> <tex-math notation="LaTeX">\boldsymbol {M} </tex-math></inline-formula> 2-D matrices of order <inline-formula> <tex-math notation="LaTeX">\boldsymbol {K}\times \boldsymbol {N} </tex-math></inline-formula> with periodic tolerance <inline-formula> <tex-math notation="LaTeX">\delta _{\max } </tex-math></inline-formula>. In a multicarrier code-division multiple-access (MC-CDMA) communication system, the set size <inline-formula> <tex-math notation="LaTeX">\boldsymbol {M} </tex-math></inline-formula> of a QCSS is equal to the maximum number of users it can support, and the periodic tolerance <inline-formula> <tex-math notation="LaTeX">\delta _{\max } </tex-math></inline-formula> determines the interference performance. For the application of a QCSS, it is desirable that the set size should be as large as possible, and the periodic tolerance should be as small as possible. In this paper, a framework of a periodic QCSS is proposed from additive and multiplicative characters associated with a specific integer set. It is then discovered that the parameters of the obtained QCSS are determined by the employed integer set. From this discovery, new classes of periodic QCSSs with large set sizes and low periodic tolerances are constructed and associated with some known integer sets.