arrow
返回

Reduced Complexity Recursive Grassmannian Quantization

delete2020-01-01
delete7
delete
OA
AI
Š
Štefan Schwarz *
M
Markus Rupp
DOI:10.1109/LSP.2020.2969841delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We propose a novel recursive multi-stage approach to Grassmannian quantization. Compared to the commonly employed single-stage quantization, our method has the advantage of significantly decreasing the number of codebook searches required for quantization and, thus, reducing the complexity. On the downside, the multi-stage approach causes a slight rate-distortion degradation compared to single-stage quantization. We analyze the rate-distortion performance of the proposed recursive quantization approach, considering random vector quantization within the individual stages. We furthermore propose a bit-allocation optimization amongst the stages of the quantizer, given a constraint on the total number of quantization bits.
Keyword:
Grassmannian quantization
CSI feedback
random vector quantization

期刊

IEEE Signal Processing Magazine 封面图
IEEE Signal Processing Magazine
IF:
9.6
论文数:
1.1W
被引数:
1.7W

机构

T
Technische Universitat Wien
学者数:
1.3W
论文数: 1.1W
被引数: 21
引用论文

引用论文

err分享
err收藏
学者 查看更多内容