This paper presents a kernel-based adaptive filter that is applied for the digital domain self-interference cancellation (SIC) in a transceiver operating in full-duplex (FD) mode. In FD, the benefit of simultaneous transmission and receiving of signals comes at the price of strong self-interference (SI). In this work, we are primarily interested in suppressing the SI using an adaptive filter namely adaptive projected subgradient method (APSM) in a reproducing kernel Hilbert space (RKHS) of functions. Using the projection concept as a powerful tool, APSM is used to model and consequently remove the SI. A low-complexity and fast-tracking algorithm is provided taking advantage of parallel projections as well as the kernel trick in RKHS. The performance of the proposed method is evaluated on real measurement data. The method illustrates the good performance of the proposed adaptive filter, compared to the known popular benchmarks. They demonstrate that the kernel-based algorithm achieves a favorable level of digital SIC while enabling parallel computation-based implementation within a rich and nonlinear function space, thanks to the employed adaptive filtering method.
{"title":"Parallel APSM for Fast and Adaptive Digital SIC in Full-Duplex Transceivers with Nonlinearity","authors":"M. Attar, Omid Taghizadeh, Kaixin Chang, Ramez Askar, Matthias Mehlhose, Sławomir Stańczak","doi":"10.1109/spawc51304.2022.9833961","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833961","url":null,"abstract":"This paper presents a kernel-based adaptive filter that is applied for the digital domain self-interference cancellation (SIC) in a transceiver operating in full-duplex (FD) mode. In FD, the benefit of simultaneous transmission and receiving of signals comes at the price of strong self-interference (SI). In this work, we are primarily interested in suppressing the SI using an adaptive filter namely adaptive projected subgradient method (APSM) in a reproducing kernel Hilbert space (RKHS) of functions. Using the projection concept as a powerful tool, APSM is used to model and consequently remove the SI. A low-complexity and fast-tracking algorithm is provided taking advantage of parallel projections as well as the kernel trick in RKHS. The performance of the proposed method is evaluated on real measurement data. The method illustrates the good performance of the proposed adaptive filter, compared to the known popular benchmarks. They demonstrate that the kernel-based algorithm achieves a favorable level of digital SIC while enabling parallel computation-based implementation within a rich and nonlinear function space, thanks to the employed adaptive filtering method.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126165142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833968
Nikolaos Ntetsikas, N. Babu, M. H. Tariq, C. Papadias, Jinfeng Du, D. Chizhik, R. Valenzuela, M. Rodríguez, R. Feick
In this paper, we present 60 GHz outdoor to indoor directional propagation measurements done on the main campus of The American College of Greece (ACG). The receiver was placed in offices and corridors, and the transmitter was placed at over 160 different points in a large parking lot. We collected over 2.4 million power measurements, from four similar runs, with distance up to 220 meters. Slope-intercept fits to each run separately resulted in a RMS error of under 2.5 dB, where three out of four slopes are close to 4, and one is close to 2. Excess loss relative to Free space exceeded 30 dB for distances beyond 20 m. Azimuthal gain degradation due to scattering was 7.5 dB at the 90th percentile, while temporal power fluctuations resulted in a minimum Rician K factor of 9 dB for 90% of measured links.
{"title":"60 GHz Outdoor to Indoor (O2I) Propagation Measurements in a University Campus","authors":"Nikolaos Ntetsikas, N. Babu, M. H. Tariq, C. Papadias, Jinfeng Du, D. Chizhik, R. Valenzuela, M. Rodríguez, R. Feick","doi":"10.1109/spawc51304.2022.9833968","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833968","url":null,"abstract":"In this paper, we present 60 GHz outdoor to indoor directional propagation measurements done on the main campus of The American College of Greece (ACG). The receiver was placed in offices and corridors, and the transmitter was placed at over 160 different points in a large parking lot. We collected over 2.4 million power measurements, from four similar runs, with distance up to 220 meters. Slope-intercept fits to each run separately resulted in a RMS error of under 2.5 dB, where three out of four slopes are close to 4, and one is close to 2. Excess loss relative to Free space exceeded 30 dB for distances beyond 20 m. Azimuthal gain degradation due to scattering was 7.5 dB at the 90th percentile, while temporal power fluctuations resulted in a minimum Rician K factor of 9 dB for 90% of measured links.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128632932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9834010
Roman Klus, J. Talvitie, Julia Vinogradova, J. Torsner, M. Valkama
In this paper, we address the challenging problem of radio positioning in non-line-of-sight (NLoS) conditions. To this end, we utilize measurements in the form of time-of-flight and gNodeB angular information in the context of 5G New Radio (NR) networks. Such measurements are processed by artificial neural networks with different snapshot and sequence-processing architectures to track the positions of the terminals. For model training, we consider a crowdsensing data acquisition scheme to effortlessly gather the desired measurements with the synchronized location tags. Realistic ray-tracing based evaluations on the so-called Madrid map at 28 GHz millimeter-wave band are provided, to assess the achievable performance while also varying the amount of uncertainties within the data. The obtained results show that radio positioning is feasible with accuracy in the order of 1 meter, or even below, also in challenging NLOS scenarios if the data and measurement uncertainties are small. The results also show that the sequence processing approach offers superior performance under practical measurement uncertainties.
{"title":"Machine Learning Based NLOS Radio Positioning in Beamforming Networks","authors":"Roman Klus, J. Talvitie, Julia Vinogradova, J. Torsner, M. Valkama","doi":"10.1109/spawc51304.2022.9834010","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834010","url":null,"abstract":"In this paper, we address the challenging problem of radio positioning in non-line-of-sight (NLoS) conditions. To this end, we utilize measurements in the form of time-of-flight and gNodeB angular information in the context of 5G New Radio (NR) networks. Such measurements are processed by artificial neural networks with different snapshot and sequence-processing architectures to track the positions of the terminals. For model training, we consider a crowdsensing data acquisition scheme to effortlessly gather the desired measurements with the synchronized location tags. Realistic ray-tracing based evaluations on the so-called Madrid map at 28 GHz millimeter-wave band are provided, to assess the achievable performance while also varying the amount of uncertainties within the data. The obtained results show that radio positioning is feasible with accuracy in the order of 1 meter, or even below, also in challenging NLOS scenarios if the data and measurement uncertainties are small. The results also show that the sequence processing approach offers superior performance under practical measurement uncertainties.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126396867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9834011
{"title":"SPAWC 2022 Cover Page","authors":"","doi":"10.1109/spawc51304.2022.9834011","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834011","url":null,"abstract":"","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114549211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833960
Patrick Agostini, Z. Utkovski, Sławomir Stańczak
Multipoint channel charting (MP-CC) has been proposed as an effective approach to reap the benefits of cooperation for learning accurate channel charts in massive MIMO systems with multiple bases-stations (BSs). The high-dimensional nature of channel state information (CSI) data, however, imposes significant communication overhead between BSs for joint learning of the MP-CC. To reduce communication overhead and foster locality of CSI data, we explore federated learning (FL) approaches for distributed learning of joint multipoint channel charts. In the proposed approach, each BS learns an individual model and a shared model, where the individual model parameters are unique to each BS and the shared model parameters are communicated to a central server for aggregation. By sharing only weights of the shared model after each training episode, the communication overhead between BSs can be significantly reduced. We provide experimental results on a convolution autoencoder architecture with simulated beam-space CSI data, and compare the FL approach against a fully centralized architecture.
{"title":"Federated Learning for Multipoint Channel Charting","authors":"Patrick Agostini, Z. Utkovski, Sławomir Stańczak","doi":"10.1109/spawc51304.2022.9833960","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833960","url":null,"abstract":"Multipoint channel charting (MP-CC) has been proposed as an effective approach to reap the benefits of cooperation for learning accurate channel charts in massive MIMO systems with multiple bases-stations (BSs). The high-dimensional nature of channel state information (CSI) data, however, imposes significant communication overhead between BSs for joint learning of the MP-CC. To reduce communication overhead and foster locality of CSI data, we explore federated learning (FL) approaches for distributed learning of joint multipoint channel charts. In the proposed approach, each BS learns an individual model and a shared model, where the individual model parameters are unique to each BS and the shared model parameters are communicated to a central server for aggregation. By sharing only weights of the shared model after each training episode, the communication overhead between BSs can be significantly reduced. We provide experimental results on a convolution autoencoder architecture with simulated beam-space CSI data, and compare the FL approach against a fully centralized architecture.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128419114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9834009
Steffen Gracla, C. Bockelmann, A. Dekorsy
The quality of data driven learning algorithms scales significantly with the quality of data available. One of the most straight-forward ways to generate good data is to sample or explore the data source intelligently. Smart sampling can reduce the cost of gaining samples, reduce computation cost in learning, and enable the learning algorithm to adapt to unforeseen events. In this paper, we teach three Deep Q-Networks (DQN) with different exploration strategies to solve a problem of puncturing ongoing transmissions for URLLC messages. We demonstrate the efficiency of two adaptive exploration candidates, variance-based and Maximum Entropy-based exploration, compared to the standard, simple ϵ-greedy exploration approach.
{"title":"On the Importance of Exploration for Real Life Learned Algorithms","authors":"Steffen Gracla, C. Bockelmann, A. Dekorsy","doi":"10.1109/spawc51304.2022.9834009","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834009","url":null,"abstract":"The quality of data driven learning algorithms scales significantly with the quality of data available. One of the most straight-forward ways to generate good data is to sample or explore the data source intelligently. Smart sampling can reduce the cost of gaining samples, reduce computation cost in learning, and enable the learning algorithm to adapt to unforeseen events. In this paper, we teach three Deep Q-Networks (DQN) with different exploration strategies to solve a problem of puncturing ongoing transmissions for URLLC messages. We demonstrate the efficiency of two adaptive exploration candidates, variance-based and Maximum Entropy-based exploration, compared to the standard, simple ϵ-greedy exploration approach.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128681962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833944
Wang Liu, Ying Cui, Feng Yang, Lianghui Ding, Jun Sun
Recently, grant-free access is proposed as an essential technique for supporting massive machine-type communications (mMTC) for the Internet of Things (IoT). Most existing studies on device activity detection either make no use of channel statistics or assume Rayleigh fading for simplicity. Device activity detection under more general fading models remains open. To shed some light, this paper considers Rician fading and proposes a maximum likelihood estimation (MLE)-based device activity detection method. First, we formulate the estimation of device activities as an MLE problem. Then, based on the coordinate descent (CD) method, we develop an iterative algorithm, where all coordinate optimization problems are solved analytically, to obtain a stationary point of the non-convex MLE problem. Finally, numerical results demonstrate the notable gains of the proposed method over the existing solutions and offer important design insights into practical massive grant-free access for mMTC. The results in this paper generalize those for Rayleigh fading and have practical sense.
{"title":"MLE-based Device Activity Detection for Grant-free Massive Access under Rician Fading","authors":"Wang Liu, Ying Cui, Feng Yang, Lianghui Ding, Jun Sun","doi":"10.1109/spawc51304.2022.9833944","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833944","url":null,"abstract":"Recently, grant-free access is proposed as an essential technique for supporting massive machine-type communications (mMTC) for the Internet of Things (IoT). Most existing studies on device activity detection either make no use of channel statistics or assume Rayleigh fading for simplicity. Device activity detection under more general fading models remains open. To shed some light, this paper considers Rician fading and proposes a maximum likelihood estimation (MLE)-based device activity detection method. First, we formulate the estimation of device activities as an MLE problem. Then, based on the coordinate descent (CD) method, we develop an iterative algorithm, where all coordinate optimization problems are solved analytically, to obtain a stationary point of the non-convex MLE problem. Finally, numerical results demonstrate the notable gains of the proposed method over the existing solutions and offer important design insights into practical massive grant-free access for mMTC. The results in this paper generalize those for Rayleigh fading and have practical sense.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130795482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833919
Navneet Garg, T. Ratnarajah
In this paper, considering a two-way wiretap channel in the Multi-Input Multi-Output Multi-antenna Eve (MIMOME) channel, where both nodes (Alice and Bob) operate in full-duplex manner. For this system, we consider artificial noise (AN) based signal design and derive secrecy rate approximation based on mean-squared error (MSE) upper bound. Statistical power allocation problem is formulated in terms of an optimization problem with the maximization of Alice and Bob rates subject to the rate constraint at Eavesdropper (Eve). The usefulness of the resulting solution is verified via simulations. The results shows that with proper power allocation, Eve rates are significantly lower, and the Alice-Bob sum rates are close to the maximum rate, which are achieved, when the allowable Eve’s rates are increased.
{"title":"Power Allocation For Full-duplex Two-way Wiretap Channel","authors":"Navneet Garg, T. Ratnarajah","doi":"10.1109/spawc51304.2022.9833919","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833919","url":null,"abstract":"In this paper, considering a two-way wiretap channel in the Multi-Input Multi-Output Multi-antenna Eve (MIMOME) channel, where both nodes (Alice and Bob) operate in full-duplex manner. For this system, we consider artificial noise (AN) based signal design and derive secrecy rate approximation based on mean-squared error (MSE) upper bound. Statistical power allocation problem is formulated in terms of an optimization problem with the maximization of Alice and Bob rates subject to the rate constraint at Eavesdropper (Eve). The usefulness of the resulting solution is verified via simulations. The results shows that with proper power allocation, Eve rates are significantly lower, and the Alice-Bob sum rates are close to the maximum rate, which are achieved, when the allowable Eve’s rates are increased.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127941212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9833962
Yaqi Hu, Mingsheng Yin, S. Rangan, M. Mezzavilla
High-rank line-of-sight (LOS) MIMO systems have attracted considerable attention for millimeter wave and THz communications. The small wavelengths in these frequencies enable spatial multiplexing with massive data rates at long distances. Such systems are also being considered for multi-path non-LOS (NLOS) environments. In these scenarios, standard channels models based on plane waves cannot capture the curvature of each wave front necessary to model spatial multiplexing. This work presents a novel and simple multi-path wireless channel parametrization where each path is replaced by a LOS path with a reflected image source. The model fully captures the spherical nature of each wave front and uses only two additional parameters relative to the standard plane wave model. Moreover, the parameters can be easily captured in standard ray tracing. The accuracy of the approach is demonstrated on detailed ray tracing simulations at 28GHz and 140GHz in a dense urban area.
{"title":"Parametrization of High-Rank Line-of-Sight MIMO Channels with Reflected Paths","authors":"Yaqi Hu, Mingsheng Yin, S. Rangan, M. Mezzavilla","doi":"10.1109/spawc51304.2022.9833962","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9833962","url":null,"abstract":"High-rank line-of-sight (LOS) MIMO systems have attracted considerable attention for millimeter wave and THz communications. The small wavelengths in these frequencies enable spatial multiplexing with massive data rates at long distances. Such systems are also being considered for multi-path non-LOS (NLOS) environments. In these scenarios, standard channels models based on plane waves cannot capture the curvature of each wave front necessary to model spatial multiplexing. This work presents a novel and simple multi-path wireless channel parametrization where each path is replaced by a LOS path with a reflected image source. The model fully captures the spherical nature of each wave front and uses only two additional parameters relative to the standard plane wave model. Moreover, the parameters can be easily captured in standard ray tracing. The accuracy of the approach is demonstrated on detailed ray tracing simulations at 28GHz and 140GHz in a dense urban area.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131472613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-07-04DOI: 10.1109/spawc51304.2022.9834018
Ankit Gupta, M. Sellathurai, T. Ratnarajah
In this work, we derive a sequential experience-driven contextual bandit (CB)-based policies for online relay selection in multiple-input multiple-output (MIMO) two-way amplify-and-forward (TWAF) relay networks, where the relays are provided with quantized imperfect channel gain information. The proposed CB-based policy acquires information about the optimal relay node by resolving the exploration-versus-exploitation dilemma. In particular, we propose a linear upper confidence bound (LinUCB)-based CB policy, and an adaptive active greedy (AAG)-based CB policy that utilizes active learning heuristics. With simulation results, we show that the proposed CB-based policies can reduce the feedback overhead by a factor of eight and time-cost by 70% while outperforming the best conventional Gram-Schmidt (GS) algorithm.
{"title":"A Sequential Experience-driven Contextual Bandit Policy for MIMO TWAF Online Relay Selection","authors":"Ankit Gupta, M. Sellathurai, T. Ratnarajah","doi":"10.1109/spawc51304.2022.9834018","DOIUrl":"https://doi.org/10.1109/spawc51304.2022.9834018","url":null,"abstract":"In this work, we derive a sequential experience-driven contextual bandit (CB)-based policies for online relay selection in multiple-input multiple-output (MIMO) two-way amplify-and-forward (TWAF) relay networks, where the relays are provided with quantized imperfect channel gain information. The proposed CB-based policy acquires information about the optimal relay node by resolving the exploration-versus-exploitation dilemma. In particular, we propose a linear upper confidence bound (LinUCB)-based CB policy, and an adaptive active greedy (AAG)-based CB policy that utilizes active learning heuristics. With simulation results, we show that the proposed CB-based policies can reduce the feedback overhead by a factor of eight and time-cost by 70% while outperforming the best conventional Gram-Schmidt (GS) algorithm.","PeriodicalId":423807,"journal":{"name":"2022 IEEE 23rd International Workshop on Signal Processing Advances in Wireless Communication (SPAWC)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114715123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：