Analysis and Transceiver Design for the MIMO Broadcast Channel

Nonfiction, Science & Nature, Technology, Telecommunications, Electronics
Cover of the book Analysis and Transceiver Design for the MIMO Broadcast Channel by Raphael Hunger, Springer Berlin Heidelberg
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Raphael Hunger ISBN: 9783642316920
Publisher: Springer Berlin Heidelberg Publication: August 29, 2012
Imprint: Springer Language: English
Author: Raphael Hunger
ISBN: 9783642316920
Publisher: Springer Berlin Heidelberg
Publication: August 29, 2012
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer Berlin Heidelberg

Cover of the book Sander/Müller, Meine Zahnarztpraxis – Ökonomie by Raphael Hunger
Cover of the book Einführung Mathematik Primarstufe - Arithmetik by Raphael Hunger
Cover of the book Ecology and Evolution of the Freshwater Mussels Unionoida by Raphael Hunger
Cover of the book Emission Factors of Carbonaceous Particulate Matter and Polycyclic Aromatic Hydrocarbons from Residential Solid Fuel Combustions by Raphael Hunger
Cover of the book Orbital Dynamics in the Gravitational Field of Small Bodies by Raphael Hunger
Cover of the book The Logic of Economic Reform in China by Raphael Hunger
Cover of the book The Menstrual Cycle and Its Disorders by Raphael Hunger
Cover of the book Lagerstättentechnik by Raphael Hunger
Cover of the book Integrated Systems of Meso-Meteorological and Chemical Transport Models by Raphael Hunger
Cover of the book Evolutionary Biology: Mechanisms and Trends by Raphael Hunger
Cover of the book Acute Leukemias by Raphael Hunger
Cover of the book Die hypothetische Einwilligung im Strafrecht by Raphael Hunger
Cover of the book Transplantation in Hematology and Oncology by Raphael Hunger
Cover of the book Self-Organized Arrays of Gold Nanoparticles by Raphael Hunger
Cover of the book Subsequent Agreements and Subsequent Practice in Domestic Courts by Raphael Hunger
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy