Non-linear continuous phase modulation has constant envelope and spectral efficiency, which are desirable for public safety communication systems where both bandwidth and power are limited. A practical design of an innovation based receiver for partial response CPM was recently developed for public safety applications. It is in the form of a linear predictive demodulator with a coefficient look up table. The demodulator shows great performance over multipath fading channels without channel equalization and promises a significant contribution to public safety communication. The work in this thesis is focussed on developing and analyzing modern techniques to improve the receiver performance while maintaining a feasible implementation complexity. Suitable soft output algorithms are incorporated into the demodulator allowing a subsequent convolutional decoder to perform soft decoding. By modifying the design criteria of the predictive demodulator and introducing a feedback loop, an iterative detection scheme is formed for the concatenated structure of demodulator, deinterleaver and decoder. Spatial diversity combining techniques are summarized and a very low complexity combining scheme is developed. It selects the best received sample sequence by considering the average energy of each sequence. In addition, the demodulator is extended to have dual coefficient look up tables supporting its detection by having parallel prediction processes and combining their results. This leads to an improvement in overall demodulator performance. A theoretical proof that only half the number of coefficients need to be stored in memory is also given. Matlab simulations on a Rayleigh fast fading multipath channel have shown that the proposed techniques significantly improve the overall detection accuracy. Each of them provides a good gain in signal to noise ratio or delay spread and when combined, a significant performance gain is achieved.

The focus of this thesis is peak-to-average power ratio (PAPR) reduction in cooperative wireless networks which exploit orthogonal frequency division multiplexing in transmission. To reduce the PAPR clipping is employed at the source node. The first contribution focuses upon an amplify-and-forward (AF) type network with four relay nodes which exploits distributed closed loop extended orthogonal space frequency block coding to improve end-to-end performance. Oversampling and filtering are used at the source node to reduce out-of-band interference and the iterative amplitude reconstruction decoding technique is used at the destination node to mitigate in-band distortion which is introduced by the clipping process. In addition, by exploiting quantized group feedback and phase rotation at two of the relay nodes, the system achieves full cooperative diversity in addition to array gain. The second contribution area is outage probability analysis in the context of multi-relay selection in a cooperative AF network with frequency selective fading channels. The gains of time domain multi-path fading channels with L paths are modeled with an Erlang distribution. General closed form expressions for the lower and upper bounds of outage probability are derived for arbitrary channel length L as a function of end-to-end signal to noise ratio. This analysis is then extended for the case when single relay selection from an arbitrary number of relay nodes M is performed. The spatial and temporal cooperative diversity gain is then analysed. In addition, exact form of outage probability for multi-path channel length L = 2 and selecting the best single relay from an arbitrary number of relay nodes M is obtained. Moreover, selecting a pair of relays when L = 2 or 3 is additionally analysed. Finally, the third contribution context is outage probability analysis of a cooperative AF network with single and two relay pair selection from M available relay nodes together with clipping at the source node, which is explicitly modelled. MATLAB and Maple software based simulations are employed throughout the thesis to support the analytical results and assess the performance of algorithms and methods.

