Array processing involves manipulation of signals induced on various antenna elements. In an adaptive array system, the radiation pattern is formed according to the signal environment by using signal processing techniques. Adaptive arrays improve the capacity of mobile communication systems by placing nulls in the direction of interfering sources and by directing independent beams toward various users. Adaptive beamforming algorithms process signals induced on each array element that are assumed not to be affected by mutual coupling between the elements. The aim of this thesis is to investigate the effects of mutual coupling on the performance of various adaptive beamforming algorithms. The performance parameters such as signal to interference plus noise ratio and speed of convergence of the adaptive algorithms are studied and compared by both neglecting and considering the mutual coupling for the least mean squares, recursive least squares, conjugate gradient and constant modulus algorithms. Finally, it is concluded that the effect of mutual coupling is major in the performance of blind algorithms rather than non-blind algorithms. The results are obtained by simulations carried out on MATLAB.

[pt] Os sistemas de múltiplas antenas empregam diferentes técnicas de processamento de sinais em ambos extremos do sistema de comunicações para se beneficiar das múltiplas dimensões espaciais e transmitir para diversos usuarios usando os mesmos recursos de tempo e frequência. Desta forma, uma alta eficiência espectral pode ser atingida sem precisar de largura de banda extra. No entanto, o desempenho depende de uma estimativa do canal altamente precisa do lado do transmissor, a qual é denominada channel state information at the transmitter (CSIT). Se o valor estimado do canal for perfeito, o sistema consegue suprimir a interferência multiusuário (MUI), que é a principal responsável pela degradação do desempenho do sistema. Porém, supor uma estimativa perfeita é bastante otimista pois sistemas reais introduzem incerteza devido ao processo de estimação, a erros de quantização e a retardos próprios dos sistemas. Nesse contexto, a técnica conhecida como divisão de taxas ou rate splitting (RS) surge como uma ferramenta promissora para lidar com as imperfeições na estimativa do canal. RS divide os dados em um fluxo comum e vários fluxos privados e então sobrepõe o fluxo comum no topo dos fluxos privados. Esta tese propõe várias técnicas de processamento que aumentam ainda mais os benefícios dos sistemas RS. Neste trabalho, consideramos o downlink (DL) de um sistema de comunicações sem fio onde o transmissor envia mensagens independentes para cada usuário. A métrica usada para avaliar o desempenho do sistema é a soma das taxas ergódica (ESR). Diferente dos trabalhos convencionais em RS, consideramos que os terminais dos usuários estão equipados com múltiplas antenas. Isso nos permite implementar na recepção combinadores de fluxos que aumentem a taxa do fluxo comum. Aumentar esta taxa é um dos grandes problemas dos sistemas RS, uma vez que a taxa comum é limitada pelo pior usuário o que pode degradar fortemente o desempenho do sistema. Assim, três combinadores de fluxos diferentes são propostos e as expressões analíticas para calcular a soma das taxas são apresentadas. Os combinadores são derivados empregando-se os critérios Min-Max, MRC e MMSE. O critério Min-Max seleciona para cada usuário a melhor antena para decodificar o símbolo comum. O MRC visa maximizar o SNR ao decodificar o símbolo comum. Finalmente, o critério MMSE minimiza o quadrado da diferença entre o símbolo comum e o sinal recebido. Até o momento, RS foi considerado com precodificadores lineares. Devido a isto, neste trabalho investigamos o desempenho do RS com precodificadores não lineares. Para este fim, usamos diferentes tipos de precodificador Tomlinson-Harashima (THP) baseados nos precodificadores lineares ZF e MMSE. Em seguida, propomos um algoritmo multi-branch (MB) adequado para o RS-THP proposto. Este algoritmo cria vários padrões de transmissão e seleciona o melhor padrão para efetuar a transmissão. Esta técnica de préprocessamento aumentam ainda mais a soma das taxas obtida, uma vez que o desempenho do THP depende da ordem dos símbolos, porém também aumenta a complexidade computacional. Expressões analíticas para calcular a soma das taxas das técnicas propostas são derivadas por meio de análises estatísticas dos principais parâmetros. Finalmente, propomos quatro técnicas adaptativas diferentes de alocação de potência, as quais se caracterizam por sua baixa complexidade computacional. Duas destas técnicas são projetadas para sistemas SDMA convencionais, enquanto as outras duas são projetadas para sistemas RS. Um dos principais objetivos dos algoritmos propostos é realizar uma alocação de potência robusta capaz de lidar com os efeitos prejudicias das imperfeições no CSIT. É importante mencionar que a alocação de potência em sistemas RS é uma das tarefas mais importantes e deve ser realizada com extremo cuidado. Se a potência não for alocada corretamente, o desempenho do sistema RS será bastante degradado e as arquiteturas convencionais, como SDMA e NOMA, poderão ter um desempenho melhor. No entanto, a alocação de potência em sistemas RS precisa da solução de problemas complexos de otimização, o que aumenta o tempo gasto no processamento do sinal. Os algoritmos adaptativos propostos reduzem a complexidade computacional e são uma solução atrativa para aplicações práticas em sistemas de grande porte. / [en] Multiple-antenna systems employ different signal processing techniques at both ends of the communication to exploit the spatial dimensions and serve multiple users simultaneously in the same time-frequency domain. In this way, high spectral efficiency can be reached without the need of extra bandwidth. However, such gain depends on a highly accurate channel state information at the transmitter (CSIT). Perfect CSIT allows the system to suppress the multi user interference (MUI), which is the main responsible of the performance degradation. Nonetheless, assuming perfect CSIT is rather optimistic since the estimation procedure, quantization errors and delays of real system lead to CSIT uncertainties. In this context, rate splitting (RS) has arisen as a promising technique to deal with CSIT imperfections. Basically, RS splits the data into a common stream and private streams and then superimposes the common stream on top of the private streams. This thesis proposes several processing techniques which further enhance the benefits of RS systems. We consider the downlink (DL) of a wireless communications system, where the transmitter sends independent messages to each receiver. The ergodic sum rate (ESR) is adopted as the main metric to evaluate the performance of the system. Different from conventional RS works, we consider that the users are equipped with multiple antennas. This allows us to implement stream combiners for the common stream at the receivers. The implementations of the stream combiners improves the common rate performance, which is a major problem of RS systems since the common rate is limited by the performance of the worst user and can be heavily degraded. In this work, three different stream combiners are proposed along with analytical expressions to compute their sum rate performance. Specifically, the combiners are derived employing the min-max, maximum ratio combining (MRC), and minimum mean square error (MMSE) criteria. The min-max criterion selects at each user the best receive antenna to decode the common symbol. The MRC criterion aims at maximizing the SNR when decoding the common symbol. Finally, the MMSE criterion minimizes the squared difference between the common symbol and the received signal. So far, RS has been predominantly considered with channel inversiontype linear precoders. Therefore, this motivates us to investigate the performance of RS with non-linear precoders. For this purpose, we employ different architectures of the Tomlinson-Harashima precoder (THP) which are based on the zero-forcing (ZF) and MMSE precoders. We then propose a multi-branch (MB) algorithm for the proposed RS-THP, which creates several transmit patterns and selects the best for transmission. This pre-processing techniques further enhance the sum rate obtained since the performance of THP is dependent on the symbol ordering but also increases the computational complexity. Analytical expressions to calculate the sum rate of the proposed techniques are derived through statistical evaluation of key parameters. Finally, we propose four different adaptive power allocation techniques, which are characterized by their low computational complexity. Two of them are designed for conventional SDMA systems whereas the other two are intended for RS systems. One major objective of the proposed algorithms is to perform robust power allocation capable of dealing with the detrimental effects of imperfect CSIT. It is important to mention that power allocation in RS systems is one of the critical tasks that should be carefully performed. If the power is not properly allocated the performance of RS systems is heavily degraded and conventional architectures such as SDMA and NOMA could perform better. However, RS rely on solving complex optimization problems to perform power allocation, increasing the time and effort dedicated to signal processing. The proposed adaptive power allocation algorithms reduce the computational complexity and are an attractive solution for practical applications with large-scale systems.

