新的周期准互补序列集构造方法

doi:10.11959/j.issn.1000-436x.2023100

通信学报 ›› 2023, Vol. 44 ›› Issue (5): 206-212.doi: 10.11959/j.issn.1000-436x.2023100

新的周期准互补序列集构造方法

陈晓玉¹^,², 王成瑞¹^,², 刘凡¹^,²

¹ 燕山大学信息科学与工程学院，河北秦皇岛 066004
² 河北省信息传输与信号处理重点实验室，河北秦皇岛 066004

修回日期:2023-04-26 出版日期:2023-05-25 发布日期:2023-05-01
作者简介:陈晓玉（1983- ），女，内蒙古赤峰人，博士，燕山大学副教授、硕士生导师，主要研究方向为序列设计、无线通信技术
王成瑞（1999- ），男，山东泰安人，燕山大学硕士生，主要研究方向为序列设计
刘凡（1998- ），女，河北唐山人，燕山大学硕士生，主要研究方向为序列设计
基金资助:
国家自然科学基金资助项目(62241110);河北省自然科学基金资助项目(F2021203078);河北省高等学校科学技术研究项目(ZD2022026);河北省重点实验室项目(202250701010046)

New construction method of periodic quasi-complementary sequence set

Xiaoyu CHEN¹^,², Chengrui WANG¹^,², Fan LIU¹^,²

¹ College of Information Science ＆Engineering, Yanshan University, Qinhuangdao 066004, China
² Hebei Province Key Laboratory of Information Transmission and Signal Processing, Qinhuangdao 066004, China

Revised:2023-04-26 Online:2023-05-25 Published:2023-05-01
Supported by:
The National Natural Science Foundation of China(62241110);The Natural Science Foundation of Hebei Province(F2021203078);Science and Technology Project of Hebei Education Department(ZD2022026);Hebei Key Labor-atory Project(202250701010046)

摘要/Abstract

摘要：

为解决完备互补序列集序列数目受限的问题，构造了周期准互补序列集。首先基于循环 Florentine 阵列，应用上的映射函数构造了几乎最优周期准互补序列集，所构造的周期准互补序列集具有全新的子序列长度；其次基于单重合跳频序列集，定义到上的映射函数，构造了渐近最优周期准互补序列集。对比结果表明，与现有周期准互补序列集相比，所提方法在子序列长度相同时包含更多的序列数目，可以在多载波通信系统中支持更多用户。

关键词: 准互补, 几乎最优, 渐近最优, 循环Florentine阵列, 单重合跳频

Abstract:

To solve the problem that the number of sequences in the complete complementary sequence set is limited, periodic quasi-complementary sequence set was constructed.Firstly, based on the circular Florentine array, the near optimal periodic quasi-complementary sequence set was constructed by using the mapping function on .The obtained periodic quasi-complementary sequence sets had new subsequence lengths.Secondly, based on the one-coincidence frequency-hopping sequence set, the asymptotically optimal periodic quasi-complementary sequence set was constructed by defining the mapping function from to .The comparison results show that compared with the existing periodic quasi-complementary sequence sets, the proposed method contains more sequences with the same subsequence length, and can support more users in multi-carrier communication system.

Key words: quasi-complementary, near optimal, asymptotically optimal, circular Florentine array, one-coincidence fre-quency-hopping

中图分类号:

TN911.2

陈晓玉, 王成瑞, 刘凡. 新的周期准互补序列集构造方法[J]. 通信学报, 2023, 44(5): 206-212.

Xiaoyu CHEN, Chengrui WANG, Fan LIU. New construction method of periodic quasi-complementary sequence set[J]. Journal on Communications, 2023, 44(5): 206-212.

图/表 2

参考文献 13

[1]	RATHINAKUMAR A , CHATURVEDI A K . Complete mutually orthogonal Golay complementary sets from reed-muller codes[J]. IEEE Transactions on Information Theory, 2008,54(3): 1339-1346.
[2]	SUEHIRO N , HATORI M . N-shift cross-orthogonal sequences[J]. IEEE Transactions on Information Theory, 1988,34(1): 143-146.
[3]	CHEN H H , YEH J F , SUEHIRO N . A multicarrier CDMA architecture based on orthogonal complementary codes for new generations of wideband wireless communications[J]. IEEE Communications Magazine, 2001,39(10): 126-135.
[4]	LIU Z L , GUAN Y L , CHEN H H . Fractional-delay-resilient receiver design for interference-free MC-CDMA communications based on complete complementary codes[J]. IEEE Transactions on Wireless Communications, 2015,14(3): 1226-1236.
[5]	LIU Z L , PARAMPALLI U , GUAN Y L ,et al. Constructions of optimal and near-optimal quasi-complementary sequence sets from singer difference sets[J]. IEEE Wireless Communications Letters, 2013,2(5): 487-490.
[6]	LIU Z L , GUAN Y L , MOW W H . A tighter correlation lower bound for quasi-complementary sequence sets[J]. IEEE Transactions on Information Theory, 2014,60(1): 388-396.
[7]	LI Y B , LIU T , XU C Q . Constructions of asymptotically optimal quasi-complementary sequence sets[J]. IEEE Communications Letters, 2018,22(8): 1516-1519.
[8]	LI Y B , TIAN L Y , LIU T ,et al. Two constructions of asymptotically optimal quasi-complementary sequence sets[J]. IEEE Transactions on Communications, 2019,67(3): 1910-1924.
[9]	LI Y B , TIAN L Y , LIU T ,et al. Constructions of quasi-complementary sequence sets associated with characters[J]. IEEE Transactions on Information Theory, 2019,65(7): 4597-4608.
[10]	陈晓玉, 彭秀英, 王成瑞 ,等. 周期准互补序列集构造法[J]. 电子与信息学报, 2022,44(11): 4034-4040.
	CHEN X Y , PENG X Y , WANG C R ,et al. Constructions of periodic quasi-complementary sequence sets[J]. Journal of Electronics ＆ Information Technology, 2022,44(11): 4034-4040.
