首页/论文/2305.04698

arXiv 2305.046982023-05-10cs.ITmath.IT

多移位互补集的灵活长度直接构造

Direct Constructions of Multiple Shift Complementary Sets of Flexible Lengths

Abhishek Roy, Sudhan Majhi

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

摘要英文摘要相关论文

AI总结：

本文提出基于多变量函数的直接构造方法，生成灵活长度与集合大小的多移位互补集，以扩展序列集并降低OFDM中的峰均功率比。

摘要：

Golay互补集（GCS）在正交频分复用（OFDM）中降低峰均包络功率比（PMEPR）方面起着至关重要的作用。GCS的一个更一般的版本是多移位互补集（MSCS），通过将零自相关和的条件从所有非零时移放宽到某个固定时移的整数倍，可以获得更多的序列集。在本文中，我们提出了使用多变量函数直接构造具有灵活和任意长度以及灵活集合大小的MSCS的方法，这在此前尚未被报道过。

英文摘要：

Golay complementary set (GCS) plays a vital role in reducing peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM). A more general version of GCS is a multiple shift complementary set (MSCS), where by relaxing the condition of zero auto-correlation sum throughout all the non-zero time shifts to the integer multiples of some fixed time shift, more sequence sets can be made available. In this paper, we propose direct constructions of MSCSs with flexible and arbitrary lengths and flexible set sizes, by using multivariable functions, which have not been reported before.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

摘要英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

A Direct Construction of Cross Z-Complementary Sets with Flexible Lengths and Large Zero Correlation Zone

This letter proposes a direct construction for cross Z-complementary sets (CZCSs) with flexible lengths and a large zero correlation zone (ZCZ). CZCS is an extension of the cross Z-complementary pair (CZCP). The maximum possible ZCZ width of a CZCP is half of its sequence length. In this letter, for the first time, a generalized Boolean function based construction of CZCSs with a large number of constituent sequences and a ZCZ ratio of $2/3$ is presented. For integers $m$ and $δ$, the proposed construction produces CZCS with length expressed as $2^{m-1}+2^δ$ ($0 \leq δ<m-1,m\geq 4$), where bot…

2022-07-24cs.ITmath.IT

Pseudo-Boolean Functions for Optimal Z-Complementary Code Sets with Flexible Lengths

This paper aims to construct optimal Z-complementary code set (ZCCS) with non-power-of-two (NPT) lengths to enable interference-free multicarrier code-division multiple access (MC-CDMA) systems. The existing ZCCSs with NPT lengths, which are constructed from generalized Boolean functions (GBFs), are sub-optimal only with respect to the set size upper bound. For the first time in the literature, we advocate the use of pseudo-Boolean functions (PBFs) (each of which transforms a number of binary variables to a real number as a natural generalization of GBF) for direct constructions of optimal ZCC…

2021-04-20cs.ITeess.SPmath.IT

利用多变量函数直接构造具有任意阵列规模和灵活集合规模的2D-CCC

A Direct Construction of 2D-CCC with Arbitrary Array Size and Flexible Set Size Using Multivariable Function

该研究提出利用多变量函数直接构造任意阵列规模、灵活集合规模的2D-CCC，分析其行列序列的PMEPR特性，该构造推广了多种现有相关成果且参数更优，可应用于无线通信领域。

2024-09-11cs.ITmath.IT

A Direct Construction of Optimal 2D-ZCACS with Flexible Array Size and Large Set Size

In this paper, we propose a direct construction of optimal two-dimensional Z-complementary array code sets (2D-ZCACS) using multivariable functions (MVFs). In contrast to earlier works, the proposed construction allows for a flexible array size and a large set size. Additionally, the proposed design can be transformed into a one-dimensional Z-complementary code set (1D-ZCCS). Many of the 1D-ZCCS described in the literature appeared to be special cases of this proposed construction. At last, we compare our work with the current state of the art and then draw our conclusions.

2023-01-06cs.ITmath.IT

$q$-ary Golay互补对的构造：适用于非2的幂长度

Constructions of $q$-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths

本文证明了四元GCP的存在等价于可构造长度为2^mM的4h元GCP，通过扩展布尔函数构造了更灵活长度范围的GCP。

2026-04-16cs.ITmath.IT

面向不同系统需求的灵活长度二维 Z-互补阵列码集构造

Construction of 2-D Z-Complementary Array Code Sets with Flexible Lengths for Different System Requirements

本文利用多变量扩展布尔函数构造灵活参数的二维 ZCACS，给出更优 PMEPR 上界和更紧集合大小界，并导出 GCAS/GCS，仿真验证其通信性能。

2025-09-02cs.ITmath.IT

更多相关论文收起更多论文

Asymptotically Optimal Golay-ZCZ Sequence Sets with Flexible Length