Yes / In this work, a new prototype of the eight-element MIMO antenna system for 5G communications, internet of things, and networks has been proposed. This system is based on an H-shaped monopole antenna system that offers 200 MHz bandwidth ranges between 3.4-3.6GHz, and the isolation between any two elements is well below -12dB without using any decoupling structure. The proposed system is designed on a commercially available 0.8mm-thick FR4 substrate. One side of the chassis is used to place the radiating elements, while the copper from the other side is being removed to avoid short-circuiting with other components and devices. This also enables space for other systems, sub-systems, and components. A prototype is fabricated and excellent agreement is observed between the experimental and the computed results. It was found that ECC is 0.2 for any two radiating elements which is consistent with the desirable standards, and channel capacity is 38 bps/Hz which is 2.9 times higher than 4x4 MIMO configuration. In addition, single hand mode and dual hand mode analysis are conducted to understand the operation of the system under such operations and to identify losses and/or changes in the key performance parameters. Based on the results, the proposed antenna system will find its applications in modern 5G handheld devices and internet of things with healthcare and high rate delivery. Besides that, its design simplicity will make it applicable for mass production to be used in industrial demands.

Multiple-Input Multiple-Output (MIMO) communication using multiple antennas has received significant attention in recent years, both in the academia and industry, as they offer additional spatial dimensions for high-rate and reliable communication, without expending valuable bandwidth. However, exploiting these promised benefits of MIMO systems critically depends on fast and accurate acquisition of Channel State Information (CSI) at the Receiver (CSIR) and the Transmitter (CSIT). In Time Division Duplex (TDD) MIMO systems, where the forward channel and the reverse channel are the same, it is possible to exploit this reciprocity to reduce the overhead involved in acquiring CSI, both in terms of training duration and power. Further, many popular and efficient transmission schemes such as beam forming, spatial multiplexing over dominant channel modes, etc. do not require full CSI at the transmitter. In such cases, it is possible to reduce the Reverse Channel Training (RCT) overhead by only learning the part of the channel that is required for data transmission at the transmitter. In this thesis, we propose and analyze several novel channel-dependent RCT schemes for MIMO systems and analyze their performance in terms of (a) the mean-square error in the channel estimate, (b) lower bounds on the capacity, and (c) the diversity-multiplexing gain tradeoff. We show that the proposed training schemes offer significant performance improvement relative to conventional channel-agnostic RCT schemes. The main take-home messages from this thesis are as follows: • Exploiting CSI while designing the RCT sequence improves the performance. • The training sequence should be designed so as to convey only the part of the CSI required for data transmission by the transmitter. • Power-controlled RCT, when feasible, significantly outperforms fixed power RCT.