[pt] Este trabalho estuda o problema de detecção de hipóteses binárias em sistemas distribuídos com centro de fusão operando em presença de canais seletivos em frequência. O uso de uma técnica de múltiplo acesso, referida aqui como CS-CDMA, é proposta para comunicação ortogonal entre os nós e o centro de fusão, assim como detector ótimo Bayesiano para fusão de dados em tais sistemas distribuídos é obtido. Como a complexidade do detector ótimo cresce exponencialmente com o número de nós sensores, um receptor sub-ótimo de baixa complexidade que realiza uma detecção casada multi-usuário seguida de decisão pela regra da maioria é proposto e examinado neste trabalho. Técnicas para estimação de canal, cega e assistida, necessárias para a implementação prática da detecção casada são também propostas. Simulações indicam que este receptor, de baixa complexidade, possui um desempenho próximo ao receptor ótimo. Com o objetivo de se ampliar o desempenho do detector casado do centro de fusão, é examinado o uso de cooperação na rede de sensores. Resultados de simulações mostraram que, como esperado, o uso de cooperação em sistema distribuídos utilizando o esquema de múltiplo acesso CS-CDMA melhora o desempenho do decisor do centro de fusão, entretanto esse ganho de desempenho mostrou-se mais significativo em ambientes com poucos multipercursos, uma vez que os sistemas distribuídos CS-CDMA não-cooperativos propostos exploram eficientemente a diversidade de multipercurso. Finalmente, este trabalho propõe um procedimento de fusão adaptativa não-assistida para sistemas distribuídos com fusão centralizada. Simulações mostram que a estratégia de fusão adaptativa possui desempenho muito próximo ao da regra de fusão ótima. / [en] This work studies the problem of detecting binary hypotheses in distributed systems with a fusion center operating in frequency selective channels. The use of a multiple access technique, referred herein as Chip Spread- Code Division Multiple Access (CS-CDMA), is proposed for orthogonal communication between the nodes and the fusion center and the Bayesian optimum detector for data fusion for such distributed systems is obtained. As the complexity of the optimal detector grows exponentially with the number of sensor nodes, a sub-optimal low-complexity receiver that performs a multi-user matched detection followed by the majority rule is proposed and examined in this work. Blind and assisted techniques for channel estimation necessary for the practical implementation of the matched detection have also been proposed. Simulations indicate that this low complexity receptor has a performance close to the optimal receiver. In order to increase the performance of the matched detector of the fusion center, it was examined the use of cooperation in this sensor network. Simulation results showed that, as expected, the use of cooperation in the distributed system with a multiple access scheme CS-CDMA improves the performance of the fusion center, however, this performance increasing was more significant in environments with few multipath, since the non-cooperative CS-CDMA distributed systems proposed here, efficiently exploits the multipath diversity. Finally, this paper proposes a non-assisted adaptive fusion for distributed systems with centralized fusion. Simulations show that the adaptive fusion strategy has a performance very close to the optimal fusion rule.

The topic of this thesis is signaling design for data transmission through wireless channels between a transmitter and a receiver that can both be equipped with one or more antennas. In particular, the focus is on channels where the propagation coefficients between each transmitter--receiver antenna pair are only partially known or completetly unknown to the receiver and unknown to the transmitter. A standard signal design approach for this scenario is based on separate training for the acquisition of channel knowledge at the receiver and subsequent error-control coding for data detection over channels that are known or at least approximately known at the receiver. If the number of parameters to estimate in the acquisition phase is high as, e.g., in a frequency-selective multiple-input multiple-output channel, the required amount of training symbols can be substantial. It is therefore of interest to study signaling schemes that minimize the overhead of training or avoid a training sequence altogether. Several approaches for the design of such schemes are considered in this thesis. Two different design methods are investigated based on a signal representation in the time domain. In the first approach, the symbol alphabet is preselected, the design problem is formulated as an integer optimization problem and solutions are found using simulated annealing. The second design method is targeted towards general complex-valued signaling and applies a constrained gradient-search algorithm. Both approaches result in signaling schemes with excellent detection performance, albeit at the cost of significant complexity requirements. A third approach is based on a signal representation in the frequency domain. A low-complexity signaling scheme performing differential space--frequency modulation and detection is described, analyzed in detail and evaluated by simulation examples. The mentioned design approaches assumed that the receiver has no knowledge about the value of the channel coefficients. However, we also investigate a scenario where the receiver has access to an estimate of the channel coefficients with known error statistics. In the case of a frequency-flat fading channel, a design criterion allowing for a smooth transition between the corresponding criteria for known and unknown channel is derived and used to design signaling schemes matched to the quality of the channel estimate. In particular, a constellation design is proposed that offers a high level of flexibility to accomodate various levels of channel knowledge at the receiver. / QC 20101014

