arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv quant-ph/0205138quant-ph
收藏

基于量子计数的多用户检测错误概率的紧界

A Tight Bound for Probability of Error for Quantum Counting Based Multiuser Detection

Sandor Imre, Ferenc Balazs

摘要:

未来的有线和无线通信系统将采用纯的或组合的码分多址(CDMA)技术,例如在欧洲3G移动UMTS或电力线电信系统中,而且若干4G提议包括例如多载波(MC)CDMA。以往的研究揭示了在窄带IS-95 CDMA系统中广泛采用的单用户检测器(SUD)的缺点,并迫使开发合适的多用户检测方案以提高抗干扰的效率。然而,目前只有次优的解决方案,因为最佳检测器的复杂性相当高。可能的接收器技术之一可以是量子辅助计算设备,其允许计算中的高级并行性。第一批商用设备预计将在未来几年内推出,这符合3G和4G系统的广告。本文分析了一种基于量子计算的量子多用户检测(QMUD)算法在静态和动态环境下的误码率,给出了严格的上界,该算法采用量子计数算法,给出了最优解。

英文摘要:

Future wired and wireless communication systems will employ pure or combined Code Division Multiple Access (CDMA) technique, such as in the European 3G mobile UMTS or Power Line Telecommunication system, but also several 4G proposal includes e.g. multi carrier (MC) CDMA. Former examinations carried out the drawbacks of single user detectors (SUD), which are widely employed in narrowband IS-95 CDMA systems, and forced to develop suitable multiuser detection schemes to increase the efficiency against interference. However, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. One of the possible receiver technologies can be the quantum assisted computing devices which allows high level parallelism in computation. The first commercial devices are estimated for the next years, which meets the advert of 3G and 4G systems. In this paper we analyze the error probability and give tight bounds in a static and dynamically changing environment for a novel quantum computation based Quantum Multiuser detection (QMUD) algorithm, employing quantum counting algorithm, which provides optimal solution.

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

↑