Zero correlation zone (ZCZ) sequences and Golay complementary sequences are two kinds of sequences with different preferable correlation properties. Golay-ZCZ sequences are special kinds of complementary sequences which also possess a large ZCZ and are good candidates for pilots in OFDM systems. Known Golay-ZCZ sequences reported in the literature have a limitation in the length which is the form of a power of 2. In this paper, we propose two constructions of Golay-ZCZ sequence sets with new parameters which generalize the constructions of Gong et al. (IEEE Transaction on Communications 61(9),…

2021-12-16cs.ITmath.IT

Resource Optimization with Flexible Numerology and Frame Structure for Heterogeneous Services

We explore the potential of optimizing resource allocation with flexible numerology in frequency domain and variable frame structure in time domain, in presence of services with different types of requirements. We analyze the computational complexity and propose a scalable optimization algorithm based on searching in both the primal space and dual space that are complementary to each other. Numerical results show significant advantages of adopting flexibility in both time and frequency domains for capacity enhancement and meeting the requirements of mission critical services.

2018-08-10cs.ITmath.IT

基于扩展布尔函数的互正交互补集与Z-互补码集的新构造

New Constructions of Mutually Orthogonal Complementary Sets and Z-Complementary Code Sets Based on Extended Boolean Functions

本文基于扩展布尔函数提出MOCSs和ZCCSs的直接构造方法，可生成灵活长度及满足集合大小上界的最优码集，适合快速硬件生成。

2023-08-09cs.ITmath.IT

A Generalised Construction of Multiple Complete Complementary Codes and Asymptotically Optimal Aperiodic Quasi-Complementary Sequence Sets

In recent years, complementary sequence sets have found many important applications in multi-carrier code-division multiple-access (MC-CDMA) systems for their good correlation properties. In this paper, we propose a construction, which can generate multiple sets of complete complementary codes (CCCs) over $\mathbb{Z}_N$, where $N~(N\geq 3)$ is a positive integer of the form $N=p_0^{e^0}p_1^{e^1}\dots p_{n-1}^{e^{n-1}}$, $p_0<p_1<\cdots<p_{n-1}$ are prime factors of $N$ and $e_0,e_1,\cdots,e_{n-1}$ are non-negative integers. Interestingly, the maximum inter-set aperiodic cross-correlation magni…

2021-05-21cs.ITmath.IT

New Construction of Optimal Type-II Binary Z-Complementary Pairs

A pair of sequences is called a Z-complementary pair (ZCP) if it has zero aperiodic autocorrelation sums at each of the non-zero time-shifts within {a} certain region, called the zero correlation zone (ZCZ). ZCPs are categorised into two types{:} Type-I ZCPs and Type-II ZCPs. Type-I ZCPs have {the} ZCZ around the in-phase position and Type-II ZCPs have the ZCZ around the end-shift position. {Till now only a few} constructions of Type-II ZCPs are reported {in the literature}, and all {have} lengths of the form $2^m\pm1$ or $N+1$ where $N=2^a 10^b 26^c$ and $a,~b,~c$ are non-negative integers. I…

2020-04-11cs.ITmath.IT

OFDM的互补集、广义Reed-Muller码和功率控制

Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM

在正交频分复用（OFDM）传输中，使用纠错码严格控制的峰均包络功率比（PMEPR）被认为是在这个对应关系。通过推广Paterson的结果，可以看出每个长度为2^m的q相（q是偶数）序列都位于大小为2^{k+1}的互补集中，其中k是一个非负整数，可以很容易地从与序列相关的广义布尔函数中确定。对于较小的k，这个结果为长度为2^m的q相序列的PMEPR提供了一个合理的紧界。然后，将经典Reed-Muller码的一个新的2^h元推广与互补集上的结果一起使用，以导出具有低PMEPR的灵活的OFDM编码方案。这些代码包括戴维斯和Jedwab开发的代码作为特例。在某些情况下，本通信中的代码类似于帕特森的代码结构，并且往往优于它们。

2006-11-30cs.ITmath.IT

A Direct Construction of Cross Z-Complementary Sequence Sets with Large Set Size

This letter presents a direct construction of cross Z-complementary sequence sets (CZCSSs), whose aperiodic correlation sums exhibit zero correlation zones at both the front-end and tail-end shifts. CZCSS can be regarded as an extension of the symmetrical Z-complementary code set (SZCCS). The available construction of SZCCS has a limitation on the set size, with a maximum set size of 8. The proposed generalized Boolean function based construction can generate CZCSS of length in the form of non-power-of-two with variable set size $2^{n+1}$, where each code has $2^{n+1}$ constituent sequences. T…

2022-07-06cs.ITmath.IT

增强型交叉Z互补集及其在广义空间调制中的应用

Enhanced Cross Z-Complementary Set and Its Application in Generalized Spatial Modulation

本文提出增强型交叉Z互补集（E-CZCS）并推导其零相关区宽度上界，构造灵活参数的最优序列集，用于广义空间调制系统中的高效训练和信道估计。

2023-12-01cs.ITmath.IT

Two-Dimensional Golay Complementary Array Sets from Generalized Boolean Functions

The one-dimensional (1-D) Golay complementary set (GCS) has many well-known properties and has been widely employed in engineering. The concept of 1-D GCS can be extended to the two-dimensional (2-D) Golay complementary array set (GCAS) where the 2-D aperiodic autocorrelation of constituent arrays sum to zero except for the 2-D zero shift. The 2-D GCAS includes the 2-D Golay complementary array pair (GCAP) as a special case when the set size is 2. In this paper, 2-D generalized Boolean functions are introduced and novel constructions of 2-D GCAPs, 2-D GCASs, and 2-D Golay complementary array m…

2021-02-08cs.ITmath.IT

具有灵活支撑集的谱零约束零相关区序列的构造

Construction of Spectrally-Null-Constrained Zero-Correlation Zone Sequences with Flexible Support

本文提出利用扩展布尔函数构造具有灵活支撑集的谱零约束零相关区序列，该序列在支撑集等于长度时退化为传统ZCZ序列，并生成渐近最优的素数幂长度序列，同时建立与广义Reed-Muller码的关系。

2023-09-05cs.ITmath.IT

New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets

The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for the set of sequences to deploy is the quasi-complementary sequence set (QCSS). Its large set size enables the system to accommodate a lot of users. The set has low nontrivial correlation magnitudes within a zone around the origin. This keeps undue interference among users under control. A QCSS performs better than the perfect complementary sequence set (PCSS)…

2021-09-28cs.ITmath.IT