Being aware of the channel and its properties is critical for coherent transmission in massive multiple-input multiple-output (M-MIMO) systems due to the large channel dimension in the space domain. In cell-free (CF) systems, the channel dimension increases further as each user is served by multiple access points, with a significant burden on signal processing. Angle domain transmission and channel maps promise to alleviate this burden by reducing channel dimensions in the angle domain and providing a priori channel information through channel measurements and modeling, respectively. In this paper, we propose a channel map-based angle domain multiple access scheme for the uplink CF M-MIMO communications. First, we propose an angle domain data reception scheme constituting receive combining and large-scale fading decoding to maximize spectral efficiency. Then, we derive an initial access criterion utilizing the angle domain channel similarity between users, based on which we propose pilot assignment and access point selection schemes for better trade-offs between spectral and energy efficiency. Finally, we construct two channel map-based transmission mechanisms by wielding different levels of channel information, where a tailored data reception scheme with a newly derived spectral efficiency upper bound is also proposed for quantitative evaluation. Simulation results show that the proposed channel map-based angle domain schemes outperform their space domain alternatives and the schemes without using channel maps regarding spectral and energy efficiency.
{"title":"Channel Map-Based Angle Domain Multiple Access for Cell-Free Massive MIMO Communications","authors":"Shuaifei Chen;Cheng-Xiang Wang;Junling Li;Chen Huang;Hengtai Chang;Yusong Huang;Jie Huang;Yunfei Chen","doi":"10.1109/JSTSP.2025.3536289","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3536289","url":null,"abstract":"Being aware of the channel and its properties is critical for coherent transmission in massive multiple-input multiple-output (M-MIMO) systems due to the large channel dimension in the space domain. In cell-free (CF) systems, the channel dimension increases further as each user is served by multiple access points, with a significant burden on signal processing. Angle domain transmission and channel maps promise to alleviate this burden by reducing channel dimensions in the angle domain and providing a priori channel information through channel measurements and modeling, respectively. In this paper, we propose a channel map-based angle domain multiple access scheme for the uplink CF M-MIMO communications. First, we propose an angle domain data reception scheme constituting receive combining and large-scale fading decoding to maximize spectral efficiency. Then, we derive an initial access criterion utilizing the angle domain channel similarity between users, based on which we propose pilot assignment and access point selection schemes for better trade-offs between spectral and energy efficiency. Finally, we construct two channel map-based transmission mechanisms by wielding different levels of channel information, where a tailored data reception scheme with a newly derived spectral efficiency upper bound is also proposed for quantitative evaluation. Simulation results show that the proposed channel map-based angle domain schemes outperform their space domain alternatives and the schemes without using channel maps regarding spectral and energy efficiency.","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"19 2","pages":"366-380"},"PeriodicalIF":8.7,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-11DOI: 10.1109/JSTSP.2025.3539085
Xiaodan Shao;Rui Zhang;Qijun Jiang;Jihong Park;Tony Q. S. Quek;Robert Schober
Six-dimensional movable antenna (6DMA) is an innovative and transformative technology to improve wireless network capacity by adjusting the 3D positions and rotations of antennas/antenna surfaces based on the channel spatial distribution. To achieve optimal antenna positions and rotations, acquiring statistical channel state information (CSI) is essential for 6DMA systems. However, existing works assume that a central processing unit (CPU) jointly processes the signals of all 6DMA surfaces. This incurs prohibitively high processing cost and latency for channel estimation due to the vast numbers of 6DMA candidate positions/rotations and antenna elements. Therefore, we propose a distributed 6DMA processing architecture to reduce the processing complexity of the CPU by equipping each 6DMA surface with a local processing unit (LPU). Furthermore, we unveil for the first time the directional sparsity property of the 6DMA channels with respect to distributed users, where each user has significant channel gains only for a (small) subset of 6DMA position-rotation pairs. Based on this property, we propose a practical three-stage protocol for the 6DMA system and corresponding algorithms to conduct statistical CSI acquisition for all 6DMA candidate positions/rotations, 6DMA position/rotation optimization based on statistical CSI, and instantaneous CSI estimation for user data transmission with optimized 6DMA positions/rotations. Simulation results show that the proposed channel estimation algorithms achieve higher accuracy than benchmark schemes, while requiring lower pilot overhead. Moreover, the proposed 6DMA system with statistical CSI-based position/rotation optimization achieves a higher ergodic sum rate than fixed-position and fluid antenna systems, even if the latter have perfect instantaneous CSI.
{"title":"Distributed Channel Estimation and Optimization for 6D Movable Antenna: Unveiling Directional Sparsity","authors":"Xiaodan Shao;Rui Zhang;Qijun Jiang;Jihong Park;Tony Q. S. Quek;Robert Schober","doi":"10.1109/JSTSP.2025.3539085","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3539085","url":null,"abstract":"Six-dimensional movable antenna (6DMA) is an innovative and transformative technology to improve wireless network capacity by adjusting the 3D positions and rotations of antennas/antenna surfaces based on the channel spatial distribution. To achieve optimal antenna positions and rotations, acquiring statistical channel state information (CSI) is essential for 6DMA systems. However, existing works assume that a central processing unit (CPU) jointly processes the signals of all 6DMA surfaces. This incurs prohibitively high processing cost and latency for channel estimation due to the vast numbers of 6DMA candidate positions/rotations and antenna elements. Therefore, we propose a distributed 6DMA processing architecture to reduce the processing complexity of the CPU by equipping each 6DMA surface with a local processing unit (LPU). Furthermore, we unveil for the first time the <bold><i>directional sparsity</i></b> property of the 6DMA channels with respect to distributed users, where each user has significant channel gains only for a (small) subset of 6DMA position-rotation pairs. Based on this property, we propose a practical three-stage protocol for the 6DMA system and corresponding algorithms to conduct statistical CSI acquisition for all 6DMA candidate positions/rotations, 6DMA position/rotation optimization based on statistical CSI, and instantaneous CSI estimation for user data transmission with optimized 6DMA positions/rotations. Simulation results show that the proposed channel estimation algorithms achieve higher accuracy than benchmark schemes, while requiring lower pilot overhead. Moreover, the proposed 6DMA system with statistical CSI-based position/rotation optimization achieves a higher ergodic sum rate than fixed-position and fluid antenna systems, even if the latter have perfect instantaneous CSI.","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"19 2","pages":"349-365"},"PeriodicalIF":8.7,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-11DOI: 10.1109/JSTSP.2025.3541370
{"title":"2024 Index IEEE Journal of Selected Topics in Signal Processing Vol. 18","authors":"","doi":"10.1109/JSTSP.2025.3541370","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3541370","url":null,"abstract":"","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"18 8","pages":"1562-1590"},"PeriodicalIF":8.7,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10880692","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143388563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-11DOI: 10.1109/JSTSP.2025.3541386
Yanqing Xu;Erik G. Larsson;Eduard A. Jorswieck;Xiao Li;Shi Jin;Tsung-Hui Chang
Extremely large-scale antenna arrays (ELAA) play a critical role in enabling the functionalities of next generation wireless communication systems. However, as the number of antennas increases, ELAA systems face significant bottlenecks, such as excessive interconnection costs and high computational complexity. Efficient distributed signal processing (SP) algorithms show great promise in overcoming these challenges. In this paper, we provide a comprehensive overview of distributed SP algorithms for ELAA systems, tailored to address these bottlenecks. We start by presenting three representative forms of ELAA systems: single-base station ELAA systems, coordinated distributed antenna systems, and ELAA systems integrated with emerging technologies. For each form, we review the associated distributed SP algorithms in the literature. Additionally, we outline several important future research directions that are essential for improving the performance and practicality of ELAA systems.
{"title":"Distributed Signal Processing for Extremely Large-Scale Antenna Array Systems: State-of-the-Art and Future Directions","authors":"Yanqing Xu;Erik G. Larsson;Eduard A. Jorswieck;Xiao Li;Shi Jin;Tsung-Hui Chang","doi":"10.1109/JSTSP.2025.3541386","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3541386","url":null,"abstract":"Extremely large-scale antenna arrays (ELAA) play a critical role in enabling the functionalities of next generation wireless communication systems. However, as the number of antennas increases, ELAA systems face significant bottlenecks, such as excessive interconnection costs and high computational complexity. Efficient distributed signal processing (SP) algorithms show great promise in overcoming these challenges. In this paper, we provide a comprehensive overview of distributed SP algorithms for ELAA systems, tailored to address these bottlenecks. We start by presenting three representative forms of ELAA systems: single-base station ELAA systems, coordinated distributed antenna systems, and ELAA systems integrated with emerging technologies. For each form, we review the associated distributed SP algorithms in the literature. Additionally, we outline several important future research directions that are essential for improving the performance and practicality of ELAA systems.","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"19 2","pages":"304-330"},"PeriodicalIF":8.7,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10883023","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-10DOI: 10.1109/JSTSP.2025.3539098
Zeyan Zhuang;Xin Zhang;Dongfang Xu;Shenghui Song;Yonina C. Eldar
Centralized baseband processing (CBP) is required to achieve the full potential of massive multiple-input multiple-output (MIMO) systems. However, due to the large number of antennas, CBP suffers from two major issues: 1) Extensive data interconnection between radio frequency (RF) circuitry and the central processing unit; and 2) high-dimensional computation. To this end, decentralized baseband processing (DBP) has been proposed, where the antennas at the base station are partitioned into clusters connected to separate RF circuits and equipped with separate computing units. However, the optimal fusion scheme that maximizes signal-to-interference-and-noise ratio (SINR) and the related performance analysis for DBP with general spatial correlation and imperfect channel state information (CSI) have not been studied. In this paper, we consider a decentralized MIMO system where all clusters adopt linear minimum mean-square error (LMMSE) receivers. We first establish an optimal linear fusion scheme that has high computational and data input/output costs. To reduce the cost, we then propose two suboptimal fusion schemes with reduced complexity. For all three schemes, we study the SINR performance by leveraging random matrix theory and demonstrate conditions under which the suboptimal schemes are optimal. Furthermore, we determine the optimal regularization parameter for the LMMSE receiver, identify the best antenna partitioning strategy, and prove that the SINR will decrease as the number of clusters increases. Numerical simulations validate the accuracy of the theoretical results.
{"title":"Decentralized MIMO Systems With Imperfect CSI Using LMMSE Receivers","authors":"Zeyan Zhuang;Xin Zhang;Dongfang Xu;Shenghui Song;Yonina C. Eldar","doi":"10.1109/JSTSP.2025.3539098","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3539098","url":null,"abstract":"Centralized baseband processing (CBP) is required to achieve the full potential of massive multiple-input multiple-output (MIMO) systems. However, due to the large number of antennas, CBP suffers from two major issues: 1) Extensive data interconnection between radio frequency (RF) circuitry and the central processing unit; and 2) high-dimensional computation. To this end, decentralized baseband processing (DBP) has been proposed, where the antennas at the base station are partitioned into clusters connected to separate RF circuits and equipped with separate computing units. However, the optimal fusion scheme that maximizes signal-to-interference-and-noise ratio (SINR) and the related performance analysis for DBP with general spatial correlation and imperfect channel state information (CSI) have not been studied. In this paper, we consider a decentralized MIMO system where all clusters adopt linear minimum mean-square error (LMMSE) receivers. We first establish an optimal linear fusion scheme that has high computational and data input/output costs. To reduce the cost, we then propose two suboptimal fusion schemes with reduced complexity. For all three schemes, we study the SINR performance by leveraging random matrix theory and demonstrate conditions under which the suboptimal schemes are optimal. Furthermore, we determine the optimal regularization parameter for the LMMSE receiver, identify the best antenna partitioning strategy, and prove that the SINR will decrease as the number of clusters increases. Numerical simulations validate the accuracy of the theoretical results.","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"19 2","pages":"331-348"},"PeriodicalIF":8.7,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143900474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-06DOI: 10.1109/JSTSP.2025.3539845
David Gimeno-Gómez;Catarina Botelho;Anna Pompili;Alberto Abad;Carlos-D. Martínez-Hinarejos
Recent works in pathological speech analysis have increasingly relied on powerful self-supervised speech representations, leading to promising results. However, the complex, black-box nature of these embeddings and the limited research on their interpretability significantly restrict their adoption for clinical diagnosis. To address this gap, we propose a novel, interpretable framework specifically designed to support Parkinson's Disease (PD) diagnosis. Through the design of simple yet effective cross-attention mechanisms for both embedding- and temporal-level analysis, the proposed framework offers interpretability from two distinct but complementary perspectives. Experimental findings across five well-established speech benchmarks for PD detection demonstrate the framework's capability to identify meaningful speech patterns within self-supervised representations for a wide range of assessment tasks. Fine-grained temporal analyses further underscore its potential to enhance the interpretability of deep-learning pathological speech models, paving the way for the development of more transparent, trustworthy, and clinically applicable computer-assisted diagnosis systems in this domain. Moreover, in terms of classification accuracy, our method achieves results competitive with state-of-the-art approaches, while also demonstrating robustness in cross-lingual scenarios when applied to spontaneous speech production.
{"title":"Unveiling Interpretability in Self-Supervised Speech Representations for Parkinson's Diagnosis","authors":"David Gimeno-Gómez;Catarina Botelho;Anna Pompili;Alberto Abad;Carlos-D. Martínez-Hinarejos","doi":"10.1109/JSTSP.2025.3539845","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3539845","url":null,"abstract":"Recent works in pathological speech analysis have increasingly relied on powerful self-supervised speech representations, leading to promising results. However, the complex, black-box nature of these embeddings and the limited research on their interpretability significantly restrict their adoption for clinical diagnosis. To address this gap, we propose a novel, interpretable framework specifically designed to support Parkinson's Disease (PD) diagnosis. Through the design of simple yet effective cross-attention mechanisms for both embedding- and temporal-level analysis, the proposed framework offers interpretability from two distinct but complementary perspectives. Experimental findings across five well-established speech benchmarks for PD detection demonstrate the framework's capability to identify meaningful speech patterns within self-supervised representations for a wide range of assessment tasks. Fine-grained temporal analyses further underscore its potential to enhance the interpretability of deep-learning pathological speech models, paving the way for the development of more transparent, trustworthy, and clinically applicable computer-assisted diagnosis systems in this domain. Moreover, in terms of classification accuracy, our method achieves results competitive with state-of-the-art approaches, while also demonstrating robustness in cross-lingual scenarios when applied to spontaneous speech production.","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"19 5","pages":"717-730"},"PeriodicalIF":13.7,"publicationDate":"2025-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10877763","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145659221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-05DOI: 10.1109/JSTSP.2025.3535108
{"title":"IEEE Signal Processing Society Information","authors":"","doi":"10.1109/JSTSP.2025.3535108","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3535108","url":null,"abstract":"","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"18 8","pages":"C2-C2"},"PeriodicalIF":8.7,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10874832","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-05DOI: 10.1109/JSTSP.2025.3535110
{"title":"IEEE Signal Processing Society Information","authors":"","doi":"10.1109/JSTSP.2025.3535110","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3535110","url":null,"abstract":"","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"18 8","pages":"C3-C3"},"PeriodicalIF":8.7,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10874836","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-02-05DOI: 10.1109/JSTSP.2025.3534376
{"title":"List of Reviewers 2024","authors":"","doi":"10.1109/JSTSP.2025.3534376","DOIUrl":"https://doi.org/10.1109/JSTSP.2025.3534376","url":null,"abstract":"","PeriodicalId":13038,"journal":{"name":"IEEE Journal of Selected Topics in Signal Processing","volume":"18 8","pages":"1557-1561"},"PeriodicalIF":8.7,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10874840","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：