A Manifold Learning-Based CSI Feedback Framework for FDD Massive MIMO

IF 8.3 2区 计算机科学 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Communications Pub Date : 2024-08-27 DOI:10.1109/TCOMM.2024.3450568
Yandi Cao;Haifan Yin;Ziao Qin;Weidong Li;Weimin Wu;Mérouane Debbah
{"title":"A Manifold Learning-Based CSI Feedback Framework for FDD Massive MIMO","authors":"Yandi Cao;Haifan Yin;Ziao Qin;Weidong Li;Weimin Wu;Mérouane Debbah","doi":"10.1109/TCOMM.2024.3450568","DOIUrl":null,"url":null,"abstract":"Massive multi-input multi-output (MIMO) in Frequency Division Duplex (FDD) mode suffers from heavy feedback overhead for Channel State Information (CSI). In this paper, a novel manifold learning-based CSI feedback framework (MLCF) is proposed to reduce the feedback and improve the spectral efficiency for FDD massive MIMO. Manifold learning (ML) is an effective method for dimensionality reduction. However, most ML algorithms focus only on data compression, and lack the corresponding recovery methods. Moreover, the computational complexity is high when dealing with incremental data. Considering to utilize the intrinsic manifold structure where the CSI samples reside, we propose a landmark selection algorithm to describe the topological skeleton of this manifold. Based on the learned skeleton, the local patch of the incremental CSI on the manifold can be easily determined by its nearest landmarks. This motivates us to propose an incremental CSI compression and reconstruction scheme by keeping the local geometric relationships with landmarks invariant. We theoretically prove the convergence of the proposed landmark selection algorithm. Meanwhile, the upper bound on the error of approximating CSI with landmarks is derived. Simulation results under an industrial channel model of 3GPP demonstrate that the proposed MLCF outperforms existing deep learning based algorithms.","PeriodicalId":13041,"journal":{"name":"IEEE Transactions on Communications","volume":"73 3","pages":"1833-1846"},"PeriodicalIF":8.3000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Communications","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10649656/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Massive multi-input multi-output (MIMO) in Frequency Division Duplex (FDD) mode suffers from heavy feedback overhead for Channel State Information (CSI). In this paper, a novel manifold learning-based CSI feedback framework (MLCF) is proposed to reduce the feedback and improve the spectral efficiency for FDD massive MIMO. Manifold learning (ML) is an effective method for dimensionality reduction. However, most ML algorithms focus only on data compression, and lack the corresponding recovery methods. Moreover, the computational complexity is high when dealing with incremental data. Considering to utilize the intrinsic manifold structure where the CSI samples reside, we propose a landmark selection algorithm to describe the topological skeleton of this manifold. Based on the learned skeleton, the local patch of the incremental CSI on the manifold can be easily determined by its nearest landmarks. This motivates us to propose an incremental CSI compression and reconstruction scheme by keeping the local geometric relationships with landmarks invariant. We theoretically prove the convergence of the proposed landmark selection algorithm. Meanwhile, the upper bound on the error of approximating CSI with landmarks is derived. Simulation results under an industrial channel model of 3GPP demonstrate that the proposed MLCF outperforms existing deep learning based algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 Manifold Learning 的 FDD 大规模多输入多输出 CSI 反馈框架
频分双工(FDD)模式下的大规模多输入多输出(MIMO)存在信道状态信息(CSI)反馈开销较大的问题。本文提出了一种新的基于流形学习的CSI反馈框架(MLCF),以减少FDD大规模MIMO的反馈,提高频谱效率。流形学习(ML)是一种有效的降维方法。然而,大多数ML算法只关注数据压缩,缺乏相应的恢复方法。此外,在处理增量数据时,计算复杂度较高。考虑到利用CSI样本所在的本征流形结构,我们提出了一种地标选择算法来描述该流形的拓扑骨架。基于学习到的骨架,增量CSI在流形上的局部斑块可以很容易地由其最近的地标确定。这促使我们提出了一种增量CSI压缩和重建方案,通过保持局部几何关系与地标不变。从理论上证明了所提出的地标选择算法的收敛性。同时,导出了用地标逼近CSI的误差上界。在3GPP工业信道模型下的仿真结果表明,所提出的MLCF优于现有的基于深度学习的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Communications
IEEE Transactions on Communications 工程技术-电信学
CiteScore
16.10
自引率
8.40%
发文量
528
审稿时长
4.1 months
期刊介绍: The IEEE Transactions on Communications is dedicated to publishing high-quality manuscripts that showcase advancements in the state-of-the-art of telecommunications. Our scope encompasses all aspects of telecommunications, including telephone, telegraphy, facsimile, and television, facilitated by electromagnetic propagation methods such as radio, wire, aerial, underground, coaxial, and submarine cables, as well as waveguides, communication satellites, and lasers. We cover telecommunications in various settings, including marine, aeronautical, space, and fixed station services, addressing topics such as repeaters, radio relaying, signal storage, regeneration, error detection and correction, multiplexing, carrier techniques, communication switching systems, data communications, and communication theory. Join us in advancing the field of telecommunications through groundbreaking research and innovation.
期刊最新文献
Novel Transform Based Optimization for Resource Allocation and Task Offloading in Communication Networks A Novel Cross-Entropy Receiver for Random Time-Hopping Covert Satellite Systems Rydberg-Atom-Based Superdirective Receivers: Array Modeling and Performance Analysis Resource Allocation in RIS-assisted Integrated Sensing, Communication, and Computation Network Coarse-to-Fine Doppler Compensation in 6G VLEO: Dual-Head Temporal Convolutional Network Acquisition with CP-Aided Tracking
×
引用
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