基于基序列构造二元互补序列集

Constructions of Binary Complementary Sequence Set Based on Base Sequences

互补序列集凭借其理想的非周期自相关函数特性,在通信与感知领域得到广泛应用。针对互补序列集长度受限的问题,该文以基序列为初始序列,利用级联算子和交织算子提出两类二元互补序列集的新构造方法。所提构造填补了二元互补序列集在特定长度上的空白,并解决了由Adhikary和Majhi提出的公开问题。

Complementary Sequence Sets(CSS)have ideal aperiodic auto-correlation functions and are widely used in the field of communication and sensing.In order to solve the problem of limited length of complementary sequence sets,two new constructions of binary complementary sequence sets are proposed using concatenation operator and interleaving operator,with the base sequence as the initial sequence.The proposed construction fills the gap in the length of the binary complementary sequence set and solves the public problem proposed by Adhikary and Majhi.