<p>The Multiple-input and Multiple-output (MIMO) channel model is very useful for the presentation of a wide range of wireless communication systems. This thesis addresses the joint design of a precoder and a receiver for a MIMO channel model, in a scenario in which perfect channel state information (CSI) is available at both ends. We develop a novel framework for the transmitting-receiving procedure. Under the proposed framework, the receiver decomposes the channel matrix by using a block QR decomposition, where Q is a unitary matrix and R is a block upper triangular matrix. The optimal maximum likelihood (ML) detection process is employed within each diagonal block of R. Then, the detected block of symbols is substituted and subtracted sequentially according to the block QR decomposition based successive cancellation. On the transmitting end, the expression of probability of error based on ML detection is chosen as the design criterion to formulate the precoder design problem. This thesis presents a design of MIMO transceivers in the particular case of having 4 transmitting and 4 receiving antennas with full CSI knowledge on both sides. In addition, a closed-form expression for the optimal precoder matrix is obtained for channels satisfying certain conditions. For other channels not satisfying the specific condition, a numerical method is applied to obtain the optimal precoder matrix.</p> / Master of Applied Science (MASc)

The content of this dissertation is divided into two main topics: 1) nonlinear profile monitoring and 2) an improved approximate distribution for the T² statistic based on the successive differences covariance matrix estimator. Part 1: Nonlinear Profile Monitoring In an increasing number of cases the quality of a product or process cannot adequately be represented by the distribution of a univariate quality variable or the multivariate distribution of a vector of quality variables. Rather, a series of measurements are taken across some continuum, such as time or space, to create a profile. The profile determines the product quality at that sampling period. We propose Phase I methods to analyze profiles in a baseline dataset where the profiles can be modeled through either a parametric nonlinear regression function or a nonparametric regression function. We illustrate our methods using data from Walker and Wright (2002) and from dose-response data from DuPont Crop Protection. Part 2: Approximate Distribution of T² Although the T² statistic based on the successive differences estimator has been shown to be effective in detecting a shift in the mean vector (Sullivan and Woodall (1996) and Vargas (2003)), the exact distribution of this statistic is unknown. An accurate upper control limit (UCL) for the T² chart based on this statistic depends on knowing its distribution. Two approximate distributions have been proposed in the literature. We demonstrate the inadequacy of these two approximations and derive useful properties of this statistic. We give an improved approximate distribution and recommendations for its use. / Ph. D.

This dissertation focuses on quantifying the effects of multi-user co-channel interference for an avionic communication system operating in a heavy-traffic aeronautical mobile environment and proposes advanced interference cancellation techniques to mitigate the interference. The dissertation consists of two parts. The first part of the work investigates the use of a visualization method to quantify and characterize the multi-user co-channel interference (multiple access interference) effects impinging on an avionic communication system. The interference is caused by complex interactions of thousands of RF signals transmitted from thousands of aircraft; each attempts to access a common communication channel, which is governed by a specific channel contention access protocol. The visualization method transforms the co-channel interference, which is specified in terms of signal-overlaps (signal collisions), from a visual representation to a matrix representation for further statistical analysis. It is found that the statistical Poisson and its cumulative distribution provide the best estimates of multi-user co-channel interference. It is shown, using Monte Carlo simulation, that the co-channel interference of a victim aircraft operating in the heavy-traffic environment could result in as high as eight signal-overlaps. This constitutes to approximately 83.4% of success rate in signal detection for the entire three thousand aircraft environment using conventional FSK receiver. One key finding shows that high-quality communications, up to 98.5% success rate, is achievable if only three overlapping signals can be decoded successfully. The interference results found in the first part set the stage for interference cancellation research in the second part. The second part of the work proposes the use of advanced interference cancellation techniques, namely sequential interference cancellation (SIC) and parallel interference cancellation (PIC), as potential solutions to mitigating the interference effects. These techniques can be implemented in radio receivers to perform multi-signal decoding functionality to remove the required interferers (three overlapping signals) so that high-quality communication, as described in the first part, can be achieved. Various performance graphs are shown for B-FSK and B-PSK for both SIC and PIC techniques. One key finding is that the system performance can be improved substantially to an additional 15% in signal reception success rate by using SIC or PIC. This means that critical information transmitted from 450 aircraft (out of approximately three thousand aircraft in the environment) is preserved and successfully decoded. Multi-signal decoding using these interference cancellation receivers comes at a small penalty of 2 - 4.5 dBs in Eb/No when sufficient signal-to-interference (SIR) ratio (7-12 dB) is provided. / Ph. D.

