0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Analysis and Transceiver Design for the MIMO Broadcast Channel (Hardcover, 2013 ed.): Raphael Hunger Analysis and Transceiver Design for the MIMO Broadcast Channel (Hardcover, 2013 ed.)
Raphael Hunger
R2,691 Discovery Miles 26 910 Ships in 18 - 22 working days

This book deals with the optimization-based joint design of the transmit and receive filters in MIMO broadcast channel in which the user terminals may be equipped with several antenna elements. Furthermore, the maximum performance of the system in the high power regime as well as the set of all feasible quality-of-service requirements is analyzed. First, a fundamental duality is derived that holds between the MIMO broadcast channel and virtual MIMO multiple access channel. This duality construct allows for the efficient solution of problems originally posed in the broadcast channel in the dual domain where a possibly hidden convexity can often be revealed. On the basis of the established duality result, the gradient-projection algorithm is introduced as a tool to solve constrained optimization problems to global optimality under certain conditions. The gradient-projection tool is then applied to solving the weighted sum rate maximization problem which is a central optimization that arises in any network utility maximization. In the high power regime, a simple characterization of the obtained performance becomes possible due to the fact that the weighted sum rate utility converges to an affine asymptote in the logarithmic power domain. We find closed form expressions for these asymptotes which allows for a quantification of the asymptotic rate loss that linear transceivers have to face with respect to dirty paper coding. In the last part, we answer the fundamental question of feasibility in quality-of-service based optimizations with inelastic traffic that features strict delay constraints. Under the assumption of linear transceivers, not every set of quality-of-service requirements might be feasible making the power minimization problem with given lower bound constraints on the rate for example infeasible in these cases. We derive a complete description of the quality-of-service feasibility region for arbitrary channel matrices.

Analysis and Transceiver Design for the MIMO Broadcast Channel (Paperback, 2013 ed.): Raphael Hunger Analysis and Transceiver Design for the MIMO Broadcast Channel (Paperback, 2013 ed.)
Raphael Hunger
R3,483 Discovery Miles 34 830 Ships in 18 - 22 working days

This book deals with the optimization-based joint design of the transmit and receive filters in MIMO broadcast channel in which the user terminals may be equipped with several antenna elements. Furthermore, the maximum performance of the system in the high power regime as well as the set of all feasible quality-of-service requirements is analyzed. First, a fundamental duality is derived that holds between the MIMO broadcast channel and virtual MIMO multiple access channel. This duality construct allows for the efficient solution of problems originally posed in the broadcast channel in the dual domain where a possibly hidden convexity can often be revealed. On the basis of the established duality result, the gradient-projection algorithm is introduced as a tool to solve constrained optimization problems to global optimality under certain conditions. The gradient-projection tool is then applied to solving the weighted sum rate maximization problem which is a central optimization that arises in any network utility maximization. In the high power regime, a simple characterization of the obtained performance becomes possible due to the fact that the weighted sum rate utility converges to an affine asymptote in the logarithmic power domain. We find closed form expressions for these asymptotes which allows for a quantification of the asymptotic rate loss that linear transceivers have to face with respect to dirty paper coding. In the last part, we answer the fundamental question of feasibility in quality-of-service based optimizations with inelastic traffic that features strict delay constraints. Under the assumption of linear transceivers, not every set of quality-of-service requirements might be feasible making the power minimization problem with given lower bound constraints on the rate for example infeasible in these cases. We derive a complete description of the quality-of-service feasibility region for arbitrary channel matrices.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Disease Modelling and Public Health…
Arni S.R. Srinivasa Rao, Saumyadipta Pyne, … Hardcover R5,729 Discovery Miles 57 290
An Introduction to Queueing Theory…
U. Narayan Bhat Hardcover R3,784 Discovery Miles 37 840
Isogeometric Topology Optimization…
Jie Gao, Liang Gao, … Hardcover R3,989 Discovery Miles 39 890
Math Everywhere - Deterministic and…
G. Aletti, Martin Burger, … Hardcover R2,695 Discovery Miles 26 950
Surveys in Theoretical High Energy…
Raghavan Rangarajan, M. Sivakumar Hardcover R3,415 Discovery Miles 34 150
Stochastic Geometric Mechanics - CIB…
Sergio Albeverio, Ana Bela Cruzeiro, … Hardcover R2,969 R1,933 Discovery Miles 19 330
The Statistical Stability Phenomenon
Igor I. Gorban Hardcover R4,542 R3,471 Discovery Miles 34 710
Recent Trends in Computational Science…
M. Serdar Celebi Hardcover R3,070 Discovery Miles 30 700
Probability and Statistical Models…
Arjun K Gupta, Wei-Bin Zeng, … Hardcover R1,554 Discovery Miles 15 540
Engineering Applications of Discrete…
Xuewen Wang, Bo Li, … Hardcover R3,984 Discovery Miles 39 840

 

Partners