Structured Tensor Decomposition for FDD Massive MIMO Downlink Channel Reconstruction

IF 5.8 2区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Signal Processing Pub Date : 2025-01-13 DOI:10.1109/TSP.2025.3529657
Lin Chen;Xue Jiang;Pei Xiao;Xingzhao Liu;Martin Haardt
{"title":"Structured Tensor Decomposition for FDD Massive MIMO Downlink Channel Reconstruction","authors":"Lin Chen;Xue Jiang;Pei Xiao;Xingzhao Liu;Martin Haardt","doi":"10.1109/TSP.2025.3529657","DOIUrl":null,"url":null,"abstract":"The downlink channel reconstruction at the base station holds paramount significance across a multitude of applications in FDD massive MIMO systems. Conventional approaches rely on downlink training and feedback with a considerable overhead. In order to mitigate this issue, we propose a tensor-based framework for downlink channel reconstruction that leverages the partial reciprocity between the uplink and downlink channels. By modeling the uplink channel as a multi-dimensional tensor, we estimate the reciprocal channel parameters via a low-rank tensor decomposition. This approach effectively captures the correlation between arrays, subcarriers, and polarizations of the channel. In addition to the classical tensor decomposition, we exploit the exponential structure of the decomposed antenna and delay steering matrices, and propose a structured tensor decomposition algorithm. The proposed algorithm enhances the exponential structure via a tensor rank-1 constraint by incorporating the Hankel transform. The resulting optimization problem is rendered tractable by introducing a domain conversion matrix to facilitate the mapping of variables between the Hankel transform domain and the original domain. The proposed method exhibits superior noise robustness compared to conventional algebraic closed-form methods based on the Vandermonde constrained tensor decomposition. Experimental results with both simulated data and a Ray-tracing dataset demonstrate the effectiveness and superior downlink reconstruction accuracy of our proposed methods compared with several alternative approaches.","PeriodicalId":13330,"journal":{"name":"IEEE Transactions on Signal Processing","volume":"73 ","pages":"887-902"},"PeriodicalIF":5.8000,"publicationDate":"2025-01-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/10839618/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

The downlink channel reconstruction at the base station holds paramount significance across a multitude of applications in FDD massive MIMO systems. Conventional approaches rely on downlink training and feedback with a considerable overhead. In order to mitigate this issue, we propose a tensor-based framework for downlink channel reconstruction that leverages the partial reciprocity between the uplink and downlink channels. By modeling the uplink channel as a multi-dimensional tensor, we estimate the reciprocal channel parameters via a low-rank tensor decomposition. This approach effectively captures the correlation between arrays, subcarriers, and polarizations of the channel. In addition to the classical tensor decomposition, we exploit the exponential structure of the decomposed antenna and delay steering matrices, and propose a structured tensor decomposition algorithm. The proposed algorithm enhances the exponential structure via a tensor rank-1 constraint by incorporating the Hankel transform. The resulting optimization problem is rendered tractable by introducing a domain conversion matrix to facilitate the mapping of variables between the Hankel transform domain and the original domain. The proposed method exhibits superior noise robustness compared to conventional algebraic closed-form methods based on the Vandermonde constrained tensor decomposition. Experimental results with both simulated data and a Ray-tracing dataset demonstrate the effectiveness and superior downlink reconstruction accuracy of our proposed methods compared with several alternative approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结构化张量分解用于FDD海量MIMO下行信道重构
在FDD大规模MIMO系统的众多应用中,基站下行信道重建具有至关重要的意义。传统方法依赖于下行链路训练和反馈,开销相当大。为了缓解这个问题,我们提出了一个基于张量的下行信道重建框架,利用上行和下行信道之间的部分互易性。通过将上行信道建模为一个多维张量,我们通过低秩张量分解来估计信道参数的倒数。这种方法有效地捕获阵列、子载波和信道极化之间的相关性。在经典张量分解的基础上,利用分解后的天线和时延转向矩阵的指数结构,提出了一种结构化张量分解算法。该算法结合汉克尔变换,通过张量秩1约束增强了指数结构。通过引入域转换矩阵,简化了汉克尔变换域与原域之间变量的映射,使优化问题变得易于处理。与传统的基于Vandermonde约束张量分解的代数闭型方法相比,该方法具有更好的噪声鲁棒性。模拟数据和光线追踪数据集的实验结果表明,与几种替代方法相比,我们提出的方法的有效性和优越的下行链路重建精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
One-bit Single-Measurement Spectral Compressed Sensing via Hankel Matrix Factorization K-Means and Gaussian Mixture Models on Lie Groups: Application to Geometrical Clustering Achieving Optimal Sample Complexity for a Broader Class of Signals in Sparse Phase Retrieval Over-the-Air Computation on Network Edge for Collaborative Estimation Marginalized Particle Filter Degeneration
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1