The essays main intent is to examine whether there has been a proper implementation of the Council’s directive 1999/70/EG into Swedish law regarding the requirement for measures to prevent the abuse of successive fixed-term employment contracts. To achieve this purpose there is a need for an examination of current law. The essay also has some secondary purposes. One of these secondary purposes is the question of whether the implementation of the Council’s directive 1999/70/EG has lead to a reduction of the workers employment protection, which is closely connected to my main question and the violation case. My other secondary purposes are to make a connection between fixed-term employment and labor market flexibilization and flexicurity, to see if the rules about fixed-term work has affected gender equality, and to discuss whether there has been a shift of power in the relationship between employers and employees. I have come to the conclusion that Sweden has not implemented the Council’s directive 1999/70/EG properly regarding the requirement for measures to prevent abuse of successive fixed-term employments. I have found that the Swedish rules that apply today may be circumvented by combining various forms of fixed-term employments and that some forms of fixed-term employment requires a more clear definition. To prevent the abuse of successive fixed-term contracts, I suggest the introduction of a maximum total duration for all forms of fixed-term employment together, combined with a rule about the maximum number of times a fixed-term employment contract may be renewed. Furthermore I have found factors indicating that a reduction of workers employment protection level has taken place, but I can not draw any firm conclusions about it because the essay has not examined the issue in a completely thorough manner. I have also found a connection between labor market flexibilization and the use of fixed-term employment and that Sweden should examine whether the flexicurity-model can provide some useful solutions to increase employment without reducing workers employment protection level. Gender equality regarding the share of fixed-term employment contracts has slightly increased, both in Sweden and in the EU, since the origin of the Council’s directive 1999/70/EG. Also I have found that the new rules for fixed-term employment may have resulted in a shift of power that favors the employer. / Uppsatsen syftar främst till att undersöka huruvida det skett en korrekt implementering av visstidsdirektivet i svensk rätt avseende kravet på åtgärder för att förhindra missbruk av flera på varandra följande visstidsanställningar. För att uppnå detta syfte krävs en utredning av gällande rätt. Uppsatsen har också några underordnade syften. Ett av dessa underordnade syften är frågan om huruvida implementeringen av visstidsdirektivet inneburit en minskning av arbetstagarnas anställningsskydd, som är nära kopplat till min huvudsakliga fråga och överträdelseärendet. Mina andra underordnade syften är att koppla reglerna om tidsbegränsade anställningar till arbetsmarknadens flexibilisering och flexicurity, att se om reglerna om tidsbegränsade anställningar påverkat jämställdhet mellan könen och att diskutera huruvida det skett förändringar i maktförhållandet mellan arbetsgivare och arbetstagare. Jag har kommit fram till slutsatsen att Sverige inte har implementerat visstidsdirektivet på ett korrekt sätt avseende kravet på åtgärder för att förhindra missbruk av flera på varandra följande visstidsanställningar. Jag har konstaterat att de svenska reglerna som gäller idag kan kringgås genom att olika former av tidsbegränsade anställningar kombineras och att vissa av anställningsformerna kräver en tydligare definition. För att förhindra missbruk av flera på varandra följande visstidsanställningar föreslår jag att det införs en övre sammanlagd tidsgräns för alla tidsbegränsade anställningsformer kombinerat med en regel om maximalt antal gånger ett tidsbegränsat anställningsavtal får förnyas. Jag har funnit faktorer som visar på att en minskning av arbetstagarskyddet har skett, men jag kan inte dra några säkra slutsatser om det eftersom uppsatsen inte behandlat frågan på ett uttömmande sätt. Vidare har jag funnit ett samband mellan arbetsmarknadens flexibilisering och användandet av tidsbegränsade anställningar och att Sverige borde undersöka om flexicurity-modellen kan bidra med några lösningar för att öka sysselsättningen utan att minska nivån på arbetstagarnas anställningsskydd. Jämställdhet mellan könen rörande andelen tidsbegränsat anställda har ökat något, både i Sverige och EU, sedan visstidsdirektivets tillkomst. Jag har också kommit fram till att de nya reglerna om tidsbegränsade anställningar kan ha inneburit en maktförskjutning som gynnar arbetsgivaren.

