Transmission of vector quantization over a frequency-selective Rayleigh fading CDMA channel

Recently, the transmission of vector quantization (VQ) over a code-division multiple access (CDMA) channel has received a considerable attention in research community. The complexity of the optimal decoding for VQ in CDMA communications is prohibitive for implementation, especially for systems with a medium or large number of users. A suboptimal approach to VQ decoding over a CDMA channel, disturbed by additive white Gaussian noise (AWGN), was recently developed. Such a suboptimal decoder is built from a soft-output multiuser detector (MUD), a soft bit estimator and the optimal soft VQ decoders of individual users. Due to its lower complexity and good performance, such a decoding scheme is an attractive alternative to the complicated optimal decoder. It is necessary to extend this decoding scheme for a frequency-selective Rayleigh fading CDMA channel, a channel model typically seen in mobile wireless communications. This is precisely the objective of this thesis. Furthermore, the suboptimal decoders are obtained not only for binary phase shift keying (BPSK), but also for M-ary pulse amplitude modulation (M-PAM). This extension offers a flexible trade-off between spectrum efficiency and performance of the systems. In addition, two algorithms based on distance measure and reliability processing are introduced as other alternatives to the suboptimal decoder. Simulation results indicate that the suboptimal decoders studied in this thesis also performs very well over a frequency-selective Rayleigh fading CDMA channel

Low-complexity quantize-and-forward cooperative communication using two-way relaying

Cooperative communication is used as an effective measure against fading in wireless communication systems. In a classical one-way cooperative system, the relay needs as many orthogonal channels as the number of terminal it assists, yielding a poor spectral efficiency. Efficiency is improved in two-way relaying systems, where a relay simultaneously assists two terminals using only one timeslot. In the current contribution, a two-way quantize-and-forward (QF) protocol is presented. Because of the coarse quantization, the proposed protocol has a low complexity at the relay and can be used with half-duplex devices, making it very suitable for low-complexity applications like sensor networks. Additionally, channel parameter estimation is discussed. By estimating all channel parameters at the destination terminals, relay complexity is kept low. Using Monte Carlo simulations, it is shown that the proposed QF protocol achieves a good frame error rate (FER) performance as compared to two-way amplify-and-forward (AF) and one-way relaying systems. It is further shown that, using the proposed estimation algorithm, the FER degradation arising from the channel parameter estimation is negligible when compared to an (unrealistic) system in which all parameters are assumed to be known

Adaptive Communication for Wireless Massive MIMO Systems

The demand for high data rates in wireless communications is increasing rapidly. One way to provide reliable communication with increased rates is massive multiple-input multiple-output (MIMO) systems where a large number of antennas is deployed. We analyze three systems utilizing a large number of antennas to provide enhancement in the performance of wireless communications. First, we consider a general form of spatial modulation (SM) systems where the number of transmitted data streams is allowed to vary and we refer to it as generalized spatial modulation with multiplexing (GSMM). A Gaussian mixture model (GMM) is shown to accurately model the transmitted spatially modulated signal using a precoding framework. Using this transmit model, a general closed-form expression for the achievable rate when operating over Rayleigh fading channels is evaluated along with a tight upper and a lower bounds for the achievable rate. The obtained expressions are flexible enough to accommodate any form of SM by adjusting the precoding set. Followed by that, we study quantized distributed wireless relay networks where a relay consisting of many geographically dispersed nodes is facilitating communication between unconnected users. Due to bandwidth constraints, distributed relay networks perform quantization at the relay nodes, and hence they are referred to as quantized distributed relay networks. In such systems, users transmit their data simultaneously to the relay nodes through the uplink channel that quantize their observed signals independently to a few bits and broadcast these bits to the users through the downlink channel. We develop algorithms that can be employed by the users to estimate the uplink channels between all users and all relay nodes when the relay nodes are performing simple sign quantization. This setup is very useful in either extending coverage to unconnected regions or replacing the existing wireless infrastructure in case of disasters. Using the uplink channel estimates, we propose multiple decoders that can be deployed at the receiver side. We also study the performance of each of these decoders under different system assumptions. A different quantization framework is also proposed for quantized distributed relay networking where the relay nodes perform vector quantization instead of sign quantization. Applying vector quantization at the relay nodes enables us to propose an algorithm that allocates quantization resources efficiently among the relay nodes inside the relay network. We also study the beamforming design at the users’ side in this case where beamforming design is not trivial due to the quantization that occurs at the relay network. Finally, we study a different setup of distributed communication systems called cell-free massive MIMO. In cell-free massive MIMO, regular cellular communication is replaced by multiple access points (APs) that are placed randomly over the coverage area. All users in the coverage area are sharing time and frequency resources and all APs are serving all UEs while power allocation is done in a central processor that is connected to the APs through a high speed backhaul network. We study the power allocation in cell-free massive MIMO system where APs are equipped with few antennas and how the distribution of the available antennas among access points affects both the performance and the infrastructure cost

