Cooperative communication HARDWARE, CHANNEL & PHY

协作通信，一本很经典的书, This edition first published 2010  2010 John Wiley & Sons, Ltd Book Content This book is essentially composed of four important subject areas related to cooperative communication systems. The first is a thorough taxonomy of said systems; the second the wireless channel; the third the physical layer, and the fourth the hardware realization. To this end, this book is split into six main chapters with the following contents: Chapter 1 contains a basic introduction to cooperative systems in general. We will then discuss typical application scenarios of cooperative techniques. Furthermore, we will discuss pros and cons of relaying and briefly quantify the capacity gains. We will also revise definitions and terminologies typically used in the context of cooperative systems. Finally, some historical background as well as key milestones are discussed. Chapter 2 deals with the wireless relaying and space–time channel. In contrast to traditional wireless systems, the wireless channel becomes part of the cooperative system, which has a profound impact on channel statistics, including temporal and correlation behaviors. We will hence discuss in detail the channel behavior of regenerative, transparent and distributed multiple-input multiple-output (MIMO) systems. This is pivotal in understanding and quantifying the performance of cooperative protocols at the physical (PHY) layer. Chapter 3 is dedicated to transparent PHY algorithms, and we will discuss and quantify the per- formance of different transparent architectures here. We will introduce some tools that facilitate the characterization of general architectures, which range from transparent relaying to transparent distributed space–time block and trellis coding, distributed multiplexing and beamforming. We will also dwell on issues pertaining to distributed system optimization, such as distributed power allocation and distributed relay selection. Chapter 4 deals solely with regenerative PHY algorithms and we will discuss and quantify the performance of a plethora of regenerative architectures here. We will mainly deal with differ- ent estimate-and-forward, decode-and-forward, compress-and-forward and soft-information relaying protocols, among others, with the aim of characterizing their performance. We will also dwell on recently emerged advanced topics related to distributed coding, such as distributed space–time block, trellis and turbo coding, distributed network-channel coding for single as well as multiple source–destination pairs, etc. Chapter 5 pertains to hardware and we will discuss how hardware facilitates as well as limits any implementation of cooperative relaying schemes. These limitations in hardware render, for example, the implementation of some of the recently proposed cooperative protocols infeasible. We will dis- cuss the implementation of transparent and regenerative schemes. We will also compare their costs and implementation complexities. We then derive complexities and power consumption of various relaying architectures based on 3G and 4G standards. Finally, we discuss some available hardware platforms and testbeds implementing relaying or distributed space–time processing techniques. Chapter 6 concludes this book by summarizing its contributions and also highlighting important open research directions and still-to-be-explored impact areas. We also describe how to include real- world impairments into the analysis, such as shadowing, interference, etc. Finally, some business issues are briefly dealt with. Acknowledgments The writing of this book w

convex optimization

Convex Optimization Stephen Boyd Department of Electrical Contents Preface xi 1 Introduction 1 1.1 Mathematical optimization . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Least-squares and linear programming . . . . . . . . . . . . . . . . . . 4 1.3 Convex optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.4 Nonlinear optimization . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.5 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.6 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 I Theory 19 2 Convex sets 21 2.1 Affine and convex sets . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 2.2 Some important examples . . . . . . . . . . . . . . . . . . . . . . . . . 27 2.3 Operations that preserve convexity . . . . . . . . . . . . . . . . . . . . 35 2.4 Generalized inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . 43 2.5 Separating and supporting hyperplanes . . . . . . . . . . . . . . . . . . 46 2.6 Dual cones and generalized inequalities . . . . . . . . . . . . . . . . . . 51 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60 3 Convex functions 67 3.1 Basic properties and examples . . . . . . . . . . . . . . . . . . . . . . 67 3.2 Operations that preserve convexity . . . . . . . . . . . . . . . . . . . . 79 3.3 The conjugate function . . . . . . . . . . . . . . . . . . . . . . . . . . 90 3.4 Quasiconvex functions . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 3.5 Log-concave and log-convex functions . . . . . . . . . . . . . . . . . . 104 3.6 Convexity with respect to generalized inequalities . . . . . . . . . . . . 108 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112 Exercises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113