Computer Science – Information Theory
Scientific paper
2011-04-24
IEEE Transactions on Wireless Communications, vol. 10, no. 9, pp. 3012-3019, Sep. 2011
Computer Science
Information Theory
Scientific paper
10.1109/TWC.2011.072511.101916
We consider the quantization of a transmit beamforming vector in multiantenna channels and of a signature vector in code division multiple access (CDMA) systems. Assuming perfect channel knowledge, the receiver selects for a transmitter the vector that maximizes the performance from a random vector quantization (RVQ) codebook, which consists of independent isotropically distributed unit-norm vectors. The quantized vector is then relayed to the transmitter via a rate-limited feedback channel. The RVQ codebook requires an exhaustive search to locate the selected entry. To reduce the search complexity, we apply generalized Lloyd or $k$-dimensional (kd)-tree algorithms to organize RVQ entries into a tree. In examples shown, the search complexity of tree-structured (TS) RVQ can be a few orders of magnitude less than that of the unstructured RVQ for the same performance. We also derive the performance approximation for TS-RVQ in a large system limit, which predicts the performance of a moderate-size system very well.
Mamat Kritsada
Santipach Wiroonsak
No associations
LandOfFree
Tree-Structured Random Vector Quantization for Limited-Feedback Wireless Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tree-Structured Random Vector Quantization for Limited-Feedback Wireless Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree-Structured Random Vector Quantization for Limited-Feedback Wireless Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-623802