Cette thèse se situe au carrefour de la combinatoire énumérative, algébrique et bijective. Elle se consacre d’une part à traduire des problèmes algébriques en des problèmes combinatoires, et inversement, utilise le formalisme algébrique pour traiter des questions combinatoires.Après un rappel des notions classiques de combinatoire et de structures algébriques, nous abordons l’étude des tableaux de dominos décalés, qui sont des objets combinatoires définis dans le but de mieux comprendre la combinatoire des fonctions symétriques P et Q de Schur. Nous donnons la définition de ces tableaux et nous démontrons qu'ils sont en bijection avec les paires de tableaux de Young décalés. Cette bijection nous permet de voir ces objets comme des éléments du super monoïde plaxique décalé, qui est l'analogue décalé du super monoïde plaxique de Carré et Leclerc. Nous montrons aussi que ces tableaux décrivent un produit de deux fonctions P de Schur et en prenant un autre type de tableaux de dominos décalés, nous décrivons un produit de deux fonctions Q de Schur. Nous proposons aussi deux algorithmes d'insertion pour les tableaux de dominos décalés, analogues aux algorithmes d'insertion mixte et d'insertion gauche-droit de Haiman. Toujours dans le domaine de la combinatoire bijective, nous nous intéressons dans la deuxième partie de notre travail à des bijections en lien avec des statistiques sur les permutations et les nombres eulériens.Dans cette deuxième partie de thèse, nous introduisons l'unimodalité des suites finies associées aux différentes directions dans le triangle eulérien. Nous donnons dans un premier temps une interprétation combinatoire ainsi que la relation de récurrence des suites associées à la direction (1,t) dans le triangle eulérien, où t≥1. Ces suites sont les coefficients de polynômes appelés les polynômes eulériens avec succession d'ordre t, qui généralisent les polynômes eulériens. Nous démontrons par une bijection entre les permutations et des chemins nord-est étiquetés que ces suites sont log-concaves et donc unimodales. Puis nous prouvons que les suites associées aux directions (r,q), où r est un entier positif et q est un entier, tel que r+q≥0, sont aussi log-concaves et donc unimodales / This thesis is at the crossroads of enumerative, algebraic and bijective combinatorics. It studies some algebraic problems from a combinatorial point of view, and conversely, uses algebraic formalism to deal with combinatorial questions.After a reminder about classical notions of combinatoics and algebraic structures, We introduce new combinatorial objects called the shifted domino tableaux, these objects can be seen as a shifted analog of domino tableaux or as an extension of shifted Young tableaux. We prove that these objects are in bijection with pairs of shifted Young tableaux. This bijection shows that shifted domino tableaux can be seen as elements of the super shifted plactic monoid, which is the shifted analog of the super plactic monoid. We also show that the sum over all shifted domino tableaux of a fixed shape describe a product of two P-Schur functions, and by taking a different kind of shifted domino tableaux we describe a product of two Q-Schur functions. We also propose two insertion algorithms for shifted domino tablaux, analogous to Haiman's left-right and mixed insertion algorithms. Still in the field of bijective combinatorics, we are interested in the second part of our work with bijections related to statistics on permutations and Eulerian numbers.In this second part of this thesis, we introduce the unimodality of finite sequences associated to different directions in the Eulerian triangle. We first give a combinatorial interpretations as well as recurrence relations of sequences associated with the direction (1, t) in the Eulerian triangle, where t≥1. These sequences are the coefficients of polynomials called the t-successive eulerian polynomials, which generalize the eulerian polynomials. We prove using a bijection between premutations and north-east lattice paths that those sequences are unomodal. Then we prove that the sequences associated with the directions (r, q), where r is a positive integer and q is an integer such that r + q ≥ 0, are also log-concave and therefore unimodal