[11]	LUO G J , CAO X W , SHI M J ,et al. Three new constructions of asymptotically optimal periodic quasi-complementary sequence sets with small alphabet sizes[J]. IEEE Transactions on Information Theory, 2021,67(8): 5168-5177.
[12]	ZHANG D , HELLESETH T . Sequences with good correlations based on circular Florentine arrays[J]. IEEE Transactions on Information Theory, 2022,68(5): 3381-3388.
[13]	REED I . Kth-order near-orthogonal codes (corresp.)[J]. IEEE Transactions on Information Theory, 1971,17(1): 116-117.

p, n, q值	K	M	N	δ_max
p=2, n=3, q=8	56	8	7	1.153
p=3, n=2, q=9	72	9	8	1.133
p=2,n=4,q=16	240	16	15	1.069
p=5,n=2,q=25	600	25	24	1.043
p=3,n=3,q=27	702	27	26	1.039
p=7,n=2,q=49	992	32	31	1.033

构造方法	K	M	N	δ_max	约束条件
文献[7]方法	p		p		p是素数
文献[8]方法1					p是奇素数
文献[8]方法2					p是素数
文献[9]方法1					p是奇素数
文献[9]方法2					p是素数，n＞1
文献[9]方法3					p是素数
文献[10]方法1					p= 2
文献[10]方法2					p是奇素数
文献[11]方法1					p是奇素数且
文献[11]方法2					p是奇素数且
本文构造法1	NF(N)	N	N	N	N是奇数
本文构造法2					p是素数且

[1]	陈晓玉, 孙连峰, 张钇涵. 具有大零相关区宽度的Ⅱ型偶长Z-互补对构造方法[J]. 通信学报, 2023, 44(6): 167-174.
[2]	李君, 周乐佳, 李正权, 吉茹, 诸锦涛, 刘兴鑫, 刘子怡. 基于GRU网络辅助和路径度量交换的极化码SCLF算法[J]. 通信学报, 2023, 44(6): 223-237.
[3]	郭锐, 刘洋. 基于简化序列重复节点的极化码快速串行抵消译码算法[J]. 通信学报, 2023, 44(5): 158-168.
[4]	张平, 牛凯, 姚圣时, 戴金晟. 面向未来的语义通信：基本原理与实现方法[J]. 通信学报, 2023, 44(5): 1-14.
[5]	陈晓玉, 孙连峰, 张杰坤, 李玉博. 新的Ⅱ型偶长Z-互补对构造[J]. 通信学报, 2023, 44(3): 138-144.
[6]	解元, 邹涛, 孙为军, 谢胜利. 面向高混响环境的欠定卷积盲源分离算法[J]. 通信学报, 2023, 44(2): 82-93.
[7]	宋鑫, 倪淑燕, 张喆, 廖育荣, 雷拓峰. 面向不等差错保护的低误码平台LT编码算法[J]. 通信学报, 2022, 43(6): 85-97.
[8]	彭秀平, 李红晓, 王仕德, 林洪彬. 周期为N≡1（mod4）的平衡最优几乎二元序列对[J]. 通信学报, 2021, 42(12): 163-171.
[9]	宋鑫, 程乃平, 倪淑燕, 廖育荣, 雷拓峰. 采用定长节点分类窗口的低误码平台LT编码算法[J]. 通信学报, 2021, 42(9): 31-42.
[10]	王桐, 高山, 龚慧雯, 孙博. 基于分时MDP的出租车载客预测推荐技术研究[J]. 通信学报, 2021, 42(2): 37-51.
[11]	陈晓玉,高茜超,李永杰. 最佳零相关区序列集构造法[J]. 通信学报, 2020, 41(8): 215-222.
[12]	牛凯,戴金晟,朴瑨楠. 面向6G的极化码与极化处理[J]. 通信学报, 2020, 41(5): 9-17.
[13]	孙彦景,杨俊秋,陈岩,王艳芬,陈晓晶,刘丰祯,孙智. 面向工业物联网的IEEE 802.11ah协议RAW在线式重分组方法[J]. 通信学报, 2020, 41(4): 92-101.
[14]	王海荣, 董健, 王玉辉. 大规模MIMO系统中基于谱分离的导频去污染[J]. 通信学报, 2020, 41(4): 197-205.
[15]	李玉博,刘胜毅,张景景,贾冬艳. 基于Zadoff-Chu矩阵的最优码本构造方法[J]. 通信学报, 2020, 41(3): 112-119.

新的周期准互补序列集构造方法

New construction method of periodic quasi-complementary sequence set

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 2

参考文献 13

相关文章 15

Metrics

推荐阅读 0