Individual Channel Estimation in a Diamond Relay Network Using Relay-Assisted Training

We consider the training design and channel estimation in the amplify-and-forward (AF) diamond relay network. Our strategy is to transmit the source training in time-multiplexing (TM) mode while each relay node superimposes its own relay training over the amplified received data signal without bandwidth expansion. The principal challenge is to obtain accurate channel state information (CSI) of second-hop link due to the multiaccess interference (MAI) and cooperative data interference (CDI). To maintain the orthogonality between data and training, a modified relay-assisted training scheme is proposed to migrate the CDI, where some of the cooperative data at the relay are discarded to accommodate relay training. Meanwhile, a couple of optimal zero-correlation zone (ZCZ) relay-assisted sequences are designed to avoid MAI. At the destination node, the received signals from the two relay nodes are combined to achieve spatial diversity and enhanced data reliability. The simulation results are presented to validate the performance of the proposed schemes

Physical Layer Cooperation:Theory and Practice

Information theory has long pointed to the promise of physical layer cooperation in boosting the spectral efficiency of wireless networks. Yet, the optimum relaying strategy to achieve the network capacity has till date remained elusive. Recently however, a relaying strategy termed Quantize-Map-and-Forward (QMF) was proved to achieve the capacity of arbitrary wireless networks within a bounded additive gap. This thesis contributes to the design, analysis and implementation of QMF relaying by optimizing its performance for small relay networks, proposing low-complexity iteratively decodable codes, and carrying out over-the-air experiments using software-radio testbeds to assess real-world potential and competitiveness. The original QMF scheme has each relay performing the same operation, agnostic to the network topology and the channel state information (CSI); this facilitates the analysis for arbitrary networks, yet comes at a performance penalty for small networks and medium SNR regimes. In this thesis, we demonstrate the benefits one can gain for QMF if we optimize its performance by leveraging topological and channel state information. We show that for the N-relay diamond network, by taking into account topological information, we can exponentially reduce the QMF additive approximation gap from $\Theta(N)$ bits/s/Hz to $\Theta(\log N)$ bits/s/Hz, while for the one-relay and two-relay networks, use of topological information and CSI can help to gain as much as $6$ dB. Moreover, we explore what benefits we can realize if we jointly optimize QMF and half-duplex scheduling, as well as if we employ hybrid schemes that combine QMF and Decode-and-Forward (DF) relay operations. To take QMF from being a purely information-theoretic idea to an implementable strategy, we derive a structure employing Low-Density-Parity-Check (LDPC) ensembles for the relay node operations and message-passing algorithms for decoding. We demonstrate through extensive simulation results over the full-duplex diamond network, that our designs offer a robust performance over fading channels and achieves the full diversity order of our network at moderate SNRs. Next, we explore the potential real-world impact of QMF and present the design and experimental evaluation of a wireless system that exploits relaying in the context of WiFi. We deploy three main competing strategies that have been proposed for relaying, Amplify-and-Forward (AF), DF and QMF, on the WarpLab software radio platform. We present experimental results--to the best of our knowledge, the first ones--that compare QMF, AF and DF in a realistic indoor setting. We find that QMF is a competitive scheme to the other two, offering in some cases up to 12% throughput benefits and up to 60% improvement in frame error-rates over the next best scheme. We then present a more advanced architecture for physical layer cooperation (termed QUILT), that seamlessly adapts to the underlying network configuration to achieve competitive or better performance than the best current approaches. It combines on-demand, opportunistic use of DF or QMF followed by interleaving at the relay, with hybrid decoding at the destination that extracts information from even potentially undecodable received frames. We theoretically quantify how our design choices affect the system performance. We also deploy QUILT on WarpLab and show through over-the-air experiments up to $5$ times FER improvement over the next best cooperative protocol

Machine Learning for Metasurfaces Design and Their Applications

