Delay is an important quality-of-service measure for the design of next-generation wireless networks. This dissertation considers the problem of delay-limited communication over block-fading channels, where the channel state information is available at the receiver but not at the transmitter. For this communication scenario, the difference between the ergodic capacity and the maximum achievable expected rate (the expected capacity) for coding over a finite number of coherent blocks represents a fundamental measure of the penalty incurred by the delay constraint.
This dissertation introduces a notion of worst-case expected-capacity loss. Focusing on the slow-fading scenario (one-block delay), the worst-case additive and multiplicative expected-capacity losses are precisely characterized for the point-to- point fading channel. Extension to the problem of writing on fading paper is also considered, where both the ergodic capacity and the additive expected-capacity loss over one-block delay are characterized to within one bit per channel use.
The problem with multiple-block delay is considerably more challenging. This dissertation presents two partial results. First, the expected capacity is precisely characterized for the point-to-point two-state fading channel with two-block delay. Second, the optimality of Gaussian superposition coding with indirect decoding is established for a two-parallel Gaussian broadcast channel with three receivers. Both results reveal some intrinsic complexity in characterizing the expected capacity with multiple-block delay.
| Identifer | oai:union.ndltd.org:tamu.edu/oai:repository.tamu.edu:1969.1/149339 |
| Date | 03 October 2013 |
| Creators | Yoo, Jae Won |
| Contributors | Liu, Tie, Singh, Chanan, Pfister, Henry D., Jiang, Anxiao |
| Source Sets | Texas A and M University |
| Language | English |
| Detected Language | English |
| Type | Thesis, text |
| Format | application/pdf |
Page generated in 0.0023 seconds