Quasi Complementary Sequence Sets: New Bounds and Optimal Constructions via Quasi-Florentine Rectangles

Abstract

Quasi complementary sequence sets (QCSSs) are important in modern communication systems as they are capable of supporting more users, which is desired in applications like MC-CDMA nowadays. In this paper, we first derive a tighter bound on the maximum aperiodic correlation among all constituent complementary sequence sets in QCSSs. By proposing a new combinatorial structure called quasi-Florentine rectangles, we obtain a new construction of QCSSs with large set sizes. Using Butson-type Hadamard matrices and quasi-Florentine rectangles, we propose another construction which can construct QCSSs with flexible parameters over any given alphabet size, including small alphabets. All the proposed sequences are optimal with respect to the newly proposed bound. Also, through some of the constructions, the column sequence PMEPR of the proposed QCSSs are upper bounded by 2.