اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNew families of Strictly optimal Frequency hopping sequence sets
79
0
0.0
(
0
)
تأليف
Jingjun Bao
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHS sets with optimal partial Hamming correlation. We present several direct constructions for balanced nested cyclic difference packings (BNCDPs) and balanced nested cyclic relative difference packings (BNCRDPs) such that both of them have a special property by using trace functions and discrete logarithm. We also show three recursive constructions for FHS sets with partial Hamming correlation, which are based on cyclic difference matrices and discrete logarithm. Combing these BNCDPs, BNCRDPs and three recursive constructions, we obtain infinitely many new strictly optimal FHS sets with respect to the Peng-Fan bounds.
قيم البحث
اقرأ أيضاً
In this paper, a new construction of interference-free zero correlation zone (IF-ZCZ) sequence sets is proposed by well designed finite Zak transform lattice tessellation. Each set is characterized by the period of sequences $KM^2$, the set size $K$
and the length of zero correlation zone $M^2-1$, which is optimal with respect to the Tang-Fan-Matsufuji bound. In particular, all sequences in these sets have sparse and highly structured Zak and Fourier spectra, which can decrease the computational complexity of the implementation of the banks of matched filters. Moreover, for the parameters proposed in this paper, the new construction is essentially different from the general construction of optimal IF-ZCZ sequence sets given by Popovic.
Quasi-complementary sequence sets (QCSSs) can be seen as a generalized version of complete complementary codes (CCCs), which enables multicarrier communication systems to support more users. The contribution of this work is two-fold. First, we propos
e a systematic construction of Florentine rectangles. Secondly, we propose several sets of CCCs and QCSS, using Florentine rectangles. The CCCs and QCSS are constructed over $mathbb{Z}_N$, where $Ngeq2$ is any integer. The cross-correlation magnitude of any two of the constructed CCCs is upper bounded by $N$. By combining the proposed CCCs, we propose asymptotically optimal and near-optimal QCSSs with new parameters. This solves a long-standing problem, of designing asymptotically optimal aperiodic QCSS over $mathbb{Z}_N$, where $N$ is any integer.
The concept of paraunitary (PU) matrices arose in the early 1990s in the study of multi-rate filter banks. So far, these matrices have found wide applications in cryptography, digital signal processing, and wireless communications. Existing PU matric
es are subject to certain constraints on their existence and hence their availability is not guaranteed in practice. Motivated by this, for the first time, we introduce a novel concept, called $Z$-paraunitary (ZPU) matrix, whose orthogonality is defined over a matrix of polynomials with identical degree not necessarily taking the maximum value. We show that there exists an equivalence between a ZPU matrix and a $Z$-complementary code set when the latter is expressed as a matrix with polynomial entries. Furthermore, we investigate some important properties of ZPU matrices, which are useful for the extension of matrix sizes and sequence lengths. Finally, we propose a unifying construction framework for optimal ZPU matrices which includes existing PU matrices as a special case.
A new method to construct $q$-ary complementary sequence sets (CSSs) and complete complementary codes (CCCs) of size $N$ is proposed by using desired para-unitary (PU) matrices. The concept of seed PU matrices is introduced and a systematic approach
on how to compute the explicit forms of the functions in constructed CSSs and CCCs from the seed PU matrices is given. A general form of these functions only depends on a basis of the functions from $Z_N$ to $Z_q$ and representatives in the equivalent class of Butson-type Hadamard (BH) matrices. Especially, the realization of Golay pairs from the our general form exactly coincides with the standard Golay pairs. The realization of ternary complementary sequences of size $3$ is first reported here. For the realization of the quaternary complementary sequences of size 4, almost all the sequences derived here are never reported before. Generalized seed PU matrices and the recursive constructions of the desired PU matrices are also studied, and a large number of new constructions of CSSs and CCCs are given accordingly. From the perspective of this paper, all the known results of CSSs and CCCs with explicit GBF form in the literature (except non-standard Golay pairs) are constructed from the Walsh matrices of order 2. This suggests that the proposed method with the BH matrices of higher orders will yield a large number of new CSSs and CCCs with the exponentially increasing number of the sequences of low peak-to-mean envelope power ratio.
A new method to construct $q$-ary complementary sequence (or array) sets (CSSs) and complete complementary codes (CCCs) of size $N$ is introduced in this paper. An algorithm on how to compute the explicit form of the functions in constructed CSS and
CCC is also given. A general form of these functions only depends on a basis of functions from $Z_N$ to $Z_q$ and representatives in the equivalent class of Butson-type Hadamard matrices. Surprisingly, all the functions fill up a larger number of cosets of a linear code, compared with the existing constructions. From our general construction, its realization of $q$-ary Golay pairs exactly coincides with the standard Golay sequences. The realization of ternary complementary sequences of size $3$ is first reported here. For binary and quaternary complementary sequences of size 4, a general Boolean function form of these sequences is obtained. Most of these sequences are also new. Moreover, most of quaternary sequences cannot be generalized from binary sequences, which is different from known constructions. More importantly, both binary and quaternary sequences of size 4 constitute a large number of cosets of the linear code respectively.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
