IEEE 802.11n Wireless Local Area Networks (WLANs) employ Multiple-Input-Multiple-Output (MIMO), which significantly boosts the raw data rate at the Physical layer (PHY). But the potential of enhancing Medium Access Control (MAC) layer efficiencies by MIMO is still in its early stage and is the aim of the research in this thesis. Many existing works in this field mainly employ distributed MIMO spatial multiplexing/Multi-User Detection (MUD) technique and stream sharing to enable multiple simultaneous transmissions. Most works require synchronization among multiple transmissions, split the channel, and aim for single-hop networks. In this thesis, a novel Hybrid Carrier Sense (HCS) framework is proposed, mainly at the MAC layer to exploit the power of MIMO. HCS senses the channel availability jointly by the virtual carrier sense and physical carrier sense. HCS does not require synchronization among nodes; each node independently and locally determines when to start its transmission. HCS not only shares the channel, but also exploits the bi-directional handshakes of the wireless transmissions and increases the number of simultaneous stream transmissions. For a network with M antennas in each node, HCS can accommodate 2x(M-1) streams instead of M streams achieved by all other existing works. Moreover, HCS is aimed for multi-hop wireless ad hoc networks, in which the hidden terminal, exposed terminal, and deafness problems greatly degrade network performance. The HCS framework incorporates solutions to these problems. HCS is implemented in an NS2 network simulator and the performance evaluation shows that HCS significantly outperforms MIMO-enabled IEEE 802.11 (in which MIMO is only used for enhancing the raw data rate in the physical layer), resulting in higher aggregate throughput, packet delivery ratio and fairness in multi-hop wireless ad hoc networks. The HCS framework will be in wide use in the future generation of wireless networks and opens up more research possibilities. Some ideas in the HCS framework can be applied not only for MIMO, but also for many other techniques surveyed in this thesis; or we may combine them with HCS to further boost the network performance. / Thesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2013-10-15 21:46:15.983

The aim of this thesis is to develop and analyse single data set (SDS) detection algorithms that can utilise the advantages of widely-spaced (statistical) multiple-input multiple-output (MIMO) radar to increase their accuracy and performance. The algorithms make use of the observations obtained from multiple space-time adaptive processing (STAP) receivers and focus on covariance estimation and inversion to perform target detection. One of the main interferers for a Doppler radar has always been the radar’s own signal being reflected off the surroundings. The reflections of the transmitted waveforms from the ground and other stationary or slowly-moving objects in the background generate observations that can potentially raise false alarms. This creates the problem of searching for a target in both additive white Gaussian noise (AWGN) and highly-correlated (coloured) interference. Traditional STAP deals with the problem by using target-free training data to study this environment and build its characteristic covariance matrix. The data usually comes from range gates neighbouring the cell under test (CUT). In non-homogeneous or non-stationary environments, however, this training data may not reflect the statistics of the CUT accurately, which justifies the need to develop SDS methods for radar detection. The maximum likelihood estimation detector (MLED) and the generalised maximum likelihood estimation detector (GMLED) are two reduced-rank STAP algorithms that eliminate the need for training data when mapping the statistics of the background interference. The work in this thesis is largely based on these two algorithms. The first work derives the optimal maximum likelihood (ML) solution to the target detection problem when the MLED and GMLED are used in a multistatic radar scenario. This application assumes that the spatio-temporal Doppler frequencies produces in the individual bistatic STAP pairs of the MIMO system are ideally synchronised. Therefore the focus is on providing the multistatic outcome to the target detection problem. It is shown that the derived MIMO detectors possess the desirable constant false alarm rate (CFAR) property. Gaussian approximations to the statistics of the multistatic MLED and GMLED are derived in order to provide a more in-depth analysis of the algorithms. The viability of the theoretical models and their approximations are tested against a numerical simulation of the systems. The second work focuses on the synchronisation of the spatio-temporal Doppler frequency data from the individual bistatic STAP pairs in the multistatic MLED scenario. It expands the idea to a form that could be implemented in a practical radar scenario. To reduce the information shared between the bistatic STAP channels, a data compression method is proposed that extracts the significant contributions of the MLED likelihood function before transmission. To perform the inter-channel synchronisation, the Doppler frequency data is projected into the space of potential target velocities where the multistatic likelihood is formed. Based on the expected structure of the velocity likelihood in the presence of a target, a modification to the multistatic MLED is proposed. It is demonstrated through numerical simulations that the proposed modified algorithm performs better than the basic multistatic MLED while having the benefit of reducing the data exchange in the MIMO radar system.