Quantizer design for a symbol sharing scheme in wireless cooperation systems

The purpose of this thesis is to study some cooperation strategies between computers in order to increment the system reliability without compromising extra resources. In order to achieve this aim research must be conducted on data sharing on the receiver side regarding symbols, which have to be selected by means of a suitable procedure involving the L-values of the information bits. Nonetheless, in a computer, real values can’t be used and it will be necessary to quantize careful these symbols, hence the analysis of different methods of quantization will be investigated, as well as the uniform quantization, the iterative Lloyd-Max’s algorithm for non-uniform quantization and the vector quantization. The results will we shown analysing the different throughput for a different quantization scheme for a given modulations, using Matlab.El propósito de esta tesis es el estudio de algunas de las estrategias de cooperación entre equipos con el fin de incrementar la fiabilidad del sistema sin comprometer recursos adicionales. Para lograr este objetivo, la investigación debe llevarse a cabo con el intercambio de datos en el lado del receptor mediante los símbolos, que han de ser seleccionados por medio de un procedimiento adecuado que implica los L-values de los bits de información. Sin embargo, en un ordenador, los valores reales no se pueden utilizar y será necesario cuantificar cuidadosos estos símbolos, por lo tanto, se investigará el análisis de los diferentes métodos de cuantificación, así como la cuantificación uniforme, la cuantificación no uniforme (Lloyd-Max) y la cuantificación vectorial. Los resultados que se muestran son analizando el rendimiento para diferentes esquemas de cuantificación y modulaciones dadas, utilizando Matlab.El propòsit d’aquesta tesi és l'estudi d’algunes de les estratègies de cooperació entre ordinadors per tal de incrementar la fiabilitat del sistema sense comprometre recursos addicionals. Per aconseguir aquest objectiu, la investigació ha de dur-se a terme amb l'Intercanvi de dades al costat dels receptors mitjançant els símbols, que han de ser seleccionats a través d'un procediment adequat que impliqui els L-values dels bits d'informació. No obstant això, en els ordinadors no poden utilitzar valor reals I serà necessari quantificar aquests símbols, per tant, s'investigarà els diferents mètodes de quantificació, com la quantificació uniforme, la quantificació no uniforme (Lloyd- Max) i la quantificació vectorial. Els resultats serán mostrats analitzant el rendiment per a diferents esquemes de quantificació donades les modulacions, utilitzant Matlab

Channel modeling and resource allocation in OFDM systems

