53,610 research outputs found
A Direct Construction of Optimal Symmetrical Z-Complementary Code Sets of Prime Power Lengths
This paper presents a direct construction of an optimal symmetrical
Z-complementary code set (SZCCS) of prime power lengths using a multi-variable
function (MVF). SZCCS is a natural extension of the Z-complementary code set
(ZCCS), which has only front-end zero correlation zone (ZCZ) width. SZCCS has
both front-end and tail-end ZCZ width. SZCCSs are used in developing optimal
training sequences for broadband generalized spatial modulation systems over
frequency-selective channels because they have ZCZ width on both the front and
tail ends. The construction of optimal SZCCS with large set sizes and prime
power lengths is presented for the first time in this paper. Furthermore, it is
worth noting that several existing works on ZCCS and SZCCS can be viewed as
special cases of the proposed construction
Recommended from our members
Large Families of Ternary Sequences with Aperiodic Zero Correlation Zone Sequences for a Multi-Carrier DS-CDMA System
A new method for generating families of ternary spreading sequences is presented. The sequences have aperiodic zero correlation zones and large families are created for a specific sequence length. The sequences are proposed as spreading sequences to provide high capacity and cancel multipath and multiple access interference (MAI) in a single carrier (SC) or multi-carrier (MC) direct-spread code division multiple access (DS-CDMA) system. A Multi-carrier DS-CDMA system is simulated that employs the new sequences as spreading sequences in a multipath channel. Bit error rates (BER) and frame error rates (FER) for a range of Eb/No values are presented and it is demonstrated that the proposed sequences improve the BER and FER performance when used in place of masked Walsh Codes for the frequency selective fading channel evaluated, when a single correlator receiver is used on each sub-carrier
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
Large Zero Autocorrelation Zone of Golay Sequences and -QAM Golay Complementary Sequences
Sequences with good correlation properties have been widely adopted in modern
communications, radar and sonar applications. In this paper, we present our new
findings on some constructions of single -ary Golay sequence and -QAM
Golay complementary sequence with a large zero autocorrelation zone, where
is an arbitrary even integer and is an arbitrary integer.
Those new results on Golay sequences and QAM Golay complementary sequences can
be explored during synchronization and detection at the receiver end and thus
improve the performance of the communication system
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
- …