223 research outputs found
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
Weyl Spreading Sequence Optimizing CDMA
This paper shows an optimal spreading sequence in the Weyl sequence class,
which is similar to the set of the Oppermann sequences for asynchronous CDMA
systems. Sequences in Weyl sequence class have the desired property that the
order of cross-correlation is low. Therefore, sequences in the Weyl sequence
class are expected to minimize the inter-symbol interference. We evaluate the
upper bound of cross-correlation and odd cross-correlation of spreading
sequences in the Weyl sequence class and construct the optimization problem:
minimize the upper bound of the absolute values of cross-correlation and odd
cross-correlation. Since our optimization problem is convex, we can derive the
optimal spreading sequences as the global solution of the problem. We show
their signal to interference plus noise ratio (SINR) in a special case. From
this result, we propose how the initial elements are assigned, that is, how
spreading sequences are assigned to each users. In an asynchronous CDMA system,
we also numerically compare our spreading sequences with other ones, the Gold
codes, the Oppermann sequences, the optimal Chebyshev spreading sequences and
the SP sequences in Bit Error Rate. Our spreading sequence, which yields the
global solution, has the highest performance among the other spreading
sequences tested
Compressive Sensing for Spread Spectrum Receivers
With the advent of ubiquitous computing there are two design parameters of
wireless communication devices that become very important power: efficiency and
production cost. Compressive sensing enables the receiver in such devices to
sample below the Shannon-Nyquist sampling rate, which may lead to a decrease in
the two design parameters. This paper investigates the use of Compressive
Sensing (CS) in a general Code Division Multiple Access (CDMA) receiver. We
show that when using spread spectrum codes in the signal domain, the CS
measurement matrix may be simplified. This measurement scheme, named
Compressive Spread Spectrum (CSS), allows for a simple, effective receiver
design. Furthermore, we numerically evaluate the proposed receiver in terms of
bit error rate under different signal to noise ratio conditions and compare it
with other receiver structures. These numerical experiments show that though
the bit error rate performance is degraded by the subsampling in the CS-enabled
receivers, this may be remedied by including quantization in the receiver
model. We also study the computational complexity of the proposed receiver
design under different sparsity and measurement ratios. Our work shows that it
is possible to subsample a CDMA signal using CSS and that in one example the
CSS receiver outperforms the classical receiver.Comment: 11 pages, 11 figures, 1 table, accepted for publication in IEEE
Transactions on Wireless Communication
Permutation Polynomial Interleaved Zadoff-Chu Sequences
Constant amplitude zero autocorrelation (CAZAC) sequences have modulus one
and ideal periodic autocorrelation function. Such sequences have been used in
communications systems, e.g., for reference signals, synchronization signals
and random access preambles. We propose a new family CAZAC sequences, which is
constructed by interleaving a Zadoff-Chu sequence by a quadratic permutation
polynomial (QPP), or by a permutation polynomial whose inverse is a QPP. It is
demonstrated that a set of orthogonal interleaved Zadoff-Chu sequences can be
constructed by proper choice of QPPs.Comment: Submitted to IEEE Transactions on Information Theor
- …