Fast and reliable detection of incumbent users in cognitive radios

Fast and reliable Spectrum Sensing (SS) plays a crucial role in the cognitive radio (CR) technology in order to prevent unwanted interference to the primary users (PU) and to reliably and quickly detect the white spaces in the spectrum for opportunistic access by the secondary users (SU). Spectrum Sensing must often be performed in the absence of information such as PU signaling scheme, noise level and channel fading coefficients. While these parameters can be estimated in the SU, estimation errors significantly deteriorates the performance of SS techniques. In this thesis, we introduce and evaluate the performance of two novel blind spectrum sensing algorithms which do not rely on knowledge of these parameters. The first is a SS technique for signaling schemes which introduce controlled intersymbol interference in the transmitter. The second is for cases when the receiver of the SU is equipped with a multiantenna system. This approach exploits the path correlation among the signals received at different antennas. Next we analyze the performance of Spectrum Monitoring (SM), an new technique which allows the SU to detect the presence of the PU using its own receiver statistics. In contrast to SS, with SM, the SU does not need to interrupt its own transmission in order to detect the presence of the PU. We carefully construct the decision statistics for SM and evaluate its performance. The performance of a hybrid SM/SS system shows a significant improvement over SS alone

On Dependable Wireless Communications through Multi-Connectivity

The realization of wireless ultra-reliable low-latency communications (URLLC) is one of the key challenges of the fifth generation (5G) of mobile communications systems and beyond. Ensuring ultra-high reliability together with a latency in the (sub-)millisecond range is expected to enable self-driving cars, wireless factory automation, and the Tactile Internet. In wireless communications, reliability is usually only considered as percentage of successful packet delivery, aiming for 1 − 10⁻⁵ up to 1 − 10⁻⁹ in URLLC

Accelerating the simulation of wireless cellular systems

The simulation of comprehensive models for cellular wireless systems poses a computational burden of great proportions. When a sub-model for transmitter power level control is included in the simulation, a continuous process in discrete-time is introduced, requiring traditional execution to advance in small, regular time-steps. to accelerate these simulations, we propose the use of interval jumping, a novel technique which allows time to progress in adaptive, irregularly-sized jumps in time. The foundations for this mechanism are laid out in the light of the simulation of a complex simulation model which includes teletraffic, radio propagation, channel allocation, transmitter power control, and user mobility. We demonstrate the performance of this method through the use of sequential and parallel simulation.;Approaching the problem of accelerating the simulation of wireless systems from a different angle, we also identify a second important performance bottleneck. Calculations for interference computation, which may be carried out hundreds of times for each second of simulated time, require the evaluation of O(N2) interactions, for a system with N transmitter/receiver pairs. In order to provide a computationally cheaper and more scalable alternative to these operations, we study the applicability of an N-body algorithm, which brings time complexity down to O(N log N)

Soft-decision equalization techniques for frequency selective MIMO channels

Multi-input multi-output (MIMO) technology is an emerging solution for high data rate wireless communications. We develop soft-decision based equalization techniques for frequency selective MIMO channels in the quest for low-complexity equalizers with BER performance competitive to that of ML sequence detection. We first propose soft decision equalization (SDE), and demonstrate that decision feedback equalization (DFE) based on soft-decisions, expressed via the posterior probabilities associated with feedback symbols, is able to outperform hard-decision DFE, with a low computational cost that is polynomial in the number of symbols to be recovered, and linear in the signal constellation size. Building upon the probabilistic data association (PDA) multiuser detector, we present two new MIMO equalization solutions to handle the distinctive channel memory. With their low complexity, simple implementations, and impressive near-optimum performance offered by iterative soft-decision processing, the proposed SDE methods are attractive candidates to deliver efficient reception solutions to practical high-capacity MIMO systems. Motivated by the need for low-complexity receiver processing, we further present an alternative low-complexity soft-decision equalization approach for frequency selective MIMO communication systems. With the help of iterative processing, two detection and estimation schemes based on second-order statistics are harmoniously put together to yield a two-part receiver structure: local multiuser detection (MUD) using soft-decision Probabilistic Data Association (PDA) detection, and dynamic noise-interference tracking using Kalman filtering. The proposed Kalman-PDA detector performs local MUD within a sub-block of the received data instead of over the entire data set, to reduce the computational load. At the same time, all the inter-ference affecting the local sub-block, including both multiple access and inter-symbol interference, is properly modeled as the state vector of a linear system, and dynamically tracked by Kalman filtering. Two types of Kalman filters are designed, both of which are able to track an finite impulse response (FIR) MIMO channel of any memory length. The overall algorithms enjoy low complexity that is only polynomial in the number of information-bearing bits to be detected, regardless of the data block size. Furthermore, we introduce two optional performance-enhancing techniques: cross- layer automatic repeat request (ARQ) for uncoded systems and code-aided method for coded systems. We take Kalman-PDA as an example, and show via simulations that both techniques can render error performance that is better than Kalman-PDA alone and competitive to sphere decoding. At last, we consider the case that channel state information (CSI) is not perfectly known to the receiver, and present an iterative channel estimation algorithm. Simulations show that the performance of SDE with channel estimation approaches that of SDE with perfect CSI

Interference Mitigation in Wireless Communications

