arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.6398cs.ITmath.IT
收藏

用于最大分集和阵列增益的可变长度信道量化器

Variable-Length Channel Quantizers for Maximum Diversity and Array Gains

Erdem Koyuncu, Hamid Jafarkhani

摘要:

我们考虑一个$t \times 1$多天线衰落信道与量化的信道状态信息在发送端(CSIT)。我们的目标是最大限度地提高分集和阵列增益与符号出错率(SER)的系统性能。众所周知,对于波束成形和预编码策略,有限速率固定长度量化器(FLQ)不能实现全CSIT分集和阵列增益。在这项工作中,对于任何功能$f(P)\inω(1)$,我们构建可变长度量化器(VLQ),可以实现这些全CSIT增益率$1+(f(P) \log P)/P$和$1+f(P)/P^t$分别为波束成形和预编码策略,其中$P$是发射机的功率约束。我们还表明,这些利率是最好的可能高达$o(1)$乘数在其$P$依赖的条款。特别地,尽管全CSIT SER在任何(甚至无限)反馈速率下都是不可实现的,但是全CSIT分集和阵列增益可以利用每信道状态1比特的反馈速率渐进地实现。

英文摘要:

We consider a $t \times 1$ multiple-antenna fading channel with quantized channel state information at the transmitter (CSIT). Our goal is to maximize the diversity and array gains that are associated with the symbol error rate (SER) performance of the system. It is well-known that for both beamforming and precoding strategies, finite-rate fixed-length quantizers (FLQs) cannot achieve the full-CSIT diversity and array gains. In this work, for any function $f(P)\inω(1)$, we construct variable-length quantizers (VLQs) that can achieve these full-CSIT gains with rates $1+(f(P) \log P)/P$ and $1+f(P)/P^t$ for the beamforming and precoding strategies, respectively, where $P$ is the power constraint of the transmitter. We also show that these rates are the best possible up to $o(1)$ multipliers in their $P$-dependent terms. In particular, although the full-CSIT SER is not achievable at any (even infinite) feedback rate, the full-CSIT diversity and array gains can be achieved with a feedback rate of 1 bit per channel state asymptotically.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