<p>The topic of this thesis is signaling design for data transmission through wireless channels between a transmitter and a receiver that can both be equipped with one or more antennas. In particular, the focus is on channels where the propagation coefficients between each transmitter--receiver antenna pair are only partially known or completetly unknown to the receiver and unknown to the transmitter.</p><p>A standard signal design approach for this scenario is based on separate training for the acquisition of channel knowledge at the receiver and subsequent error-control coding for data detection over channels that are known or at least approximately known at the receiver. If the number of parameters to estimate in the acquisition phase is high as, e.g., in a frequency-selective multiple-input multiple-output channel, the required amount of training symbols can be substantial. It is therefore of interest to study signaling schemes that minimize the overhead of training or avoid a training sequence altogether.</p><p>Several approaches for the design of such schemes are considered in this thesis. Two different design methods are investigated based on a signal representation in the time domain. In the first approach, the symbol alphabet is preselected, the design problem is formulated as an integer optimization problem and solutions are found using simulated annealing. The second design method is targeted towards general complex-valued signaling and applies a constrained gradient-search algorithm. Both approaches result in signaling schemes with excellent detection performance, albeit at the cost of significant complexity requirements.</p><p>A third approach is based on a signal representation in the frequency domain. A low-complexity signaling scheme performing differential space--frequency modulation and detection is described, analyzed in detail and evaluated by simulation examples.</p><p>The mentioned design approaches assumed that the receiver has no knowledge about the value of the channel coefficients. However, we also investigate a scenario where the receiver has access to an estimate of the channel coefficients with known error statistics. In the case of a frequency-flat fading channel, a design criterion allowing for a smooth transition between the corresponding criteria for known and unknown channel is derived and used to design signaling schemes matched to the quality of the channel estimate. In particular, a constellation design is proposed that offers a high level of flexibility to accomodate various levels of channel knowledge at the receiver.</p>