A metodologia de superfície de resposta foi utilizada para otimizar as condições e obter maiores produção de etanol e viabilidade para a linhagem de S. cerevisiae 63M em processo descontínuo, resultando nas condições: 200 g.L-1 de sacarose, 40 g.L-1 de inóculo a 30 °C. Diferentes tipos de processos foram comparados e o processo que apresentou maiores viabilidade, produtividade e rendimento foi o descontínuo alimentado por pulsos de volumes decrescentes de sacarose a 30 °C. A redução da concentração de sacarose foi uma estratégia que permitiu aumentar a temperatura até 37 °C sem perdas em viabilidades. Uma linhagem utilizada nas destilarias brasileiras foi comparada com a linhagem 63M em temperaturas elevadas e observou-se que a 63M produziu maior produtividade e rendimento. Oito ciclos sucessivos de fermentação com reutilização de células da linhagem 63M foram realizados em meio sintético em processo descontínuo alimentado por pulsos de sacarose a 37 °C e uma perda gradual de viabilidade foi observada, mas o etanol final permaneceu constante nos oitos ciclos. / Surface response methodology was used to optimize the conditions and to obtain higher ethanol production and viability to strain 63M of S. cerevisiae in batch culture, resulting in the conditions: 200 g.L-1 sucrose, 40 g.L-1 inoculum at 30 °C. Different types of processes were compared and the process that presented higher viability, productivity and yield was pulse fed-batch using five decreasing pulses of sucrose at 30 °C. The reduction of the sucrose concentration was a strategy that allowed increasing the temperature up to 37 °C without losses in viabilities. An industrial strain used in Brazilian distilleries was compared with strain 63M at high temperatures and it was observed that strain 63M produced higher productivity and yield. Eight successive cycles of fermentation with reuse of cells of strain 63M were carried out in synthetic medium in fed-batch process using sucrose pulses at 37 °C and a gradual loss of viability was observed, but the final ethanol was kept constant in the eight fermentation cycles.

