Orthogonal frequency division multiplexing (OFDM) modulator with redundancy has been adopted in many wireless communication systems for higher data rate transmissions. The introduced redundancy at the transmitter allows us to overcome serious inter-block interference (IBI) problems due to highly dispersive channel. However, the selection of redundancy length will affect the system performance and spectral efficiency, and is highly dependent on the length of channel impulse response. In this thesis, based on the pseudorandom postfix (PRP) OFDM scheme we propose a novel block-based OFDM transceiver framework. Since in the PRP-OFDM system the PRP can be employed for semi-blind channel estimation with order-one statistics of the received signal. Hence, for sufficient redundancy case the PRP-OFDM system with the Bayesian decision feedback equalizer (DFE) is adopted for suppressing the IBI and ISI simultaneously. However, for the insufficient redundancy case (the length of redundancy is less than the order of channel), we first propose a modified scheme for channel estimation. To further reduce the complexity of receiver, the maximum shortening signal-to-noise-ratio time domain equalizer (MSSNR TEQ) with the Bayesian DFE is developed for suppressing the IBI and ISI, separately. That is, after knowing the channel state information (CSI) and removing the effect of IBI with MSSNR TEQ, the Bayesian DFE is applied for eliminating the ISI. Via computer simulation, we verify that performance improvement, in terms of bit error rate (BER), compared with the conventional block-based minimum mean square error (MMSE)-DFE can be achieved.

This thesis proposes a decision-feedback equalizer (DFE) scheme for blind ADC-based receivers to overcome the challenges introduced by blind sampling. It presents the design, simulation, and implementation of a 5Gb/s speculative DFE for a 2x blind ADC-based receiver. The complete receiver, including the ADC, the DFE, and a 2x blind clock and data recovery (CDR) circuit, is implemented in Fujitsu’s 65-nm CMOS process. Measurements of the fabricated test-chip confirm 5Gb/s data recovery with bit error rate (BER) less than 1e−12 in the presence of a test channel introducing 13.3dB of attenuation at the Nyquist frequency of 2.5GHz. The receiver tolerates 0.24UIpp of high-frequency sinusoidal jitter (SJ) in this case. Without the DFE, the BER exceeds 1e−8 even when no SJ is applied.

This thesis proposes a decision-feedback equalizer (DFE) scheme for blind ADC-based receivers to overcome the challenges introduced by blind sampling. It presents the design, simulation, and implementation of a 5Gb/s speculative DFE for a 2x blind ADC-based receiver. The complete receiver, including the ADC, the DFE, and a 2x blind clock and data recovery (CDR) circuit, is implemented in Fujitsu’s 65-nm CMOS process. Measurements of the fabricated test-chip confirm 5Gb/s data recovery with bit error rate (BER) less than 1e−12 in the presence of a test channel introducing 13.3dB of attenuation at the Nyquist frequency of 2.5GHz. The receiver tolerates 0.24UIpp of high-frequency sinusoidal jitter (SJ) in this case. Without the DFE, the BER exceeds 1e−8 even when no SJ is applied.

This thesis present a new receiver framework for the cyclic-prefix free (CP-free) MIMO-OFDM system, equipped with the space-time block coded (ST-BC) uplink transmission over (slowly) time varying multipath channels. Usually, without CP in the OFDM system the inter-carrier interference (ICI) could not be removed, effectively, at the receiver, when the inter-symbol-interference (ISI) has to be taken into account. In this thesis, by exploiting the spatial and frequency resources, we propose a novel frequency-domain decision-feedback equalizer, associated with the oblique projection (OB), to combat the effects of ISI and ICI, simultaneously. The OB is a non-orthogonal projection and is very useful to deal with the structure noise (e.g., the ISI term). From computer simulations, we observe that the performance of propose scheme can perform very close to the conventional CP-based MMO-OFDM with the ST-BC.