Metasurfaces (MTSs) are increasingly emerging as enabling technologies to meet the demands for multi-functional, small form-factor, efficient, reconfigurable, tunable, and low-cost radio-frequency (RF) components because of their ability to manipulate waves in a sub-wavelength thickness through modified boundary conditions. They enable the design of reconfigurable intelligent surfaces (RISs) for adaptable wireless channels and smart radio environments, wherein the inherently stochastic nature of the wireless environment is transformed into a programmable propagation channel. In particular, space-limited RF applications, such as communications and radar, that have strict radiation requirements are currently being investigated for potential RIS deployment. The RIS comprises sub-wavelength units or meta-atoms, which are independently controlled and whose geometry and material determine the spectral response of the RIS. Conventionally, designing RIS to yield the desired EM response requires trial and error by iteratively investigating a large possibility of various geometries and materials through thousands of full-wave EM simulations. In this context, machine/deep learning (ML/DL) techniques are proving critical in reducing the computational cost and time of RIS inverse design. Instead of explicitly solving Maxwell's equations, DL models learn physics-based relationships through supervised training data. The ML/DL techniques also aid in RIS deployment for numerous wireless applications, which requires dealing with multiple channel links between the base station (BS) and the users. As a result, the BS and RIS beamformers require a joint design, wherein the RIS elements must be rapidly reconfigured. This chapter provides a synopsis of DL techniques for both inverse RIS design and RIS-assisted wireless systems.Comment: Book chapter, 70 pages, 12 figures, 2 tables. arXiv admin note: substantial text overlap with arXiv:2101.09131, arXiv:2009.0254

Channel estimation and parameters acquisition systems employing cooperative diversity

Doutoramento em Engenharia Eletrotécnica e TelecomunicaçõesThis work investigates new channel estimation schemes for the forthcoming and future generation of cellular systems for which cooperative techniques are regarded. The studied cooperative systems are designed to re-transmit the received information to the user terminal via the relay nodes, in order to make use of benefits such as high throughput, fairness in access and extra coverage. The cooperative scenarios rely on OFDM-based systems employing classical and pilot-based channel estimators, which were originally designed to pointto-point links. The analytical studies consider two relaying protocols, namely, the Amplifyand-Forward and the Equalise-and-Forward, both for the downlink case. The relaying channels statistics show that such channels entail specific characteristics that comply to a proper filter and equalisation designs. Therefore, adjustments in the estimation process are needed in order to obtain the relay channel estimates, refine these initial estimates via iterative processing and obtain others system parameters that are required in the equalisation. The system performance is evaluated considering standardised specifications and the International Telecommunication Union multipath channel models.Este trabalho tem por objetivo o estudo de novos esquemas de estimação de canal para sistemas de comunicação móvel das próximas gerações, para os quais técnicas cooperativa são consideradas. Os sistemas cooperativos investigados neste trabalho estão projetados para fazerem uso de terminais adicionais a fim de retransmitir a informação recebida para o utilizador final. Desta forma, pode-se usurfruir de benefícios relacionados às comunicações cooperativas tais como o aumento do rendimento do sistema, fiabilidade e extra cobertura. Os cenários são basedos em sistemas OFDM que empregam estimadores de canal que fazem uso de sinais piloto e que originalmente foram projetados para ligações ponto a ponto. Os estudos analíticos consideram dois protocolos de encaminhamento, nomeadamente, Amplify-and-Forward e Equalise-and-Forward, ambos para o caso downlink. As estatísticas dos canais em estudo mostram que tais canais ocasionam características específicas para as quais o filtro do estimador e a equalisação devem ser apropridamente projetados. Estas características requerem ajustes que são necessários no processo de estimação a fim de estimar os canais, refinar as estimativas iniciais através de processos iterativos e ainda obter outros parâmetros do sistema que são necessários na equalização. O desempenho dos esquemas propostos são avaliados tendo em consideração especificações padronizadas e modelos de canal descritos na International Telecommunication Union

Low Complexity Scheduling and Coding for Wireless Networks

