Navneet Garg
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Navneet Garg has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Tharmalingam Ratnarajah
San Diego State University
26 shared publications - Haifeng Luo
Institute for Digital Communications, School of Engineering, The University of Edinburgh, Edinburgh, U.K.
6 shared publications - Govind Sharma
Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, India
5 shared publications - Junkai Zhang
School of Mathematics and Statistics, Xian Jiaotong University, Xian, China
5 shared publications - Zhikai Liu
Institute for Imaging, Data and Communications (IDCOM), School of Engineering, University of Edinburgh, Edinburgh, U.K.
4 shared publications - Hanxiao Ge
Institute for Digital Communications, The University of Edinburgh, Edinburgh, U.K.
3 shared publications
Latest Publications
- 1 January 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Cognitive Communications and Networking
- Vol.Ā 11 Ā (4) , 2201-2215
Dynamic Energy Efficient Resource Allocation for Massive MIMO Networks Using Randomized Ensembled Double Q-Learning Algorithm
This paper tackles the challenge of power consumption in the massive multiple-input multiple-output (mMIMO) base station (BS), where continuous operation of all antennas generates significant heat within a limited physical area. We propose a strategic power control scheme to enhance energy efficiency and mitigate thermal impact. Our approach introduces a time-slotted model incorporating dynamic, time-varying user quality of service (QoS) requirements. We examine energy efficiency under various conditions, presenting discrete and analog power allocation methods for both hybrid and fully digital precoding, with consideration of hardware impairments (HWI).We frame the energy efficiency optimization as dynamic Markov decision process (MDP) problems, constrained by total power, per-antenna power, and dynamic QoS requirements. The randomized ensembled double Q-learning (REDQ) algorithm is utilized with an action coding scheme to reduce computational complexity. By comparing existing reinforcement learning algorithms and evaluating our proposed power allocation schemes across diverse scenarios, simulations demonstrate that our approach improves energy efficiency effectively under varying operational conditions, showcasing its potential as a robust solution for adaptive resource allocation in mMIMO systems.
- 1 January 2025
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Cognitive Communications and Networking
- Vol.Ā 11 Ā (4) , 2201-2215
Dynamic Energy Efficient Resource Allocation for Massive MIMO Networks Using Randomized Ensembled Double Q-Learning Algorithm
This paper tackles the challenge of power consumption in the massive multiple-input multiple-output (mMIMO) base station (BS), where continuous operation of all antennas generates significant heat within a limited physical area. We propose a strategic power control scheme to enhance energy efficiency and mitigate thermal impact. Our approach introduces a time-slotted model incorporating dynamic, time-varying user quality of service (QoS) requirements. We examine energy efficiency under various conditions, presenting discrete and analog power allocation methods for both hybrid and fully digital precoding, with consideration of hardware impairments (HWI).We frame the energy efficiency optimization as dynamic Markov decision process (MDP) problems, constrained by total power, per-antenna power, and dynamic QoS requirements. The randomized ensembled double Q-learning (REDQ) algorithm is utilized with an action coding scheme to reduce computational complexity. By comparing existing reinforcement learning algorithms and evaluating our proposed power allocation schemes across diverse scenarios, simulations demonstrate that our approach improves energy efficiency effectively under varying operational conditions, showcasing its potential as a robust solution for adaptive resource allocation in mMIMO systems.
- 2 October 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Vehicular Technology
- Vol.Ā 74 Ā (2) , 2973-2988
Multi-Agent Federated $Q$-Learning Algorithms for Wireless Edge Caching
Edge caching is an increasingly vital technique in wireless networks, particularly needed to address users' repeated demands, including real-time traffic data and map access in vehicular communications. This paper presents a three-tier system for edge caching, integrating massive multiple-input multiple-output (mMIMO) networks. We consider a scenario with an extensive file library whose size is larger than the aggregated caching capacity of the small base stations (SBSs). Each SBS proactively caches files based on dynamic file popularity that is unknown in advance. A distinguishing aspect of our model is its file-wise approach to the cache instead of the conventional vector-wise methods based on aggregate popularity. This approach introduces additional computational challenges concerning the extensive file library. We formulated the optimization problem to maximize the long-term discounted cache hit rate while minimizing the delivery delay. For the solution, two multi-agent federated $Q$ -learning algorithms are proposed. The first algorithm employs selective updates of the $Q$ -values of popular files to minimize computational overhead. The second algorithm incorporates linear function approximation (LFA) and tensor completion (TC) to streamline the updating process further, reducing the required parameter number. Through the real-world MovieLens dataset and compared with various baseline algorithms, simulations demonstrate that our proposed algorithm can reduce the delay by around 2.60-21.29%, improve the cache hit rate by around 5.71-66.42%, and reduce the computational complexity by at most 97.91%.
- 2 October 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Vehicular Technology
- Vol.Ā 74 Ā (2) , 2973-2988
Multi-Agent Federated $Q$-Learning Algorithms for Wireless Edge Caching
Edge caching is an increasingly vital technique in wireless networks, particularly needed to address users' repeated demands, including real-time traffic data and map access in vehicular communications. This paper presents a three-tier system for edge caching, integrating massive multiple-input multiple-output (mMIMO) networks. We consider a scenario with an extensive file library whose size is larger than the aggregated caching capacity of the small base stations (SBSs). Each SBS proactively caches files based on dynamic file popularity that is unknown in advance. A distinguishing aspect of our model is its file-wise approach to the cache instead of the conventional vector-wise methods based on aggregate popularity. This approach introduces additional computational challenges concerning the extensive file library. We formulated the optimization problem to maximize the long-term discounted cache hit rate while minimizing the delivery delay. For the solution, two multi-agent federated $Q$ -learning algorithms are proposed. The first algorithm employs selective updates of the $Q$ -values of popular files to minimize computational overhead. The second algorithm incorporates linear function approximation (LFA) and tensor completion (TC) to streamline the updating process further, reducing the required parameter number. Through the real-world MovieLens dataset and compared with various baseline algorithms, simulations demonstrate that our proposed algorithm can reduce the delay by around 2.60-21.29%, improve the cache hit rate by around 5.71-66.42%, and reduce the computational complexity by at most 97.91%.
- 16 May 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Systems Journal
- Vol.Ā 18 Ā (2) , 977-988
A Rate-Splitting Strategy for STAR-RIS-Aided Massive MIMO Systems With Joint Optimization
This work proposes a rate-splitting (RS) strategy for simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided massive multiple-input multiple-output (mMIMO) systems to reduce the interference among multiple users and enhance the spectral efficiency (SE) while improving the coverage degraded by blockages. Specifically, we use the RS to design the precoder for the common part by solving the asymptotic problem. Also, unlike traditional RIS-aided systems, receivers can be positioned on either side of the RIS panel in the proposed system. We derive the sum-rate based on statistical channel state information (CSI) to reduce the signal overhead. Next, we optimize the rate through a projected gradient ascent method algorithm simultaneously with respect to the amplitudes and phase shifts of the STAR-RIS. Simulations show the advantages of the RS strategy compared with the broadcasting strategy in improving the sum-rate. We further evaluate the efficiency of the STAR-RIS system against the traditional RIS-aided system. In our analysis, we employ energy splitting and mode switching protocols to fine-tune the transmission and reflection coefficients of the outgoing and incoming signals.
- 16 May 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Systems Journal
- Vol.Ā 18 Ā (2) , 977-988
A Rate-Splitting Strategy for STAR-RIS-Aided Massive MIMO Systems With Joint Optimization
This work proposes a rate-splitting (RS) strategy for simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided massive multiple-input multiple-output (mMIMO) systems to reduce the interference among multiple users and enhance the spectral efficiency (SE) while improving the coverage degraded by blockages. Specifically, we use the RS to design the precoder for the common part by solving the asymptotic problem. Also, unlike traditional RIS-aided systems, receivers can be positioned on either side of the RIS panel in the proposed system. We derive the sum-rate based on statistical channel state information (CSI) to reduce the signal overhead. Next, we optimize the rate through a projected gradient ascent method algorithm simultaneously with respect to the amplitudes and phase shifts of the STAR-RIS. Simulations show the advantages of the RS strategy compared with the broadcasting strategy in improving the sum-rate. We further evaluate the efficiency of the STAR-RIS system against the traditional RIS-aided system. In our analysis, we employ energy splitting and mode switching protocols to fine-tune the transmission and reflection coefficients of the outgoing and incoming signals.
- 13 May 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Vehicular Technology
- Vol.Ā 74 Ā (4) , 5799-5813
Joint Power Allocation and Beamforming for In-Band Full-Duplex Multi-Cell Multi-User Networks
This paper investigates a robust joint power allocation and beamforming scheme for in-band full-duplex multicell multi-user (IBFD-MCMU) networks. A mean-squared error (MSE) minimization problem is formulated with constraints on the power budgets and residual self-interference (RSI) power. The problem is not convex, so we decompose it into two sub-problems: interference management beamforming and power allocation, and give closed-form solutions to the sub-problems. Then we propose an iterative algorithm to yield an overall solution. The computational complexity and convergence behavior of the algorithm are analyzed. Our method can enhance the analog selfinterference cancellation (ASIC) depth provided by the precoder with less effect on the downlink communication than the existing null-space projection method, inspiring a low-cost but efficient IBFD transceiver design. It can achieve 42.9% of IBFD gain in terms of spectral efficiency with only antenna isolation, while this value increases to 60.9% with further digital selfinterference cancellation (DSIC). Numerical results illustrate that our algorithm is robust to hardware impairments and channel uncertainty. With sufficient ASIC depth, our method reduces the computation time by at least 20% than the existing scheme due to its faster convergence speed at the cost of < 12.5% sum rate loss. The benefit is much more significant with single-antenna users that our algorithm saves at least 40% of the computation time at the cost of < 10% sum rate reduction.
- 13 May 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Vehicular Technology
- Vol.Ā 74 Ā (4) , 5799-5813
Joint Power Allocation and Beamforming for In-Band Full-Duplex Multi-Cell Multi-User Networks
This paper investigates a robust joint power allocation and beamforming scheme for in-band full-duplex multicell multi-user (IBFD-MCMU) networks. A mean-squared error (MSE) minimization problem is formulated with constraints on the power budgets and residual self-interference (RSI) power. The problem is not convex, so we decompose it into two sub-problems: interference management beamforming and power allocation, and give closed-form solutions to the sub-problems. Then we propose an iterative algorithm to yield an overall solution. The computational complexity and convergence behavior of the algorithm are analyzed. Our method can enhance the analog selfinterference cancellation (ASIC) depth provided by the precoder with less effect on the downlink communication than the existing null-space projection method, inspiring a low-cost but efficient IBFD transceiver design. It can achieve 42.9% of IBFD gain in terms of spectral efficiency with only antenna isolation, while this value increases to 60.9% with further digital selfinterference cancellation (DSIC). Numerical results illustrate that our algorithm is robust to hardware impairments and channel uncertainty. With sufficient ASIC depth, our method reduces the computation time by at least 20% than the existing scheme due to its faster convergence speed at the cost of < 12.5% sum rate loss. The benefit is much more significant with single-antenna users that our algorithm saves at least 40% of the computation time at the cost of < 10% sum rate reduction.
- 18 March 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Cognitive Communications and Networking
- Vol.Ā 10 Ā (4) , 1535-1550
Federated Distillation in Massive MIMO Networks: Dynamic Training, Convergence Analysis, and Communication Channel-Aware Learning
Federated Distillation (FD) is a novel distributed learning paradigm that shares the privacy-preserving nature of Federated Learning (FL) and provides possible solutions to the challenges introduced by the FL framework, such as being able to train local models with nonidentical architectures. In this paper, a communication channel-aware FD-framework is presented for multi-user massive multi-input-multi-output (mMIMO) communication system, where zero-forcing (ZF) and minimum mean-squared-error (MMSE) schemes are utilized to null the intra-cell interference. Unlike most existing studies, where both model parameters and model outputs (logits) are utilized for transmission, we exclusively adopt logits as the information exchanged in the wireless links to reduce the overall communication overhead in each round. Based on the analysis, the dynamic training steps based FD algorithm (FedTSKD) is proposed to save communication resources and accelerate the training process. Further, a group-based FD algorithm (FedTSKD-G) is proposed for the system experiencing different channel conditions like deep-fade. Simulation results on image classification tasks with ImageNette/STL-10, CIFAR-10/STL-10 and MNIST/FMNIST datasets combinations have demonstrated the proposed algorithmās effectiveness and efficiency. Comparison with the FL algorithm shows that the proposed FD algorithm only incurs 1% of FLās communication overhead to achieve the same testing performance.
- 18 March 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Cognitive Communications and Networking
- Vol.Ā 10 Ā (4) , 1535-1550
Federated Distillation in Massive MIMO Networks: Dynamic Training, Convergence Analysis, and Communication Channel-Aware Learning
Federated Distillation (FD) is a novel distributed learning paradigm that shares the privacy-preserving nature of Federated Learning (FL) and provides possible solutions to the challenges introduced by the FL framework, such as being able to train local models with nonidentical architectures. In this paper, a communication channel-aware FD-framework is presented for multi-user massive multi-input-multi-output (mMIMO) communication system, where zero-forcing (ZF) and minimum mean-squared-error (MMSE) schemes are utilized to null the intra-cell interference. Unlike most existing studies, where both model parameters and model outputs (logits) are utilized for transmission, we exclusively adopt logits as the information exchanged in the wireless links to reduce the overall communication overhead in each round. Based on the analysis, the dynamic training steps based FD algorithm (FedTSKD) is proposed to save communication resources and accelerate the training process. Further, a group-based FD algorithm (FedTSKD-G) is proposed for the system experiencing different channel conditions like deep-fade. Simulation results on image classification tasks with ImageNette/STL-10, CIFAR-10/STL-10 and MNIST/FMNIST datasets combinations have demonstrated the proposed algorithmās effectiveness and efficiency. Comparison with the FL algorithm shows that the proposed FD algorithm only incurs 1% of FLās communication overhead to achieve the same testing performance.
- Open Access
On the Secrecy Rate of In-Band Full-duplex Two-way Wiretap Channel
In this paper, we consider a two-way wiretap Multi-Input Multi-Output Multi-antenna Eve (MIMOME) channel, where both nodes (Alice and Bob) transmit and receive in an in-band full-duplex (IBFD) manner. For this system with keyless security, we provide a novel artificial noise (AN) based signal design, where the AN is injected in both signal and null spaces. We present an ergodic secrecy rate approximation to derive the power allocation algorithm. We consider scenarios where AN is known and unknown to legitimate users and include imperfect channel information effects. To maximize secrecy rates subject to the transmit power constraint, a two-step power allocation solution is proposed, where the first step is known at Eve, and the second step helps to improve the secrecy further. We also consider scenarios where partial information is known by Eve and the effects of non-ideal self-interference cancellation. The usefulness and limitations of the resulting power allocation solution are analyzed and verified via simulations. Results show that secrecy rates are less when AN is unknown to receivers or Eve has more information about legitimate users. Since the ergodic approximation only considers Eves distance, the resulting power allocation provides secrecy rates close to the actual ones.
Open AccessOn the Secrecy Rate of In-Band Full-duplex Two-way Wiretap Channel
In this paper, we consider a two-way wiretap Multi-Input Multi-Output Multi-antenna Eve (MIMOME) channel, where both nodes (Alice and Bob) transmit and receive in an in-band full-duplex (IBFD) manner. For this system with keyless security, we provide a novel artificial noise (AN) based signal design, where the AN is injected in both signal and null spaces. We present an ergodic secrecy rate approximation to derive the power allocation algorithm. We consider scenarios where AN is known and unknown to legitimate users and include imperfect channel information effects. To maximize secrecy rates subject to the transmit power constraint, a two-step power allocation solution is proposed, where the first step is known at Eve, and the second step helps to improve the secrecy further. We also consider scenarios where partial information is known by Eve and the effects of non-ideal self-interference cancellation. The usefulness and limitations of the resulting power allocation solution are analyzed and verified via simulations. Results show that secrecy rates are less when AN is unknown to receivers or Eve has more information about legitimate users. Since the ergodic approximation only considers Eves distance, the resulting power allocation provides secrecy rates close to the actual ones.
- 22 February 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Green Communications and Networking
- Vol.Ā 8 Ā (4) , 1348-1360
On the Secrecy Rate of In-Band Full-Duplex Two-Way Wiretap Channel
In this paper, we consider a two-way wiretap Multi-Input Multi-Output Multi-antenna Eve (MIMOME) channel, where both nodes (Alice and Bob) transmit and receive in an in-band full-duplex (IBFD) manner. For this system with keyless security, we provide a novel artificial noise (AN) based signal design, where the AN is injected in both signal and null spaces. We present an ergodic secrecy rate approximation to derive the power allocation algorithm. We consider scenarios where AN is known and unknown to legitimate users and include imperfect channel information effects. To maximize secrecy rates subject to the transmit power constraint, a two-step power allocation solution is proposed, where the first step is known at Eve, and the second step helps to improve the secrecy further. We also consider scenarios where partial information is known by Eve and the effects of non-ideal self-interference cancellation. The usefulness and limitations of the resulting power allocation solution are analyzed and verified via simulations. Results show that secrecy rates are less when AN is unknown to receivers or Eve has more information about legitimate users. Since the ergodic approximation only considers Eveās distance, the resulting power allocation provides secrecy rates close to the actual ones.
- 22 February 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Transactions on Green Communications and Networking
- Vol.Ā 8 Ā (4) , 1348-1360
On the Secrecy Rate of In-Band Full-Duplex Two-Way Wiretap Channel
In this paper, we consider a two-way wiretap Multi-Input Multi-Output Multi-antenna Eve (MIMOME) channel, where both nodes (Alice and Bob) transmit and receive in an in-band full-duplex (IBFD) manner. For this system with keyless security, we provide a novel artificial noise (AN) based signal design, where the AN is injected in both signal and null spaces. We present an ergodic secrecy rate approximation to derive the power allocation algorithm. We consider scenarios where AN is known and unknown to legitimate users and include imperfect channel information effects. To maximize secrecy rates subject to the transmit power constraint, a two-step power allocation solution is proposed, where the first step is known at Eve, and the second step helps to improve the secrecy further. We also consider scenarios where partial information is known by Eve and the effects of non-ideal self-interference cancellation. The usefulness and limitations of the resulting power allocation solution are analyzed and verified via simulations. Results show that secrecy rates are less when AN is unknown to receivers or Eve has more information about legitimate users. Since the ergodic approximation only considers Eveās distance, the resulting power allocation provides secrecy rates close to the actual ones.
- Open Access
- 26 January 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Access
- Vol.Ā 12, 19520-19531
Tensor Completion Algorithm and Its Applications to Wireless Edge Caching and Hyper- Spectral Imaging
In this paper, we present a lightweight tensor completion algorithm with applications in wireless edge caching and hyper-spectral imaging. In wireless edge caching, content popularityās dynamic and selective nature inevitably leads to missing observations. We address this challenge by employing tensor-based models, which are notably practical for imputing missing data. We approach cooperative caching as a problem of third-order tensor completion and prediction, acknowledging the correlations across time, files, and base stations. Given the potentially large content libraries, we modify the latent norm-based Frank-Wolfe (FW) algorithm. This modification, which incorporates multi-rank updates instead of the traditional rank-1 updates, significantly reduces computational time complexity. This advancement facilitates the development of an efficient online caching algorithm. Through simulations using Movielens datasets and comparing them with the conventional FW algorithm, our proposed algorithm demonstrates a reduced computational overhead reduction and improved normalized cache hit rates within linear prediction models. Furthermore, since hyper-spectral images often have missing or corrupted data due to various noise sources, we conduct simulations on hyper-spectral images. From the Pavia University and Pavia City datasets with noisy data, our proposed tensor completion algorithm can recover the original images from heavily interfered with communication noise effectively. The effectiveness of our proposed tensor completion algorithm across various applications, including wireless edge caching and hyper-spectral imaging, accentuates its versatility and significant utility. Its ability to adeptly handle diverse challenges underscores its value as a comprehensive solution for solving intricate data recovery problems.
- 26 January 2024
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Access
- Vol.Ā 12, 19520-19531
Open AccessTensor Completion Algorithm and Its Applications to Wireless Edge Caching and Hyper- Spectral Imaging
In this paper, we present a lightweight tensor completion algorithm with applications in wireless edge caching and hyper-spectral imaging. In wireless edge caching, content popularityās dynamic and selective nature inevitably leads to missing observations. We address this challenge by employing tensor-based models, which are notably practical for imputing missing data. We approach cooperative caching as a problem of third-order tensor completion and prediction, acknowledging the correlations across time, files, and base stations. Given the potentially large content libraries, we modify the latent norm-based Frank-Wolfe (FW) algorithm. This modification, which incorporates multi-rank updates instead of the traditional rank-1 updates, significantly reduces computational time complexity. This advancement facilitates the development of an efficient online caching algorithm. Through simulations using Movielens datasets and comparing them with the conventional FW algorithm, our proposed algorithm demonstrates a reduced computational overhead reduction and improved normalized cache hit rates within linear prediction models. Furthermore, since hyper-spectral images often have missing or corrupted data due to various noise sources, we conduct simulations on hyper-spectral images. From the Pavia University and Pavia City datasets with noisy data, our proposed tensor completion algorithm can recover the original images from heavily interfered with communication noise effectively. The effectiveness of our proposed tensor completion algorithm across various applications, including wireless edge caching and hyper-spectral imaging, accentuates its versatility and significant utility. Its ability to adeptly handle diverse challenges underscores its value as a comprehensive solution for solving intricate data recovery problems.
- 21 December 2023
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Internet of Things Journal
- Vol.Ā 11 Ā (8) , 14901-14913
Distributed Transceiver Design for Decentralized Estimation in Coexisting IoT Networks
With the increasing number of applications of Internet of Things (IoT) devices, co-channel interference is unavoidable among coexisting wireless networks, where multiple IoT devices transmit their observations to their respective destinations [access points (APs)]. In this scenario, we present a joint precoding and power allocation solution to minimize the mean squared error (MSE), while satisfying power constraints at individual IoT devices. In this regard, first, the necessary feasibility condition for the joint convexity of the optimization problem is derived, ensuring the global optimum solution. Subsequently, based on the solution, an iterative MSE algorithm is formulated and analyzed for convergence. The expressions for the MSE-based precoder is obtained via solving KarushāKuhnāTucker (KKT) conditions. Further analysis shows that the total resulting MSE at APs is limited by the observation signal-to-noise-ratio (SNR). It leads to the inference that in order to avoid the MSE saturation at APs at higher SNRs, the transmit power at IoT devices should be scaled proportional to and less than the observation SNR. Next, we compare the performance of our solution with two classical methods, namely, the minimum variance distortionless precoding (MVDP) and interference alignment (IA) methods, which are modified and enhanced for the given system. Simulations verify the above inference, and the global convergence of the MSE algorithm, with robustness to initializations yielding the better precoders and power allocation as compared to MVDPās and IAās in terms of the averaged total MSE performance.
- 21 December 2023
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Internet of Things Journal
- Vol.Ā 11 Ā (8) , 14901-14913
Distributed Transceiver Design for Decentralized Estimation in Coexisting IoT Networks
With the increasing number of applications of Internet of Things (IoT) devices, co-channel interference is unavoidable among coexisting wireless networks, where multiple IoT devices transmit their observations to their respective destinations [access points (APs)]. In this scenario, we present a joint precoding and power allocation solution to minimize the mean squared error (MSE), while satisfying power constraints at individual IoT devices. In this regard, first, the necessary feasibility condition for the joint convexity of the optimization problem is derived, ensuring the global optimum solution. Subsequently, based on the solution, an iterative MSE algorithm is formulated and analyzed for convergence. The expressions for the MSE-based precoder is obtained via solving KarushāKuhnāTucker (KKT) conditions. Further analysis shows that the total resulting MSE at APs is limited by the observation signal-to-noise-ratio (SNR). It leads to the inference that in order to avoid the MSE saturation at APs at higher SNRs, the transmit power at IoT devices should be scaled proportional to and less than the observation SNR. Next, we compare the performance of our solution with two classical methods, namely, the minimum variance distortionless precoding (MVDP) and interference alignment (IA) methods, which are modified and enhanced for the given system. Simulations verify the above inference, and the global convergence of the MSE algorithm, with robustness to initializations yielding the better precoders and power allocation as compared to MVDPās and IAās in terms of the averaged total MSE performance.
- Open Access
- 15 December 2023
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Access
- Vol.Ā 11, 142162-142176
Transceiver Design for IRS-Aided Massive MIMO Networks With Rate-Splitting
Intelligent reflecting surface (IRS), equipped with multiple reflective elements, is an important technology for improving the achievable rate and energy efficiency of communications. Meanwhile, rate-splitting (RS) is an approach that reduces the detrimental effect of multi-user interference in the system by splitting usersā messages into private and common parts. In this work, we use the RS method in an IRS-aided massive multiple-input multiple-output (mMIMO) system. We assume each user is equipped with multiple antennas and then design the transceiver, which include the precoder and the combiner. We analyze the performance of the achievable sum-rate when the base station (BS) and users know perfect channel state information (CSI) or only statistical CSI. We use a projected gradient descent method (PGDM) to optimize the IRS phase shifts by minimizing the mean-squared error (MSE) for data estimates when the system has mixed CSI. The performance of combiner and precoder quantization, as well as the limited feedback has also been investigated in simulations in terms of the achievable sum-rate by using the iterative chordal distance (ICD) method.
- 15 December 2023
- Published byĀ Institute of Electrical and Electronics Engineers (IEEE)Ā inĀ IEEE Access
- Vol.Ā 11, 142162-142176
Open AccessTransceiver Design for IRS-Aided Massive MIMO Networks With Rate-Splitting
Intelligent reflecting surface (IRS), equipped with multiple reflective elements, is an important technology for improving the achievable rate and energy efficiency of communications. Meanwhile, rate-splitting (RS) is an approach that reduces the detrimental effect of multi-user interference in the system by splitting usersā messages into private and common parts. In this work, we use the RS method in an IRS-aided massive multiple-input multiple-output (mMIMO) system. We assume each user is equipped with multiple antennas and then design the transceiver, which include the precoder and the combiner. We analyze the performance of the achievable sum-rate when the base station (BS) and users know perfect channel state information (CSI) or only statistical CSI. We use a projected gradient descent method (PGDM) to optimize the IRS phase shifts by minimizing the mean-squared error (MSE) for data estimates when the system has mixed CSI. The performance of combiner and precoder quantization, as well as the limited feedback has also been investigated in simulations in terms of the achievable sum-rate by using the iterative chordal distance (ICD) method.