À l’horizon 2024, l’expérience ATLAS prévoit de fonctionner à des luminosités 10 fois supérieures à la configuration actuelle. Par conséquent, l’électronique actuelle de lecture ne correspondra pas aux conditions de ces luminosités. Dans ces conditions, une nouvelle électronique devra être conçue. Cette mise à niveau est rendue nécessaire aussi par les dommages causés par les radiations et le vieillissement. Une nouvelle carte frontale va être intégrée dans l’électronique de lecture du calorimètre LAr. Un élément essentiel de cette carte est le Convertisseur Analogique-Numérique (CAN) présentant une résolution de 12bits pour une fréquence d’échantillonnage de 40MS/s, ainsi qu’une résistance aux irradiations. Compte tenu du grand nombre des voies, ce CAN doit remplir des critères sévères sur la consommation et la surface. Le but de cette thèse est de concevoir un CAN innovant qui peut répondre à ces spécifications. Une architecture à approximations successives (SAR) a été choisie pour concevoir notre CAN. Cette architecture bénéficie d’une basse consommation de puissance et d’une grande compatibilité avec les nouvelles technologies CMOS. Cependant, le SAR souffre de certaines limitations liées principalement aux erreurs de décisions et aux erreurs d’appariement des capacités du CNA. Deux prototypes de CAN-SAR 12bits ont été modélisés en Matlab afin d’évaluer leur robustesse. Ensuite les conceptions ont été réalisées dans une technologie CMOS 130nm d’IBM validée par la collaboration ATLAS pour sa tenue aux irradiations. Les deux prototypes intègrent un algorithme d’approximations avec redondance en 14 étapes de conversion, qui permet de tolérer des marges d’erreurs de décisions et d’ajouter une calibration numérique des effets des erreurs d’appariement des capacités. La partie logique de nos CAN est très simplifiée pour minimiser les retards de génération des commandes et la consommation d’énergie. Cette logique exécute un algorithme monotone de commutation des capacités du CNA permettant une économie de 70% de la consommation dynamique par rapport à un algorithme de commutation classique. Grâce à cet algorithme, une réduction de capacité totale est aussi obtenue : 50% en comparant notre premier prototype à un seul segment avec une architecture classique. Pour accentuer encore plus le gain en termes de surface et de consommation, un second prototype a été réalisé en introduisant un CNA à deux segments. Cela a abouti à un gain supplémentaire d’un facteur 7,64 sur la surface occupée, un facteur de 12 en termes de capacité totale, et un facteur de 1,58 en termes de consommation. Les deux CAN consomment respectivement une puissance de ~10,3mW et ~6,5mW, et ils occupent respectivement une surface de ~2,63mm2 et ~0,344mm2.Afin d’améliorer leurs performances, un algorithme de correction numérique des erreurs d’appariement des capacités a été utilisé. Des buffers de tensions de référence ont étés conçus spécialement pour permettre la charge/décharge des capacités du convertisseur en hautes fréquences et avec une grande précision. En simulations électriques, les deux prototypes atteignent un ENOB supérieur à 11bits tout en fonctionnant à la vitesse de 40MS/s. Leurs erreurs d’INL simulés sont respectivement +1,14/-1,1LSB et +1,66/-1,72LSB.Les résultats de tests préliminaires du premier prototype présentent des performances similaires à celles d’un CAN commercial de référence sur notre carte de tests. Après la correction, ce prototype atteint un ENOB de 10,5bits et un INL de +1/-2,18LSB. Cependant suite à une panne de carte de tests, les résultats de mesures du deuxième prototype sont moins précis. Dans ces circonstances, ce dernier atteint un ENOB de 9,77bits et un INL de +7,61/-1,26LSB. En outre la carte de tests actuelle limite la vitesse de fonctionnement à ~9MS/s. Pour cela une autre carte améliorée a été conçue afin d’atteindre un meilleur ENOB, et la vitesse souhaitée. Les nouvelles mesures vont être publiées dans le futur. / By 2024, the ATLAS experiment plan to operate at luminosities 10 times the current configuration. Therefore, many readout electronics must be upgraded. This upgrade is rendered necessary also by the damage caused by years of total radiations’ effect and devices aging. A new Front-End Board (FEB) will be designed for the LAr calorimeter readout electronics. A key device of this board is a radiation hard Analog-to-Digital Converter (ADC) featuring a resolution of 12bits at 40MS/s sampling rate. Following the large number of readout channels, this ADC device must display low power consumption and also a low area to easy a multichannel design.The goal of this thesis is to design an innovative ADC that can deal with these specifications. A Successive Approximation architecture (SAR) has been selected to design our ADC. This architecture has a low power consumption and many recent works has shown his high compatibility with modern CMOS scaling technologies. However, the SAR has some limitations related to decision errors and mismatches in capacitors array.Using Matlab software, we have created the models for two prototypes of 12bits SAR-ADC which are then used to study carefully their limitations, to evaluate their robustness and how it could be improved in digital domain.Then the designs were made in an IBM 130nm CMOS technology that was validated by the ATLAS collaboration for its radiation hardness. The prototypes use a redundant search algorithm with 14 conversion steps allowing some margins with comparator’s decision errors and opening the way to a digital calibration to compensate the capacitors mismatching effects. The digital part of our ADCs is very simplified to reduce the commands generation delays and saving some dynamic power consumption. This logic follows a monotonic switching algorithm which saves about70% of dynamic power consumption compared to the conventional switching algorithm. Using this algorithm, 50% of the total capacitance reduction is achieved when one compare our first prototype using a one segment capacitive DAC with a classic SAR architecture. To boost even more our results in terms of area and consumption, a second prototype was made by introducing a two segments DAC array. This resulted in many additional benefits: Compared to the first prototype, the area used is reduced in a ratio of 7,6, the total equivalent capacitance is divided by a factor 12, and finally the power consumption in improved by a factor 1,58. The ADCs respectively consume a power of ~10,3mW and ~6,5mW, and they respectively occupy an area of ~2,63mm2 and ~0,344mm2.A foreground digital calibration algorithm has been used to compensate the capacitors mismatching effects. A high frequency open loop reference voltages buffers have been designed to allow the high speed and high accuracy charge/discharge of the DAC capacitors array.Following electrical simulations, both prototypes reach an ENOB better than 11bits while operating at the speed of 40MS/s. The INL from the simulations were respectively +1.14/-1.1LSB and +1.66/-1.72LSB.The preliminary testing results of the first prototype are very close to that of a commercial 12bits ADC on our testing board. After calibration, we measured an ENOB of 10,5bits and an INL of +1/-2,18LSB. However, due to a testing board failure, the testing results of the second prototype are less accurate. In these circumstances, the latter reached an ENOB of 9,77bits and an INL of +7,61/-1,26LSB. Furthermore the current testing board limits the operating speed to ~9MS/s. Another improved board was designed to achieve a better ENOB at the targeted 40MS/s speed. The new testing results will be published in the future.

