Concurrent Channel Probing and Data Transmission in Full-duplex MIMO Systems

An essential step for achieving multiplexing gain in MIMO downlink systems is to collect accurate channel state information (CSI) from the users. Traditionally, CSIs have to be collected before any data can be transmitted. Such a sequential scheme incurs a large feedback overhead, which substantially limits the multiplexing gain especially in a network with a large number of users. In this paper, we propose a novel approach to mitigate the feedback overhead by leveraging the recently developed Full-duplex radios. Our approach is based on the key observation that using Full-duplex radios, when the base-station (BS) is collecting CSI of one user through the uplink channel, it can use the downlink channel to simultaneously transmit data to other (non-interfering) users for which CSIs are already known. By allowing concurrent channel probing and data transmission, our scheme can potentially achieve a higher throughput compared to traditional schemes using Half-duplex radios. The new flexibility introduced by our scheme, however, also leads to fundamental challenges in achieving throughout optimal scheduling. In this paper, we make an initial effort to this important problem by considering a simplified group interference model. We develop a throughput optimal scheduling policy with complexity $O((N/I)^I)$, where $N$ is the number of users and $I$ is the number of user groups. To further reduce the complexity, we propose a greedy policy with complexity $O(N\log N)$ that not only achieves at least 2/3 of the optimal throughput region, but also outperforms any feasible Half-duplex solutions. We derive the throughput gain offered by Full-duplex under different system parameters and show the advantage of our algorithms through numerical studies.Comment: Technical repor

MSE-Based Transceiver Designs for Full-Duplex MIMO Cognitive Radios

We study two scenarios of full-duplex (FD) multiple-input-multiple-output cognitive radio networks: FD cognitive ad hoc networks and FD cognitive cellular networks. In FD cognitive ad hoc networks (also referred as interference channels), each pair of secondary users (SUs) operate in FD mode and communicate with each other within the service range of primary users (PUs). Each SU experiences not only self-interference but also interuser interference from all other SUs, and all SUs generate interference on PUs. We address two optimization problems: one is to minimize the sum of mean-squared errors (MSE) of all estimated symbols, and the other is to minimize the maximum per-SU MSE of estimated symbols, both of which are subject to power constraints at SUs and interference constraints projected to each PU. We show that these problems can be cast as a second-order cone programming, and joint design of transceiver matrices can be obtained through an iterative algorithm. Moreover, we show that the proposed algorithm is not only applicable to interference channels but also to FD cellular systems, in which a base station operating in FD mode simultaneously serves multiple uplink and downlink users, and it is shown to outperform HD scheme significantly