Providing access to telecommunication services in rural areas is of paramount importance for the development of any country. Since the cost is the main inhibiting factor, any technical solution for access in sparsely populated rural areas has to be reliable, efficient, and deployable at low-cost. This thesis studies the utilization of Multihop Wireless Networks (MWN) as an appealing alternative for rural communication. MWN are designed with a self-configuring capability and can adapt to the addition or removal of network radio units (nodes). This makes them simple to install, allowing unskilled users to set up the network quickly. To increase the performance and cost-efficiency, this thesis focuses on the use of Advanced Antenna Systems (AAS) in rural access networks. AAS promise to increase the overall capacity in MWN, improving the link quality while suppressing or reducing the multiple access interference. To effectively exploit the capabilities of AAS, a proper design of Medium Access Control (MAC) protocols is needed. Hence, the results of system level studies into MAC protocols and AAS are presented in this thesis. Two different MAC protocols are examined: Spatial Time Division Multiple Access (STDMA) and Carrier Sense Multiple Access Collision Avoidance (CSMA/CA) with handshaking. The effects of utilizing advanced antennas on the end-to-end network throughput and packet delay are analyzed with routing, power control and adaptive transmission data rate control separately and in combination. Many of the STDMA-related research questions addressed in this thesis are posed as nonlinear optimization problems that are solved by the technique called "column generation" to create the transmission schedule using AAS. However, as finding the optimal solution is computationally expensive, we also introduce low-complexity algorithms that, while simpler, yield reasonable results close to the optimal solution. Although STDMA has been found to be very efficient and fair, one potential drawback is that it may adapt slower than a distributed approach like CSMA/CA to network changes produced e.g. by traffic variations and time-variant channel conditions. In CSMA/CA, nodes make their own decisions based on partial network information and the handshaking procedure allows the use of AAS at the transmitter and the receiver. How to effectively use AAS in CSMA/CA with handshaking is addressed in this thesis. Different beam selection policies using switched beam antenna systems are investigated. Finally, we demonstrate how the proposed techniques can be applied in a rural access scenario in Nicaragua. The result of a user-deployed MWN for Internet access shows that the supported aggregated end-to-end rate is higher than an Asymmetric Digital Subscriber Line (ADSL) connection. / QC 20100908