Τα τελευταία χρόνια και κυρίως μετά το 1996 έχει παρουσιαστεί ένα έντονο ενδιαφέρον γύρω από τα ασύρματα συστήματα MIMO (Συστήματα Πολλών Εισόδων και Πολλών Εξόδων). Η βασική αιτία που δημιούργησε αυτό το ενδιαφέρον ήταν η θεωρητική ανάλυση της χωρητικότητας που επιτυγχάνεται με τη χρήση πολλαπλών κεραιών τόσο στο δέκτη όσο και στον πομπό. Ωστόσο πέρα από την αύξηση της χωρητικότητας τα συστήματα MIMΟ έχουν μια σειρά από επιπλέον πλεονεκτήματα, επιτυγχάνουν ανεκτικότητα στην εξασθένιση, αυξάνουν την φασματική αποδοτικότητα, μειώνουν την κατανάλωση ενέργειας καθώς και το κόστος χρήσης και κατασκευής ασύρματων δικτύων. Έχοντας λάβει υπ’ όψιν τα παραπάνω και έχοντας κάνει ήδη μια αρχική έρευνα στο τι υπάρχει στην επιστημονική βιβλιογραφία γύρω από τα συστήματα MIMO, επιλέξαμε να ασχοληθούμε με την συγκεκριμένη τεχνολογία και πιο συγκεκριμένα με την προ-κωδικοποίηση πομπού, όταν τα κανάλια που διαθέτουμε είναι συχνοτικά επιλεκτικά (frequency selective). Το πρόβλημα που μας απασχόλησε είναι η διερεύνηση τεχνικών κωδικοποίησης των δεδομένων του πομπού, πριν αυτά μεταδοθούν, ούτως ώστε να μπορέσει να απλοποιηθεί η σχεδίαση του δέκτη. Στην περίπτωση των συχνοτικά επιλεκτικών καναλιών πέρα από τον πανταχού παρόντα Γκαουσιανό θόρυβο έχουμε να αντιμετωπίσουμε και τη διασυμβολική παρεμβολή (Intersymbol Interference - ISI) . Στόχος μας είναι να μπορέσουμε να μετατοπίσουμε τη διαδικασία της ισοστάθμισης από το δέκτη στον πομπό, όπου, στην περίπτωση που ο πομπός είναι ένας σταθμός βάσης, η δυνατότητα υλοποίησης πολύπλοκων διεργασιών είναι μεγαλύτερη, τόσο μεγαλύτερης ανοχής στην κατανάλωση ενέργειας όσο κυρίως, και στη δυνατότητα χρήσης πολύπλοκου υλικού. Το πρόβλημα που τίθεται στην περίπτωση που η ισοστάθμιση γίνει στην μεριά του πομπού είναι η ποιότητα και η ποσότητα της γνώσης του πραγματικού καναλιού. Είναι σχεδόν αδύνατο ο πομπός να έχει πλήρη γνώση του πραγματικού καναλιού, με αποτέλεσμα να πρέπει να αρκεστεί σε γνώση, που στην καλύτερη περίπτωση προσεγγίζει αυτή του πραγματικού καναλιού. Επίσης, πολλές φορές, η ποσότητα της γνώσης που μπορεί να αποσταλεί από το δέκτη – όταν δεν ισχύει η αρχή της αμοιβαιότητας (reciprocity) – είναι περιορισμένη. Από τα παραπάνω καταλαβαίνουμε ότι θα είχε ενδιαφέρον η μελέτη τεχνικών που παρουσιάζουν ανοχή στην ποιότητα της γνώσης του καναλιού καθώς και η συμπεριφορά τους όταν αυτές διαθέτουν μερική ή και περιορισμένη γνώση του πραγματικού καναλιού. Ένας από τους τρόπου αντιμετώπισης όταν συναντούνται συχνοτικά επιλεκτικά κανάλια είναι η χρήση του OFDM με όσα αρνητικά αυτό συνεπάγεται (π.χ. η δυσκολία συγχρονισμού πομπού και δέκτη). Ένας άλλος τρόπος αντιμετώπισης, στην περίπτωση μονής φέρουσας (single carrier), είναι η χρήση προκωδικοποιητων Bezout. Επιλέξαμε να ασχοληθούμε με αυτόν τον τύπου προκωδικοποίητων. Πιο συγκεκριμένα, όταν ο αριθμός των κεραιών του πομπού είναι μεγαλύτερος από τον αριθμό των κεραιών του δέκτη, είναι δυνατόν να εφαρμόσουμε την ταυτότητα Bezout (Bezout Identity) στην μεριά του δέκτη. Με απλά λόγια θα εφαρμόσουμε ένα προ-ισοσταθμιστή επιβολής μηδενικών (zero forcing). Όπως είναι αναμενόμενο, μιας και ο προκωδικοποιητής εφαρμόζεται στην μεριά του πομπού, πριν εμφανιστεί ο Γκαουσιανός θόρυβος, δεν έχουμε ενίσχυση αυτού του θορύβου, ωστόσο είναι δυνατόν να έχουμε σημαντική αύξηση της μεταδιδόμενης ισχύος. Για να λυθεί αυτό το πρόβλημα έχει προταθεί στη βιβλιογραφία η σχεδίαση προκωδικοποιητών Bezout με την χρήση περιορισμών ισχύος. Αυτό που εμείς μελετήσαμε στην περίπτωση των προκωδικοποιητών Bezout (ή FIR προκωδικοποιητών), είναι η συμπεριφορά τους στην περίπτωση που ο πομπός διαθέτει πλήρη ή μερική γνώση του καναλιού. Είδαμε την περίπτωση του σχεδιασμού ενός FIR προκωδικοποιητή κάτω από τον περιορισμό ισχύος μετάδοσης μέσω της μεθόδου Tikhonov Regularization, ενός σημαντικού εργαλείου επίλυσης του προβλήματος των ελαχίστων τετραγώνων κάτω από τη δι-κριτήριο διατύπωση. Τέλος, προτείναμε δύο FIR σχεδιασμούς προκωδικοποιητών για την περίπτωση που ο πομπός διαθέτει παραμετρική (στατιστική) περιγραφή του καναλιού. / The last years, but mainly after 1996 there is an intensive interest in MIMO systems. The reason that created this interest was the capacity that can be achieved by the use of multiple antennas to the transmitter and to receiver. Furthermore, the use of multiple antennas has a number of advantages except from the capacity increase; MIMO can achieve tolerance to fading, spectral efficiency, increased coverage etc. By having considered the above information we decided to work with MIMO systems and especially with precoding techniques for frequency selective channels. In the case of frequency selective channels except from the Gaussian noise we have to treat and with intersymbol interference (ISI) which is an important degradation factor. A very serious reason to handle intersymbol interference at the transmitter side - especially when transmitter is a base station - is to simplify receiver's design. When transmitter is a base station there is a tolerance in power consuming and in the implementation of more complicated hardware. After an extensive bibliographical we concluded to use the theory of Bezout Identity. In the case where the number of antennas at the transmitter is greater than the number of antennas at the receiver it is formed a left-coprime FIR channel. By using the Bezout identity matrix, it is possible to be designed a FIR MIMO precoder that reduce intersymbol interference. Bezout precoder (pre-equalizer) is a zero-forcing (ZF) equalizer. As it is known from bibliography ZF equalizer has the disadvantage that amplifies noise power in deep fades. For the case of Bezout precoder it is not true since there is no noise - noise will appear at the receiver. But there is another disadvantage, Bezout precoder may increase transmit power significantly to overcome deep fades in the singular values of the channel matrix. The solution to the previous phenomenon can be taken by designing ZF precoders under power constraints. The main problem in the case of transmit precoding is the channel knowledge - when reciprocity principle is not valid. In most cases it is not possible to have perfect channel knowledge or even the knowledge that we have may be of bad quality. Another drawback that appears in the case of frequency selective channels is the amounts of information (number of bits) that can be send back to the transmitter - limited feedback. Many works assumed a quasi-static channel - channel doesn't changes for a number of symbols - and perfect channel knowledge. In real world this may not be true. In this master thesis we investigated three things. Firstly, the behavior of Bezout precoders under channel mismatch at the side of transmitter. Secondly, ways that will allows us to decrease channel feedback. And thirdly, which was the most interesting, we proposed two FIR designs that uses statistical channel knowledge.

