We study the achievable capacity regions of full-duplex links in the single- and multi-channel cases (in the latter case, the channels are assumed to be orthogonal -- e.g., OFDM). We present analytical results that characterize the uplink and downlink capacity region and efficient algorithms for computing rate pairs at the region's boundary. We also provide near-optimal and heuristic algorithms that "convexify" the capacity region when it is not convex. The convexified region corresponds to a combination of a few full-duplex rates (i.e., to time sharing between different operation modes). The algorithms can be used for theoretical characterization of the capacity region as well as for resource (time, power, and channel) allocation with the objective of maximizing the sum of the rates when one of them (uplink or downlink) must be guaranteed (e.g., due to QoS considerations). We numerically illustrate the capacity regions and the rate gains (compared to time division duplex) for various channel and cancellation scenarios. The analytical results provide insights into the properties of the full-duplex capacity region and are essential for future development of scheduling, channel allocation, and power control algorithms.
Full-duplex (FD) technology has been regarded as a promising solution to improve the spectral efficiency of the 5th generation (5G) wireless communication system. In this paper, we focus on a small-area radio system, where a FD base-station serves two half-duplex users simultaneously with one in the uplink and the other one in downlink direction. However, the self-interference (SI) and the inter-user interference (IUI) may largely degrade the system performance. Therefore we propose a simple but effective inter-user interference cancellation (IIC) strategy to cope with the IUI. This method is based on the fact that the downlink user observes a multiple access channel (MAC) of two user, the BS and the uplink user, respectively. Hence, the downlink user has an opportunity to remove the IUI according to the transmission rates and its received powers. Therefore, we call this method as multi-access channel IIC (MIIC). Then, we analyze the achievable rate region of the FD system with and without MIIC when taking the SI into consideration. To obtain the rate region, analytic power allocation strategies are derived. Simulation results show that, by applying the proposed power allocation strategies, the performance of FD system with MIIC is as good as the system without IUI under the 3GPP assumptions. From the Publisher: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition,this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition,Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity,and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition,this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further,the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm,a design technique,an application area,or a related topic. The chapters are not dependent on one another,so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally,the new edition offers a 25 increase over the first edition in the number of problems,giving the book 155 problems and over 900 exercises thatreinforcethe concepts the students are learning. 