In the last decade, there has been an explosive growth in different applications of wireless technology, due to users' increasing expectations for multi-media services. With the current trend, the present systems will not be able to handle the required data traffic. Lattice codes have attracted considerable attention in recent years, because they provide high data rate constellations. In this thesis, the applications of implementing lattice codes in different communication systems are investigated. The thesis is divided into two major parts. Focus of the first part is on constellation shaping and the problem of lattice labeling. The second part is devoted to the lattice decoding problem. In constellation shaping technique, conventional constellations are replaced by lattice codes that satisfy some geometrical properties. However, a simple algorithm, called lattice labeling, is required to map the input data to the lattice code points. In the first part of this thesis, the application of lattice codes for constellation shaping in Orthogonal Frequency Division Multiplexing (OFDM) and Multi-Input Multi-Output (MIMO) broadcast systems are considered. In an OFDM system a lattice code with low Peak to Average Power Ratio (PAPR) is desired. Here, a new lattice code with considerable PAPR reduction for OFDM systems is proposed. Due to the recursive structure of this lattice code, a simple lattice labeling method based on Smith normal decomposition of an integer matrix is obtained. A selective mapping method in conjunction with the proposed lattice code is also presented to further reduce the PAPR. MIMO broadcast systems are also considered in the thesis. In a multiple antenna broadcast system, the lattice labeling algorithm should be such that different users can decode their data independently. Moreover, the implemented lattice code should result in a low average transmit energy. Here, a selective mapping technique provides such a lattice code. Lattice decoding is the focus of the second part of the thesis, which concerns the operation of finding the closest point of the lattice code to any point in N-dimensional real space. In digital communication applications, this problem is known as the integer least-square problem, which can be seen in many areas, e.g. the detection of symbols transmitted over the multiple antenna wireless channel, the multiuser detection problem in Code Division Multiple Access (CDMA) systems, and the simultaneous detection of multiple users in a Digital Subscriber Line (DSL) system affected by crosstalk. Here, an efficient lattice decoding algorithm based on using Semi-Definite Programming (SDP) is introduced. The proposed algorithm is capable of handling any form of lattice constellation for an arbitrary labeling of points. In the proposed methods, the distance minimization problem is expressed in terms of a binary quadratic minimization problem, which is solved by introducing several matrix and vector lifting SDP relaxation models. The new SDP models provide a wealth of trade-off between the complexity and the performance of the decoding problem.

In the last decade, there has been an explosive growth in different applications of wireless technology, due to users' increasing expectations for multi-media services. With the current trend, the present systems will not be able to handle the required data traffic. Lattice codes have attracted considerable attention in recent years, because they provide high data rate constellations. In this thesis, the applications of implementing lattice codes in different communication systems are investigated. The thesis is divided into two major parts. Focus of the first part is on constellation shaping and the problem of lattice labeling. The second part is devoted to the lattice decoding problem. In constellation shaping technique, conventional constellations are replaced by lattice codes that satisfy some geometrical properties. However, a simple algorithm, called lattice labeling, is required to map the input data to the lattice code points. In the first part of this thesis, the application of lattice codes for constellation shaping in Orthogonal Frequency Division Multiplexing (OFDM) and Multi-Input Multi-Output (MIMO) broadcast systems are considered. In an OFDM system a lattice code with low Peak to Average Power Ratio (PAPR) is desired. Here, a new lattice code with considerable PAPR reduction for OFDM systems is proposed. Due to the recursive structure of this lattice code, a simple lattice labeling method based on Smith normal decomposition of an integer matrix is obtained. A selective mapping method in conjunction with the proposed lattice code is also presented to further reduce the PAPR. MIMO broadcast systems are also considered in the thesis. In a multiple antenna broadcast system, the lattice labeling algorithm should be such that different users can decode their data independently. Moreover, the implemented lattice code should result in a low average transmit energy. Here, a selective mapping technique provides such a lattice code. Lattice decoding is the focus of the second part of the thesis, which concerns the operation of finding the closest point of the lattice code to any point in N-dimensional real space. In digital communication applications, this problem is known as the integer least-square problem, which can be seen in many areas, e.g. the detection of symbols transmitted over the multiple antenna wireless channel, the multiuser detection problem in Code Division Multiple Access (CDMA) systems, and the simultaneous detection of multiple users in a Digital Subscriber Line (DSL) system affected by crosstalk. Here, an efficient lattice decoding algorithm based on using Semi-Definite Programming (SDP) is introduced. The proposed algorithm is capable of handling any form of lattice constellation for an arbitrary labeling of points. In the proposed methods, the distance minimization problem is expressed in terms of a binary quadratic minimization problem, which is solved by introducing several matrix and vector lifting SDP relaxation models. The new SDP models provide a wealth of trade-off between the complexity and the performance of the decoding problem.

