Advanced low-complexity multiuser receivers

It tema centrale di questa tesi è la rivelazione multi-utente per sistemi di comunicazione wireless ad elevata efficienza spettrale. Lo scopo del lavoro è quello di proporre nuovi ricevitori multi-utente a bassa complessità con elevate prestazioni. Sono considerati sistemi satellitari basati su FDM (Frequency Division Multiplexing), in cui ogni utente adotta una modulazione CPM (Continuous Phase Modulation) concatenata serialmente con un codificatore tramite un interlacciatore e decodifica iterativa. Si considerano, inoltre, canali lineari in presenza di AWGN (additive white Gaussian noise). In particolare, si studiano sistemi FDM, in cui i canali adiacenti possono sovrapporsi in frequenza per aumentere l'efficienza spettrale, e sistemi CDMA (code division multiple access). Per gli scenari presi in esame, proponiamo schemi di rivelazione con un eccellente compromesso tra prestazioni e complessità computazionale, che permettono di implementare schemi di trasmissione con straordinaria efficienza spettrale, al prezzo di un limitato aumento di complessità rispetto ad un classico ricevitore singolo-utente che ignora l'interferenza.This thesis deals with multiuser detection (MUD) for spectrally-efficient wireless communication systems. The aim of this work is to propose new advanced low-complexity multiuser receivers with near-optimal detection performance. We consider frequency division multiplexing (FDM) satellite systems where each user employs a continuous phase modulation (CPM), serially concatenated with an outer code through an interleaver, and iterative detection/decoding. We also consider linear channels impaired by additive white Gaussian noise (AWGN), focusing on FDM systems where adjacent channels are allowed to overlap in frequency, and on code division multiple access systems (CDMA). For the considered scenarios, we propose detection schemes with an excel- lent performance/complexity tradeoff which allow us to implement transmission schemes with unprecedented spectral efficiency at a price of a limited complexity increase with respect to a classical single-user receiver which neglects the interference

Capacity -based parameter optimization of bandwidth constrained CPM

Continuous phase modulation (CPM) is an attractive modulation choice for bandwidth limited systems due to its small side lobes, fast spectral decay and the ability to be noncoherently detected. Furthermore, the constant envelope property of CPM permits highly power efficient amplification. The design of bit-interleaved coded continuous phase modulation is characterized by the code rate, modulation order, modulation index, and pulse shape. This dissertation outlines a methodology for determining the optimal values of these parameters under bandwidth and receiver complexity constraints. The cost function used to drive the optimization is the information-theoretic minimum ratio of energy-per-bit to noise-spectral density found by evaluating the constrained channel capacity. The capacity can be reliably estimated using Monte Carlo integration. A search for optimal parameters is conducted over a range of coded CPM parameters, bandwidth efficiencies, and channels. Results are presented for a system employing a trellis-based coherent detector. To constrain complexity and allow any modulation index to be considered, a soft output differential phase detector has also been developed.;Building upon the capacity results, extrinsic information transfer (EXIT) charts are used to analyze a system that iterates between demodulation and decoding. Convergence thresholds are determined for the iterative system for different outer convolutional codes, alphabet sizes, modulation indices and constellation mappings. These are used to identify the code and modulation parameters with the best energy efficiency at different spectral efficiencies for the AWGN channel. Finally, bit error rate curves are presented to corroborate the capacity and EXIT chart designs

Some concatenated and iterative decoding approaches for continuous phase modulation

Several concatenated and iterative decoding approaches are used to improve the power efficiency of continuous phase modulation (CPM). First a symbol interleaver is used for serially concatenated CPM (SCCPM). Convergence of iterative decoding for this scheme can be earlier (lower SNR: Signal-to-Noise-Ratio) compared to bit interleaved SCCPM. Then a ring convolutional code (CC) is used as the outer code in this symbol interleaved SCCPM. By setting the denominator of the CPM modulation index equal to the alphabet size of the system (CPM, interleaver and ring CC), a natural combination of them is achieved. Further improvements on earlier convergence or error floors are achieved with this scheme. Finally, irregular repeat accumulate (IRA) codes with CPM (IRCPM) are considered. CPM now takes the role of the accumulator. This scheme shows even earlier convergence than SCCPM. </p> To analyze the error floor performance, we derive the union bound for symbol interleaved SCCPM. In this bound analysis, we have to consider the order of nonzero permuted difference symbols that are not identical. We also derive the union bound for IRCPM from its equivalent structure. This structure introduces a virtual interleaver before CPM. Thus, the union bound analysis for SCCPM is now applicable