The advent of wireless communication technologies has created a paradigm shift in the accessibility of communication. With it has come an increased demand for throughput, a trend that is likely to increase further in the future. A key aspect of these challenges is to develop low complexity algorithms and architectures that can take advantage of the nature of the wireless medium like broadcasting and physical layer cooperation. In this thesis, we consider several problems in the domain of low complexity coding, relaying and scheduling for wireless networks. We formulate the Pliable Index Coding problem that models a server trying to send one or more new messages over a noiseless broadcast channel to a set of clients that already have a subset of messages as side information. We show through theoretical bounds and algorithms, that it is possible to design short length codes, poly-logarithmic in the number of clients, to solve this problem. The length of the codes are exponentially better than those possible in a traditional index coding setup. Next, we consider several aspects of low complexity relaying in half-duplex diamond networks. In such networks, the source transmits information to the destination through $n$ half-duplex intermediate relays arranged in a single layer. The half-duplex nature of the relays implies that they can either be in a listening or transmitting state at any point of time. To achieve high rates, there is an additional complexity of optimizing the schedule (i.e. the relative time fractions) of the relaying states, which can be $2^n$ in number. Using approximate capacity expressions derived from the quantize-map-forward scheme for physical layer cooperation, we show that for networks with $n\leq 6$ relays, the optimal schedule has atmost $n+1$ active states. This is an exponential improvement over the possible $2^n$ active states in a schedule. We also show that it is possible to achieve at least half the capacity of such networks (approximately) by employing simple routing strategies that use only two relays and two scheduling states. These results imply that the complexity of relaying in half-duplex diamond networks can be significantly reduced by using fewer scheduling states or fewer relays without adversely affecting throughput. Both these results assume centralized processing of the channel state information of all the relays. We take the first steps in analyzing the performance of relaying schemes where each relay switches between listening and transmitting states randomly and optimizes their relative fractions using only local channel state information. We show that even with such simple scheduling, we can achieve a significant fraction of the capacity of the network. Next, we look at the dual problem of selecting the subset of relays of a given size that has the highest capacity for a general layered full-duplex relay network. We formulate this as an optimization problem and derive efficient approximation algorithms to solve them. We end the thesis with the design and implementation of a practical relaying scheme called QUILT. In it the relay opportunistically decodes or quantizes its received signal and transmits the resulting sequence in cooperation with the source. To keep the complexity of the system low, we use LDPC codes at the source, interleaving at the relays and belief propagation decoding at the destination. We evaluate our system through testbed experiments over WiFi

Distributed transmission schemes for wireless communication networks

In this thesis new techniques are presented to achieve performance enhancement in wireless cooperative networks. In particular, techniques to improve transmission rate and maximise end-to-end signal-to-noise ratio are described. An offset transmission scheme with full interference cancellation for a wireless cooperative network with frequency flat links and four relays is introduced. This method can asymptotically, as the size of the symbol block increases, achieve maximum transmission rate together with full cooperative diversity provided the destination node has multiple antennas. A novel full inter-relay interference cancellation method that also achieves asymptotically maximum rate and full cooperative diversity is then designed for which the destination node only requires a single antenna. Two- and four-relay selection schemes for wireless cooperative amplify and forward type networks are then studied in order to overcome the degradation of end-to-end bit error rate performance in single-relay selection networks when there are feedback errors in the relay to destination node links. Outage probability analysis for a four-relay selection scheme without interference is undertaken. Outage probability analysis of a full rate distributed transmission scheme with inter-relay interference is also studied for best single- and two-relay selection networks. The advantage of multi-relay selection when no interference occurs and when adjacent cell interference is present at the relay nodes is then shown theoretically. Simulation results for outage probability analysis are included which support the theoretical expressions. Finally, outage probability analysis of a cognitive amplify and forward type relay network with cooperation between certain secondary users, chosen by best single-, two- and four-relay selection is presented. The cognitive amplify and forward relays are assumed to exploit an underlay approach, which requires adherence to an interference constraint on the primary user. The relay selection scheme is performed either with a max−min strategy or one based on maximising exact end-to-end signal-to-noise ratio. The outage probability analyses are again confirmed by numerical evaluations

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks