首页> 外国专利> LOW COMPLEXITY DATA DETECTION USING FAST FOURIER TRANSFORM OF CHANNEL CORRELATION MATRIX

LOW COMPLEXITY DATA DETECTION USING FAST FOURIER TRANSFORM OF CHANNEL CORRELATION MATRIX

机译:基于通道相关矩阵的快速傅里叶变换的低复杂度数据检测

摘要

PROBLEM TO BE SOLVED: To simplify a receiving apparatus of multiplex communication by common frequency spectrum such as TDD/CDMA communication system.;SOLUTION: A combined signal is received via common frequency spectrum of a time division duplex (TDD) communication system using code division multiple access(CDMA). Each data signal experiences a similar channel response. The similar channel response is estimated. A matrix representing a channel of the data signals based on in part the estimated channel response is constructed. A spread data vector is determined based on in part a fast fourier transform (FFT) of a circulant version of the channel matrix. The spread data vector is despread to recover data from the received combined signal.;COPYRIGHT: (C)2007,JPO&INPIT
机译:解决的问题:为了简化通过诸如TDD / CDMA通信系统的公共频谱进行的多路通信的接收设备。解决方案:通过时分双工(TDD)通信系统的公共频谱使用码分来接收组合信号。多址(CDMA)。每个数据信号都会经历类似的信道响应。估计相似的信道响应。构建部分地基于估计的信道响应来表示数据信号的信道的矩阵。扩展数据矢量部分地基于信道矩阵的循环版本的快速傅立叶变换(FFT)来确定。对扩展的数据向量进行解扩,以从接收到的组合信号中恢复数据。版权所有:(C)2007,JPO&INPIT

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号