39 research outputs found

    Multi-user MIMO wireless communications

    Get PDF
    Mehrantennensysteme sind auf Grund der erhöhten Bandbreiteneffizienz und Leistung eine Schlüsselkomponente von Mobilfunksystemen der Zukunft. Diese ermöglichen das gleichzeitige Senden von mehreren, räumlich getrennten Datenströmen zu verschiedenen Nutzern. Die zentrale Fragestellung in der Praxis ist, ob der ursprünglich vorausgesagte Kapazitätsgewinn in realistischen Szenarios erreicht wird und welche spezifischen Gewinne durch zusätzliche Antennen und das Ausnutzen von Kanalkenntnis am Sender und Empfänger erzielt werden, was andererseits einen Zuwachs an Overhead oder nötiger Rechenleistung bedeutet. In dieser Arbeit werden neue lineare und nicht-lineare MU-MIMO Precoding- Verfahren vorgestellt. Der verfolgte Ansatz zur Bestimmung der Precoding- Matrizen ist allgemein anwendbar und die entstandenen Algorithmen können zur Optimierung von verschiedenen Kriterien mit beliebig vielen Antennen an der Mobilstation eingesetzt werden. Das wurde durch die Berechnung der Precoding- Matrix in zwei Schritten erreicht. Im ersten Schritt wird die Überschneidung der Zeilenräume minimiert, die durch die effektiven Kanalmatrizen verschiedener Nutzer aufgespannt werden. Basierend auf mehreren parallelen Einzelnutzer-MIMO- Kanälen wird im zweiten Schritt die Systemperformanz bezüglich bestimmter Kriterien optimiert. Aus der gängigen Literatur ist bereits bekannt, dass für Nutzer mit nur einer Antenne das MMSE Kriterium beim precoding optimal aber nicht bei Nutzern mit mehreren Antennen. Deshalb werden in dieser Arbeit zwei neue Mehrnutzer MIMO Strategien vorgestellt, die vom MSE Kriterium abgeleitet sind, nämlich sukzessives MMSE und RBD. Bei der sukzessiven Verarbeitung mit einer entsprechenden Anpassung der Sendeleistungsverteilung kann die volle Diversität des Systems ausgeschöpft werden. Die Kapazität nähert sich dabei der maximalen Summenrate des Systems an. Bei gemeinsamer Verarbeitung der MIMO Kanäle wird unabhängig vom Grad der Mehrnutzerinterferenz die maximale Diversität erreicht. Die genannten Techniken setzen entweder eine aktuelle oder eine über einen längeren Zeitraum gemittelte Kanalkenntnis voraus. Aus diesem Grund müssen die Auswirkungen von Kanal-Schätzfehlern und Einflüsse des Transceiver Front-Ends auf die Verfahren näher untersucht werden. Für eine weitergehende Abschätzung der Mehrantennensysteme muss die Performanz des Gesamtsystems untersucht werden, da viele Einflüsse auf die räumliche Signalverarbeitung bei Betrachtung eines einzelnen Links nicht erkennbar sind. Es wurde gezeigt, dass mit MIMO Precoding Strategien ein Vielfaches der Datenrate eines Systems mit nur einer Antenne erzielt werden kann, während der Overhead durch Pilotsymbole und Steuersignale nur geringfügig zunimmt.Multiple-input, multiple-output (MIMO) systems are a key component of future wireless communication systems, because of their promising improvement in terms of performance and bandwidth efficiency. An important research topic is the study of multi-user (MU) MIMO systems. Such systems have the potential to combine the high throughput achievable with MIMO processing with the benefits of space division multiple access (SDMA). The main question from a practical standpoint is whether the initially predicted capacity gains can be obtained in more realistic scenarios and what specific gains result from adding more antennas and overhead or computational power to obtain channel state information (CSI) at the transceivers. In this thesis we introduce new linear and non-linear MU MIMO processing techniques. The approach used for the design of the precoding matrix is general and the resulting algorithms can address several optimization criteria with an arbitrary number of antennas at the user terminals (UTs). This is achieved by designing the precoding matrices in two steps. In the first step we minimize the overlap of the row spaces spanned by the effective channel matrices of different users. In the next step, we optimize the system performance with respect to the specific optimization criterion assuming a set of parallel single-user MIMO channels. As it was previously reported in the literature, minimum mean-squared-error (MMSE) processing is optimum for single-antenna UTs. However, MMSE suffers from a performance loss when users are equipped with more than one antenna. The two MU MIMO processing techniques that result from the two different MSE criteria that are proposed in this thesis are successive MMSE and regularized block diagonalization. By iterating the closed form solution with appropriate power loading we are able to extract the full diversity in the system and empirically approach the maximum sum-rate capacity in case of high multi-user interference. Joint processing of MIMO channels yields maximum diversity regardless of the level of multi-user interference. As these techniques rely on the fact that there is either instantaneous or long- term CSI available at the base station to perform precoding and decoding, it was very important to investigate the influence of the transceiver front-end imperfections and channel estimation errors on their performance. For a comprehensive assessment of multi-antenna techniques, it is mandatory to consider the performance at system level, since many effects of spatial processing are not tractable at the link level. System level investigations have shown that MU MIMO precoding techniques provide several times higher data rates than single-input single-output systems with only slightly increased pilot and control overhead

    Multi-user MIMO wireless communications

    Get PDF

    Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems

    Get PDF
    Nach einer Einleitung behandelt Teil 2 Mehrbenutzer-Scheduling für die Abwärtsstrecke von drahtlosen MIMO Systemen mit einer Sendestation und kanaladaptivem precoding: In jeder Zeit- oder Frequenzressource kann eine andere Nutzergruppe gleichzeitig bedient werden, räumlich getrennt durch unterschiedliche Antennengewichte. Nutzer mit korrelierten Kanälen sollten nicht gleichzeitig bedient werden, da dies die räumliche Trennbarkeit erschwert. Die Summenrate einer Nutzermenge hängt von den Antennengewichten ab, die wiederum von der Nutzerauswahl abhängen. Zur Entkopplung des Problems schlägt diese Arbeit Metriken vor basierend auf einer geschätzten Rate mit ZF precoding. Diese lässt sich mit Hilfe von wiederholten orthogonalen Projektionen abschätzen, wodurch die Berechnung von Antennengewichten beim Scheduling entfällt. Die Ratenschätzung kann basierend auf momentanen Kanalmessungen oder auf gemittelter Kanalkenntnis berechnet werden und es können Datenraten- und Fairness-Kriterien berücksichtig werden. Effiziente Suchalgorithmen werden vorgestellt, die die gesamte Systembandbreite auf einmal bearbeiten können und zur Komplexitätsreduktion die Lösung in Zeit- und Frequenz nachführen können. Teil 3 zeigt wie mehrere Sendestationen koordiniertes Scheduling und kooperative Signalverarbeitung einsetzen können. Mittels orthogonalen Projektionen ist es möglich, Inter-Site Interferenz zu schätzen, ohne Antennengewichte berechnen zu müssen. Durch ein Konzept virtueller Nutzer kann der obige Scheduling-Ansatz auf mehrere Sendestationen und sogar Relays mit SDMA erweitert werden. Auf den benötigten Signalisierungsaufwand wird kurz eingegangen und eine Methode zur Schätzung der Summenrate eines Systems ohne Koordination besprochen. Teil4 entwickelt Optimierungen für Turbo Entzerrer. Diese Nutzen Signalkorrelation als Quelle von Redundanz. Trotzdem kann eine Kombination mit MIMO precoding sinnvoll sein, da bei Annahme realistischer Fehler in der Kanalkenntnis am Sender keine optimale Interferenzunterdrückung möglich ist. Mit Hilfe von EXIT Charts wird eine neuartige Methode zur adaptiven Nutzung von a-priori-Information zwischen Iterationen entwickelt, die die Konvergenz verbessert. Dabei wird gezeigt, wie man semi-blinde Kanalschätzung im EXIT chart berücksichtigen kann. In Computersimulationen werden alle Verfahren basierend auf 4G-Systemparametern überprüft.After an introduction, part 2 of this thesis deals with downlink multi-user scheduling for wireless MIMO systems with one transmitting station performing channel adaptive precoding:Different user subsets can be served in each time or frequency resource by separating them in space with different antenna weight vectors. Users with correlated channel matrices should not be served jointly since correlation impairs the spatial separability.The resulting sum rate for each user subset depends on the precoding weights, which in turn depend on the user subset. This thesis manages to decouple this problem by proposing a scheduling metric based on the rate with ZF precoding such as BD, written with the help of orthogonal projection matrices. It allows estimating rates without computing any antenna weights by using a repeated projection approximation.This rate estimate allows considering user rate requirements and fairness criteria and can work with either instantaneous or long term averaged channel knowledge.Search algorithms are presented to efficiently solve user grouping or selection problems jointly for the entire system bandwidth while being able to track the solution in time and frequency for complexity reduction. Part 3 shows how multiple transmitting stations can benefit from cooperative scheduling or joint signal processing. An orthogonal projection based estimate of the inter-site interference power, again without computing any antenna weights, and a virtual user concept extends the scheduling approach to cooperative base stations and finally included SDMA half-duplex relays in the scheduling.Signalling overhead is discussed and a method to estimate the sum rate without coordination. Part 4 presents optimizations for Turbo Equalizers. There, correlation between user signals can be exploited as a source of redundancy. Nevertheless a combination with transmit precoding which aims at reducing correlation can be beneficial when the channel knowledge at the transmitter contains a realistic error, leading to increased correlation. A novel method for adaptive re-use of a-priori information between is developed to increase convergence by tracking the iterations online with EXIT charts.A method is proposed to model semi-blind channel estimation updates in an EXIT chart. Computer simulations with 4G system parameters illustrate the methods using realistic channel models.Im Buchhandel erhältlich: Advances in Multi-User Scheduling and Turbo Equalization for Wireless MIMO Systems / Fuchs-Lautensack,Martin Ilmenau: ISLE, 2009,116 S. ISBN 978-3-938843-43-

    Multi-user visible light communications: State-of-the-art and future directions

    Get PDF
    Visible light communications (VLC) builds upon the dual use of existing lighting infrastructure for wireless data transmission. VLC has recently gained interest as cost-effective, secure, and energy-efficient wireless access technology particularly for indoor user-dense environments. While initial studies in this area are mainly limited to single-user point-to-point links, more recent efforts have focused on multi-user VLC systems in an effort to transform VLC into a scalable and fully networked wireless technology. In this paper, we provide a comprehensive overview of multi-user VLC systems discussing the recent advances on multi-user precoding, multiple access, resource allocation, and mobility management. We further provide possible directions for future research in this emerging topic.King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia ; TÜBİTAKPublisher versio

    Li-Fi technology-based long-range FSO data transmit system evaluation

    Get PDF
    Visible light is used by a technology known as Light Fidelity to establish wireless internet connections very quickly. This article offers line-of-sight communication between the transmitter and receiver using LED technology. Li-Fi technology is a method that transmits data using LED light, which is faster and more efficient than Wi-Fi. Since it is practically ubiquitous, light can be used for communication as well. A cutting-edge technology called optical communication includes a subset called Li-Fi. By sending out visible light, the Li-Fi device enables wireless intranet communication. An in-depth study and analysis of Li-Fi, a novel technology that transmits data at high speeds over a wide spectrum by using light as a medium of transmission

    Design and implimentationof Multi-user MIMO precoding algorithms

    Get PDF
    The demand for high-speed communications required by cutting-edge applications has put a strain on the already saturated wireless spectrum. The incorporation of antenna arrays at both ends of the communication link has provided improved spectral efficiency and link reliability to the inherently complex wireless environment, thus allowing for the thriving of high data-rate applications without the cost of extra bandwidth consumption. As a consequence to this, multiple-input multiple-output (MIMO) systems have become the key technology for wideband communication standards both in single-user and multi-user setups. The main difficulty in single-user MIMO systems stems from the signal detection stage at the receiver, whereas multi-user downlink systems struggle with the challenge of enabling non-cooperative signal acquisition at the user terminals. In this respect, precoding techniques perform a pre-equalization stage at the base station so that the signal at each receiver can be interpreted independently and without the knowledge of the overall channel state. Vector precoding (VP) has been recently proposed for non-cooperative signal acquisition in the multi-user broadcast channel. The performance advantage with respect to the more straightforward linear precoding algorithms is the result of an added perturbation vector which enhances the properties of the precoded signal. Nevertheless, the computation of the perturbation signal entails a search for the closest point in an in nite lattice, which is known to be in the class of non-deterministic polynomial-time hard (NP-hard) problems. This thesis addresses the difficulties that stem from the perturbation process in VP systems from both theoretical and practical perspectives. On one hand, the asymptotic performance of VP is analyzed assuming optimal decoding. Since the perturbation process hinders the analytical assessment of the VP performance, lower and upper bounds on the expected data rate are reviewed and proposed. Based on these bounds, VP is compared to linear precoding with respect to the performance after a weighted sum rate optimization, the power resulting from a quality of service (QoS) formulation, and the performance when balancing the user rates. On the other hand, the intricacies of performing an efficient computation of the perturbation vector are analyzed. This study is focused on tree-search techniques that, by means of an strategic node pruning policy, reduce the complexity derived from an exhaustive search and yield a close-to-optimum performance. To that respect, three tree-search algorithms are proposed. The xed-sphere encoder (FSE) features a constant data path and a non-iterative architecture that enable the parallel processing of the set of vector hypotheses and thus, allow for high-data processing rates. The sequential best-node expansion (SBE) algorithm applies a distance control policy to reduce the amount of metric computations performed during the tree traversal. Finally, the low-complexity SBE (LC-SBE) aims at reducing the complexity and latency of the aforementioned algorithm by combining an approximate distance computation model and a novel approach of variable run-time constraints. Furthermore, the hardware implementation of non-recursive tree-search algorithms for the precoding scenario is also addressed in this thesis. More specifically, the hardware architecture design and resource occupation of the FSE and K-Best xed-complexity treesearch techniques are presented. The determination of the ordered sequence of complexvalued nodes, also known as the Schnorr-Euchner enumeration, is required in order to select the nodes to be evaluated during the tree traversal. With the aim of minimizing the hardware resource demand of such a computationally-expensive task, a novel non-sequential and lowcomplexity enumeration algorithm is presented, which enables the independent selection of the nodes within the ordered sequence. The incorporation of the proposed enumeration technique along with a fully-pipelined architecture of the FSE and K-Best approaches, allow for data processing throughputs of up to 5 Gbps in a 4x4 antenna setup.Aplikazio abangoardistek beharrezko duten abiadura handiko komunikazioen eskaerak presio handia ezarri du dagoeneko saturatuta dagoen haririk gabeko espektruan. Komunikazio loturaren bi muturretan antena array-en erabilerak eraginkortasun espektral eta dagarritasun handiagoez hornitu du berez konplexua den haririk gabeko ingurunea, modu honetan banda zabalera gehigarririk gabeko abiadura handiko aplikazioen garapena ahalbidetuz. Honen ondorioz, multiple-input multiple output (MIMO) sistemak banda zabaleko komunikazio estandarren funtsezko teknologia bihurtu dira, erabiltzaile bakarreko ezarpenetan hala nola erabiltzaile anitzeko inguruneetan. Erabiltzaile bakarreko MIMO sistemen zailtasun garrantzitsuena hartzailean ematen den seinalearen detekzio fasean datza. Erabiltzaile anitzeko sistemetan, aldiz, erronka nagusiena datu jasotze ez kooperatiboa bermatzea da. Prekodi kazio teknikek hartzaile bakoitzaren seinalea kanalaren egoera orokorraren ezagutzarik gabe eta modu independiente baten interpretatzea ahalbidetzen dute estazio nagusian seinalearen pre-ekualizazio fase bat inposatuz. Azken aldian, prekodi kazio bektoriala (VP, ingelesez vector precoding) proposatu da erabiltzaile anitzeko igorpen kanalean seinalearen eskuratze ez kooperatiboa ahalbidetzeko. Perturbazio seinale baten erabilerak, prekodi katutako seinalearen ezaugarriak hobetzeaz gain, errendimenduaren hobekuntza nabarmen bat lortzen du prekodi kazio linearreko teknikekiko. Hala ere, perturbazio seinalearen kalkuluak sare in nitu baten puntu hurbilenaren bilaketa suposatzen du. Problema honen ebazpenaren konplexutasuna denbora polinomialean ez deterministikoa dela jakina da. Doktoretza tesi honen helburu nagusia VP sistemetan perturbazio prozesuaren ondorioz ematen diren zailtasun teoriko eta praktikoei irtenbide egoki bat ematea da. Alde batetik, seinale/zarata ratio handiko ingurunetan VP sistemen errendimendua aztertzen da, beti ere deskodetze optimoa ematen dela suposatuz. Perturbazio prozesuak VP sistemen errendimenduaren azterketa analitikoa oztopatzen duenez, data transmisio tasaren hainbat goi eta behe borne proposatu eta berrikusi dira. Borne hauetan oinarrituz, VP eta prekodi kazio linealaren arteko errendimendu desberdintasuna neurtu da hainbat aplikazio ezberdinen eremuan. Konkretuki, kanalaren ahalmen ponderatua, zerbitzu kalitatearen formulazio baten ondorioz esleitzen den seinale potentzia eta erabiltzaileen datu transmisio tasa orekatzean lortzen den errendimenduaren azterketa burutu dira. Beste alde batetik, perturbazio bektorearen kalkulu eraginkorra lortzeko metodoak ere aztertu dira. Analisi hau zuhaitz-bilaketa tekniketan oinarritzen da, non egitura sinple baten bitartez errendimendu ia optimoa lortzen den. Ildo horretan, hiru zuhaitz-bilaketa algoritmo proposatu dira. Alde batetik, Fixed-sphere encoder-aren (FSE) konplexutasun konstateak eta arkitektura ez errekurtsiboak datu prozesaketa abiadura handiak lortzea ahalbidetzen dute. Sequential best-node expansion (SBE) delako algoritmo iteratiboak ordea, distantzia kontrol politika baten bitartez metrika kalkuluen kopurua murriztea lortzen du. Azkenik, low-complexity SBE (LC-SBE) algoritmoak SBE metodoaren latentzia eta konplexutasuna murriztea lortzen du ordezko distantzien kalkuluari eta exekuzio iraupenean ezarritako muga aldakorreko metodo berri bati esker. Honetaz gain, prekodi kazio sistementzako zuhaitz-bilaketa algoritmo ez errekurtsiboen hardware inplementazioa garatu da. Zehazki, konplexutasun nkoko FSE eta K-Best algoritmoen arkitektura diseinua eta hardware baliabideen erabilera landu dira. Balio konplexuko nodoen sekuentzia ordenatua, Schnorr-Euchner zerrendapena bezala ezagutua, funtsezkoa da zuhaitz bilaketan erabiliko diren nodoen aukeraketa egiteko. Prozesu honek beharrezkoak dituen hardware baliabideen eskaera murrizteko, konplexutasun bajuko algoritmo ez sekuentzial bat proposatzen da. Metodo honen bitartez, sekuentzia ordenatuko edozein nodoren aukeraketa independenteki egin ahal da. Proposatutako zerrendapen metodoa eta estruktura fully-pipeline baten bitartez, 5 Gbps-ko datu prozesaketa abiadura lortu daiteke FSE eta K-Best delako algoritmoen inplementazioan.La demanda de comunicaciones de alta velocidad requeridas por las aplicaciones más vanguardistas ha impuesto una presión sobre el actualmente saturado espectro inalámbrico. La incorporación de arrays de antenas en ambos extremos del enlace de comunicación ha proporcionado una mayor e ciencia espectral y abilidad al inherentemente complejo entorno inalámbrico, permitiendo así el desarrollo de aplicaciones de alta velocidad de transmisión sin un consumo adicional de ancho de banda. Consecuentemente, los sistemas multiple-input multiple output (MIMO) se han convertido en la tecnología clave para los estándares de comunicación de banda ancha, tanto en las con guraciones de usuario único como en los entornos multiusuario. La principal di cultad presente en los sistemas MIMO de usuario único reside en la etapa de detección de la señal en el extremo receptor, mientras que los sistemas multiusuario en el canal de bajada se enfrentan al reto de habilitar la adquisición de datos no cooperativa en los terminales receptores. A tal efecto, las técnicas de precodi cación realizan una etapa de pre-ecualización en la estación base de tal manera que la señal en cada receptor se pueda interpretar independientemente y sin el conocimiento del estado general del canal. La precodifi cación vectorial (VP, del inglés vector precoding) se ha propuesto recientemente para la adquisición no cooperativa de la señal en el canal de difusión multiusuario. La principal ventaja de la incorporación de un vector de perturbación es una considerable mejora en el rendimiento con respecto a los métodos de precodi cación lineales. Sin embargo, la adquisición de la señal de perturbación implica la búsqueda del punto más cercano en un reticulado in nito. Este problema se considera de complejidad no determinística en tiempo polinomial o NP-complejo. Esta tesis aborda las di cultades que se derivan del proceso de perturbación en sistemas VP desde una perspectiva tanto teórica como práctica. Por un lado, se analiza el rendimiento de VP asumiendo una decodi cación óptima en escenarios de alta relación señal a ruido. Debido a que el proceso de perturbación di culta la evaluación analítica del rendimiento de los sistemas de VP, se proponen y revisan diversas cotas superiores e inferiores en la tasa esperada de transmisión de estos sistemas. En base a estas cotas, se realiza una comparación de VP con respecto a la precodi cación lineal en el ámbito de la capacidad suma ponderada, la potencia resultante de una formulación de calidad de servicio y el rendimiento obtenido al equilibrar las tasas de transmisión de los usuarios. Por otro lado, se han propuesto nuevos procedimientos para un cómputo e ciente del vector de perturbación. Estos métodos se basan en técnicas de búsqueda en árbol que, por medio de diferentes políticas de podado, reducen la complejidad derivada de una búsqueda exhaustiva y obtienen un rendimiento cercano al óptimo. A este respecto, se proponen tres algoritmos de búsqueda en árbol. El xed-sphere encoder (FSE) cuenta con una complejidad constante y una arquitectura no iterativa, lo que permite el procesamiento paralelo de varios vectores candidatos, lo que a su vez deriva en grandes velocidades de procesamiento de datos. El algoritmo iterativo denominado sequential best-node expansion (SBE) aplica una política de control de distancias para reducir la cantidad de cómputo de métricas realizadas durante la búsqueda en árbol. Por último, el low-complexity SBE (LC-SBE) tiene por objetivo reducir la complejidad y latencia del algoritmo anterior mediante la combinación de un modelo de cálculo aproximado de distancias y una estrategia novedosa de restricción variable del tiempo de ejecución. Adicionalmente, se analiza la implementación en hardware de algoritmos de búsqueda en árbol no iterativos para los escenarios de precodi cación. Más especí camente, se presentan el diseño de la arquitectura y la ocupación de recursos de hardware de las técnicas de complejidad ja FSE y K-Best. La determinación de la secuencia ordenada de nodos de naturaleza compleja, también conocida como la enumeración de Schnorr-Euchner, es vital para seleccionar los nodos evaluados durante la búsqueda en árbol. Con la intención de reducir al mínimo la demanda de recursos de hardware de esta tarea de alta carga computacional, se presenta un novedoso algoritmo no secuencial de baja complejidad que permite la selección independiente de los nodos dentro de la secuencia ordenada. La incorporación de la técnica de enumeración no secuencial junto con la arquitectura fully-pipeline de los algoritmos FSE y K-Best, permite alcanzar velocidades de procesamiento de datos de hasta 5 Gbps para un sistema de 4 antenas receptoras

    Low complexity hybrid precoding designs for multiuser mmWave/THz ultra massive MIMO Systems

    Get PDF
    Millimeter-wave and terahertz technologies have been attracting attention from the wireless research community since they can offer large underutilized bandwidths which can enable the support of ultra-high-speed connections in future wireless communication systems. While the high signal attenuation occurring at these frequencies requires the adoption of very large (or the so-called ultra-massive) antenna arrays, in order to accomplish low complexity and low power consumption, hybrid analog/digital designs must be adopted. In this paper we present a hybrid design algorithm suitable for both mmWave and THz multiuser multiple-input multiple-output (MIMO) systems, which comprises separate computation steps for the digital precoder, analog precoder and multiuser interference mitigation. The design can also incorporate different analog architectures such as phase shifters, switches and inverters, antenna selection and so on. Furthermore, it is also applicable for different structures, namely fully-connected structures, arrays of subarrays (AoSA) and dynamic arrays of subarrays (DAoSA), making it suitable for the support of ultra-massive MIMO (UM-MIMO) in severely hardware constrained THz systems. We will show that, by using the proposed approach, it is possible to achieve good trade-offs between spectral efficiency and simplified implementation, even as the number of users and data streams increases.info:eu-repo/semantics/publishedVersio

    Multi-Antenna Techniques for Next Generation Cellular Communications

    Get PDF
    Future cellular communications are expected to offer substantial improvements for the pre- existing mobile services with higher data rates and lower latency as well as pioneer new types of applications that must comply with strict demands from a wider range of user types. All of these tasks require utmost efficiency in the use of spectral resources. Deploying multiple antennas introduces an additional signal dimension to wireless data transmissions, which provides a significant alternative solution against the plateauing capacity issue of the limited available spectrum. Multi-antenna techniques and the associated key enabling technologies possess unquestionable potential to play a key role in the evolution of next generation cellular systems. Spectral efficiency can be improved on downlink by concurrently serving multiple users with high-rate data connections on shared resources. In this thesis optimized multi-user multi-input multi-output (MIMO) transmissions are investigated on downlink from both filter design and resource allocation/assignment points of view. Regarding filter design, a joint baseband processing method is proposed specifically for high signal-to-noise ratio (SNR) conditions, where the necessary signaling overhead can be compensated for. Regarding resource scheduling, greedy- and genetic-based algorithms are proposed that demand lower complexity with large number of resource blocks relative to prior implementations. Channel estimation techniques are investigated for massive MIMO technology. In case of channel reciprocity, this thesis proposes an overhead reduction scheme for the signaling of user channel state information (CSI) feedback during a relative antenna calibration. In addition, a multi-cell coordination method is proposed for subspace-based blind estimators on uplink, which can be implicitly translated to downlink CSI in the presence of ideal reciprocity. Regarding non-reciprocal channels, a novel estimation technique is proposed based on reconstructing full downlink CSI from a select number of dominant propagation paths. The proposed method offers drastic compressions in user feedback reports and requires much simpler downlink training processes. Full-duplex technology can provide up to twice the spectral efficiency of conventional resource divisions. This thesis considers a full-duplex two-hop link with a MIMO relay and investigates mitigation techniques against the inherent loop-interference. Spatial-domain suppression schemes are developed for the optimization of full-duplex MIMO relaying in a coverage extension scenario on downlink. The proposed methods are demonstrated to generate data rates that closely approximate their global bounds

    Transmitter precoding for multi-antenna multi-user communications

    Get PDF
    Emerging wireless sensor networks and existing wireless cellular and ad hoc networks motivate the design of low-power receivers. Multi-user interference drastically reduces the energy efficiency of wireless multi-user communications by introducing errors in the bits being detected at the receiver. Interference rejection algorithms and multiple antenna techniques can significantly reduce the bit-error-rate at the receiver. Unfortunately, while interference rejection algorithms burden the receiver with heavy signal processing functionalities, thereby increasing the power consumption at the receiver, the small size of receivers, specifically in sensor networks and in downlink cellular communications, prohibits the use of multiple receive antennas. In a broadcast channel, where a central transmitter is transmitting independent streams to decentralized receivers, it is possible for the transmitter to have a priori knowledge of the interference. Multiple antennas can be used at the transmitter to enhance energy efficiency. In some systems, the transmitter has access to virtually an infinite source of power. A typical example would be the base station transmitter for the downlink of a cellular system. The power consumption at receivers can be reduced if some of the signal processing functionality of the receiver is moved to the transmitter.;In this thesis, we consider a wireless broadcast channel with a transmitter equipped with multiple antennas and having a priori knowledge of interference. Our objective is to minimize the receiver complexity by adding extra signal processing functions to the transmitter. We need to determine the optimal signal that should be transmitted so that interference is completely eliminated, and the benefits that can be obtained by using multiple transmit antennas can be maximized. We investigate the use of linear precoders, linear transformations made on the signal before transmission, for this purpose
    corecore