Some concatenated and iterative decoding approaches for continuous phase modulation

Several concatenated and iterative decoding approaches are used toimprove the power efficiency of continuous phase modulation (CPM).First a symbol interleaver is used for serially concatenated CPM(SCCPM). Convergence of iterative decoding for this scheme can beearlier (lower SNR: Signal-to-Noise-Ratio) compared to bitinterleaved SCCPM. Then a ring convolutional code (CC) is used asthe outer code in this symbol interleaved SCCPM. By setting thedenominator of the CPM modulation index equal to the alphabet sizeof the system (CPM, interleaver and ring CC), a naturalcombination of them is achieved. Further improvements on earlierconvergence or error floors are achieved with this scheme.Finally, irregular repeat accumulate (IRA) codes with CPM (IRCPM)are considered. CPM now takes the role of the accumulator. Thisscheme shows even earlier convergence than SCCPM. To analyze the error floor performance, we derive the union boundfor symbol interleaved SCCPM. In this bound analysis, we have toconsider the order of nonzero permuted difference symbols that arenot identical. We also derive the union bound for IRCPM from itsequivalent structure. This structure introduces a virtualinterleaver before CPM. Thus, the union bound analysis for SCCPMis now applicable

Multiuser Serially Concatenated Continuous Phase Modulation

A multiuser communication system using serially concatenated and randomly interleaved continuous phase modulation (SCCPM) over the additive white Gaussian noise (AWGN) channel is investigated. The users, which may be asynchronous, are allowed to have individual energy levels as well as carrier frequencies and phases. This model incorporates multiple-access signaling similar to direct-sequence code division multiple-access (DS-CDMA), trellis-coded multiple-access (TCMA), and frequency division multiple-access (FDMA) with arbitrary spectral overlap, as well as non-intentional co-channel or adjacent channel interference of the same signaling type. First, the system is analyzed through analytical upper bounds on the average bit error probability for a given user under maximum-likelihood (ML) detection, where the R> average is over the ensemble of systems over all sets of interleavers. It is shown that in a properly designed system, the bit error probability vanishes for infinite interleaver sizes and a sufficiently large channel signal-to-noise ratio (SNR), regardless of the signal correlation between the users. Thus, even with equal modulation, energy levels, and carrier frequencies and phases, the users can be detected adequately provided they employ random interleaving. The second part of the analysis concerns iterative decoding of multiuser SCCPM. A convergence analysis based on EXIT charts is presented, along with decoding threshold estimates. It is observed that in systems with no frequency offset, the performance of ML detection does not always carry over to iterative decoding. On the other hand, for many other systems excellent performance can be obtained both in terms of power efficiency (bit error rate as a function of SNR) and spectral efficiency (bandwidth). In particular, systems are demonstrated with performance within 1 dB of the average-power limited Shannon capacity at 1 bit/s/Hz, and within 2.3 dB at 2 bits/s/Hz

Multiuser Serially Concatenated Continuous Phase Modulation

A multiuser communication system using serially concatenated and randomly interleaved continuous phase modulation (SCCPM) over the additive white Gaussian noise (AWGN) channel is investigated. The users, which may be asynchronous, are allowed to have individual energy levels as well as carrier frequencies and phases. This model incorporates multiple-access signaling similar to direct-sequence code division multiple-access (DS-CDMA), trellis-coded multiple-access (TCMA), and frequency division multiple-access (FDMA) with arbitrary spectral overlap, as well as non-intentional co-channel or adjacent channel interference of the same signaling type. First, the system is analyzed through analytical upper bounds on the average bit error probability for a given user under maximum-likelihood (ML) detection, where the R> average is over the ensemble of systems over all sets of interleavers. It is shown that in a properly designed system, the bit error probability vanishes for infinite interleaver sizes and a sufficiently large channel signal-to-noise ratio (SNR), regardless of the signal correlation between the users. Thus, even with equal modulation, energy levels, and carrier frequencies and phases, the users can be detected adequately provided they employ random interleaving. The second part of the analysis concerns iterative decoding of multiuser SCCPM. A convergence analysis based on EXIT charts is presented, along with decoding threshold estimates. It is observed that in systems with no frequency offset, the performance of ML detection does not always carry over to iterative decoding. On the other hand, for many other systems excellent performance can be obtained both in terms of power efficiency (bit error rate as a function of SNR) and spectral efficiency (bandwidth). In particular, systems are demonstrated with performance within 1 dB of the average-power limited Shannon capacity at 1 bit/s/Hz, and within 2.3 dB at 2 bits/s/Hz