The increasing demand for high data rate in wireless communication systems gives rise to broadband communication systems. The radio channel is plagued by multipath propagation, which causes frequency-selective fading in broadband signals. Orthogonal Frequency-Division Multiplexing (OFDM) is a modulation scheme specifically designed to facilitate high-speed data transmission over frequency-selective fading channels. The problem of channel modeling in the frequency domain is first investigated for the wideband and ultra wideband wireless channels. The channel is converted into an equivalent discrete channel by uniformly sampling the continuous channel frequency response (CFR), which results in a discrete CFR. A necessary and sufficient condition is established for the existence of parametric models for the discrete CFR. Based on this condition, we provide a justification for the effectiveness of previously reported autoregressive (AR) models in the frequency domain of wideband and ultra wideband channels. Resource allocation based on channel state information (CSI) is known to be a very powerful method for improving the spectral efficiency of OFDM systems. Bit and power allocation algorithms have been discussed for both static channels, where perfect knowledge of CSI is assumed, and time-varying channels, where the knowledge of CSI is imperfect. In case of static channels, the optimal resource allocation for multiuser OFDM systems has been investigated. Novel algorithms are proposed for subcarrier allocation and bit-power allocation with considerably lower complexity than other schemes in the literature. For time-varying channel, the error in CSI due to channel variation is recognized as the main obstacle for achieving the full potential of resource allocation. Channel prediction is proposed to suppress errors in the CSI and new bit and power allocation schemes incorporating imperfect CSI are presented and their performance is evaluated through simulations. Finally, a maximum likelihood (ML) receiver for Multiband Keying (MBK) signals is discussed, where MBK is a modulation scheme proposed for ultra wideband systems (UWB). The receiver structure and the associated ML decision rule is derived through analysis. A suboptimal algorithm based on a depth-first tree search is introduced to significantly reduce the computational complexity of the receiver

Tatouage du flux compressé MPEG-4 AVC

La présente thèse aborde le sujet de tatouage du flux MPEG-4 AVC sur ses deux volets théoriques et applicatifs en considérant deux domaines applicatifs à savoir la protection du droit d auteur et la vérification de l'intégrité du contenu. Du point de vue théorique, le principal enjeu est de développer un cadre de tatouage unitaire en mesure de servir les deux applications mentionnées ci-dessus. Du point de vue méthodologique, le défi consiste à instancier ce cadre théorique pour servir les applications visées. La première contribution principale consiste à définir un cadre théorique pour le tatouage multi symboles à base de modulation d index de quantification (m-QIM). La règle d insertion QIM a été généralisée du cas binaire au cas multi-symboles et la règle de détection optimale (minimisant la probabilité d erreur à la détection en condition du bruit blanc, additif et gaussien) a été établie. Il est ainsi démontré que la quantité d information insérée peut être augmentée par un facteur de log2m tout en gardant les mêmes contraintes de robustesse et de transparence. Une quantité d information de 150 bits par minutes, soit environ 20 fois plus grande que la limite imposée par la norme DCI est obtenue. La deuxième contribution consiste à spécifier une opération de prétraitement qui permet d éliminer les impactes du phénomène du drift (propagation de la distorsion) dans le flux compressé MPEG-4 AVC. D abord, le problème a été formalisé algébriquement en se basant sur les expressions analytiques des opérations d encodage. Ensuite, le problème a été résolu sous la contrainte de prévention du drift. Une amélioration de la transparence avec des gains de 2 dB en PSNR est obtenueThe present thesis addresses the MPEG-4 AVC stream watermarking and considers two theoretical and applicative challenges, namely ownership protection and content integrity verification.From the theoretical point of view, the thesis main challenge is to develop a unitary watermarking framework (insertion/detection) able to serve the two above mentioned applications in the compressed domain. From the methodological point of view, the challenge is to instantiate this theoretical framework for serving the targeted applications. The thesis first main contribution consists in building the theoretical framework for the multi symbol watermarking based on quantization index modulation (m-QIM). The insertion rule is analytically designed by extending the binary QIM rule. The detection rule is optimized so as to ensure minimal probability of error under additive white Gaussian noise distributed attacks. It is thus demonstrated that the data payload can be increased by a factor of log2m, for prescribed transparency and additive Gaussian noise power. A data payload of 150 bits per minute, i.e. about 20 times larger than the limit imposed by the DCI standard, is obtained. The thesis second main theoretical contribution consists in specifying a preprocessing MPEG-4 AVC shaping operation which can eliminate the intra-frame drift effect. The drift represents the distortion spread in the compressed stream related to the MPEG encoding paradigm. In this respect, the drift distortion propagation problem in MPEG-4 AVC is algebraically expressed and the corresponding equations system is solved under drift-free constraints. The drift-free shaping results in gain in transparency of 2 dB in PSNREVRY-INT (912282302) / SudocSudocFranceF