Catalogue : Details

Simon Görtzen

Performance-Guaranteed Resource Allocation in Wireless Communication Systems

ISBN:

978-3-8440-3432-5

Series:

Kommunikationstechnik

Keywords:

Wireless Communication; Resource Allocation; Communication Systems

Type of publication:

Thesis

Language:

English

Pages:

190 pages

Figures:

26 figures

Weight:

282 g

Format:

21 x 14,8 cm

Bindung:

Paperback

Price:

48,80 € / 61,00 SFr

Published:

March 2015

Buy:

Download:

Available PDF-Files for this title:

You need the Adobe Reader, to open the files. Here you get help and information, for the download.

These files are not printable.


	Document		Document
	Type		PDF
	Costs		12,20 EUR
	Action		Purchase in obligation and display of file - 1.024 kB (1048069 Byte)
	Action		Purchase in obligation and download of file - 1.024 kB (1048069 Byte)


	Document		Table of contents
	Type		PDF
	Costs		free
	Action		Diplay of file - 61 kB (62885 Byte)
	Action		Download of file - 61 kB (62885 Byte)

User settings for registered users

You can change your address here or download your paid documents again.

User:	Not logged in.
Actions:	Login / Register Forgotten your password?

Recommendation:

You want to recommend this title?

Review copy

Here you can order a review copy.

Link

You want to link this page? Click here.

Abstract

Growing user demands in current fourth generation (4G) and future fifth generation (5G) wireless communication systems necessitate efficient resource utilization. This work is motivated by the optimization potential of 4G systems employing orthogonal frequency division multiple access (OFDMA) technology. It covers centralized single-cell instantaneous resource allocation problems with perfect channel state information and adaptive modulation. The exemplary problems analyzed in this work are weighted sum rate maximization, weighted sum power minimization, fairness-constrained rate maximization, and heterogeneous rate maximization.

We develop a general framework for resource allocation problems, which encompasses the common problem formulations found in the literature. We show that so-called rounding methods provide an approximation scheme based on linear relaxation. A general bound on the absolute performance loss of such methods is derived. This result yields a performance guarantee for the exemplary problems analyzed in this work. Under certain regularity conditions, the relative performance of rounding methods is shown to be asymptotically optimal as the number of subcarriers grows.