Over the past two decades the mobile wireless communication systems has been growing fast and continuously. Therefore, the standardization bodies together with wireless researchers and mobile operators around the globe have been constantly working on new technical specifications in order to meet the demand for this rapid growth. The 3rd Generation Partnership Project (3GPP) one of the largest of such standardization bodies, works on developing the current third generation (3G) mobile telecommunication systems towards the future 4th generation. Research towards meeting the higher demands for higher data rates was the main reason for the birth of an evolution technology towards the 4th generation mobile systems. This evolution to the current 3rd generation UMTS systems was given the name E-UTRA/UTRAN Long Term Evolution (LTE) by the 3GPP. This thesis research has been carried out at the Telecommunications Research Center (ftw.) in Vienna. It was conducted in the framework of the C10 project “Wireless Evolution Beyond 3G”. One of the fields of research within this project is to have a special focus on the OFDM modulation schemes that are discussed under the new evolution technology (LTE) of the UMTS mobile networks. Therefore, this thesis focuses mainly in analyzing the new requirements, and evaluating them by designing a low-complexity UMTS-LTE OFDM based transceiver. This thesis aims mainly in studying the feasibility of this technology by means of simulation. / Tel: +46-704469795 Email: osman@ftw.at,amos04@student.bth.se, ammarmao@gmail.com

