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

一类似然上升搜索多用户检测器:比特出错率的上界和渐近多用户效率的下界

A Family of Likelihood Ascent Search Multiuser Detectors: an Upper Bound of Bit Error Rate and a Lower Bound of Asymptotic Multiuser Efficiency

Yi Sun

摘要:

本文分析了一类似然上升搜索(LAS)多用户检测器的误码性能。任何LAS检测器的BER的上限是通过与最坏的初始检测器的不动点区域的边界。Verdu发展的不可分解误差的概念被用来收紧上界。在一个特殊的情况下,上界被降低到所有的局部最大似然检测器。其上界与Verdu得到的最佳检测器的上界相当。渐近多用户效率(AME)的下界,然后得到。它示出,有非平凡的CDMA信道,使得LAS检测器可以实现单位AME,而不管用户数。AME下限提供了一种用于进一步寻找用于频谱和功率高效CDMA的良好的扩频序列和功率分布集合的手段。

英文摘要:

In this paper, the bit error performance of a family of likelihood ascent search (LAS) multiuser detectors is analyzed. An upper bound on the BER of any LAS detector is obtained by bounding the fixed point region with the worst initial detector. The concept of indecomposable errors developed by Verdu is applied to tighten the upper bound. In a special instance, the upper bound is reduced to that for all the local maximum likelihood detectors. The upper bound is comparable with that of the optimum detector obtained by Verdu. A lower bound on the asymptotic multiuser efficiency (AME) is then obtained. It is shown that there are nontrivial CDMA channels such that a LAS detector can achieve unit AME regardless of user number. The AME lower bound provides a means for further seeking a good set of spreading sequences and power distribution for spectral and power efficient CDMA.

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

↑