CaltechTHESIS
  A Caltech Library Service

Broadband wireless broadcast channels : throughput, performance, and PAPR reduction

Citation

Sharif, Masoud (2006) Broadband wireless broadcast channels : throughput, performance, and PAPR reduction. Dissertation (Ph.D.), California Institute of Technology. http://resolver.caltech.edu/CaltechETD:etd-08292005-100440

Abstract

The ever-growing demand for higher rates and better quality of service in cellular systems has attracted many researchers to study techniques to boost the capacity and improve the performance of cellular systems. The main candidates to increase the capacity are to use multiple antennas or to increase the bandwidth. This thesis attempts to solve a few challenges regarding scheduling schemes in the downlink of cellular networks, and the implementation of modulation schemes suited for wideband channels. Downlink scheduling in cellular systems is known to be a bottleneck for future broadband wireless communications. Information theoretic results on broadcast channels provide the limits for the maximum achievable rates for each receiver and transmission schemes to achieve them. It turns out that the sum-rate capacity (sum-rate (or throughput) refers to the sum of the transmission rates to all users) of a multi-antenna broadcast channel heavily depends on the availability of channel state information (CSI) at the transmitter. Unfortunately, the dirty paper coding (DPC) scheme which achieves the capacity region is extremely computationally intensive especially in multiuser context. Furthermore, relying on the assumption that full CSI is available from all the n users may not be feasible in practice. In the first part of the thesis, we obtain the scaling law of the sum-rate capacity for large n and for a homogeneous fading MIMO (multiple input multiple output) broadcast channel, and then propose a simple scheme that only requires little (partial) CSI and yet achieves the same scaling law. Another important issue in downlink scheduling is to maintain fairness among users with different distances to the transmitter. Interestingly, we prove that our scheduling scheme becomes fair provided that the number of transmit antennas is large enough. We further analyze the impact of using a throughput optimal scheduling on the delay in sending information to the users. Finally, we look into the problem of differentiated rate scheduling in which different users demand for different sets of rates. We obtain explicit scheduling schemes to achieve the rate constraints. In the second part of the thesis, we focus on orthogonal frequency division multiplexing (OFDM), which is the most promising technique for broadband wireless channels (mainly due to its simplicity of channel equalization even in a severe multipath fading environment). The main disadvantage of this modulation, however, is its high peak to mean envelope power ratio (PMEPR). This is due to the fact that the OFDM signal consists of many (say n) harmonically related subcarriers which may, in the worst-case, add up constructively and lead to large peaks (of order n) in the signal. Despite this worst-case performance, we show that when each subcarrier is chosen from some given constellation, the PMEPR behaves like log{n} almost surely, for large n. This implies that there exist almost full-rate codes with a PMEPR of log{n} for large n. We further prove that there exist codes with rate not vanishing to zero such that the PMEPR is less than a constant (independent of n). We also construct high rate codes with a guaranteed PMEPR of log{n}. Simulation results show that in a system with 128 subcarriers and using 16QAM, the PMEPR of a multicarrier signal can be reduced from 13.5 to 3.4 which is within 1.6dB of the PMEPR of a single carrier system.

Item Type:Thesis (Dissertation (Ph.D.))
Subject Keywords:downlink scheduling; fairness; multiple antenna; peak to average power ratio; sum-rate
Degree Grantor:California Institute of Technology
Division:Engineering and Applied Science
Major Option:Electrical Engineering
Awards:Charles and Ellen Wilts Prize, 2006
Thesis Availability:Public (worldwide access)
Research Advisor(s):
  • Hassibi, Babak
Thesis Committee:
  • Hassibi, Babak (chair)
  • Divsalar, Dariush
  • Vaidyanathan, P. P.
  • McEliece, Robert J.
  • Low, Steven H.
Defense Date:12 August 2005
Author Email:masoud (AT) systems.caltech.edu
Record Number:CaltechETD:etd-08292005-100440
Persistent URL:http://resolver.caltech.edu/CaltechETD:etd-08292005-100440
Default Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:3264
Collection:CaltechTHESIS
Deposited By: Imported from ETD-db
Deposited On:30 Aug 2005
Last Modified:26 Dec 2012 02:58

Thesis Files

[img]
Preview
PDF (thesis.pdf) - Final Version
See Usage Policy.

2253Kb

Repository Staff Only: item control page