一种低复杂度的空时多用户迭代检测方案

杜娜; 徐大专

doi:10.3724/SP.J.1146.2007.01446

一种低复杂度的空时多用户迭代检测方案

doi: 10.3724/SP.J.1146.2007.01446

杜娜,
徐大专

基金项目:

移动通信国家重点实验室开放基金(N200502)和江苏省自然科学基金项目(BK2007192)资助课题

计量
- 文章访问数: 3084
- HTML全文浏览量: 102
- PDF下载量: 642
- 被引次数: 0
出版历程
- 收稿日期: 2007-09-11
- 修回日期: 2008-10-20
- 刊出日期: 2009-02-19

A Low Complexity Scheme for Space-Time Multi-user Iterative Detection

Du Na,
Xu Da-zhuan

摘要

摘要: 该文针对已有的对多用户空时编码系统的研究大都集中在多用户STTC和STBC方案，提出一种联合Turbo-BLAST的多用户空时方案。在接收端，针对传统的基于符号干扰抵消(Symbol-Level Cancellation, SLC)与检测的迭代接收机复杂度仍然较高的前提下，提出一种低复杂度的基于比特级干扰抵消(Bit-Level Cancellation, BLC)的迭代检测方案。该方案在检测部分将M-QAM调制符号分解成为一系列的BPSK符号的线性组合，采用比特级的干扰抵消。理论分析和仿真结果表明，该文提出的方案在保持BLAST高频谱效率的同时，与传统检测方案相比，在不降低系统性能的前提下，计算复杂度得到了很大程度的降低。
- 空时处理;Turbo-BLAST;迭代接收机;软干扰抵消;比特级干扰抵消
Abstract: In multiuser space-time coding system the research already made is almost focused on STTC and STBC scheme. For this reason, a multiuser space-time coding system combined with Turbo-BLAST scheme is proposed. The conventional iterative receiver with Symbol-Level Cancellation (SLC) and detection still has a high computation complexity, so a low complexity iterative receiver scheme with Bit-Level Cancellation (BLC) and detection is proposed which can performs bit-level cancellation by decomposing of an M-QAM constellation into a linear combination of binary constellations. Theoretic analysis and simulation results show that the proposed scheme has a low complexity with no performance degradation compared with conventional iterative receiver, while the high spectral efficiency of the system from BLAST is retained.

HTML全文

参考文献(1)

Moher M. An iterative multiuser decoder for near-capacitycommunications[J].IEEE Trans. on Commun.1998, 46(7):870-880[2]Lampe A and Huber B. On improved multiuser detectionwith iterated soft decision interference cancellation. In Proc.IEEE Int. Conf. Communications (ICC), Vancouver, BC,Canada, June 1999: 172-176.[3]Gamal H El and Geraniotis E. Iterative multiuser detectionfor coded CDMA signals in AWGN and fading channels[J].IEEE Journal on Selected Areas in Communications.2000,18(1):30-41[4]Berrou C.[J].Glavieux A, and Thitimajshima P. Near Shannonlimit error-correction coding and decoding: Turbo codes.Proc. 1993 Int. Conf. on Communications (ICC93), GenevaSwitzerland.1993,:-[5]Tuchler M, Koetter R, and Singer A C. Turbo equalization:Principles and new results[J].IEEE Trans. on Commn.2002,50(5):754-766[6]Wang X and Poor H V. Iterative (Turbo) soft interferencecancellation anddecoding for coded CDMA[J].IEEE Trans. onCommun.1999, 47(7):1046-1061[7]Lu B and Wang X. Iterative receivers for multiuserspace-time coding systems[J].IEEE J. Select. Areas inCommun.2000, 18(11):2322-2335[8]Choi J. Iterative receivers with bit-level cancellation anddetection for MIMO-BICM systems[J].IEEE Trans. on SignalProcessing.2005, 53(12):4568-4577[9]Tran N H, Nguyen H H, and Le-Ngoc T. Performance ofBICM-ID with signal space diversity. Proc. IEEE Int. Conf.on Communications-Communication Theory Symposium,ICC'06, Istanbul, Turkey, June 2006: 1712-1717.[10]Yang Y, Nguyen H H, and Shwedyk E. A low-complexityiterative receiver for multiuser space-time coding systems. InProc. Queen's Biennial Symposium on Communications(QBSC), May-June 2006: 26-30.[11]Wolniansky P W, Foschini G J, and Golden G D, et al..V-BLAST: An architecture for realizing very high data ratesover the rich scattering wireless channel. In Proc. URSI int.Symp. Signals, Systems, Electronics. Pisa, Italy, Sept.-Oct.1998: 295-300.[12]Foschini G J. Layered space-time architecture for wirelesscommunications in a fading environment when usingmulti-element antennas[J].Bell Labs Technical Journal.1996, 1(2):41-59[13]Sellathurai M and Haykin S. TURBO-BLAST for high-speedwireless communications, Wireless Comm. And NetworkConf. 2000, WCNC2000, Chicago, Sept. 2000: 315-320.[14]Sellathurai M and Haykin S. TURBO-BLAST for wirelesscommunications: Theory and experiments[J].IEEE Trans. onSignal Processing.2002, 50(10):2538-2546[15]Li Ping. Approximate MMSE-APP estimation for linearsystems with binary inputs[J].IEEE Commun. Letters.2005,9(2):172-174

施引文献

资源附件(0)

访问统计