Cette thèse s'inscrit dans le cadre des systèmes radiocommunications numériques pour des récepteurs mobiles basés sur la modulation multi-porteuse OFDM. L'objectif est de proposer des algorithmes d'estimation de canal et de suppression d'IEP pour les <br />récepteurs OFDM à grande mobilité en liaison descendante. Notre démarche est d'estimer les paramètres de propagation du canal physique tels que les retards et les variations temporelles des gains complexes du canal à trajet multiples, au lieu du canal discret équivalent. Nous avons développé une approximation à base de polynôme pour l'évolution des gains complexes d'un canal multi-trajet de type Rayleigh avec un spectre de Jakes. En se basant sur cette modélisation polynomiale, nous avons présenté une étude théorique sur les Bornes de Cramér-Rao Bayésiennes (BCRBs) pour l'estimation des gains complexes du canal, en supposant les délais des trajets connus. Enfin, nous avons développé et analysé trois algorithmes itératifs d'estimation des variations temporelles des gains complexes (à l'intérieur d'un symbole OFDM) et de suppression d'IEP pour des récepteurs à grande mobilité. Les deux premiers sont basés sur l'interpolation (passe-bas ou polynomiale) des valeurs moyennes estimées et sur un égaliseur SSI. Ils ont montré de bonnes performances pour des récepteurs à vitesses modérées (i.e., fd.T <= 0.1). Le troisième algorithme est basé sur une modélisation AR et un filtre de Kalman pour estimer les coefficients polynomiaux des gains complexes, et sur un égaliseur QR. Il a fait preuve de bonnes performances pour des récepteurs à vitesses très élevées (i.e. , fd.T> 0.1).

La Tesis Doctoral está dedicada al estudio de ciertas propiedades de los radios sucesivos de los cuerpos convexos (funcionales definidos a partir de circunradios e inradios de proyecciones o secciones del cuerpo). Comenzamos estableciendo las nociones básicas necesarias para el desarrollo de los contenidos. A continuación calculamos los radios sucesivos de familias particulares de conjuntos (p-bolas, anchura constante, cuerpos tangenciales), y estudiamos la conexión existente entre estos funcionales y los números de Gelfand y Kolmogorov. En el tercer capítulo consideramos el problema de Pukhov-Perel'man sobre la mejor cota superior para un cierto cociente de radios, determinando desigualdades para problemas de este tipo que van a permitir mejorar los resultados existentes en ciertos casos. Finalmente, estudiamos cómo se relacionan los radios sucesivos de la suma de Minkowski (Firey) de dos cuerpos convexos con los correspondientes funcionales de los conjuntos, obteniendo los resultados óptimos en todos los casos. / The Doctoral Thesis is focused in the study of some properties of the successive radii of convex bodies (functionals defined by means of circumradii and inradii of projections or sections of the set). We start establishing the basic notions that will be needed further on. Next, we compute the successive radii of particular families of sets (p-balls, constant width sets and tangential bodies), and study the connection between these functionals and the Gelfand and Kolmogorov numbers. In the third chapter we consider the Pukhov-Perel'man problem on the best upper bound for a particular ratio of radii, determining inequalities for some problems of this type which will allow to improve the known results in particular cases. Finally we study how the successive radii of the (Firey)-Minkowski addition of two convex bodies are related with the corresponding functionals of the sets, obtaining the optimal results in all cases.