Made available in DSpace on 2016-03-15T19:37:53Z (GMT). No. of bitstreams: 1 Joao Mendes Filho.pdf: 3436374 bytes, checksum: c1e27ed8da5440d5715cdfb24bb7aa6a (MD5) Previous issue date: 2007-01-24 / Fundo Mackenzie de Pesquisa / Due to the growing demand for mobile communications, adaptive equalizers play an important role for enhancing the efficiency of data transmission. In this scenario, the Decision Feedback Equalizer (DFE) stands out. It presents a favorable tradeoff between computational cost and efficient behavior, mainly when compared to Linear Transversal Equalizer. In this work, the blind adaptation of DFE is investigated for the single and multiuser cases. In the single user case, the perfect equalization conditions for the DFE are revisited, considering the absence of noise and feedback of correct decisions. Assuming the joint blind adaptation of the DFE's feedforward and feedback filters, two stochastic gradient algorithms are also revisited. The first is based on the Constant Modulus cost function, subjected to a constraint to avoid degenerate solutions. The second considers the minimization of a cost function that takes into account the probability density function of the equalizers's output. This latter, known in the literature as the Soft Decision-Directed (SDD) algorithm, was proposed for the recovery of signals based on the Quadrature Amplitude Modulation (QAM). From the division of the complex plane into regions containing 4-QAM type constellations, we propose a modification in the SDD algorithm based on the centers of these regions. The resulting algorithm presents a more favorable tradeoff between convergence rate and computational cost. Moreover, in order to mitigate the steady-state mean-square error, we consider concurrent algorithms based on the previous mentioned. As a core of this dissertation, the perfect equalization conditions and the remarked algorithms are extended to the multiuser case. Simulation results point out that the Modified SDD algorithm and its concurrent adaptation with the constrained Constant Modulus Algorithm present advantages in terms of convergence rate for the blind adaptation of DFE in the recovering of QAM signals. / Devido à crescente demanda por comunicações móveis, equalizadores adaptativos autodidatas desempenham um importante papel na melhoria da eficiência da transmissão de dados. Nesse cenário, destaca-se o equalizador de decisão realimentada (DFE - Decision Feedback Equalizer), que apresenta um compromisso favorável entre custo computacional e comportamento eficiente, principalmente quando comparado ao equalizador linear transversal. Neste trabalho, a adaptação autodidata do DFE é investigada tanto no caso mono quanto no multiusuário. Considerando o caso monousuário, revisitam-se as condições de equalização perfeita com o DFE, assumindo realimentação de decisões corretas e ausência de ruído. Revisitam-se também dois algoritmos do gradiente estocástico para adaptação autodidata conjunta dos filtros direto e de realimentação do DFE. O primeiro é baseado na função custo do Módulo Constante com uma restrição imposta, a fim de se evitar soluções degeneradas. O segundo considera a minimização de uma função custo que leva em conta a função densidade de probabilidade do sinal de saída do equalizador. Este último, conhecido na literatura como algoritmo de Decisão Direta Suave (SDD - Soft Decision-Directed), foi proposto para recuperação de sinais com modulação do tipo QAM (Quadrature Amplitude Modulation). A partir da divisão do espaço complexo em regiões contendo constelações do tipo 4-QAM, é proposta uma modificação ao algoritmo SDD baseada nos centros dessas regiões. O algoritmo resultante apresenta uma relação mais favorável entre velocidade de convergência e complexidade computacional. Ainda com o intuito de mitigar o erro quadrático resultante da adaptação autodidata, considera-se a utilização de algoritmos concorrentes baseados nos algoritmos supracitados. Como cerne desta dissertação, as condições de equalização perfeita e os algoritmos abordados são estendidos para o caso multiusuário. Resultados de simulações evidenciam que o algoritmo SDD modificado e sua adaptação concorrente com o algoritmo do Módulo Constante com restrição apresentam vantagens em termos de velocidade de convergência para adaptação autodidata do DFE na recuperação de sinais do tipo QAM.

Tato práce je psaná v angličtině a je zaměřená na problematiku ekvalizace v digitálních komunikačních systémech. Teoretická část zahrnuje stručné pozorování různých způsobů návrhu ekvalizérů. Praktická část se zabývá implementací nejčastěji používaných ekvalizérů a s jejich adaptačními algoritmy. Cílem praktické části je porovnat jejich charakteristiky a odhalit činitele, které ovlivňují kvalitu ekvalizace. V rámci problematiky ekvalizace jsou prozkoumány tři typy ekvalizérů. Lineární ekvalizér, ekvalizér se zpětnou vazbou a ML (Maximum likelihood) ekvalizér. Každý ekvalizér byl testován na modelu, který simuloval reálnou přenosovou soustavu s komplexním zkreslením, která je složena z útlumu, mezisymbolové interference a aditivního šumu. Na základě implenentace byli určeny charakteristiky ekvalizérů a stanoveno že optimální výkon má ML ekvalizér. Adaptační algoritmy hrají významnou roli ve výkonnosti všech zmíněných ekvalizérů. V práci je nastudována skupina stochastických algoritmů jako algoritmus nejmenších čtverců(LMS), Normalizovaný LMS, Variable step-size LMS a algoritmus RLS jako zástupce deterministického přístupu. Bylo zjištěno, že RLS konverguje mnohem rychleji, než algoritmy založené na LMS. Byly nastudovány činitele, které ovlivnili výkon popisovaných algoritmů. Jedním z důležitých činitelů, který ovlivňuje rychlost konvergence a stabilitu algoritmů LMS je parametr velikosti kroku. Dalším velmi důležitým faktorem je výběr trénovací sekvence. Bylo zjištěno, že velkou nevýhodou algoritmů založených na LMS v porovnání s RLS algoritmy je, že kvalita ekvalizace je velmi závislá na spektrální výkonové hustotě a a trénovací sekvenci.

