首页> 外文会议>2012 IEEE International Conference on Emerging Signal Processing Applications >Joint synchronization in the cdma reverse link using a two-bit window transpose domain filter
【24h】

Joint synchronization in the cdma reverse link using a two-bit window transpose domain filter

机译:使用两位窗口转置域滤波器在cdma反向链路中进行联合同步

获取原文
获取原文并翻译 | 示例

摘要

The reverse links of 3G cellular systems, which are based on code division multiple access (CDMA), require that the base station synchronizes with each user''s length N spreading code to despread and demodulate the information bits. A method of obtaining chip-level synchronization for all K users of the system simultaneously was recently presented [3]. The approach uses a modified transpose domain filter (TDF) implemented by a multistage Wiener filter (MWF), and the joint solution for all K users is implemented efficiently with a parallel bank of MWFs. The technique was shown to be effective in giving near 100% success in timing estimation for heavily loaded systems when Eb/N0 ≥ 0 dB, enough bits, M, e.g. M ≥ 16N, is used to obtain the estimate, and at least 20% of the chips in the spreading code are present. In this paper, we propose a modified TDF algorithm, in which processing occurs over a span of 2N chips vs. N chips. The proposed algorithm overcomes the limitations of the previous algorithm since the processing now spans two bits so the entire spreading sequence is always available for processing. We analyze the algorithm in AWGN and multipath, with known and unknown channels, and show that it achieves > 90% success even in multipath with just M = 2N bits and near 100% with M = 4N bits over a wide range of Eb/N0 and number of users K.
机译:基于码分多址(CDMA)的3G蜂窝系统的反向链路要求基站与每个用户的长度为N的扩展码进行同步,以对信息比特进行解扩和解调。最近提出了一种同时为系统的所有K个用户获得芯片级同步的方法[3]。该方法使用由多级维纳滤波器(MWF)实现的改进的转置域滤波器(TDF),并且通过并行的MWF组有效地实现了针对所有K用户的联合解决方案。当E b / N 0 ≥0 dB,足够的比特数M(例如)时,对于重载系统,该技术可有效地实现100%成功的时序估计。 M≥16N用于获得估计,并且扩频码中至少有20%的码片存在。在本文中,我们提出了一种改进的TDF算法,其中处理发生在2N个芯片对N个芯片的跨度上。所提出的算法克服了先前算法的局限性,因为处理现在跨越了两位,因此整个扩展序列始终可用于处理。我们分析了具有已知信道和未知信道的AWGN和多路径算法,并表明即使在仅E = 2N比特的多路径中,即使只有M = 2N比特的多路径,该算法也能实现> 90%的成功,而在M = 4N比特的多路径中,该算法也能实现近90%的成功> b / N 0 和用户数K。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号