365 research outputs found
Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRs
In this paper, we first propose a new design strategy of 2D -complementary
array quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four
distinct unimodular arrays satisfying zero 2D auto-correlation sums for
non-trivial 2D time-shifts within certain zone. Then, we obtain the upper
bounds on the column sequence peak-to-mean envelope power ratio (PMEPR) of the
constructed 2D-ZCAQs by using specific auto-correlation properties of some seed
sequences. The constructed 2D-ZCAQs with bounded column sequence PMEPR can be
used as a potential alternative to 2D Golay complementary array sets for
practical applicationsComment: This work has been presented in 2023 IEEE International Symposium on
Information Theory (ISIT), Taipei, Taiwa
Construction of New Optimal Z-Complementary Code Sets from Z-Paraunitary Matrices
In this paper, we first introduce a novel concept, called Z-paraunitary (ZPU) matrices. These ZPU matrices include conventional PU matrices as a special case. Then, we show that there exists an equivalence between a ZPU matrix and a Z-complementary code set (ZCCS) when the latter is expressed as a matrix with polynomial entries. The proposed ZPU matrix has an advantage over the conventional PU matrix with regard to the availability of wider range of matrix sizes and sequence lengths. In addition, the proposed construction framework can accommodate more choices of ZCCS parameters compared to the existing works
A Direct Construction of 2D-CCC with Arbitrary Array Size and Flexible Set Size Using Multivariable Function
Recently, two-dimensional (2D) array codes have been found to have
applications in wireless communication.In this paper, we propose direct
construction of 2D complete complementary codes (2D-CCCs) with arbitrary array
size and flexible set size using multivariable functions (MVF). The
Peak-to-mean envelope power ratio (PMEPR) properties of row and column
sequences of the constructed 2D-CCC arrays are investigated. The proposed
construction generalizes many of the existing state-of-the-art such as Golay
complementary pair (GCP), one-dimensional (1D)-CCC, 2D Golay complementary
array set (2D-GCAS), and 2D-CCC with better parameters compared to the existing
work
Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary Matrices
Zero correlation zone (ZCZ) sequence sets play an important role in interference-free quasi-synchronous code-division multiple access communications. In this paper, for the first time, we investigate the periodic correlation properties of polyphase sequences obtained from paraunitary (PU) matrices, which shows the inherent relationship between PU matrix and ZCZ sequence sets. Our investigation suggests that any arbitrary PU matrix can produce ZCZ sequence sets by controlling its expanded form. The key idea is to impose certain restrictions on the expanded forms of the PU matrices to enable precise computation of the periodic correlation functions of the constructed sequences. We show that our proposed construction leads to near-optimal ZCZ sequence sets with regard to the ZCZ set size upper bound
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 ZCCSs with NPT lengths
How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?
Mutually orthogonal complementary sets (MOCSs) have received significant research attention in recent years due to their wide applications in communications and radar. Existing MOCSs which are constructed based on generalized Boolean functions (GBFs) mostly have lengths of power-of-two. How to construct MOCSs with non-power-of-two lengths whilst having large set sizes is a largely open problem. With the aid of GBFs, in this paper, we present new constructions of such MOCSs and show that the maximal achievable set size is 1/2 of the flock size of an MOCS
- …