Blind adaptive interference suppression for near-par resistant CDMA

Michael L. Honig, U. Madhow, Sergio Verdu
{"title":"Blind adaptive interference suppression for near-par resistant CDMA","authors":"Michael L. Honig, U. Madhow, Sergio Verdu","doi":"10.1109/GLOCOM.1994.513548","DOIUrl":null,"url":null,"abstract":"Multiuser detection techniques can potentially solve the near-far problem in code-division multiple-access (CDMA) systems. However, these techniques often assume knowledge of system parameters, suck as signature waveforms for all users, and associated timing, which may not be available, or may be inconvenient to obtain in practice. Recently proposed adaptive minimum mean squared error (MMSE) detectors do not require knowledge of signature waveforms; however, these techniques require a training sequence for adaptation. Here we propose a blind multiuser linear detector which requires only knowledge of the desired user's signature sequence (and associated timing). In particular, it does not require the use of a training sequence. Our approach is to decompose the filter impulse response into the sum of two orthogonal components: the matched filter corresponding to the desired user plus an adaptive filter. We show that if the adaptive filter is chosen to minimize the energy (i.e., variance) of output samples at each symbol interval, then a scaled version of the MMSE detector is obtained. Based on this observation, a simple adaptive gradient algorithm is derived, and numerical examples are presented which illustrate its performance in a synchronous CDMA system.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"1264 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 IEEE GLOBECOM. Communications: The Global Bridge","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.1994.513548","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45

Abstract

Multiuser detection techniques can potentially solve the near-far problem in code-division multiple-access (CDMA) systems. However, these techniques often assume knowledge of system parameters, suck as signature waveforms for all users, and associated timing, which may not be available, or may be inconvenient to obtain in practice. Recently proposed adaptive minimum mean squared error (MMSE) detectors do not require knowledge of signature waveforms; however, these techniques require a training sequence for adaptation. Here we propose a blind multiuser linear detector which requires only knowledge of the desired user's signature sequence (and associated timing). In particular, it does not require the use of a training sequence. Our approach is to decompose the filter impulse response into the sum of two orthogonal components: the matched filter corresponding to the desired user plus an adaptive filter. We show that if the adaptive filter is chosen to minimize the energy (i.e., variance) of output samples at each symbol interval, then a scaled version of the MMSE detector is obtained. Based on this observation, a simple adaptive gradient algorithm is derived, and numerical examples are presented which illustrate its performance in a synchronous CDMA system.
近par抗CDMA盲自适应干扰抑制
多用户检测技术可以潜在地解决码分多址(CDMA)系统中的远近问题。然而,这些技术通常假设系统参数的知识,作为所有用户的签名波形,以及相关的时序,这些可能是不可用的,或者在实践中可能不方便获得。最近提出的自适应最小均方误差(MMSE)检测器不需要特征波形的知识;然而,这些技术需要一个适应的训练序列。在这里,我们提出了一种盲多用户线性检测器,它只需要知道期望用户的签名序列(以及相关的时序)。特别是,它不需要使用训练序列。我们的方法是将滤波器脉冲响应分解为两个正交分量的和:对应于期望用户的匹配滤波器加上自适应滤波器。我们表明,如果选择自适应滤波器来最小化输出样本在每个符号区间的能量(即方差),则可以获得缩放版本的MMSE检测器。在此基础上,推导了一种简单的自适应梯度算法,并给出了该算法在同步CDMA系统中的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信