The primary objective of this thesis is to design advanced interference resilient schemes for asynchronous slow frequency hopping wireless personal area networks (FH-WPAN) and time division multiple access (TDMA) cellular systems in interference dominant environments. We also propose an interference-resilient power allocation method for multiple-input-multiple-output (MIMO) systems. For asynchronous FH-WPANs in the presence of frequent packet collisions, we propose a single antenna interference canceling dual decision feedback (IC-DDF) receiver based on joint maximum likelihood (ML) detection and recursive least squares (RLS) channel estimation. For the system level performance evaluation, we propose a novel geometric method that combines bit error rate (BER) and the spatial distribution of the traffic load of CCI for the computation of packet error rate (PER). We also derived the probabilities of packet collision in multiple asynchronous FH-WPANs with uniform and nonuniform traffic patterns. For the design of TDMA receivers resilient to CCI in frequency selective channels, we propose a soft output joint detection interference rejection combining delayed decision feedback sequence estimation (JD IRC-DDFSE) scheme. In the proposed scheme, IRC suppresses the CCI, while DDFSE equalizes ISI with reduced complexity. Also, the soft outputs are generated from IRC-DDFSE decision metric to improve the performance of iterative or non-iterative type soft-input outer code decoders. For the design of interference resilient power allocation scheme in MIMO systems, we investigate an adaptive power allocation method using subset antenna transmission (SAT) techniques. Motivated by the observation of capacity imbalance among the multiple parallel sub-channels, the SAT method achieves high spectral efficiency by allocating power on a selected transmit antenna subset. For 4 x 4 V-BLAST MIMO systems, the proposed scheme with SAT showed analogous results. Adaptive modulation schemes combined with the proposed method increase the capacity gains. From a feasibility viewpoint, the proposed method is a practical solution to CCI-limited MIMO systems since it does not require the channel state information (CSI) of CCI.Ph.D.Committee Chair: Professor Gordon L. StBe

Role of Interference and Computational Complexity in Modern Wireless Networks: Analysis, Optimization, and Design

Owing to the popularity of smartphones, the recent widespread adoption of wireless broadband has resulted in a tremendous growth in the volume of mobile data traffic, and this growth is projected to continue unabated. In order to meet the needs of future systems, several novel technologies have been proposed, including cooperative communications, cloud radio access networks (RANs) and very densely deployed small-cell networks. For these novel networks, both interference and the limited availability of computational resources play a very important role. Therefore, the accurate modeling and analysis of interference and computation is essential to the understanding of these networks, and an enabler for more efficient design.;This dissertation focuses on four aspects of modern wireless networks: (1) Modeling and analysis of interference in single-hop wireless networks, (2) Characterizing the tradeoffs between the communication performance of wireless transmission and the computational load on the systems used to process such transmissions, (3) The optimization of wireless multiple-access networks when using cost functions that are based on the analytical findings in this dissertation, and (4) The analysis and optimization of multi-hop networks, which may optionally employ forms of cooperative communication.;The study of interference in single-hop wireless networks proceeds by assuming that the random locations of the interferers are drawn from a point process and possibly constrained to a finite area. Both the information-bearing and interfering signals propagate over channels that are subject to path loss, shadowing, and fading. A flexible model for fading, based on the Nakagami distribution, is used, though specific examples are provided for Rayleigh fading. The analysis is broken down into multiple steps, involving subsequent averaging of the performance metrics over the fading, the shadowing, and the location of the interferers with the aim to distinguish the effect of these mechanisms that operate over different time scales. The analysis is extended to accommodate diversity reception, which is important for the understanding of cooperative systems that combine transmissions that originate from different locations. Furthermore, the role of spatial correlation is considered, which provides insight into how the performance in one location is related to the performance in another location.;While it is now generally understood how to communicate close to the fundamental limits implied by information theory, operating close to the fundamental performance bounds is costly in terms of the computational complexity required to receive the signal. This dissertation provides a framework for understanding the tradeoffs between communication performance and the imposed complexity based on how close a system operates to the performance bounds, and it allows to accurately estimate the required data processing resources of a network under a given performance constraint. The framework is applied to Cloud-RAN, which is a new cellular architecture that moves the bulk of the signal processing away from the base stations (BSs) and towards a centralized computing cloud. The analysis developed in this part of the dissertation helps to illuminate the benefits of pooling computing assets when decoding multiple uplink signals in the cloud. Building upon these results, new approaches for wireless resource allocation are proposed, which unlike previous approaches, are aware of the computing limitations of the network.;By leveraging the accurate expressions that characterize performance in the presence of interference and fading, a methodology is described for optimizing wireless multiple-access networks. The focus is on frequency hopping (FH) systems, which are already widely used in military systems, and are becoming more common in commercial systems. The optimization determines the best combination of modulation parameters (such as the modulation index for continuous-phase frequency-shift keying), number of hopping channels, and code rate. In addition, it accounts for the adjacent-channel interference (ACI) and determines how much of the signal spectrum should lie within the operating band of each channel, and how much can be allowed to splatter into adjacent channels.;The last part of this dissertation contemplates networks that involve multi-hop communications. Building on the analytical framework developed in early parts of this dissertation, the performance of such networks is analyzed in the presence of interference and fading, and it is introduced a novel paradigm for a rapid performance assessment of routing protocols. Such networks may involve cooperative communications, and the particular cooperative protocol studied here allows the same packet to be transmitted simultaneously by multiple transmitters and diversity combined at the receiver. The dynamics of how the cooperative protocol evolves over time is described through an absorbing Markov chain, and the analysis is able to efficiently capture the interference that arises as packets are periodically injected into the network by a common source, the temporal correlation among these packets and their interdependence