La croissance exponentielle du trafic de données sans fils, causée par l'Internet mobile et les smartphones, contraint les futurs systèmes radio à inclure des modulations/formes d'ondes plus avancées offrant un débit plus élevé et une utilisation efficace des ressources spectrales. Les transmissions dites Faster-Than-Nyquist (FTN), introduites en 1975, sont parmi les meilleurs candidates pour répondre à ces besoins. En transmettant les symboles à une cadence plus rapide que celle définie par le critère de Nyquist, FTN peut théoriquement augmenter le débit mais en introduisant des interférences en contrepartie. Dans cette thèse, nous explorons le concept des transmissions FTN à travers un canal AWGN (Additive White Gaussian Noise) dans le contexte des modulations OFDM/OQAM (Orthogonal Frequency Division Multiplexing with Offset Quadrature Amplitude Modulation).L'objectif principal de cette thèse est de présenter un système OFDM/OQAM qui permet de transmettre l'information au-delà de la cadence de Nyquist tout en tenant en compte la complexité globale du système. Tout d'abord, nous proposons une nouvelle implémentation efficace des systèmes OFDM/OQAM appliquant le concept FTN, désignée ici par FTN-OQAM, qui garde la même complexité que les systèmes OFDM/OQAM et qui permet un gain en débit très proche du gain théorique. Vu que la condition de Nyquist n'est plus respectée, le signal transmis est maintenant perturbé par des interférences. Pour remédier à ce problème, nous proposons un récepteur basé sur le principe de l'égalisation linéaire sous le critère minimum erreur quadratique moyenne avec annulation d'interférences appelé MMSE LE-IC. Le but de notre système est d'augmenter le débit de transmission, ce qui signifie que des constellations d'ordres élevés seront ciblées. Dans ce contexte, le MMSE LE-IC, dont la complexité est indépendante de la constellation, représente un bon compromis entre efficacité et complexité. Puisque la modulation OFDM/OQAM utilise différents types de formes d'ondes, nous proposons pour plusieurs d'entre elles un algorithme pour déterminer la valeur minimale du facteur d'accélération, en fonction de l'ordre de constellation, qui apporte un gain en efficacité spectrale tout en gardant les mêmes performances que les systèmes respectant le critère de Nyquist à un SNR fixé. Ensuite, nous étudions l'amélioration du traitement itératif de l'émetteur-récepteur. La méthode proposée consiste à combiner un précodeur avec le système FTN-OQAM afin de réduire les interférences causées par du FTN à l'émission. Nous proposons un modèle de précodage dispersé, car il est difficile de précoder conjointement tous les symboles transmis. Nous présentons trois familles de précodeurs avec les récepteurs correspondants. En outre, nous modifions différents blocs de l'émetteur FTN-OQAM tels que le codage canal, le mappage des bits et le mappage des symboles afin d'améliorer davantage le transmetteur FTN-OQAM. Les résultats présentés révèlent le potentiel important des systèmes proposés. / The exponential growth of wireless data traffic driven by mobile Internet and smart devices constrains the future radio systems to include advanced modulations/waveforms offering higher data rates with more efficient bandwidth usage. One possibility is to violate the well known Nyquist criterion by transmitting faster than the Nyquist rate, i.e., using a technique also known as Faster-Than-Nyquist (FTN) signaling. Nyquist-based systems have the advantage of simple transmitter and receiver architectures at the detriment of bandwidth efficiency. The idea of signaling beyond the Nyquist rate to trade the interference-free transmission for more throughput goes back to 1975. In this dissertation, we investigate the concept of FTN signaling over Additive White Gaussian Noise (AWGN) channel in the context of Orthogonal Frequency Division Multiplexing with Offset Quadrature Amplitude Modulation OFDM/OQAM modulation.The main objective of our work is to present an OFDM/OQAM system signaling faster than the Nyquist one and explore its potential rate improvement while keeping under consideration the overall system complexity. First, we propose a new efficient FTN implementation of OFDM/OQAM systems, denoted by FTN-OQAM, that has the same complexity as OFDM/OQAM systems, while approaching very closely the FTN theoretical rate improvement. As the Nyquist condition is no longer respected, severe interference impacts the transmitted signals. To deal with the introduced interferences, we propose a turbo-like receiver based on Minimum Mean Square Error Linear Equalization and Interference Cancellation, named MMSE LE-IC. The aim of our system is to boost the transmission rate, which means that high constellation orders will be targeted. In this respect, the MMSE LE-IC, whose complexity is independent of the constellation, turns out to be a good candidate. Since OFDM/OQAM modulation can be equipped with different types of pulse shapes, we propose an algorithm to find, for different constellation orders, the minimum achieved FTN packing factor for various pulse shapes. Then, we aim at improving the iterative processing of the introduced transceiver. The proposed method involves combining a precoder with the FTN-OQAM system in order to remove FTN-induced interference at the transmitter. We also present a sparse precoding pattern as it is difficult to jointly precode all the transmitted symbols. We introduce three families of precoders along with the corresponding receivers. Furthermore, we propose several modifications of the FTN-OQAM transmitter concerning different blocks such as channel coding, bits mapping and symbols mapping to further enhance the FTN-OQAM transceiver design. Presented results reveal the significant potential of the proposed methods.