Τα ασύρματα συστήματα πολλαπλών κεραιών MIMO αποτελούν ένα από τα βασικά μέτωπα ανάπτυξης των τηλεπικοινωνιών. Ωστόσο η εξαιρετικά τυχαία φύση τους καθώς και η αλληλεπίδραση μεταξύ των πολλαπλών ροών δεδομένων επιβάλει την χρήση σύγχρονων τεχνικών ισοστάθμισης. Η προσαρμοστική ισοστάθμιση στο δέκτη ενός τηλεπικοινωνιακού συστήματος χρησιμοποιείται για την αντιμετώπιση της δυναμικής φύσης του ασύρματου καναλιού και την ανίχνευση των αλλαγών στα χαρακτηριστικά του. Επίσης, μη γραμμικές τεχνικές ισοστάθμισης ανατροφοδότησης συμβόλων είναι απαραίτητες για την απομάκρυνση της διασυμβολικής παρεμβολής που παρουσιάζεται στα συγκεκριμένα συστήματα. Η παρούσα εργασία ασχολείται με μεθόδους προσαρμοστικής ισοστάθμισης στο δέκτη ενός τηλεπικοινωνιακού συστήματος. Διακρίνουμε τις εξής περιπτώσεις προσαρμοστικών αλγορίθμων για την ελαχιστοποίηση του σφάλματος, του αλγορίθμου Αναδρομικών Ελαχίστων Τετραγώνων (RLS), του επαναληπτικού αλγορίθμου Συζυγών Κλίσεων (CG) και του επαναληπτικού αλγορίθμου τροποποιημένων Συζυγών Κλίσεων (MCG). Όπως διαπιστώνουμε, όταν οι παραπάνω αλγόριθμοι χρησιμοποιηθούν με γραμμικές τεχνικές ισοστάθμισης έχουμε πολύ αργή σύγκλιση και γενικά υψηλό όριο σφάλματος. Συμπεραίνουμε λοιπόν ότι, προκειμένου να έχουμε γρήγορη σύγκλιση των προσαρμοστικών αλγορίθμων και αντιμετώπιση της διασυμβολικής παρεμβολής για τα συστήματα MIMO, είναι απαραίτητη η χρήση μη γραμμικών τεχνικών ισοστάθμισης. Αρχικά χρησιμοποιούμε την μέθοδο της γενικευμένης ανατροφοδότησης συμβόλων GDFE ενώ στη συνέχεια μελετάμε μία σύγχρονη τεχνική ανατροφοδότησης συμβόλων που χρησιμοποιεί ένα κριτήριο διάταξης για την ακύρωση των συμβόλων (OSIC ή V-BLAST). Όπως διαπιστώνεται και από τις εξομοιώσεις η συγκεκριμένη τεχνική επιτυγχάνει το χαμηλότερο όριο σφάλματος, αλλά με αυξημένο υπολογιστικό κόστος. Επίσης, διαπιστώνουμε ότι η εφαρμογή της τεχνικής αυτής με χρήση του τροποποιημένου αλγορίθμου Συζυγών Κλίσεων δεν είναι εφικτή. Στα πλαίσια αυτής της εργασίας, περιγράφουμε μια συγκεκριμένη υλοποίηση της τεχνικής διατεταγμένης ακύρωσης που κάνει χρήση του αλγορίθμου Αναδρομικών Ελαχίστων Τετραγώνων με μειωμένη πολυπλοκότητα. Στη συνέχεια γενικεύουμε την εφαρμογή της για την περίπτωση των αλγορίθμων Συζυγών Κλίσεων, και διαπιστώνουμε ότι ο τροποποιημένος αλγόριθμος Συζυγών Κλίσεων δεν μπορεί να χρησιμοποιηθεί ούτε σε αυτήν την περίπτωση. Για την υλοποίηση ενός συστήματος OSIC με χρήση του αλγορίθμου Συζυγών Κλίσεων είναι απαραίτητη η χρήση ενός αλγορίθμου που δεν έχει χρονική εξάρτηση σύγκλισης, όπως είναι ο βασικός αλγόριθμος Συζυγών Κλίσεων. / Wireless systems with multiple antenna configurations has recently emerged as one of the most significant technical breaktroughs in modern communications. However, because of the extremly random nature of the wireless channels, we have to use modern equalization methods in order to defeat the signal degradation. Adaptive equalization at the receiver of the telecommunication system can be used to compete this dynamic nature of the wireless channel and track the changes of its characteristics. Furthermore, nonlinear decision feedback methods are nessesary for the cancellation of the intersymbol interference which occurs with these systems. This work involves with adaptive equalization methods at the receiver of the telecommunication system. We use the following adaptive algorithms so as to minimize the error : the Recursive Least Squares algorithm (RLS), the iterative Conjugate Gradient algorithm (CG) and the iterative Modified Conjugate Gradient algorithm (MCG). When these algorithms are used with linear methods, they give very slow converge and high final error. So, it is neccessary to use nonlinear equalization methods in order to succeed fast converge rate and deal with the increazed intersymbol interference for MIMO systems. Firstly we use the generalized decision feedback method (GDFE), and then the modern method of ordered successive cancellation method (OSIC or V-BLAST). Based on the emulations we conclude that the last method succeed the lower error, but with high computational cost. Furthermore, we can't use OSIC method with Modified Conjugate Gradient algorithm. In this work, we describe a specific implementation of the OSIC method which uses RLS algorithm with low computational complexity. So we generalize its usage with the Conjugate Gradient algorithms. Finaly, we conclude that we can't also use MCG with OSIC method with low computational complexity. In order to construct an OSIC system based on Conjugate Gradient algorithm, the algorithm must not operate on time basis, like basic Conjugate Gradient algorithm does.