This thesis proposes a distributed beamforming technique in wireless networks with half-duplex amplify-and-forward relays. With full channel state information, it has been shown that transmit beamforming is able to achieve significant diversity and coding gain. However, it takes large amount of overhead. First, we adopt the Generalized Lloyd Algorithm to design codebooks which minimize average SNR, and reduce the feedback rate by quantizing the channel state information. Furthermore, we utilize the correlation property of time-varying channels to compress the size of feedback message required to accomplish distributed beamforming. We model time-varying channels as a first-order finite-state Markov chain, namely the emph{channel state Markov chain}. Then, we propose two methods to compress the feedback bits according to the property of the transition probabilities among different channel states. One method is to compress the feedback by discarding some channel states which is less likely to be transited given current state. In the other method, we reserve all channel states and adopt Huffman coding to compress the feedback bits based on the transition probabilities. Simulations also show that distributed beamforming with compressed feedback performs closely to the beamforming with infinite feedback.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0827110-170425 |
| Date | 27 August 2010 |
| Creators | Jian, Miao-Fen |
| Contributors | Tsang-Yi Wang, Wan-Jen Huang, Chih-Peng Li, Chao-Kai Wen |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0827110-170425 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0051 seconds