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

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

Some new results on majority-logic codes for correction of random errors

The main advantages of random error-correcting majority-logic codes and majority-logic decoding in general are well known and two-fold. Firstly, they offer a partial solution to a classical coding theory problem, that of decoder complexity. Secondly, a majority-logic decoder inherently corrects many more random error patterns than the minimum distance of the code implies is possible. The solution to the decoder complexity is only a partial one because there are circumstances under which a majority-logic decoder is too complex and expensive to implement. [Continues.

A Novel estimation and Correction of Channel errors in LTE SYSTEMS

The increase in the number of RF devices and the requirement for large data rates places major role in increasing demand on bandwidth. This necessitates the need for RF communication systems with increased throughput and capacity. MIMO-OFDM is one way to meet this basic requirement. OFDM is used in many (WCD) wireless communication devices and offers high spectral efficiency and resilience to multipath channel effects. Though OFDM is very sensitive to synchronization errors, it makes the task of channel equalization simple. MIMO utilize the multiple antennas to increase throughput without increasing transmitter power or bandwidth. This project presents an introduction to the (MPC) multipath fading channel and describes an appropriate channel model. Many modulation schemes are presented (i.e. BPSK, QPSK, QAM) that are often used in Conjunction with OFDM. Mathematical modeling and analysis of OFDM are given along with a discrete implementation common to modern RF communication systems. Synchronization errors are modeled mathematically and simulated, as well as techniques to estimate and correct those errors at the receiver accurately

Master of Science

thesisFilter Bank Multicarrier (FB-MC) is a technique similar to Orthogonal Frequency Division Multiplexing (OFDM), used to divide the spectrum of a transceiver into multiple subcarriers or channels. When a single symbol is repeated across all subcarriers, its energy is spread across the entire spectrum. This is referred to as Filter Bank Multicarrier Spread Spectrum (FB-MC-SS). The design of a preamble or training sequence used in the packet construction of a FB-MC-SS transceiver system is explored in this thesis. The preamble is used to acquire an estimate of the channel impulse response and noise variance for each subcarrier. This information is then used to undo the effect of the channel and perform Maximum Ratio Combining (MRC) across all subcarriers. An alternating {+1, âˆ'1} sequence has been previously proposed for its implementation simplicity. An alternating {+1,âˆ'1} sequence leads to detection advantages as a result of the impulse response of the matched filter. An alternating {+1,âˆ'1} sequence also presents many disadvantages. Mainly, the sequence is susceptible to interference because of its distinct frequency. The alternating {+1, âˆ'1} sequence also has a higher probability of detection by unauthorized users. To combat these deficiencies of the alternating {+1,âˆ'1} sequence, pseudorandom sequences are explored in this thesis. The goal of the pseudorandom sequence is to gain ro- bustness without forfeiting the packet’s detectability by intended receivers. Pseudorandom Polyphase and Maximum Length Binary sequences are explored as randomized preambles. Both the alternating {+1, âˆ'1} sequence and the pseudorandom sequence are implemented separately in the FB-MC-SS transceiver on a Xilinx FPGA to compare resource utilizations. Pseudorandom Polyphase preamble sequences lead to robust channel frequency response and noise variance estimation in interfered environments. Although alternating {+1, âˆ'1} sequence leads to straightforward packet detection and simple FPGA implementation, the susceptibility of an alternating {+1, âˆ'1} preamble to interference makes a pseudorandom preamble sequence more desirable

Generalized DFT: extensions in communications

Discrete Fourier Transform (DFT) is a restricted version of Generalized DFT (GDFT) which offers a very limited number of sets to be used in a multicarrier communication system. In contrast, as an extension on Discrete Fourier Transform (DFT) from the linear phase to non-linear phase, the proposed GDFT provides many possible carrier sets of various lengths with comparable or better performance than DFT. The availability of the rich library of orthogonal constant amplitude transforms with good performance allows people to design adaptive systems where user code allocations are made dynamically to exploit the current channel conditions in order to deliver better performance. For MIMO Radar systems, the ideal case to detect a moving target is when all waveforms are orthogonal, which can provide an accurate estimation. But this is not practical in distributed MIMO radars, where sensors are at varying distances from a target. Orthogonal waveforms with low auto- and cross-correlations are of great interest for MIMO radar applications with distributed antennas. Finite length orthogonal codes are required in real-world applications where frequency selectivity and signal correlation features of the optimal subspace are compromised. In the first part of the dissertation, a method is addressed to design optimal waveforms which meets above requirements for various radar systems by designing the phase shaping function (PSF) of GDFT framework with non-linear phase. Multicarrier transmission such as orthogonal frequency-division multiplexing (OFDM) has seen a rise in popularity in wireless communication, as it offers a promising choice for high speed data rate transmission. Meanwhile, high peak-to-average power ratio (PAPR) is one of the well-known drawbacks of the OFDM system due to reduced power efficiency in non-linear modules. Such a situation leads to inefficient amplification and increases the cost of the system, or increases in interference and signal distortion. Therefore, PAPR reduction techniques play an essential role to improve power efficiency in the OFDM systems. There has been a variety of PAPR reduction methods emphasizing different aspects proposed in the literature. The trade-off for PAPR reduction in the existing methods is either increased average power and/or added computational complexity. A new PAPR reduction scheme is proposed that implements a pre-designed symbol alphabet modifier matrix (SAM) to jointly modify the amplitude and phase values of the original data symbol alphabets prior to the IFFT operation of an OFDM system at the transmitter. The method formulated with the GDFT offers a low-complexity framework in four proposed cases devised to be independent of original data symbols. Without degrading the bit error rate (BER) performance, it formulates PAPR reduction problem elegantly and outperforms partial transmit sequences (PTS), selected mapping technique (SLM) and Walsh Hadamard transform (WHT-OFDM) significantly for the communication scenarios considered in the dissertation

ANALYSIS OF A POTENTIAL LTE DENIAL-OF-SERVICE TIMING VULNERABILITY

There are 3.7 billion long-term evolution (LTE) subscribers worldwide, according to the Ericsson Mobility Report for the first quarter of 2019. To the average user, the exchange of this cellular traffic may seem secure; however, there exists at least one vulnerability: the unencrypted timing advance (TA). The TA is responsible for maintaining time synchronization between the evolved NodeB (eNB) and the user equipment (UE). Without it, the eNB-UE communication link fails, resulting in degraded cell service. By issuing faux TAs, an attacker disrupts the eNB-UE timing synchronization and denies service to the UEs. This thesis investigates specific effects such an attack has on targeted and time-adjacent users’ subframe bit-error rate (BER). Moreover, we show the disruption of a single user’s communications while leaving other users’ communications untouched. Through simulation, we show that delaying a target transmission is less desirable to the attacker since the eNB has delay-correcting capabilities. Additionally, by advancing a target transmission using one TA, we achieve, on average, 50% subframe BERs. Lastly, we demonstrate that the attacker has flexibility in issuing the TAs without interfering with time-adjacent users. Specifically, the attacker can issue roughly 48 TAs before incurring a non-zero BER on time adjacent users. With this functionality, combined with an unsecure timing mechanism, an attacker has the capability of denying service to a targeted individual.Lieutenant, United States NavyApproved for public release; distribution is unlimited

Efficient implementation of channel estimation algorithm for beamforming

Abstract. The future 5G mobile network technology is expected to offer significantly better performance than its predecessors. Improved data rates in conjunction with low latency is believed to enable technological revolutions such as self-driving cars. To achieve faster data rates, MIMO systems can be utilized. These systems enable the use of spatial filtering technique known as beamforming. Beamforming that is based on the preacquired channel matrix is computationally very demanding causing challenges in achieving low latency. By acquiring the channel matrix as efficiently as possible, we can facilitate this challenge. In this thesis we examined the implementation of channel estimation algorithm for beamforming with a digital signal processor specialized in vector computation. We present implementations for different antenna configurations based on three different approaches. The results show that the best performance is achieved by applying the algorithm according to the limitations given by the system and the processor architecture. Although the exploitation of the parallel architecture was proved to be challenging, the implementation of the algorithm would have benefitted from the greater amount of parallelism. The current parallel resources will be a challenge especially in the future as the size of antenna configurations is expected to grow.Keilanmuodostuksen tarvitseman kanavaestimointialgoritmin tehokas toteutus. Tiivistelmä. Tulevan viidennen sukupolven mobiiliverkkoteknologian odotetaan tarjoavan merkittävästi edeltäjäänsä parempaa suorituskykyä. Tämän suorituskyvyn tarjoamat suuret datanopeudet yhdistettynä pieneen latenssiin uskotaan mahdollistavan esimerkiksi itsestään ajavat autot. Suurempien datanopeuksien saavuttamiseksi voidaan hyödyntää monitiekanavassa käytettävää MIMO-systeemiä, joka mahdollistaa keilanmuodostuksena tunnetun spatiaalisen suodatusmenetelmän käytön. Etukäteen hankittuun kanavatilatietoon perustuva keilanmuodostus on laskennallisesti erittäin kallista. Tämä aiheuttaa haasteita verkon pienen latenssivaatimuksen saavuttamisessa. Tässä työssä tutkittiin keilanmuodostukselle tarkoitetun kanavaestimointialgoritmin tehokasta toteutusta hyödyntäen vektorilaskentaan erikoistunutta prosessoriarkkitehtuuria. Työssä esitellään kolmea eri lähestymistapaa hyödyntävät toteutukset eri kokoisille antennikonfiguraatioille. Tuloksista nähdään, että paras suorituskyky saavutetaan sovittamalla algoritmi järjestelmän ja arkkitehtuurin asettamien rajoitusten mukaisesti. Vaikka rinnakkaisarkkitehtuurin hyödyntäminen asetti omat haasteensa, olisi algoritmin toteutus hyötynyt suuremmasta rinnakkaisuuden määrästä. Nykyinen rinnakkaisuuden määrä tulee olemaan haaste erityisesti tulevaisuudessa, sillä antennikonfiguraatioiden koon odotetaan kasvavan