33 research outputs found
New Constructions of Zero-Correlation Zone Sequences
In this paper, we propose three classes of systematic approaches for
constructing zero correlation zone (ZCZ) sequence families. In most cases,
these approaches are capable of generating sequence families that achieve the
upper bounds on the family size () and the ZCZ width () for a given
sequence period ().
Our approaches can produce various binary and polyphase ZCZ families with
desired parameters and alphabet size. They also provide additional
tradeoffs amongst the above four system parameters and are less constrained by
the alphabet size. Furthermore, the constructed families have nested-like
property that can be either decomposed or combined to constitute smaller or
larger ZCZ sequence sets. We make detailed comparisons with related works and
present some extended properties. For each approach, we provide examples to
numerically illustrate the proposed construction procedure.Comment: 37 pages, submitted to IEEE Transactions on Information Theor
Design of sequences with good correlation properties
This thesis is dedicated to exploring sequences with good correlation properties. Periodic sequences with desirable correlation properties have numerous applications in communications. Ideally, one would like to have a set of sequences whose out-of-phase auto-correlation magnitudes and cross-correlation magnitudes are very small, preferably zero. However, theoretical bounds show that the maximum magnitudes of auto-correlation and cross-correlation of a sequence set are mutually constrained, i.e., if a set of sequences possesses good auto-correlation properties, then the cross-correlation properties are not good and vice versa. The design of sequence sets that achieve those theoretical bounds is therefore of great interest. In addition, instead of pursuing the least possible correlation values within an entire period, it is also interesting to investigate families of sequences with ideal correlation in a smaller zone around the origin. Such sequences are referred to as sequences with zero correlation zone or ZCZ sequences, which have been extensively studied due to their applications in 4G LTE and 5G NR systems, as well as quasi-synchronous code-division multiple-access communication systems.
Paper I and a part of Paper II aim to construct sequence sets with low correlation within a whole period. Paper I presents a construction of sequence sets that meets the Sarwate bound. The construction builds a connection between generalised Frank sequences and combinatorial objects, circular Florentine arrays. The size of the sequence sets is determined by the existence of circular Florentine arrays of some order. Paper II further connects circular Florentine arrays to a unified construction of perfect polyphase sequences, which include generalised Frank sequences as a special case. The size of a sequence set that meets the Sarwate bound, depends on a divisor of the period of the employed sequences, as well as the existence of circular Florentine arrays.
Paper III-VI and a part of Paper II are devoted to ZCZ sequences.
Papers II and III propose infinite families of optimal ZCZ sequence sets with respect to some bound, which are used to eliminate interference within a single cell in a cellular network. Papers V, VI and a part of Paper II focus on constructions of multiple optimal ZCZ sequence sets with favorable inter-set cross-correlation, which can be used in multi-user communication environments to minimize inter-cell interference. In particular, Paper~II employs circular Florentine arrays and improves the number of the optimal ZCZ sequence sets with optimal inter-set cross-correlation property in some cases.Doktorgradsavhandlin
Sequence Design for Cognitive CDMA Communications under Arbitrary Spectrum Hole Constraint
To support interference-free quasi-synchronous code-division multiple-access
(QS-CDMA) communication with low spectral density profile in a cognitive radio
(CR) network, it is desirable to design a set of CDMA spreading sequences with
zero-correlation zone (ZCZ) property. However, traditional ZCZ sequences (which
assume the availability of the entire spectral band) cannot be used because
their orthogonality will be destroyed by the spectrum hole constraint in a CR
channel. To date, analytical construction of ZCZ CR sequences remains open.
Taking advantage of the Kronecker sequence property, a novel family of
sequences (called "quasi-ZCZ" CR sequences) which displays zero
cross-correlation and near-zero auto-correlation zone property under arbitrary
spectrum hole constraint is presented in this paper. Furthermore, a novel
algorithm is proposed to jointly optimize the peak-to-average power ratio
(PAPR) and the periodic auto-correlations of the proposed quasi-ZCZ CR
sequences. Simulations show that they give rise to single-user bit-error-rate
performance in CR-CDMA systems which outperform traditional non-contiguous
multicarrier CDMA and transform domain communication systems; they also lead to
CR-CDMA systems which are more resilient than non-contiguous OFDM systems to
spectrum sensing mismatch, due to the wideband spreading.Comment: 13 pages,10 figures,Accepted by IEEE Journal on Selected Areas in
Communications (JSAC)--Special Issue:Cognitive Radio Nov, 201
A Direct Construction of Prime-Power-Length Zero-Correlation Zone Sequences for QS-CDMA System
In recent years, zero-correlation zone (ZCZ) sequences are being studied due
to their significant applications in quasi-synchronous code division multiple
access (QS-CDMA) systems and other wireless communication domains. However, the
lengths of most existing ZCZ sequences are limited, and their parameters are
not flexible, which are leading to practical limitations in their use in
QS-CDMA and other communication systems. The current study proposes a direct
construction of ZCZ sequences of prime-power length with flexible parameters by
using multivariable functions. In the proposed construction, we first present a
multivariable function to generate a vector with specific properties; this is
further used to generate another class of multivariable functions to generate
the desired -ZCZ sequence set, where is a prime
number, are positive integers, and . The constructed ZCZ
sequence set is optimal for the binary case and asymptotically optimal for the
non-binary case by the \emph{Tang-Fan-Matsufuji} bound. Moreover, a relation
between the second-order cosets of first-order generalized Reed-Muller code and
the proposed ZCZ sequences is also established. The proposed construction of
ZCZ sequences is compared with existing constructions, and it is observed that
the parameters of this ZCZ sequence set are a generalization of that of in some
existing works. Finally, the performance of the proposed ZCZ-based QS-CDMA
system is compared with the Walsh-Hadamard and Gold code-based QS-CDMA system
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
A Systematic Framework for the Construction of Optimal Complete Complementary Codes
The complete complementary code (CCC) is a sequence family with ideal
correlation sums which was proposed by Suehiro and Hatori. Numerous literatures
show its applications to direct-spread code-division multiple access (DS-CDMA)
systems for inter-channel interference (ICI)-free communication with improved
spectral efficiency. In this paper, we propose a systematic framework for the
construction of CCCs based on -shift cross-orthogonal sequence families
(-CO-SFs). We show theoretical bounds on the size of -CO-SFs and CCCs,
and give a set of four algorithms for their generation and extension. The
algorithms are optimal in the sense that the size of resulted sequence families
achieves theoretical bounds and, with the algorithms, we can construct an
optimal CCC consisting of sequences whose lengths are not only almost arbitrary
but even variable between sequence families. We also discuss the family size,
alphabet size, and lengths of constructible CCCs based on the proposed
algorithms