Abstract The use of multiple antennas is a fundamental requirement in future wireless networks as it helps to increase the reliability and spectral efficiency of mobile radio links. In this thesis, we study convex optimization based radio resource allocation methods for the downlink of multi-antenna systems. First, the problem of admission control in the downlink of a multicell multiple-input single-output (MISO) system has been considered. The objective is to maximize the number of admitted users subject to a signal-to-interference-plus-noise ratio (SINR) constraint at each admitted user and a transmit power constraint at each base station (BS). We have cast the admission control problem as an ℓ0 minimization problem; it is known to be combinatorial, NP-hard. Centralized and distributed algorithms to solve this problem have been proposed. To develop the centralized algorithm, we have used sequential convex programming (SCP). The distributed algorithm has been derived by using the consensus-based alternating direction method of multipliers in conjunction with SCP. We have shown numerically that the proposed admission control algorithms achieve a near-to-optimal performance. Next, we have extended the admission control problem to provide fairness, where long-term fairness among the users has been guaranteed. We have focused on proportional and max-min fairness, and proposed dynamic control algorithms via Lyapunov optimization. Results show that these proposed algorithms guarantee fairness. Then, the problem of admission control for the downlink of a MISO heterogeneous networks (hetnet) has been considered, and the proposed centralized and distributed algorithms have been adapted to find a solution. Numerically, we have illustrated that the centralized algorithm achieves a near-to-optimal performance, and the distributed algorithm’s performance is closer to the optimal value. Finally, an algorithm to obtain the set of all achievable power-rate tuples for a multiple-input multiple-output hetnet has been provided. The setup consists of a single macrocell and a set of femtocells. The interference power to the macro users from the femto BSs has been kept below a threshold. To find the set of all achievable power-rate tuples, a two-dimensional vector optimization problem is formulated, where we have considered maximizing the sum-rate while minimizing the sum-power, subject to maximum power and interference threshold constraints. This problem is known to be NP-hard. A solution method is provided by using the relationship between the weighted sum-rate maximization and weighted-sum-mean-squared-error minimization problems. The proposed algorithm was used to evaluate the impact of imposing interference threshold constraints and the co-channel deployments in a hetnet. / Tiivistelmä Monen antennin käyttö on perusvaatimus tulevissa langattomissa verkoissa, koska se auttaa lisäämään matkaviestinyhteyksien luotettavuutta ja spektritehokkuutta. Tässä väitöskirjassa tutkitaan konveksiin optimointiin perustuvia radioresurssien allokointimenetelmiä moniantennijärjestelmien alalinkin suunnassa. Ensiksi on käsitelty pääsynvalvonnan ongelmaa alalinkin suuntaan monen solun moni-tulo yksi-lähtö (MISO) -verkoissa. Tavoitteena on maksimoida hyväksyttyjen käyttäjien määrä, kun hyväksytyille käyttäjille on asetettu signaali-häiriö-kohinasuhteen (SINR) rajoitus, ja tukiasemille lähetystehon rajoitus. Pääsynvalvonnan ongelma on muotoiltu ℓ0-minimointiongelmana, jonka tiedetään olevan kombinatorinen, NP-vaikea ongelma. Ongelman ratkaisemiseksi on ehdotettu keskitettyjä ja hajautettuja algoritmeja. Keskitetty optimointialgoritmi perustuu sekventiaaliseen konveksiin optimointiin. Hajautettu algoritmi pohjautuu konsensusoptimointimenetelmään ja sekventiaaliseen konveksiin optimointiin. Ehdotettujen pääsynvalvonta-algoritmien on numeerisesti osoitettu saavuttavan lähes optimaalinen suorituskyky. Lisäksi pääsynvalvontaongelma on laajennettu takaamaan pitkän aikavälin oikeudenmukaisuus käyttäjien välillä. Työssä käytetään erilaisia määritelmiä oikeudenmukaisuuden takaamiseen, ja ehdotetaan dynaamisia algoritmeja pohjautuen Lyapunov-optimointiin. Tulokset osoittavat, että ehdotetuilla algoritmeilla taataan käyttäjien välinen oikeudenmukaisuus. Tämän jälkeen käsitellään heterogeenisen langattoman MISO-verkon pääsynvalvonnan ongelmaa. Edellä ehdotettuja keskitettyjä ja hajautettuja algoritmeja on muokattu tämän ongelman ratkaisemiseksi. Työssä osoitetaan numeerisesti, että sekä keskitetyllä että hajautetulla algoritmilla saavutetaan lähes optimaalinen suorituskyky. Lopuksi on laadittu algoritmi, jolla löydetään kaikki saavutettavissa olevat teho-datanopeusparit heterogeenisessä langattomassa moni-tulo moni-lähtö (MIMO) -verkossa. Verkko koostuu yhdestä makrosolusta ja useasta piensolusta. Piensolutukiasemista makrokäyttäjiin kohdistuvan häiriön teho on pidetty tietyn rajan alapuolella. Kaikkien saavutettavien teho-datanopeusparien löytämiseksi on laadittu kaksiulotteinen vektorioptimointiongelma, jossa maksimoidaan summadatanopeus pyrkien minimoimaan kokonaisteho, kun enimmäisteholle ja häiriökynnykselle on asetettu rajoitukset. Tämän ongelman tiedetään olevan NP-vaikea. Ongelman ratkaisemiseksi käytetään painotetun summadatanopeuden maksimointiongelman, ja painotetun keskineliövirheen minimointiongelman välistä suhdetta. Ehdotettua algoritmia käytettiin arvioimaan häiriörajoitusten ja saman kanavan käyttöönoton vaikutusta heterogeenisessä langattomassa verkossa.