Si les drones militaires connaissent un développement important depuis une quinzaine d’année, suivi depuis quelques années par les drones civiles dont les usages ne font que se multiplier, en réalité les drones ont un siècle avec le premier vol d’un avion équipé d’un système de pilotage automatique sur une centaine de kilomètre en 1918. La question des règles d’usage des drones civiles sont en cours de développement malgré leur multiplication pour des usages allant de l’agriculture, à l’observation en passant par la livraison de colis. Ainsi, leur intégration dans l’espace aérien reste un enjeu important, ainsi que les standards de communication avec ces drones dans laquelle s’inscrit cette thèse. Cette thèse vise en effet à étudier et proposer des solutions pour les liens de communications des drones par satellite.L’intégration de ce lien de communication permet d’assurer la fiabilité des communications et particulièrement du lien de Commande et Contrôle partout dans le monde, en s’affranchissant des contraintes d’un réseau terrestre (comme les zones blanches). En raison de la rareté des ressources fréquentielles déjà allouées pour les futurs systèmes intégrant des drones, l’efficacité spectrale devient un paramètre important pour leur déploiement à grande échelle et le contexte spatiale demande l’utilisation d’un système de communication robuste aux non-linéarités. Les Modulations à Phase Continue permettent de répondre à ces problématiques. Cependant, ces dernières sont des modulations non-linéaire à mémoire entraînant une augmentation de la complexité des récepteurs. Du fait de la présence d’un canal multi-trajet (canal aéronautique par satellite), le principal objectif de cette thèse est de proposer des algorithmes d’égalisation (dans le domaine fréquentiel pour réduire leur complexité) et de synchronisation pour CPM adaptés à ce concept tout en essayant de proposer une complexité calculatoire raisonnable. Dans un premier temps, nous avons considéré uniquement des canaux sélectifs en fréquence et avons étudier les différents égaliseurs de la littérature. En étudiant leur similitudes et différences, nous avons pu développer un égaliseur dans le domaine fréquentiel qui proposant les mêmes performances a une complexité moindre. Nous proposons également des méthodes d’estimation canal et une méthode d’estimation conjointe du canal et de la fréquence porteuse. Dans un second temps nous avons montré comment étendre ces méthodes à des canaux sélectifs en temps et fréquence permettant ainsi de conserver une complexité calculatoire raisonnable. / If the use of Unmanned Aerial Vehicles (UAV) has been booming for military applications since adecade, followed by civil applications since a few years (with a lot of completely different purposes), the first UAV has been developed and tested in 1918 with the first flight of a fight withthe first autopilot system. The issue of a complete and safe integration in the existing air trafficair craft system is currently being studied as the multiple use case of UAV are growing exponentially from agriculture, observation and package delivery. Hence, the integration of UAV inthe air traffic system is a global issue, and so are the communication standard in which the thesis take place. This thesis aims to study and propose solutions for the communication link by satellitefor UAV. This satellite link would ensure the reliability of the system, and above all of theCommand and Control Link, by avoiding the issue of a terrestrial communication network (such asover the ocean, where no terrestrial network is available). Due to spectral resource lack alreadyallocated for the UAV, the spectral efficiency of the communication link is a critical issue, as its robustness to non-linearity due to the spatial context. Continuous Phase Modulation is a potentialsolution to answer to those issues. However, this will lead to an increased computational complexity at the received compared to linear modulation scheme The aeronautical channel bysatellite is characterized by a doubly-selective channels due to Ground Reflections of the signal,and in this thesis, we proposed equalization algorithms and synchronization techniques for CPM in this context while trying to keep a reasonable computational complexity a. First, we have only considered transmission over frequency selective channels. We have made a study of the equalizers proposed by the literature and by studying their similitudes and differences, we have been able to propose a new equalizer with a lower computational complexity but having the same performance. We also have proposed a channel estimation method and a joint channel and carrier frequency estimation for CPM over frequency-selective channels. In a second time, we have extended our method to doubly selective channel (as there is Doppler Spread in our communication system due to the UAV speed) which allows us to have an overall receiver structure with a reasonable computational complexity.

