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

Constructions of Binary Complementary Sequence Set Based on Base Sequences

作　　者：沈炳声 周正春 杨洋[2] 范平志[1] SHEN Bingsheng;ZHOU Zhengchun;YANG Yang;FAN Pingzhi(School of Information Science and Technology,Southwest Jiaotong University,Chengdu 611756,China;School of Mathematics,Southwest Jiaotong University,Chengdu 611756,China)

机构地区：[1]西南交通大学信息科学与技术学院,成都611756 [2]西南交通大学数学学院,成都611756

出　　处：《电子与信息学报》2024年第9期3757-3762,共6页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(12401695,U23A20274,62171389);四川省自然科学基金创新研究群体(2024NSFTD0015);中央高校基本科研业务费(2682024CX027)。

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

关 键 词：互补序列集 基序列 交织算子 级联算子 

分 类 号：TN911.2[电子电信—通信与信息系统]