اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNew Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes
201
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
Previously, we have presented a framework to use the para-unitary (PU) matrix-based approach for constructing new complementary sequence set (CSS), complete complementary code (CCC), complementary sequence array (CSA), and complete complementary arra
y (CCA). In this paper, we introduce a new class of delay matrices for the PU construction. In this way, generalized Boolean functions (GBF) derived from PU matrix can be represented by an array of size $2times 2 times cdots times 2$. In addition, we introduce a new method to construct PU matrices using block matrices. With these two new ingredients, our new framework can construct an extremely large number of new CSA, CCA, CSS and CCC, and their respective GBFs can be also determined recursively. Furthermore, we can show that the known constructions of CSSs, proposed by Paterson and Schmidt respectively, the known CCCs based on Reed-muller codes are all special cases of this new framework. In addition, we are able to explain the bound of PMEPR of the sequences in the part of the open question, proposed in 2000 by Paterson.
In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result determine the
so-called $delta$-linear terms and $delta$-quadratic terms. As a first consequence, a powerful theory linking Golay complementary sets of $p$-ary ($p$ prime) sequences and the generalized Reed-Muller codes by Kasami et al. is developed. These codes enjoy good error-correcting capability, tightly controlled PMEPR, and significantly extend the range of coding options for applications of OFDM using $p^n$ subcarriers. As another consequence, we make a previously unrecognized connection between the sequences in CSSs and CCCs and the sequence with 2-level autocorrelation, trace function and permutation polynomial (PP) over the finite fields.
In this study, we propose a flexible construction of complementary sequences (CSs) that can contain zero-valued elements. To derive the construction, we use Boolean functions to represent a polynomial generated with a recursion. By applying this repr
esentation to recursive CS constructions, we show the impact of construction parameters such as sign, amplitude, phase rotation used in the recursion on the elements of the synthesized CS. As a result, we extend Davis and Jedwabs CS construction by obtaining independent functions for the amplitude and phase of each element of the CS, and the seed sequence positions in the CS. The proposed construction shows that a set of distinct CSs compatible with non-contiguous resource allocations for orthogonal frequency-division multiplexing (OFDM) and various constellations can be synthesized systematically. It also leads to a low peak-to-mean-envelope-power ratio (PMEPR) multiple accessing scheme in the uplink and a low-complexity recursive decoder. We demonstrate the performance of the proposed encoder and decoder through comprehensive simulations.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
