通信学报 ›› 2022, Vol. 43 ›› Issue (11): 35-43.doi: 10.11959/j.issn.1000-436x.2022206

• 学术论文 • 上一篇    下一篇

基于张量分析的欠定混合矩阵估计算法

马宝泽1,2,3, 李国军1,2, 向翠玲1,2, 徐阳1,2   

  1. 1 重庆邮电大学光电工程学院,重庆 400065
    2 重庆邮电大学超视距可信信息传输研究所,重庆 400065
    3 重庆邮电大学光电信息感测与传输技术重庆市重点实验室博士后科研工作站,重庆 400065
  • 修回日期:2022-10-09 出版日期:2022-11-25 发布日期:2022-11-01
  • 作者简介:马宝泽(1990− ),男,河北廊坊人,博士,重庆邮电大学讲师,主要研究方向为盲源分离、信道辨识、数据分析、深度学习等
    李国军(1978− ),男,四川资阳人,博士,重庆邮电大学教授、博士生导师,主要研究方向为复杂恶劣环境超视距无线通信与网络
    向翠玲(1996− ),女,重庆人,重庆邮电大学硕士生,主要研究方向为信道估计与均衡、短波建链技术
    徐阳(1998− ),男,湖南常德人,重庆邮电大学硕士生,主要研究方向为信道估计与均衡、自适应迭代算法
  • 基金资助:
    国家重点研发计划基金资助项目(2019YFC1511300);国家自然科学基金资助项目(62201113);重庆市重点研发计划基金资助项目(cstc2017zdcy-zdyfX0011)

Underdetermined mixing matrix estimation algorithm based on tensor analysis

Baoze MA1,2,3, Guojun LI1,2, Cuiling XIANG1,2, Yang XU1,2   

  1. 1 School of Electro-optics Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
    2 Lab of Beyond LOS Reliable Information Transmission, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
    3 Postdoctoral Research Workstation of Chongqing Key Laboratory of Optoelectronic Information Sensing and Transmission Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Revised:2022-10-09 Online:2022-11-25 Published:2022-11-01
  • Supported by:
    The National Key Research and Development Program of China(2019YFC1511300);The National Natural Science Foundation of China(62201113);Chongqing Key Research and Development Program(cstc2017zdcy-zdyfX0011)

摘要:

针对欠定矩阵估计中存在有效特征信息提取难和算法收敛速度慢等问题,提出基于张量分析的瞬时混合欠定矩阵估计算法,旨在克服信号稀疏性约束。该算法通过信号分割子段的自协方差构造对称三阶张量,并压缩为核张量降低数据规模,利用增强线性搜索技术加速交替最小二乘算法的收敛速度,将因子矩阵作为混合矩阵估计的测度,但分割子段数选取是个开放问题。仿真表明,所提算法在估计欠定混合矩阵时性能优于稀疏变换法和传统高阶统计量法。

关键词: 欠定矩阵估计, 对称张量, 分割策略, 自协方差矩阵

Abstract:

Aiming at the problems of difficult to extract effective feature information and the slow convergence speed of the underdetermined matrix estimation, an underdetermined matrix estimation algorithm of instantaneous mixtures based on tensor analysis was proposed to overcome the constraint of signal sparsity.In the proposed algorithm, the symmetric third-order tensor was constructed via the autocovariance matrix of segmentation sub-block, which was compressed into a kernel tensor to reduce the size of the data.An enhanced line search technology was applied to speed up the convergence of alternating least squares method, and the factor matrix was used as the measure of the mixing matrix estimation, but the selection of the number of segmentation sub-blocks was an open problem.Experimental results demonstrate that the proposed algorithm outperforms the sparse transformation method and the traditional high-order statistical method in handling the underdetermined mixing matrix estimation.

Key words: underdetermined matrix estimation, symmetric tensor, segmentation strategy, autocovariance matrix

中图分类号: 

No Suggested Reading articles found!