In a wireless communication system the transmitted information is subjected to a number of impairments, among which inter-symbol interference (ISI), thermal noise and fading are the most prevalent. Owing to the dispersive nature of the communication channel, ISI results from the arrival of multiple delayed copies of the transmitted signal at the receiver. Thermal noise is caused by the random fluctuation on electrons in the receiver hardware, while fading is the result of constructive and destructive interference, as well as absorption during transmission. To protect the source information, error-correction coding (ECC) is performed in the transmitter, after which the coded information is interleaved in order to separate the information to be transmitted temporally. Turbo equalization (TE) is a technique whereby equalization (to correct ISI) and decoding (to correct errors) are iteratively performed by iteratively exchanging extrinsic information formed by optimal posterior probabilistic information produced by each algorithm. The extrinsic information determined from the decoder output is used as prior information by the equalizer, and vice versa, allowing for the bit-error rate (BER) performance to be improved with each iteration. Turbo equalization achieves excellent BER performance, but its computational complexity grows exponentially with an increase in channel memory as well as with encoder memory, and can therefore not be used in dispersive channels where the channel memory is large. A number of low complexity equalizers have consequently been developed to replace the maximum a posteriori probability (MAP) equalizer in order to reduce the complexity. Some of the resulting low complexity turbo equalizers achieve performance comparable to that of a conventional turbo equalizer that uses a MAP equalizer. In other cases the low complexity turbo equalizers perform much worse than the corresponding conventional turbo equalizer (CTE) because of suboptimal equalization and the inability of the low complexity equalizers to utilize the extrinsic information effectively as prior information. In this thesis the author develops two novel iterative low complexity turbo equalizers. The turbo equalization problem is modeled on superstructures, where, in the context of this thesis, a superstructure performs the task of the equalizer and the decoder. The resulting low complexity turbo equalizers process all the available information as a whole, so there is no exchange of extrinsic information between different subunits. The first is modeled on a dynamic Bayesian network (DBN) modeling the Turbo Equalization problem as a quasi-directed acyclic graph, by allowing a dominant connection between the observed variables and their corresponding hidden variables, as well as weak connections between the observed variables and past and future hidden variables. The resulting turbo equalizer is named the dynamic Bayesian network turbo equalizer (DBN-TE). The second low complexity turbo equalizer developed in this thesis is modeled on a Hopfield neural network, and is named the Hopfield neural network turbo equalizer (HNN-TE). The HNN-TE is an amalgamation of the HNN maximum likelihood sequence estimation (MLSE) equalizer, developed previously by this author, and an HNN MLSE decoder derived from a single codeword HNN decoder. Both the low complexity turbo equalizers developed in this thesis are able to jointly and iteratively equalize and decode coded, randomly interleaved information transmitted through highly dispersive multipath channels. The performance of both these low complexity turbo equalizers is comparable to that of the conventional turbo equalizer while their computational complexities are superior for channels with long memory. Their performance is also comparable to that of other low complexity turbo equalizers, but their computational complexities are worse. The computational complexity of both the DBN-TE and the HNN-TE is approximately quadratic at best (and cubic at worst) in the transmitted data block length, exponential in the encoder constraint length and approximately independent of the channel memory length. The approximate quadratic complexity of both the DBN-TE and the HNN-TE is mostly due to interleaver mitigation, requiring matrix multiplication, where the matrices have dimensions equal to the data block length, without which turbo equalization using superstructures is impossible for systems employing random interleavers. / Thesis (PhD)--University of Pretoria, 2013. / gm2013 / Electrical, Electronic and Computer Engineering / unrestricted

Les standards « Long-term evolution » (LTE) et LTE-Advanced (LTE-A) devraient influencer fortement l’avenir de la cinquième génération (5G) des réseaux mobiles. Ces normes exigent de hauts débits de données et une qualité de service de très bon niveau, ce qui permet d’assurer un faible taux d’erreur, avec une faible latence. Par ailleurs, la complexité doit être limitée. Dans le but de déterminer des solutions technologiques modernes qui satisfont ces contraintes fortes, nous étudions dans la thèse des systèmes de communication sans fil MIMO codés. D’abord, nous imposons un simple code convolutif récursif systématique (RSC) pour limiter la complexité et la latence. En considérant des récepteurs itératifs, nous optimisons alors la performance en termes de taux d’erreur de ces systèmes en définissant un précodage linéaire MIMO et des techniques de mapping appropriées. Dans la deuxième partie de la thèse, nous remplaçons le RSC par un LDPC non-binaire (NB-LDPC). Nous proposons d’utiliser les techniques de précodage MIMO afin de réduire la complexité des récepteurs des systèmes MIMO intégrant des codes NB-LDPC. Enfin, nous proposons également un nouvel algorithme de décodage itératif à faible complexité adapté aux codes NB-LDPC. / The long-term evolution (LTE) and the LTE-Advanced (LTE-A) standardizations are predicted to play essential roles in the future fifth-generation (5G) mobile networks. These standardizations require high data rate and high quality of service, which assures low error-rate and low latency. Besides, as discussed in the recent surveys, low complexity communication systems are also essential in the next 5G mobile networks. To adapt to the modern trend of technology, in this PhD thesis, we investigate the multiple-input multiple-output (MIMO) wireless communication schemes. In the first part of this thesis, low-complex forward error correction (FEC) codes are used for low complexity and latency. By considering iterative receivers at the receiver side, we exploit MIMO linear precoding and mapping methods to optimize the error-rate performance of these systems. In the second part of this thesis, non-binary low density parity check (NB-LDPC) codes are investigated. We propose to use MIMO precoders to reduce the complexity for NB-LDPC encoded MIMO systems. A novel low complexity decoding algorithm for NB-LDPC codes is also proposed at the end of this thesis.