A new communication paradigm is foreseen for beyond 2020 society, due to the emergence of new broadband services and the Internet of Things era. The set of requirements imposed by these new applications is large and diverse, aiming to provide a ubiquitous broadband connectivity. Research community has been working in the last decade towards the definition of the 5G mobile wireless networks that will provide the proper mechanisms to reach these challenging requirements. In this framework, three key research directions have been identified for the improvement of capacity in 5G: the increase of the spectral efficiency by means of, for example, the use of massive MIMO technology, the use of larger amounts of spectrum by utilizing the millimeter wave band, and the network densification by deploying more base stations per unit area. This dissertation addresses densification as the main enabler for the broadband and massive connectivity required in future 5G networks. To this aim, this Thesis focuses on the study of the UDN. In particular, a set of technology enablers that can lead UDN to achieve their maximum efficiency and performance are investigated, namely, the use of higher frequency bands for the benefit of larger bandwidths, the use of massive MIMO with distributed antenna systems, and the use of distributed radio resource management techniques for the inter-cell interference coordination. Firstly, this Thesis analyzes whether there exists a fundamental performance limit related with densification in cellular networks. To this end, the UDN performance is evaluated by means of an analytical model consisting of a 1-dimensional network deployment with equally spaced BS. The inter-BS distance is decreased until reaching the limit of densification when this distance approaches 0. The achievable rates in networks with different inter-BS distances are analyzed for several levels of transmission power availability, and for various types of cooperation among cells. Moreover, UDN performance is studied in conjunction with the use of a massive number of antennas and larger amounts of spectrum. In particular, the performance of hybrid beamforming and precoding MIMO schemes are assessed in both indoor and outdoor scenarios with multiple cells and users, working in the mmW frequency band. On the one hand, beamforming schemes using the full-connected hybrid architecture are analyzed in BS with limited number of RF chains, identifying the strengths and weaknesses of these schemes in a dense-urban scenario. On the other hand, the performance of different indoor deployment strategies using HP in the mmW band is evaluated, focusing on the use of DAS. More specifically, a DHP suitable for DAS is proposed, comparing its performance with that of HP in other indoor deployment strategies. Lastly, the presence of practical limitations and hardware impairments in the use of hybrid architectures is also investigated. Finally, the investigation of UDN is completed with the study of their main limitation, which is the increasing inter-cell interference in the network. In order to tackle this problem, an eICIC scheduling algorithm based on resource partitioning techniques is proposed. Its performance is evaluated and compared to other scheduling algorithms under several degrees of network densification. After the completion of this study, the potential of UDN to reach the capacity requirements of 5G networks is confirmed. Nevertheless, without the use of larger portions of spectrum, a proper interference management and the use of a massive number of antennas, densification could turn into a serious problem for mobile operators. Performance evaluation results show large system capacity gains with the use of massive MIMO techniques in UDN, and even greater when the antennas are distributed. Furthermore, the application of ICIC techniques reveals that, besides the increase in system capacity, it brings significant energy savings to UDNs. / A partir del año 2020 se prevé que un nuevo paradigma de comunicación surja en la sociedad, debido a la aparición de nuevos servicios y la era del Internet de las cosas. El conjunto de requisitos impuesto por estas nuevas aplicaciones es muy amplio y diverso, y tiene como principal objetivo proporcionar conectividad de banda ancha y universal. En las últimas décadas, la comunidad científica ha estado trabajando en la definición de la 5G de redes móviles que brindará los mecanismos necesarios para garantizar estos requisitos. En este marco, se han identificado tres mecanismos clave para conseguir el necesario incremento de capacidad de la red: el aumento de la eficiencia espectral a través de, por ejemplo, el uso de tecnologías MIMO masivas, la utilización de mayores porciones del espectro en frecuencia y la densificación de la red mediante el despliegue de más estaciones base por área. Esta Tesis doctoral aborda la densificación como el principal mecanismo que permitirá la conectividad de banda ancha y universal requerida en la 5G, centrándose en el estudio de las Redes Ultra Densas o UDNs. En concreto, se analiza el conjunto de tecnologías habilitantes que pueden llevar a las UDNs a obtener su máxima eficiencia y prestaciones, incluyendo el uso de altas frecuencias para el aprovechamiento de mayores anchos de banda, la utilización de MIMO masivo con sistemas de antenas distribuidas y el uso de técnicas de reparto de recursos distribuidas para la coordinación de interferencias. En primer lugar, se analiza si existe un límite fundamental en la mejora de las prestaciones en relación a la densificación. Con este fin, las prestaciones de las UDNs se evalúan utilizando un modelo analítico de red unidimensional con BSs equiespaciadas, en el que la distancia entre BSs se disminuye hasta alcanzar el límite de densificación cuando ésta se aproxima a 0. Las tasas alcanzables en redes con distintas distancias entre BSs son analizadas, considerando distintos niveles de potencia disponible en la red y varios grados de cooperación entre celdas. Además, el comportamiento de las UDNs se estudia junto al uso masivo de antenas y la utilización de anchos de banda mayores. Más concretamente, las prestaciones de ciertas técnicas híbridas MIMO de precodificación y beamforming se examinan en la banda milimétrica. Por una parte, se analizan esquemas de beamforming en BSs con arquitectura híbrida en función de la disponibilidad de cadenas de radiofrecuencia en escenarios exteriores. Por otra parte, se evalúan las prestaciones de ciertos esquemas de precodificación híbrida en escenarios interiores, utilizando distintos despliegues y centrando la atención en los sistemas de antenas distribuidos o DAS. Además, se propone un algoritmo de precodificación híbrida específico para DAS, y se evalúan y comparan sus prestaciones con las de otros algoritmos de precodificación utilizados. Por último, se investiga el impacto en las prestaciones de ciertas limitaciones prácticas y deficiencias introducidas por el uso de dispositivos no ideales. Finalmente, el estudio de las UDNs se completa con el análisis de su principal limitación, el nivel creciente de interferencia en la red. Para ello, se propone un algoritmo de control de interferencias basado en la partición de recursos. Sus prestaciones son evaluadas y comparadas con las de otras técnicas de asignación de recursos. Tras este estudio, se puede afirmar que las UDNs tienen gran potencial para la consecución de los requisitos de la 5G. Sin embargo, sin el uso conjunto de mayores porciones del espectro, adecuadas técnicas de control de la interferencia y el uso masivo de antenas, las UDNs pueden convertirse en serios obstáculos para los operadores móviles. Los resultados de la evaluación de prestaciones de estas tecnologías confirman el gran aumento de la capacidad de las redes mediante el uso masivo de antenas y la introducción de mecanismos de I / A partir de l'any 2020 es preveu un nou paradigma de comunicació en la societat, degut a l'aparició de nous serveis i la era de la Internet de les coses. El conjunt de requeriments imposat per aquestes noves aplicacions és ampli i divers, i té com a principal objectiu proporcionar connectivitat universal i de banda ampla. En les últimes dècades, la comunitat científica ha estat treballant en la definició de la 5G, que proveirà els mecanismes necessaris per a garantir aquests exigents requeriments. En aquest marc, s'han identificat tres mecanismes claus per a aconseguir l'increment necessari en la capacitat: l'augment de l'eficiència espectral a través de, per exemple, l'ús de tecnologies MIMO massives, la utilització de majors porcions de l'espectre i la densificació mitjançant el desplegament de més estacions base per àrea. Aquesta Tesi aborda la densificació com a principal mecanisme que permetrà la connectivitat de banda ampla i universal requerida en la 5G, centrant-se en l' estudi de les xarxes ultra denses (UDNs). Concretament, el conjunt de tecnologies que poden dur a les UDNs a la seua màxima eficiència i prestacions és analitzat, incloent l'ús d'altes freqüències per a l'aprofitament de majors amplàries de banda, la utilització de MIMO massiu amb sistemes d'antenes distribuïdes i l'ús de tècniques distribuïdes de repartiment de recursos per a la coordinació de la interferència. En primer lloc, aquesta Tesi analitza si existeix un límit fonamental en les prestacions en relació a la densificació. Per això, les prestacions de les UDNs s'avaluen utilitzant un model analític unidimensional amb estacions base equidistants, en les quals la distància entre estacions base es redueix fins assolir el límit de densificació quan aquesta distància s'aproxima a 0. Les taxes assolibles en xarxes amb diferents distàncies entre estacions base s'analitzen considerant diferents nivells de potència i varis graus de cooperació entre cel·les. A més, el comportament de les UDNs s'estudia conjuntament amb l'ús massiu d'antenes i la utilització de majors amplàries de banda. Més concretament, les prestacions de certes tècniques híbrides MIMO de precodificació i beamforming s'examinen en la banda mil·limètrica. D'una banda, els esquemes de beamforming aplicats a estacions base amb arquitectures híbrides és analitzat amb disponibilitat limitada de cadenes de radiofreqüència a un escenari urbà dens. D'altra banda, s'avaluen les prestacions de certs esquemes de precodificació híbrida en escenaris d'interior, utilitzant diferents estratègies de desplegament i centrant l'atenció en els sistemes d' antenes distribuïdes (DAS). A més, es proposa un algoritme de precodificació híbrida distribuïda per a DAS, i s'avaluen i comparen les seues prestacions amb les de altres algoritmes. Per últim, s'investiga l'impacte de les limitacions pràctiques i altres deficiències introduïdes per l'ús de dispositius no ideals en les prestacions de tots els esquemes anteriors. Finalment, l' estudi de les UDNs es completa amb l'anàlisi de la seua principal limitació, el nivell creixent d'interferència entre cel·les. Per tractar aquest problema, es proposa un algoritme de control d'interferències basat en la partició de recursos. Les prestacions de l'algoritme proposat s'avaluen i comparen amb les d'altres tècniques d'assignació de recursos. Una vegada completat aquest estudi, es pot afirmar que les UDNs tenen un gran potencial per aconseguir els ambiciosos requeriments plantejats per a la 5G. Tanmateix, sense l'ús conjunt de majors amplàries de banda, apropiades tècniques de control de la interferència i l'ús massiu d'antenes, les UDNs poden convertir-se en seriosos obstacles per als operadors mòbils. Els resultats de l'avaluació de prestacions d' aquestes tecnologies confirmen el gran augment de la capacitat de les xarxes obtingut mitjançant l'ús massiu d'antenes i la introducci / Giménez Colás, S. (2017). Ultra Dense Networks Deployment for beyond 2020 Technologies [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/86204 / TESIS

La demande de transmissions à débits de plus en plus élevés s’accentue davantage avec l’essor de nouveaux services dans les réseaux de communication sans fils. Pour répondre à cette demande, une solution consiste à augmenter la capacité de transmission du canal radiofréquence entre la station de base et le terminal portatif. Ceci peut être réalisé en augmentant le nombre d’éléments rayonnant impliqués à l’émission et à la réception de cette liaison radiofréquence : on parle alors de technique MIMO (Multiple Input, Multiple Output). Cette thèse porte principalement sur la conception, l’optimisation et la caractérisation de systèmes multi-antennaires pour techniques de diversité et MIMO en bandes LTE (Long Term Evolution). Trois prototypes multi-bandes sont proposés dont deux systèmes planaires et un système d’antennes IFAs compactes. De nouvelles solutions multi-bandes et l’influence de la position de l’antenne sur le plan de masse sont étudiées pour réaliser de la diversité spatiale, de polarisation et de diagramme de rayonnement avec une faible corrélation entre les signaux reçus sur chaque antenne mais surtout une bonne efficacité totale. Une ligne de neutralisation est utilisée pour isoler les antennes et un fonctionnement multi-bande est réalisé. L’impédance d’entrée des antennes est étudiée avec la méthode de Youla & Carlin afin d’améliorer la bande passante de la structure compacte de type IFA. Les performances en diversité et en MIMO de ces systèmes sont évaluées dans différents environnements de propagation. Elles montrent que ces systèmes peuvent être utilisés efficacement pour des applications en diversité et MIMO. / The transmission demand for increasing data rate becomes more and more important with the development of new services in radio communication networks. To answer to this demand, one solution consists in increasing the transmission capacity of the radio channel between the base station and the handset terminal. This can be realized by increasing the number of radiating elements involved in the transmission and the reception of this radio link: we talk about MIMO (Multiple Input Multiple Output) technique. The work realized in this thesis concerns mainly design, optimization and characterization of multi-antenna systems for MIMO and diversity techniques in LTE (Long Term Evolution) bands. Three multi bands prototypes are proposed whose two planar systems and one compact IFAs antennas system. News multiband solution and antenna position influence on the PCB were studied to realize spatial, polarization and pattern diversity with low correlation between received signals on each antenna and a good efficiency. The neutralization line was used for antennas isolation and its application in multiband was realized. The antenna load impedance has been studied with Youla & Carlin method in order to improve the frequency bandwidth of the compact IFA structure. Diversity and MIMO performances of these systems were evaluated in different propagation environments. They show that these systems can be effectively used for diversity and MIMO application.