Joint detection with low computational complexity for hybrid TD-CDMA systems

N. Benvenuto, G. Sostrato
{"title":"Joint detection with low computational complexity for hybrid TD-CDMA systems","authors":"N. Benvenuto, G. Sostrato","doi":"10.1109/VETECF.1999.797208","DOIUrl":null,"url":null,"abstract":"In the hybrid multiple access technique TD/CDMA both multiple-access interference (MAI) and intersymbol interference (ISI) arise. In order to combat the overall interference (ISI+MAI), we propose two efficient joint detection schemes based respectively on zero-forcing and minimum-mean square error criteria. If M denotes the product of the number of active users U and the number of symbols per block N, the computational complexity has been reduced from O(M/sup 3/), of previously proposed schemes, to O(MU/sup 2/), where U/spl Lt/M. In fact, exploiting the asymptotic equivalence between finite-order Toeplitz matrices and circulant matrices, most computation can be carried out very efficiently through an extensive use of DFT and IDFT transforms. Performance results based on the UMTS standard under definition are presented.","PeriodicalId":355729,"journal":{"name":"Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECF.1999.797208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

In the hybrid multiple access technique TD/CDMA both multiple-access interference (MAI) and intersymbol interference (ISI) arise. In order to combat the overall interference (ISI+MAI), we propose two efficient joint detection schemes based respectively on zero-forcing and minimum-mean square error criteria. If M denotes the product of the number of active users U and the number of symbols per block N, the computational complexity has been reduced from O(M/sup 3/), of previously proposed schemes, to O(MU/sup 2/), where U/spl Lt/M. In fact, exploiting the asymptotic equivalence between finite-order Toeplitz matrices and circulant matrices, most computation can be carried out very efficiently through an extensive use of DFT and IDFT transforms. Performance results based on the UMTS standard under definition are presented.
TD-CDMA混合系统的低计算复杂度联合检测
在混合多址技术TD/CDMA中,会产生多址干扰和码间干扰。为了对抗整体干扰(ISI+MAI),我们提出了两种有效的联合检测方案,分别基于零强迫和最小均方误差准则。如果M表示活跃用户数量U与每块符号数N的乘积,则计算复杂度从先前提出的方案的O(M/sup 3/)降低到O(MU/sup 2/),其中U/spl Lt/M。事实上,利用有限阶Toeplitz矩阵和循环矩阵之间的渐近等价,通过广泛使用DFT和IDFT变换,可以非常有效地进行大多数计算。给出了定义下基于UMTS标准的性能结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信