arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0509049cs.ITmath.IT
收藏

CDMA下行链路中接收机数目较少时的可分配信息速率

On the Achievable Information Rates of CDMA Downlink with Trivial Receivers

Ori Shental, Ido Kanter, Anthony J. Weiss

摘要:

介绍了一种在严格的接收复杂度约束下工作的有噪CDMA下行信道。根据这一约束,通过直接对信道的匹配滤波器输出执行硬判决而获得的检测比特必须与传输的二进制输入相同。这种允许使用最简单的接收机方案的信道设置似乎毫无价值,无论如何都不可能进行可靠的通信。然而,最近这种通信模式被证明在无噪声信道的情况下产生有价值的信息速率。这一发现要求调查这个有吸引力的复杂性约束的传输方案,更实际的噪声信道的情况下。通过采用著名的Hopfield模型的亚稳态的统计力学的概念,它证明了在有界噪声假设下,这种复杂度约束的CDMA信道产生了一个非平凡的香农理论容量,严格的分析和证实使用有限大小的信道模拟。对于无界噪声的信道的中断容量的解决和具体描述流行的加性高斯白噪声。

英文摘要:

A noisy CDMA downlink channel operating under a strict complexity constraint on the receiver is introduced. According to this constraint, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. This channel setting, allowing the use of the simplest receiver scheme, seems to be worthless, making reliable communication at any rate impossible. However, recently this communication paradigm was shown to yield valuable information rates in the case of a noiseless channel. This finding calls for the investigation of this attractive complexity-constrained transmission scheme for the more practical noisy channel case. By adopting the statistical mechanics notion of metastable states of the renowned Hopfield model, it is proved that under a bounded noise assumption such complexity-constrained CDMA channel gives rise to a non-trivial Shannon-theoretic capacity, rigorously analyzed and corroborated using finite-size channel simulations. For unbounded noise the channel's outage capacity is addressed and specifically described for the popular additive white Gaussian noise.

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

↑