.png){kind=icon}
返回
Tree-Structured Random Vector Quantization for Limited-Feedback Wireless Channels
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2011.072511.101916.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Signature quantization
tree-structured codebook
CDMA
MIMO
random vector quantization
generalized Lloyd algorithm
kd tree
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
Numerical Analysis of Thermal Stress for a Stack of Planar Solid Oxide Fuel Cells平板固体氧化物燃料电池堆热应力的数值分析.png)
EnergiesOAAI
EnergiesIF0
OAAI分享收藏分享收藏
查看更多内容