Code-division multiple-access (CDMA) systems with random spreading and channel uncertainty at the receiver are studied. Frequency selective single antenna, as well as, narrowband multiple antenna channels are considered. Rayleigh fading is assumed in all cases. General Bayesian approach is used to derive both iterative and non-iterative estimators whose performance is obtained in the large system limit via the replica method from statistical physics. The effect of spatial correlation on the performance of a multiple antenna CDMA system operating in a flat-fading channel is studied. Per-antenna spreading (PAS) with random signature sequences and spatial multiplexing is used at the transmitter. Non-iterative multiuser detectors (MUDs) using imperfect channel state information (CSI) are derived. Training symbol based channel estimators having mismatched a priori knowledge about the antenna correlation are considered. Both the channel estimator and the MUD are shown to admit a simple ...

Multi-input multi-output (MIMO) channels are known to increase the capacity of a transmission link. This can be exploited to increase either the multiplexing gain or the diversity gain, which leads to a higher data throughput or a better resilience of the link to fading, respectively. This thesis is concerned with the diversity gain, which, in a flat fading channel, can be maximised by Alamouti’s space-time block coding (STBC) scheme and a number of derivative techniques. For frequency selective fading, i.e. dispersive, MIMO channels, a few solutions have been reported in the literature including MIMO-OFDM, where the channel is decomposed into a number of narrowband problems, and a technique known as time-reversal STBC. For the latter, a number of blind adaptive algorithms have been derived, implemented and tested in order to avoid the requirement of explicit knowledge of the channel. The ...

SoftCast based Linear Video Coding (LVC) schemes have been emerged in the last decade as a quasi analog joint-source-channel alternative to classical video coding schemes. Theoretical analyses have shown that analog coding is better than digital coding in a multicast scenario when the channel signal-to-noise ratios (C-SNR) differ among receivers. LVC schemes provide in such context a decoded video quality at different receivers proportional to their C-SNR. This thesis considers first the channel precoding and decoding matrix design problem for LVC schemes under a per-subchannel power constraint. Such constraint is found, e.g., on Power Line Telecommunication (PLT) channels and is similar to per-antenna power constraints in multi-antenna transmission system. An optimal design approach is proposed, involving a multi-level water filling algorithm and the solution of a structured Hermitian Inverse Eigenvalue problem. Three lower-complexity alternative suboptimal algorithms are also proposed. Extensive ...

Source coding concerns the representation of information in a source signal using as few bits as possible. In the case of lossy source coding, it is the encoding of a source signal using the fewest possible bits at a given distortion or, at the lowest possible distortion given a specified bit rate. Channel coding is usually applied in combination with source coding to ensure reliable transmission of the (source coded) information at the maximal rate across a channel given the properties of this channel. In this thesis, we consider the coding of auto-regressive (AR) sources which are sources that can be modeled as auto-regressive processes. The coding of AR sources lends itself to linear predictive coding. We address the problem of joint source/channel coding in the setting of linear predictive coding of AR sources. We consider channels in which individual ...

Error control coding is an essential part of modern communications systems. LDPC codes have been demonstrated to offer performance near the fundamental limits of channels corrupted by random noise. Optimal maximum likelihood decoding of LDPC codes is too complex to be practically useful even at short block lengths and so a graph-based message passing decoder known as the belief propagation algorithm is used instead. In fact, on graphs without closed paths known as cycles the iterative message passing decoding is known to be optimal and may converge in a single iteration, although identifying the message update schedule which allows single-iteration convergence is not trivial. At finite block lengths graphs without cycles have poor minimum distance properties and perform poorly even under optimal decoding. LDPC codes with large block length have been demonstrated to offer performance close to that predicted for ...

Wyner-Ziv (WZ) video coding is a particular case of distributed video coding, a new video coding paradigm based on the Slepian-Wolf and Wyner-Ziv theorems which mainly exploit the source correlation at the decoder and not only at the encoder as in predictive video coding. Therefore, this new coding paradigm may provide a flexible allocation of complexity between the encoder and the decoder and in-built channel error robustness, interesting features for emerging applications such as low-power video surveillance and visual sensor networks among others. Although some progress has been made in the last eight years, the rate-distortion performance of WZ video coding is still far from the maximum performance attained with predictive video coding. The WZ video coding compression efficiency depends critically on the capability to model the correlation noise between the original information at the encoder and its estimation generated ...

Multi-input multi-output (MIMO) wireless networks and distributed MIMO relaying wireless networks have attracted significant attention in current generation of wireless communication networks, and will play a key role in the next generation of wireless net- works. The improvement of network capacity, data rate and reliability can be achieved at the cost of increasing computational complexity of employing space-time coding (STC) and distributed STC (DSTC) in MIMO and distributed MIMO relaying networks, respectively. Efficient designs and algorithms to achieve high diversity and coding gains with low computational complexity in encoding and decoding of STC and DSTC schemes are essential. In this thesis, DSTC designs with high diversity and coding gains and efficient detection and code matrices optimization algorithms in cooperative MIMO networks are proposed. Firstly, adaptive power allocation (PA) algorithms with different criteria for a coop- erative MIMO network equipped with ...

