17,966 research outputs found
Exact BER Performance of Asynchronous DS-CDMA Systems using Quadriphase Spreading and QPSK Modulation over Rayleigh Channels
An accurate closed-form expression is derived for calculating the average BER in an asynchronous DS-CDMA system using random complex-valued spreading sequences for transmission over Rayleigh channels. This accurate solution is based on the Characteristic Function (CF) approach and only requires a single numerical integration. Our numerical simulation results verify its accuracy, and also demonstrate the relative inaccuracy of the Gaussian approximation
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
Designing structured tight frames via an alternating projection method
Tight frames, also known as general Welch-bound- equality sequences, generalize orthonormal systems. Numerous applications - including communications, coding, and sparse approximation- require finite-dimensional tight frames that possess additional structural properties. This paper proposes an alternating projection method that is versatile enough to solve a huge class of inverse eigenvalue problems (IEPs), which includes the frame design problem. To apply this method, one needs only to solve a matrix nearness problem that arises naturally from the design specifications. Therefore, it is the fast and easy to develop versions of the algorithm that target new design problems. Alternating projection will often succeed even if algebraic constructions are unavailable. To demonstrate that alternating projection is an effective tool for frame design, the paper studies some important structural properties in detail. First, it addresses the most basic design problem: constructing tight frames with prescribed vector norms. Then, it discusses equiangular tight frames, which are natural dictionaries for sparse approximation. Finally, it examines tight frames whose individual vectors have low peak-to-average-power ratio (PAR), which is a valuable property for code-division multiple-access (CDMA) applications. Numerical experiments show that the proposed algorithm succeeds in each of these three cases. The appendices investigate the convergence properties of the algorithm
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
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
- …