It is well known that multiple antennas at the transmitter and receiver are imperative for reliable and high data-rate communication over wireless channels. However, these systems essentially need multiple radio frequency (RF) chains owing to multiple antennas, and hence pose challenges for applications with limited form-factor. Antenna Selection (AS) techniques alleviate this problem by using only a subset of the total available antennas and hence require only a few RF chains compared to the number of antennas. These systems operate in a closed-loop scenario, where the information fed back from the receiver is used for the transmit antenna subset selection. In contrast to this, a novel open-loop technique known as spatial modulation (SM) was recently proposed that uses a single RF-chain at the transmitter and achieves a higher spectral efficiency compared to single-input and AS based systems. The work in the thesis mainly focuses on the following aspects of SM system: Study of Mutual Information in SM systems operating in open-loop and closed-loop scenarios: We study the achievable mutual information in the SM system operating with finite and Gaussian input alphabet, and compare the results with that of the SIMO and AS based systems. Reduced-complexity maximum-likelihood (ML) decoding algorithms for SM systems: We propose ML-optimal sphere decoders for SM systems with arbitrary number of transmit antennas. Furthermore, a reduced-complexity ML detector is also proposed whose computational complexity is lowest among the known existing detectors in the literature. Transmit diversity techniques for SM systems: The conventional SM system achieves a transmit diversity order of one. We propose a complex interleaved orthogonal design baaed SM scheme that achieves a transit diversity order of two, while offering symbol-by- symbol ML decodability. Transmit antenna subset selection algorithms for SM systems: The SM system is considered in the closed-loop scenario, where only a subset of the total number of transmit antennas is chosen based on the information fed back by the receiver. Specifically, the Euclidean distance and capacity optimized antenna selection algorithms are studied in comparison with the conventional AS based systems. SM system operating in dispersive channels: The SM system operating in a dispersive channel with the aid of zero-padding is studied. It is shown that the SM system achieves full receive-diversity and multipath-diversity with ML decoding, but offers a decoding complexity that is exponential in the number of multipaths. Furthermore, a reduced complexity linear receiver is proposed that achieves achieves full multipath as well as receive-diversity, while offering a decoding complexity order same as that of the SM system operating in a frequency-flat channel.

[pt] Além de apresentar uma visão unificada das técnicas de transmissão digital em blocos e suas combinações com a técnica de múltiplo acesso CDMA (Code Division Multiple Access), esta dissertação examina uma nova possível técnica de transmissão para sistemas com múltiplo acesso, aqui chamada CS-CDMA (Chip-Spread Code Division Multiple Access), combinada com as técnicas de transmissão em blocos, em portadora única (SC-Single Carrier ), gerando o esquema SC CS-CDMA, e em múltiplas portadoras OFDM (Orthogonal Frequency Division Multiplexing), gerando o esquema MC CSCDMA. Comparações de desempenho com os sistemas de transmissão por blocos CDMA de portadora única conhecido como SC CDMA (Single Carrier Code Division Multiple Access) e de múltiplas portadoras conhecido como MC CDMA (Multi Carrier Code Division Multiple Access) são apresentadas. Uma característica marcante da técnica de transmissão enfocada é que, diferentemente do que ocorre nos sistemas CDMA, a ortogonalidade entre os códigos dos diferentes usuários é mantida mesmo quando a transmissão é feita atravéss de um canal multipercurso seletivo na frequência, permitindo assim que os usuários possam ser idealmente desacoplados na recepção. Além desta vantagem, e muito devido a ela, os resultados de desempenho, obtidos via simulação, indicam uma significativa superioridade do sistema proposto CSCDMA, quando os sinais são transmitidos em portadora única, sobre o tradicional CDMA. Os resultados consideram recepção com equalização no domínio da frequéncia utilizando equalizadores do tipo ZF (Zero Forcing) e MMSE (Minimum Mean Squared Error). / [en] In addition to presenting a unified view of digital blocks transmission technologies and their combinations with the technique of multiple access CDMA (Code Division Multiple Access), this dissertation addresses a new possible transmission technique for multiple access sytem, called here CS -CDMA (Chip-Spread Code Division Multiple Access), combined with blocks transmissions techniques, in single carrier (SC- Single Carrier ), generating scheme SC CS-CDMA, and in multi carrier OFDM (Ortogonal Frequency Division Multiplexing), generating escheme MC CS-CDMA. Performance comparisons with the traditional SC CDMA (Single Carrier Code Division Multiple Access) and MC CDMA (Multi Carrier Code Division Multiple Access) block transmission systemare presented. A key feature of the proposed transmission technique is that, differently from what occurs with CDMA, the original code orthogonality between users is preserved despite propagation through multipath frequency selective channels, thus ideally allowing the decoupling of the signals at the receiver side. Beyond this advantage, and mostly due to it, the performance results indicate a clear superiority of the proposed system CS-CDMA, over the traditional CDMA, when signals are transmitted in single carrier. The simulation results consider frequency domain ZF (Zero Forcing) and MMSE (Minimum Mean Squared Error).