The MIMO Iterative Waterfilling Algorithm

This paper considers the non-cooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. This problem has been widely studied in a number of works during the past decade for frequency-selective channels, and recently for the more general MIMO case, for which the state-of-the art results are valid only for nonsingular square channel matrices. Surprisingly, these results do not hold true when the channel matrices are rectangular and/or rank deficient matrices. The goal of this paper is to provide a complete characterization of the MIMO game for arbitrary channel matrices, in terms of conditions guaranteeing both the uniqueness of the Nash equilibrium and the convergence of asynchronous distributed iterative waterfilling algorithms. Our analysis hinges on new technical intermediate results, such as a new expression for the MIMO waterfilling projection valid (also) for singular matrices, a mean-value theorem for complex matrix-valued functions, and a general contraction theorem for the multiuser MIMO watefilling mapping valid for arbitrary channel matrices. The quite surprising result is that uniqueness/convergence conditions in the case of tall (possibly singular) channel matrices are more restrictive than those required in the case of (full rank) fat channel matrices. We also propose a modified game and algorithm with milder conditions for the uniqueness of the equilibrium and convergence, and virtually the same performance (in terms of Nash equilibria) of the original game.Comment: IEEE Transactions on Signal Processing (accepted

Sum-rate maximisation comparison using incremental approaches with different constraints

In this work, the problem of rate maximisation of multichannel systems is considered. Two greedy allocation approaches using power (GPA) and bit (GBA) loading schemes with a slight difference in design constraints that aiming to maximise the overall system throughput are compared. Both algorithms use incremental bit loading whereby, the GPA is designed with main interest of efficient power utilisation. Whereas, the GBA sacrifices power utilisation to another design issue of achieving an average bit error ratio (BER) less than the target BER. Simulation results shows that with GPA algorithm better throughput is gained over the GBA algorithm while the latter guaranteed less BER

Performance analysis and optimal cooperative cluster size for randomly distributed small cells under cloud RAN

One major advantage of cloud/centralized radio access network is the ease of implementation of multi-cell coordination mechanisms to improve the system spectrum efficiency (SE). Theoretically, large number of cooperative cells lead to a higher SE; however, it may also cause significant delay due to extra channel state information feedback and joint processing computational needs at the cloud data center, which is likely to result in performance degradation. In order to investigate the delay impact on the throughput gains, we divide the network into multiple clusters of cooperative small cells and formulate a throughput optimization problem. We model various delay factors and the sum-rate of the network as a function of cluster size, treating it as the main optimization variable. For our analysis, we consider both base stations' as well as users' geometric locations as random variables for both linear and planar network deployments. The output signal-to-interference-plus-noise ratio and ergodic sum-rate are derived based on the homogenous Poisson point processing model. The sum-rate optimization problem in terms of the cluster size is formulated and solved. Simulation results show that the proposed analytical framework can be utilized to accurately evaluate the performance of practical cloud-based small cell networks employing clustered cooperation

Semantically Secure Lattice Codes for Compound MIMO Channels

We consider compound multi-input multi-output (MIMO) wiretap channels where minimal channel state information at the transmitter (CSIT) is assumed. Code construction is given for the special case of isotropic mutual information, which serves as a conservative strategy for general cases. Using the flatness factor for MIMO channels, we propose lattice codes universally achieving the secrecy capacity of compound MIMO wiretap channels up to a constant gap (measured in nats) that is equal to the number of transmit antennas. The proposed approach improves upon existing works on secrecy coding for MIMO wiretap channels from an error probability perspective, and establishes information theoretic security (in fact semantic security). We also give an algebraic construction to reduce the code design complexity, as well as the decoding complexity of the legitimate receiver. Thanks to the algebraic structures of number fields and division algebras, our code construction for compound MIMO wiretap channels can be reduced to that for Gaussian wiretap channels, up to some additional gap to secrecy capacity.Comment: IEEE Trans. Information Theory, to appea

MIMO signal processing in offset-QAM based filter bank multicarrier systems

Next-generation communication systems have to comply with very strict requirements for increased flexibility in heterogeneous environments, high spectral efficiency, and agility of carrier aggregation. This fact motivates research in advanced multicarrier modulation (MCM) schemes, such as filter bank-based multicarrier (FBMC) modulation. This paper focuses on the offset quadrature amplitude modulation (OQAM)-based FBMC variant, known as FBMC/OQAM, which presents outstanding spectral efficiency and confinement in a number of channels and applications. Its special nature, however, generates a number of new signal processing challenges that are not present in other MCM schemes, notably, in orthogonal-frequency-division multiplexing (OFDM). In multiple-input multiple-output (MIMO) architectures, which are expected to play a primary role in future communication systems, these challenges are intensified, creating new interesting research problems and calling for new ideas and methods that are adapted to the particularities of the MIMO-FBMC/OQAM system. The goal of this paper is to focus on these signal processing problems and provide a concise yet comprehensive overview of the recent advances in this area. Open problems and associated directions for future research are also discussed.Peer ReviewedPostprint (author's final draft

Unified Framework for Multicarrier and Multiple Access based on Generalized Frequency Division Multiplexing

The advancements in wireless communications are the key-enablers of new applications with stringent requirements in low-latency, ultra-reliability, high data rate, high mobility, and massive connectivity. Diverse types of devices, ranging from tiny sensors to vehicles, with different capabilities need to be connected under various channel conditions. Thus, modern connectivity and network techniques at all layers are essential to overcome these challenges. In particular, the physical layer (PHY) transmission is required to achieve certain link reliability, data rate, and latency. In modern digital communications systems, the transmission is performed by means of a digital signal processing module that derives analog hardware. The performance of the analog part is influenced by the quality of the hardware and the baseband signal denoted as waveform. In most of the modern systems such as fifth generation (5G) and WiFi, orthogonal frequency division multiplexing (OFDM) is adopted as a favorite waveform due to its low-complexity advantages in terms of signal processing. However, OFDM requires strict requirements on hardware quality. Many devices are equipped with simplified analog hardware to reduce the cost. In this case, OFDM does not work properly as a result of its high peak-to-average power ratio (PAPR) and sensitivity to synchronization errors. To tackle these problems, many waveforms design have been recently proposed in the literature. Some of these designs are modified versions of OFDM or based on conventional single subcarrier. Moreover, multicarrier frameworks, such as generalized frequency division multiplexing (GFDM), have been proposed to realize varieties of conventional waveforms. Furthermore, recent studies show the potential of using non-conventional waveforms for increasing the link reliability with affordable complexity. Based on that, flexible waveforms and transmission techniques are necessary to adapt the system for different hardware and channel constraints in order to fulfill the applications requirements while optimizing the resources. The objective of this thesis is to provide a holistic view of waveforms and the related multiple access (MA) techniques to enable efficient study and evaluation of different approaches. First, the wireless communications system is reviewed with specific focus on the impact of hardware impairments and the wireless channel on the waveform design. Then, generalized model of waveforms and MA are presented highlighting various special cases. Finally, this work introduces low-complexity architectures for hardware implementation of flexible waveforms. Integrating such designs with software-defined radio (SDR) contributes to the development of practical real-time flexible PHY.:1 Introduction 1.1 Baseband transmission model 1.2 History of multicarrier systems 1.3 The state-of-the-art waveforms 1.4 Prior works related to GFDM 1.5 Objective and contributions 2 Fundamentals of Wireless Communications 2.1 Wireless communications system 2.2 RF transceiver 2.2.1 Digital-analogue conversion 2.2.2 QAM modulation 2.2.3 Effective channel 2.2.4 Hardware impairments 2.3 Waveform aspects 2.3.1 Single-carrier waveform 2.3.2 Multicarrier waveform 2.3.3 MIMO-Waveforms 2.3.4 Waveform performance metrics 2.4 Wireless Channel 2.4.1 Line-of-sight propagation 2.4.2 Multi path and fading process 2.4.3 General baseband statistical channel model 2.4.4 MIMO channel 2.5 Summary 3 Generic Block-based Waveforms 3.1 Block-based waveform formulation 3.1.1 Variable-rate multicarrier 3.1.2 General block-based multicarrier model 3.2 Waveform processing techniques 3.2.1 Linear and circular filtering 3.2.2 Windowing 3.3 Structured representation 3.3.1 Modulator 3.3.2 Demodulator 3.3.3 MIMO Waveform processing 3.4 Detection 3.4.1 Maximum-likelihood detection 3.4.2 Linear detection 3.4.3 Iterative Detection 3.4.4 Numerical example and insights 3.5 Summary 4 Generic Multiple Access Schemes 57 4.1 Basic multiple access and multiplexing schemes 4.1.1 Infrastructure network system model 4.1.2 Duplex schemes 4.1.3 Common multiplexing and multiple access schemes 4.2 General multicarrier-based multiple access 4.2.1 Design with fixed set of pulses 4.2.2 Computational model 4.2.3 Asynchronous multiple access 4.3 Summary 5 Time-Frequency Analyses of Multicarrier 5.1 General time-frequency representation 5.1.1 Block representation 5.1.2 Relation to Zak transform 5.2 Time-frequency spreading 5.3 Time-frequency block in LTV channel 5.3.1 Subcarrier and subsymbol numerology 5.3.2 Processing based on the time-domain signal 5.3.3 Processing based on the frequency-domain signal 5.3.4 Unified signal model 5.4 summary 6 Generalized waveforms based on time-frequency shifts 6.1 General time-frequency shift 6.1.1 Time-frequency shift design 6.1.2 Relation between the shifted pulses 6.2 Time-frequency shift in Gabor frame 6.2.1 Conventional GFDM 6.3 GFDM modulation 6.3.1 Filter bank representation 6.3.2 Block representation 6.3.3 GFDM matrix structure 6.3.4 GFDM demodulator 6.3.5 Alternative interpretation of GFDM 6.3.6 Orthogonal modulation and GFDM spreading 6.4 Summary 7 Modulation Framework: Architectures and Applications 7.1 Modem architectures 7.1.1 General modulation matrix structure 7.1.2 Run-time flexibility 7.1.3 Generic GFDM-based architecture 7.1.4 Flexible parallel multiplications architecture 7.1.5 MIMO waveform architecture 7.2 Extended GFDM framework 7.2.1 Architectures complexity and flexibility analysis 7.2.2 Number of multiplications 7.2.3 Hardware analysis 7.3 Applications of the extended GFDM framework 7.3.1 Generalized FDMA 7.3.2 Enchantment of OFDM system 7.4 Summary 7 Conclusions and Future work

Efficient DSP and Circuit Architectures for Massive MIMO: State-of-the-Art and Future Directions

Massive MIMO is a compelling wireless access concept that relies on the use of an excess number of base-station antennas, relative to the number of active terminals. This technology is a main component of 5G New Radio (NR) and addresses all important requirements of future wireless standards: a great capacity increase, the support of many simultaneous users, and improvement in energy efficiency. Massive MIMO requires the simultaneous processing of signals from many antenna chains, and computational operations on large matrices. The complexity of the digital processing has been viewed as a fundamental obstacle to the feasibility of Massive MIMO in the past. Recent advances on system-algorithm-hardware co-design have led to extremely energy-efficient implementations. These exploit opportunities in deeply-scaled silicon technologies and perform partly distributed processing to cope with the bottlenecks encountered in the interconnection of many signals. For example, prototype ASIC implementations have demonstrated zero-forcing precoding in real time at a 55 mW power consumption (20 MHz bandwidth, 128 antennas, multiplexing of 8 terminals). Coarse and even error-prone digital processing in the antenna paths permits a reduction of consumption with a factor of 2 to 5. This article summarizes the fundamental technical contributions to efficient digital signal processing for Massive MIMO. The opportunities and constraints on operating on low-complexity RF and analog hardware chains are clarified. It illustrates how terminals can benefit from improved energy efficiency. The status of technology and real-life prototypes discussed. Open challenges and directions for future research are suggested.Comment: submitted to IEEE transactions on signal processin