Τα τελευταία χρόνια χαρακτηρίζονται από μια αλματώδη ανάπτυξη των προϊόντων και υπηρεσιών που βασίζονται στα δίκτυα ασύρματης επικοινωνίας, ενώ προκύπτουν σημαντικές ερευνητικές προκλήσεις. Τα συστήματα πολλαπλών κεραιών στον πομπό και στο δέκτη, γνωστά και ως συστήματα MIMO (multi-input multi-output), καθώς και η τεχνολογία πολλαπλής προσπέλασης με χρήση κωδικών (code division multiple access, CDMA) αποτελούν δύο από τα βασικά μέτωπα ανάπτυξης των ασύρματων τηλεπικοινωνιών. Στα πλαίσια της παρούσας διδακτορικής διατριβής, ασχοληθήκαμε με την ανάπτυξη και μελέτη αλγορίθμων επεξεργασίας σήματος για τα δύο παραπάνω συστήματα, όπως περιγράφεται αναλυτικά παρακάτω. Σχετικά με τα συστήματα MIMO, η πρωτοποριακή έρευνα που πραγματοποιήθηκε στα Bell Labs γύρω στα 1996, όπου αναπτύχθηκε η αρχιτεκτονική BLAST (Bell Labs Layered Space-Time), απέδειξε ότι η χρήση πολλαπλών κεραιών μπορεί να οδηγήσει σε σημαντική αύξηση της χωρητικότητας των ασύρματων συστημάτων. Προκειμένου να αξιοποιηθούν οι παραπάνω δυνατότητες, απαιτείται η σχεδίαση σύνθετων δεκτών MIMO. Προς αυτήν την κατεύθυνση, έχει προταθεί ένας μεγάλος αριθμός μεθόδων ισοστάθμισης του καναλιού. Ωστόσο, οι περισσότερες από αυτές υποθέτουν ότι το ασύρματο κανάλι είναι: 1) χρονικά σταθερό, 2) συχνοτικά επίπεδο (δεν εισάγει διασυμβολική παρεμβολή), και κυρίως 3) ότι είναι γνωστό στο δέκτη. Δεδομένου ότι σε ευρυζωνικά συστήματα μονής φέρουσας οι παραπάνω υποθέσεις είναι δύσκολο να ικανοποιηθούν, στραφήκαμε προς τις προσαρμοστικές μεθόδους ισοστάθμισης. Συγκεκριμένα, αναπτύξαμε τρεις βασικούς αλγορίθμους. Ο πρώτος αλγόριθμος αποτελεί έναν προσαρμοστικό ισοσταθμιστή ανάδρασης αποφάσεων (decision feedback equalizer, DFE) για συχνοτικά επίπεδα κανάλια ΜΙΜΟ. Ο προτεινόμενος MIMO DFE ακολουθεί την αρχιτεκτονική BLAST, και ανανεώνεται με βάση τον αλγόριθμο αναδρομικών ελαχίστων τετραγώνων (RLS) τετραγωνικής ρίζας. Ο ισοσταθμιστής μπορεί να παρακολουθήσει ένα χρονικά μεταβαλλόμενο κανάλι, και, από όσο γνωρίζουμε, έχει τη χαμηλότερη πολυπλοκότητα από όλους τους δέκτες BLAST που έχουν προταθεί έως σήμερα. Ο δεύτερος αλγόριθμος αποτελεί την επέκταση του προηγούμενου σε συχνοτικά επιλεκτικά κανάλια. Μέσω κατάλληλης μοντελοποίησης του προβλήματος ισοστάθμισης, οδηγηθήκαμε σε έναν αποδοτικό DFE για ευρυζωνικά κανάλια MIMO. Τότε, η διαδικασία της ισοστάθμισης εμφανίζει προβλήματα αριθμητικής ευστάθειας, που λόγω της υλοποίησης RLS τετραγωνικής ρίζας αντιμετωπίστηκαν επιτυχώς. Κινούμενοι προς την κατεύθυνση περαιτέρω μείωσης της πολυπλοκότητας, προτείναμε έναν προσαρμοστικό MIMO DFE που ανανεώνεται με βάση τον αλγόριθμο ελαχίστων μέσων τετραγώνων (LMS) υλοποιημένο εξ ολοκλήρου στο πεδίο της συχνότητας. Με χρήση του ταχύ μετασχηματισμού Fourier (FFT), μειώνεται η απαιτούμενη πολυπλοκότητα. Παράλληλα, η μετάβαση στο πεδίο των συχνοτήτων έχει ως αποτέλεσμα την προσεγγιστική διαγωνοποίηση του συστήματος, προσφέροντας ανεξάρτητη ανανέωση των φίλτρων ανά συχνοτική συνιστώσα και επιτάχυνση της σύγκλισης του αλγορίθμου. Ο προτεινόμενος ισοσταθμιστής πετυχαίνει μια καλή ανταλλαγή μεταξύ απόδοσης και πολυπλοκότητας. Παράλληλα με τα παραπάνω, ασχοληθήκαμε με την εκτίμηση του ασύρματου καναλιού σε ένα ασύγχρονο σύστημα CDMA. Το βασικό σενάριο είναι ότι ο σταθμός βάσης γνωρίζει ήδη τους ενεργούς χρήστες, και καλείται να εκτιμήσει τις παραμέτρους του καναλιού ανερχόμενης ζεύξης ενός νέου χρήστη που εισέρχεται στο σύστημα. Το πρόβλημα περιγράφεται από μια συνάρτηση ελαχίστων τετραγώνων, η οποία είναι γραμμική ως προς τα κέρδη του καναλιού, και μη γραμμική ως προς τις καθυστερήσεις του. Αποδείξαμε ότι το πρόβλημα έχει μια προσεγγιστικά διαχωρίσιμη μορφή, και προτείναμε μια επαναληπτική μέθοδο υπολογισμού των παραμέτρων. Ο προτεινόμενος αλγόριθμος δεν απαιτεί κάποια ειδική ακολουθία διάχυσης και λειτουργεί αποδοτικά ακόμη και για περιορισμένη ακολουθία εκπαίδευσης. Είναι εύρωστος στην παρεμβολή πολλαπλών χρηστών και περισσότερο ακριβής από μια υπάρχουσα μέθοδο εις βάρος μιας ασήμαντης αύξησης στην υπολογιστική πολυπλοκότητα. / Over the last decades, a dramatic progress in the products and services based on wireless communication networks has been observed, while, at the same time, new research challenges arise. The systems employing multiple antennas at the transmitter and the receiver, known as MIMO (multi-input multi-output) systems, as well as code division multiple access (CDMA) systems, are two of the main technologies employed for the evolution of wireless communications. During this PhD thesis, we worked on the design and analysis of signal processing algorithms for the two above systems, as it is described in detail next. Concerning the MIMO systems, the pioneering work performed at Bell Labs around 1996, where the BLAST (Bell Labs Layered Space-Time) architecture has been developed, proved that by using multiple antennas can lead to a significant increase in wireless systems capacity. To exploit this potential, sophisticated MIMO receivers should be designed. To this end, a large amount of channel equalizers has been proposed. However, most of these methods assume that the wireless channel is: 1) static, 2) frequency flat (no intersymbol interference is introduced), and mainly 3) it is perfectly known at the receiver. Provided that in high rate single carrier systems these assumptions are difficult to be met, we focused our attention on adaptive equalization methods. More specifically, three basic algorithms have been developed. The first algorithm is an adaptive decision feedback equalizer (DFE) for frequency flat MIMO channels. The proposed MIMO DFE implements the BLAST architecture, and it is updated by the recursive least squares (RLS) algorithm in its square root form. The new equalizer can track time varying channels, and, to the best of our knowledge, it has the lowest computational complexity among the BLAST receivers that have been proposed up to now. The second algorithm is an extension of the previous one to the frequency selective channel case. By proper modeling of the equalization problem, we arrived at an efficient DFE for wideband MIMO channels. In this case, the equalization process encounters numerical instability problems, which were successfully treated by the square root RLS implementation employed. To further reduce complexity, we proposed an adaptive MIMO DFE that is updated by the least mean square (LMS) algorithm, fully implemented in the frequency domain. By using the fast Fourier transform (FFT), the complexity required is considerably reduced. Moreover, the frequency domain implementation leads to an approximate decoupling of the equalization problem at each frequency bin. Thus, an independent update of the filters at each frequency bin allows for a faster convergence of the algorithm. The proposed equalizer offers a good performance - complexity tradeoff. Furthermore, we worked on channel estimation for an asynchronous CDMA system. The assumed scenario is that the base station has already acquired all the active users, while the uplink channel parameters of a new user entering the system should be estimated. The problem can be described via a least squares cost function, which is linear with respect to the channel gains, and non linear to its delays. We proved that the problem is approximately decoupled, and a new iterative parameter estimation method has been proposed. The suggested method does not require any specific pilot sequence and performs well even for a short training interval. It is robust to multiple access interference and more accurate compared to an existing method, at the expense of an insignificant increase in computational complexity.