Future 5G systems and beyond are expected to implement compact and versatile antennas in highly densifi ed millimetre-wave (MMW) wireless networks. This research emphasises on the realisation of 5G antennas provided with wide bandwidth, high gain, adaptable performance, preferably conformal implementation, and feasible bulk fabrication. Ka{band (26.5{40 GHz) is selected based on recent 5G standardisation, and novel antenna geometries are developed in this work on both rigid and flexible substrates by implementing advanced techniques of frequency reconfi guration, multiple-input-multiple- output (MIMO) assembly, as well as wideband and multiband antennas and arrays. Nove lMMW wideband antennas are presented for 5G and spatial diversity at the antenna front-ends is substantially improved by deploying wideband antennas in a MIMO topology for simultaneous multiple-channel communication. However, wideband operation is often associated with efficiency degradation, which demands a more versatile approach that allows the adaptable antenna to select the operating frequency. In this research, high performance recon figurable antennas are designed for frequency selection over Ka- {band. Also, an efficient and conformal antenna front-end solution is developed, which integrates both frequency recon guration and MIMO technology. Gain of the antenna is critically important for 5G systems to mitigate high propagation losses. Antenna design with both high gain and bandwidth is challenging as wideband antennas are traditionally gain-limited, while antenna arrays deliver high gain over a narrow bandwidth. An Enhanced Franklin array model is proposed in this thesis, which aggregates multiband response with high gain performance. Furthermore, novel flexible monopole antenna and array con gurations are realised to attain high gain profi le over the complete Ka{band. These proposed 5G antennas are anticipated as potential contribution in the progress towards the realisation of future wireless networks.

In wireless networks, the exponentially increasing demands for wireless services are encountered by the scarcity of the available radio resources. More bandwidth is required for not only accommodating the increasing number of users, but also to meet the requirements of the new services such as TV on demand, wireless gaming, and mobile Internet. Non-orthogonal multiple access (NOMA) has attracted a great attention recently due to its superior spectral efficiency (SE) over orthogonal multiple access and could play a vital role in improving the capacity of future networks. In particular, power based NOMA multiplexes the users in power domain via superposition coding (SC) and allows them to access the whole spectrum simultaneously while using successive interference cancellation (SIC) at the receiver side for signal detection. Since NOMA exploits the power domain for multiple access, power allocation is vital to achieve superior SE with NOMA. Resource allocation and its optimization are general methods used to further improve the NOMA based networks performance. In this thesis, the resource allocation in the downlink NOMA system is considered and optimized for different objective functions such as the sum rate and the energy efficiency (EE). In addition, the combination of NOMA and multiple antenna is considered using linear and non-linear precoders. In all the considered cases, suboptimal power allocation schemes are proposed and compared to the numerically obtained optimal one. Results confirm that NOMA outperforms OFDMA. It also support the effectiveness of the proposed schemes as compared to the existing ones and to the optimal one. The results also reveal that using multiple antennas with NOMA can significantly enhance the overall performance. Furthermore, a NOMA-multicell scenario is considered to test the proposed schemes under the effect of intercell interference (ICI). The results prove that the proposed methods effective as compared to the optimal one at a much lower complexity.

This thesis covers the investigation and application of continuous spatial models for multiple antenna signal processing. The use of antenna arrays for advanced sensing and communications systems has been facilitated by the rapid increase in the capabilities of digital signal processing systems. The wireless communications channel will vary across space as different signal paths from the same source combine and interfere. This creates a level of spatial diversity that can be exploited to improve the robustness and overall capacity of the wireless channel. Conventional approaches to using spatial diversity have centered on smart, adaptive antennas and spatial beam forming. Recently, the more general theory of multiple input, multiple output (MIMO) systems has been developed to utilise the independent spatial communication modes offered in a scattering environment.¶ Underlying any multiple antenna system is the basic physics of electromagnetic wave propagation. Whilst a MIMO system may present a set of discrete inputs and outputs, each antenna element must interact with the underlying continuous spatial field. Since an electromagnetic disturbance will propagate through space, the field at different positions in the space will be interrelated. In this way, each position in the field cannot assume an arbitrary independent value and the nature of wave propagation places a constraint on the allowable complexity of a wave-field over space. To take advantage of this underlying physical constraint, it is necessary to have a model that incorporates the continuous nature of the spatial wave-field. ¶This thesis investigates continuous spatial models for the wave-field. The wave equation constraint is introduced by considering a natural basis expansion for the space of physically valid wave-fields. This approach demonstrates that a wave-field over a finite spatial region has an effective finite dimensionality. The optimal basis for representing such a field is dependent on the shape of the region of interest and the angular power distribution of the incident field. By applying the continuous spatial model to the problem of direction of arrival estimation, it is shown that the spatial region occupied by the receiver places a fundamental limit on the number and accuracy with which sources can be resolved. Continuous spatial models also provide a parsimonious representation for modelling the spatial communications channel independent of specific antenna array configurations. The continuous spatial model is also applied to consider limits to the problem of wireless source direction and range localisation.

Design and analysis of random-like codes for various multiple-input and multiple-output communication systems are addressed in this work. Random-like codes have drawn significant interest because they offer capacity-achieving performance. We first consider the analysis and design of low-density parity-check (LDPC) codes for turbo multiuser detection in multipath CDMA channels. We develop techniques for computing the probability density function (pdf) of the extrinsic messages at the output of the soft-input soft-output (SISO) multiuser detectors as a function of the pdf of input extrinsic messages, user spreading codes, channel impulse responses, and signal-to-noise ratios. Using these techniques, we are able to accurately compute the thresholds for LDPC codes and design good irregular LDPC codes. We then apply the tools of density evolution with mixture Gaussian approximations to optimize irregular LDPC codes and to compute minimum operational signal-to-noise ratios for ergodic MIMO OFDM channels. In particular, the optimization is done for various MIMO OFDM system configurations which include different number of antennas, different channel models and different demodulation schemes. We also study the coding-spreading tradeoff in LDPC coded CDMA systems employing multiuser joint decoding. We solve the coding-spreading optimization based on the extrinsic information SNR evolution curves for the SISO multiuser detectors and the SISO LDPC decoders. Both single-cell and multi-cell scenarios will be considered. For each of these cases, we will characterize the extrinsic information for both finite-size systems and the so-called large systems where asymptotic performance results must be evoked. Finally, we consider the design optimization of irregular repeat accumulate (IRA) codes for MIMO communication systems employing iterative receivers. We present the density evolution-based procedure with Gaussian approximation for optimizing the IRA code ensemble. We adopt an approximation method based on linear programming to design an IRA code with the extrinsic information transfer (EXIT) chart matched to that of the soft MIMO demodulator.

In spread spectrum systems employing parity bit selected spreading sequences, parity bits generated from a linear block encoder are used to select a spreading code from a set of mutually orthogonal spreading sequences. In this thesis, turbo receivers for SS-PB systems are proposed and investigated. In the transmitter, data bits are rst convolutionally encoded before being fed into SS-PB modulator. In fact, the parity bit spreading code selection technique acts as an inner encoder in this system without allocating any transmit energy to the additional redundancy provided by this technique. The receiver implements a turbo processing by iteratively exchanging the soft information on coded bits between a SISO detector and a SISO decoder. In this system, detection is performed by incorporating the extrinsic information provided by the decoder in the last iteration into the received signal to calculate the likelihood of each detected bit in terms of LLR which is used as the input for a SISO decoder. In addition, SISO detectors are proposed for MC-CDMA and MIMO-CDMA systems that employ parity bit selected and permutation spreading. In the case of multiuser scenario, a turbo SISO multiuser detector is introduced for SS-PB systems for both synchronous and asynchronous channels. In such systems, MAI is estimated from the extrinsic information provided by the SISO channel decoder in the previous iteration. SISO multiuser detectors are also proposed for the case of multiple users in MC-CDMA and MIMO-CDMA systems when parity bit selected and permutation spreading are used. Simulations performed for all the proposed turbo receivers show a signi cant reduction in BER in AWGN and fading channels over multiple iterations.

Space-time coding techniques are widely used in multiple-input multiple-output communication systems to mitigate the effect of multipath fading in wireless channels. An important subset of space-time codes are linear dispersion (LD) codes, which are used for quasi-static Rayleigh flat fading channels when the channel state information (CSI) is only available at the receiver side. In this thesis, we propose a new receiver structure for LD codes. We suggest to use widely-linear minimum-mean-squared-error (WL-MMSE) estimates of the transmitted symbols in lieu of the sufficient statistics for maximum likelihood (ML) detection of these symbols. This structure offers both optimal and suboptimal operation modes. The structures of the proposed receivers in both modes are derived for general LD codes. As special cases, we study two important subsets of LD codes, namely orthogonal and quasi-orthogonal codes, and examine the performance of the proposed receivers for these codes.

Space-time coding techniques are widely used in multiple-input multiple-output communication systems to mitigate the effect of multipath fading in wireless channels. An important subset of space-time codes are linear dispersion (LD) codes, which are used for quasi-static Rayleigh flat fading channels when the channel state information (CSI) is only available at the receiver side. In this thesis, we propose a new receiver structure for LD codes. We suggest to use widely-linear minimum-mean-squared-error (WL-MMSE) estimates of the transmitted symbols in lieu of the sufficient statistics for maximum likelihood (ML) detection of these symbols. This structure offers both optimal and suboptimal operation modes. The structures of the proposed receivers in both modes are derived for general LD codes. As special cases, we study two important subsets of LD codes, namely orthogonal and quasi-orthogonal codes, and examine the performance of the proposed receivers for these codes.

The scarce and overpopulated radio spectrum is going to present a major barrier to the growth and development of future wireless networks. As such, spectrum sharing seems to be inevitable to accommodate the exploding demand for high data rate applications. A major challenge to realizing the potential advantages of spectrum sharing is interference management. This thesis deals with interference management techniques in noncooperative networks. In specific, interference alignment is used as a powerful technique for interference management. We use the degrees of freedom (DoF) as the figure of merit to evaluate the performance improvement due to the interference management schemes. This dissertation is organized in two parts. In the first part, we consider the K-user multiple input multiple output (MIMO) Gaussian interference channel (IC) with M antennas at each transmitter and N antennas at each receiver. This channel models the interaction between K transmitter-receiver pairs sharing the same spectrum for data communication. It is assumed that the channel coefficients are constant and are available at all nodes prior to data transmission. A new cooperative upper-bound on the DoF of this channel is developed which outperforms the known bounds. Also, a new achievable transmission scheme is provided based on the idea of interference alignment. It is shown that the achievable DoF meets the upper-bound when the number of users is greater than a certain threshold, and thus it reveals the channel DoF. In the second part, we consider communication over MIMO interference and X channels in a fast fading environment. It is assumed that the transmitters obtain the channel state information (CSI) after a finite delay which is greater than the coherence time of the channel. In other words, the CSI at the transmitters becomes outdated prior to being exploited for the current transmission. New transmission schemes are proposed which exploit the knowledge of the past CSI at the transmitters to retrospectively align interference in the subsequent channel uses. The proposed transmission schemes offer DoF gain compared to having no CSI at transmitters. The achievable DoF results are the best known results for these channels. Simple cooperative upper-bounds are developed to prove the tightness of our achievable results for some network configurations.