恒模PARAFAC分解CRB及拟合算法

刘旭; 许宗泽

您当前的位置：

首页 >

文章列表页 >

恒模PARAFAC分解CRB及拟合算法

电气工程 | 更新时间：2023-11-28

- 恒模PARAFAC分解CRB及拟合算法
- Cramer-Rao Bound and Fitting Algorithm for PARAFAC Decomposition Under Constant-Modulus Constraints
- 工程科学与技术 2009年41卷第5期页码：221-226
- 作者机构：
  
  南京航空航天大学
- 作者简介：
- 基金信息：
  
  省自然科学基金
- DOI：
  中图分类号：
- 纸质出版日期：2009，
  
  网络出版日期：2008-10-17，
扫描看全文
刘旭,许宗泽.恒模PARAFAC分解CRB及拟合算法[J].工程科学与技术,2009,41(5):221-226.

Liu XU, XU Zong-ze. Cramer-Rao Bound and Fitting Algorithm for PARAFAC Decomposition Under Constant-Modulus Constraints[J]. Advanced Engineering Sciences, 2009,41(5):221-226.
刘旭,许宗泽.恒模PARAFAC分解CRB及拟合算法[J].工程科学与技术,2009,41(5):221-226. DOI：

Liu XU, XU Zong-ze. Cramer-Rao Bound and Fitting Algorithm for PARAFAC Decomposition Under Constant-Modulus Constraints[J]. Advanced Engineering Sciences, 2009,41(5):221-226. DOI：

摘要

中文摘要: 为了对恒模约束条件下平行因子（PARAFAC）分解的参数估计性能进行分析，在给出PARAFAC模型分解的克拉美-罗界(CRB)的同时，结合约束CRB理论，推导出了“首行已知”约束和恒模约束下PARAFAC分解的CRB表达式

并给出了恒模约束PARAFAC分解的拟合算法TALS CM。仿真表明，恒模约束后的PARAFAC分解具有更低的CRB值，随着信噪比的增加，TALS CM拟合算法的性能接近于它的CRB值，说明算法是渐进有效的。TALS CM算法的性能优于普通的TALS算法，因此，在基于PARAFAC模型的信号处理算法中，合理利用信源的恒模特性可以有效地提高算法性能。

Abstract

Abstract:To analyze the parameter estimation performance of PARAFAC decomposition under Constant Modulus (CM) constraint

Cramer Rao Bound (CRB) expressions for PARAFAC decomposition under “First Row Known” and CM constraints were proposed. The fitting algorithm

named TALS CM

was also developed. Simulation results showed that

compared to the normal PARAFAC decomposition

CM constrained PARAFAC decomposition has a lower CRB. The performance of TALS CM algorithm was close to its CRB

which implied that TALS CM is asymptotically efficient.TALS CM algorithm has better performance than traditional TALS algorithm. Utilizing CM property of source signal improved the performance of the PARAFAC based signal processing algorithms.

关键词

盲信号处理克拉美-罗界平行因子三线性分解恒模

Keywords

blind signal processingCramer-Rao BoundPARAFACtrilinear decompositionConstant Modulus

references

Yu Yuanning;Petropulu A P,PARAFAC-based blind estimarion of possibly underdetetermined convolutive MIMO systents,Tranns on Acoustics Speech and Signal Processing,2008(1).

Stoica, P. ；Boon Chong Ng,On the Cramer-Rao bound under parametric constraints,IEEE signal processing letters ,1998, 5(7).

Gorman, J.D. ；Hero, A.O.,Lower bounds for parametric estimation with constraints,IEEE Transactions on Information Theory ,1990, 36(6).

Xiangqian Liu ；Nicholas D. Sidiropoulos,Cramer-Rao Lower Bounds for Low-Rank Decomposition of Multidimensional Arrays,IEEE Transactions on Signal Processing ,2001, 49(9).

Lathauwer L De;Castaing J,Tensor-based techniques for blind seperation of DS-CDMA signals,Signal Processing Special Issue Tensor Signal Processing,2007(2).

de Almeida, A. L. F. ；Favier, G. ；Mota, J. C. M.,A Constrained Factor Decomposition With Application to MIMO Antenna Systems,IEEE Transactions on Signal Processing ,2008, 56(6).

de Almeida A L F;Favier G;Mota J C M,PARAFAC-based unified tensor modeling for wireless communication systems with application to blind multiuser equalizarion,Elsevier Signal Processing,2007.

Sidiropoulos ND. ；Giannakis GB. ；Bro R.,Parallel factor analysis in sensor array processing,IEEE Transactions on Signal Processing ,2000, 48(8).

Stoica P;Neborai A,MUSIC,maximum likelihood,and Cramer-Rao bound,IEEE Transactions on Signal Processing,1989(5).

Bro R;Harshman R A;Sidiropoules N D,Modeling multiway data with linearly dependent loadings[KVL Technical Report],2005.

Rajih M;Comon P,Enhanced line search:A novel method to accelerate parafae[I3S Report],2005.

Sidiropoulos ND. ；Bro R. ；Giannakis GB.,Blind PARAFAC receivers for DS-CDMA systems,IEEE Transactions on Signal Processing ,2000, 48(3).

更多指标>

浏览量

208

下载量

CNKI被引量

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据