...
首页> 外文期刊>IEEE Transactions on Signal Processing >Bilinear approach to multiuser second-order statistics-based blind channel estimation
【24h】

Bilinear approach to multiuser second-order statistics-based blind channel estimation

机译:基于双线性方法的多用户基于二阶统计量的盲信道估计

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

摘要

We present a bilinear approach to multiple-input multiple-output (MIMO) blind channel estimation where products of the channel parameters are first estimated from the covariance of the received data. The channel parameters are then obtained as the dominant eigenvectors of the outer-product estimate. Necessary and sufficient identifiability conditions are presented for a single channel and extended to the multichannel case. It is found that this technique can identify the channel to within a subspace ambiguity, as long as the basis functions for the channel satisfy certain constraints, regardless of the left invertability of the channel matrix. One important requirement for identifiability is that the number of channel parameters is small compared with the channel length; advantageously, this is exactly the situation in which this algorithm has significantly lower complexity than competing (parametric, multiuser) blind algorithms. Simulations show that the technique is applicable in situations where typical identifiability conditions fail: common nulls, a single symbol-spaced channel, and more users than channels. These simulations are for the "almost flat" faded situation when the propagation delay spread is a fraction of the transmission pulse duration (as might be found in current TDMA systems). Comparisons are made, when possible, to a subspace method incorporating knowledge of the basis functions. The bilinear approach requires significantly less computation but performs better than the subspace method at low SNR, especially for multiple users.
机译:我们提出了一种用于多输入多输出(MIMO)盲信道估计的双线性方法,其中首先根据接收数据的协方差来估计信道参数的乘积。然后获得信道参数作为外部乘积估计的主要特征向量。为单通道提出了必要和充分的可识别性条件,并将其扩展到多通道情况。已经发现,只要信道的基函数满足某些约束,该技术就可以在子空间模糊度内识别信道,而与信道矩阵的左可逆性无关。可识别性的一项重要要求是,与通道长度相比,通道参数的数量要少。有利地,这恰好是这种算法比竞争性(参数,多用户)盲算法具有低得多的复杂度的情况。仿真表明,该技术适用于以下情况:典型的可识别性条件失败:常见的空值,单个用符号分隔的通道以及用户多于通道的用户。这些仿真适用于“几乎平坦”的衰落情况,此时传播延迟扩展是传输脉冲持续时间的一小部分(在当前的TDMA系统中可能会发现)。在可能的情况下,对包含基本功能知识的子空间方法进行比较。双线性方法所需的计算量明显减少,但在低SNR情况下比子空间方法要好,尤其是对于多个用户而言。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号