Mobile communication networks of the third and future generations are designed to offer high-data rate services like video-telephony and data-transfer. The current Rake receiver architecture will create a shortage in available bandwidth offered to the users. This is not due to a shortage in spectrum but results from inefficient receiver architectures. Spectral efficiency can be increased considerably through multi-user detection techniques in the receiver algorithms. The present thesis investigates iterative re- ceivers for encoded CDMA transmission in the uplink. The iterative receiver is a suboptimal receiver algorithm with manageable complexity. It consists of an inter- ference mitigating multi-user detector, a bank of single-user decoders, and a channel estimator. Instead of deciding on the transmitted symbols right after the first decod- ing, the receiver feeds back tentative decision symbols to mitigate multiple-access interference in the next iteration. Similarly, soft decision symbols ...

This dissertation proposes advanced transceiver designs applying turbo and space-time (ST) concepts to continuous phase modulation (CPM), which is preferred in numerous power- and band-limited communication systems for its constant envelope and spectral efficiency. Despite its highly attractive spectral properties, maximum-likelihood detection of CPM over the frequency-selective multipath fading channels can bring impractical complexity issues because of the intensive search over a single super trellis which combines the effects of the modulation and the multipath channel. Application of the reduced-state trellis search algorithms results in lower complexity but the computational load could still be prohibitively large to obtain high performance in long channel impulse responses. In the dissertation, instead of employing trellis-based combined detection methods, equalization and demodulation functions are separated and novel low-complexity receivers with soft-input soft-output (SISO) time-domain and frequency-domain linear equalizers are proposed for bit-interleaved coded CPM, ...

This PhD dissertation analyzes the performance of second generation digital video broadcasting (DVB) systems in mobile terrestrial environments and proposes an iterative detection algorithm based on factor graphs (FG) to reduce the distortion caused by the time variation of the channel, providing error-free communication in very severe mobile conditions. The research work focuses on mobile scenarios where the intercarrier interference (ICI) is very high: high vehicular speeds when long orthogonal frequency-division multiplexing (OFDM) blocks are used. As a starting point, we provide the theoretical background on the main topics behind the transmission and reception of terrestrial digital television signals in mobile environments, long with a general overview of the main signal processing techniques included in last generation terrestrial DVB systems. The proposed FG-based detector design is then assessed over a simpli ed bit-interleaved coded modulation (BICM)-OFDM communication scheme for a ...

The majority of communication systems need the previous knowledge of the channel, which is usually estimated by means of a training sequence. However, the transmission of pilot symbols provokes a reduction in bandwidth efficiency, which precludes the system from reaching the limits predicted by the Information Theory. This problem has motivated the development of a large number of blind channel estimation and equalization techniques, which are able to obtain the channel or the source without the need of transmitting a training signal. Usually, these techniques are based on the previous knowledge of certain properties of the signal, such as its belonging to a finite alphabet, or its higher-order statistics. However, in the case of multiple-input multipleoutput (MIMO) systems, it has been proven that the second-order statistics of the observations provide the sufficient information for solving the blind problem. The aim ...

Transmit diversity is a powerful technique for enhancing the channel capacity and reliability of multiple-input and multiple-output (MIMO) wireless systems. This thesis considers extended orthogonal space-time block coding (EO-STBC) with beamsteering angles, which have previously been shown to potentially achieve full diversity and array gain with four transmit and one receive antenna. The optimum setting of beamsteering angles applied in the transmitter, which has to be calculated based on channel state information (CSI) at the receiver side, must be quantised and feed back to the transmitter via a reverse feedback link. When operating in a fading scenario, channel coefficients vary smoothly with time. This smooth evolution of channel coefficients motivates the investigation of differential feedback, which can reduce the number of feedback bits, while potentially maintaining near optimum performance. The hypothesis that the smooth evolution of channel coefficients translates into ...

In 1948, the Shannon’s work titled ”A mathematical theory of communication” completely revolutionized the way to understand the problem of the reliable communications. He showed that any communications system is able to transmit with an arbitrarily low error probability as long as the transmission rate is kept below a certain limit. The separation between the source and channel coding was also shown as the optimal strategy to achieve the theoretical limits. Those ideas inspire the development of a whole digital communication theory focused on building more and more sophisticated coding schemes. It leads to most of communication systems were designed according to a digital approach and the separation principle from that moment, whereas other alternatives were set aside. However, in the last years, communication systems based on a jointly optimization of the source and channel encoder has aroused the interest ...

Distributed Video Coding (DVC) is a recently proposed paradigm in video communication, which fits well emerging applications such as wireless video surveillance, multimedia sensor networks, wireless PC cameras, and mobile cameras phones. These applications require a low complexity encoding, while possibly affording a high complexity decoding. DVC presents several advantages: First, the complexity can be distributed between the encoder and the decoder. Second, the DVC is robust to errors, since it uses a channel code. In DVC, a Side Information (SI) is estimated at the decoder, using the available decoded frames, and used for the decoding and reconstruction of other frames. In this Ph.D thesis, we propose new techniques in order to improve the quality of the SI. First, successive refinement of the SI is performed after each decoded DCT band, using a Partially Decoded WZF (PDWZF), along with the ...

Distributed source coding is a technique that allows to compress several correlated sources, without any cooperation between the encoders, and without rate loss provided that the decoding is joint. Motivated by this principle, distributed video coding has emerged, exploiting the correlation between the consecutive video frames, tremendously simplifying the encoder, and leaving the task of exploiting the correlation to the decoder. The first part of our contributions in this thesis presents the asymmetric coding of binary sources that are not uniform. We analyze the coding of non-uniform Bernoulli sources, and that of hidden Markov sources. For both sources, we first show that exploiting the distribution at the decoder clearly increases the decoding capabilities of a given channel code. For the binary symmetric channel modeling the correlation between the sources, we propose a tool to estimate its parameter, thanks to an ...