Robust Multichannel Decorrelation via Tensor Einstein Product

IF 4.6 2区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Signal Processing Pub Date : 2024-11-13 DOI:10.1109/TSP.2024.3495552
Shih-Yu Chang;Hsiao-Chun Wu;Guannan Liu
{"title":"Robust Multichannel Decorrelation via Tensor Einstein Product","authors":"Shih-Yu Chang;Hsiao-Chun Wu;Guannan Liu","doi":"10.1109/TSP.2024.3495552","DOIUrl":null,"url":null,"abstract":"Decorrelation of multichannel signals has played a crucial preprocessing role (in prewhitening and orthogonalization) for many signal processing applications. Classical decorrelation techniques can only be applied for signal vectors. Nonetheless, many emerging big-data and sensor-network applications involve signal tensors (signal samples required to be arranged in a tensor form of arbitrary orders). Meanwhile, the existing tensor-decorrelation methods have serious limitations. First, the correlation-tensors have to be of certain particular orders. Second, the unrealistic assumption of the specific signal-tensor form, namely the canonical polyadic (CP) form, is made. Third, the correlation-tensor has to be full-rank or an extra preprocessor based on principal component analysis is required for any non-full-rank correlation tensor. To remove the aforementioned impractical limitations, we propose a novel robust approach for high-dimensional multichannel decorrelation, which can accommodate signal tensors of arbitrary orders, forms, and ranks without any need of extra preprocessor. In this work, we introduce two new tensor-decorrelation algorithms. Our first new algorithm is designed to tackle full-rank correlation-tensors and our second new algorithm is designed to tackle non-full-rank correlation-tensors. Meanwhile, we also propose a new parallel-computing paradigm to accelerate our proposed new tensor-decorrelation algorithms. To demonstrate the applicability of our proposed new scheme, we also apply our proposed new tensor-decorrelation approach to pre-whiten the tensor signals and analyze the corresponding convergence-speed and misadjustment performances of the tensor least-mean-squares (TLMS) filter. Finally, we assess the computational- and memory-complexities of our proposed new algorithms by simulations over both artificial and real data. Simulation results show that our proposed new multichannel-decorrelation algorithms outperform the existing tensor-decorrelation methods in terms of convergence speed, eigenspread, normalized mean square error (NRMSE), and estimation accuracy.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"275-291"},"PeriodicalIF":4.6000,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10752411/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Decorrelation of multichannel signals has played a crucial preprocessing role (in prewhitening and orthogonalization) for many signal processing applications. Classical decorrelation techniques can only be applied for signal vectors. Nonetheless, many emerging big-data and sensor-network applications involve signal tensors (signal samples required to be arranged in a tensor form of arbitrary orders). Meanwhile, the existing tensor-decorrelation methods have serious limitations. First, the correlation-tensors have to be of certain particular orders. Second, the unrealistic assumption of the specific signal-tensor form, namely the canonical polyadic (CP) form, is made. Third, the correlation-tensor has to be full-rank or an extra preprocessor based on principal component analysis is required for any non-full-rank correlation tensor. To remove the aforementioned impractical limitations, we propose a novel robust approach for high-dimensional multichannel decorrelation, which can accommodate signal tensors of arbitrary orders, forms, and ranks without any need of extra preprocessor. In this work, we introduce two new tensor-decorrelation algorithms. Our first new algorithm is designed to tackle full-rank correlation-tensors and our second new algorithm is designed to tackle non-full-rank correlation-tensors. Meanwhile, we also propose a new parallel-computing paradigm to accelerate our proposed new tensor-decorrelation algorithms. To demonstrate the applicability of our proposed new scheme, we also apply our proposed new tensor-decorrelation approach to pre-whiten the tensor signals and analyze the corresponding convergence-speed and misadjustment performances of the tensor least-mean-squares (TLMS) filter. Finally, we assess the computational- and memory-complexities of our proposed new algorithms by simulations over both artificial and real data. Simulation results show that our proposed new multichannel-decorrelation algorithms outperform the existing tensor-decorrelation methods in terms of convergence speed, eigenspread, normalized mean square error (NRMSE), and estimation accuracy.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
通过张量爱因斯坦积实现稳健的多通道去相关性
多通道信号的去相关处理在许多信号处理应用中起着至关重要的预处理作用(在预白化和正交化中)。经典的去相关技术只能应用于信号向量。尽管如此,许多新兴的大数据和传感器网络应用都涉及到信号张量(信号样本需要以任意顺序的张量形式排列)。同时,现有的张量解相关方法存在严重的局限性。首先,相关张量必须具有特定的阶数。其次,对特定的信号张量形式,即正则多进(CP)形式进行了不切实际的假设。第三,相关张量必须是全秩的,或者对任何非全秩的相关张量需要额外的基于主成分分析的预处理。为了消除上述不切实际的限制,我们提出了一种新的高维多通道去相关鲁棒方法,该方法可以适应任意阶、形式和秩的信号张量,而无需额外的预处理。本文介绍了两种新的张量解相关算法。我们的第一个新算法被设计用于处理全秩相关张量,我们的第二个新算法被设计用于处理非全秩相关张量。同时,我们还提出了一种新的并行计算范式来加速我们提出的新的张量去相关算法。为了证明我们提出的新方案的适用性,我们还将我们提出的新的张量去相关方法应用于张量信号的预白化,并分析了相应的张量最小均方(TLMS)滤波器的收敛速度和失调性能。最后,我们通过模拟人工数据和真实数据来评估我们提出的新算法的计算和内存复杂性。仿真结果表明,本文提出的多通道去相关算法在收敛速度、特征扩展、归一化均方误差(NRMSE)和估计精度等方面都优于现有的张量去相关算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing 工程技术-工程:电子与电气
CiteScore
11.20
自引率
9.30%
发文量
310
审稿时长
3.0 months
期刊介绍: The IEEE Transactions on Signal Processing covers novel theory, algorithms, performance analyses and applications of techniques for the processing, understanding, learning, retrieval, mining, and extraction of information from signals. The term “signal” includes, among others, audio, video, speech, image, communication, geophysical, sonar, radar, medical and musical signals. Examples of topics of interest include, but are not limited to, information processing and the theory and application of filtering, coding, transmitting, estimating, detecting, analyzing, recognizing, synthesizing, recording, and reproducing signals.
期刊最新文献
A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent Tracking Multiple Resolvable Group Targets with Coordinated Motion via Labeled Random Finite Sets Energy-Efficient Flat Precoding for MIMO Systems Successive Refinement in Large-Scale Computation: Expediting Model Inference Applications ALPCAH: Subspace Learning for Sample-wise Heteroscedastic Data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1