Pub Date : 2023-03-01DOI: 10.1109/WCNC55385.2023.10119103
Farjam Karim, S. Singh, Keshav Singh, F. Khan
Simultaneous refracting/transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) has emerged as a potential technology for future-generation wireless networks to support extremely high data rates with a broader coverage area. In this work, with an aim to provide a novel analytical framework, we investigate the performance of a STAR-RIS assisted full duplex (FD) wireless communication system under finite block length (FBL) transmission. In particular, we first derive the probability density function and cumulative distribution function of the signal-to-interference-plus-noise ratio (SINR) for the uplink and downlink users. We then analyze the system performance by deriving closed form expressions for their block error rate (BLER) and goodput. Finally, we validate the accuracy of the derived analytical expressions using Monte-Carlo simulations and show that as the number of elements in the STAR-RIS is increased the system performance also improves. Furthermore, we graphically demonstrate the impact of imperfect channel state information and compare the performance of STAR-RIS in mode switching (MS) and energy splitting (ES) protocol.
{"title":"STAR-RIS-aided Full Duplex Communications with FBL Transmission","authors":"Farjam Karim, S. Singh, Keshav Singh, F. Khan","doi":"10.1109/WCNC55385.2023.10119103","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10119103","url":null,"abstract":"Simultaneous refracting/transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) has emerged as a potential technology for future-generation wireless networks to support extremely high data rates with a broader coverage area. In this work, with an aim to provide a novel analytical framework, we investigate the performance of a STAR-RIS assisted full duplex (FD) wireless communication system under finite block length (FBL) transmission. In particular, we first derive the probability density function and cumulative distribution function of the signal-to-interference-plus-noise ratio (SINR) for the uplink and downlink users. We then analyze the system performance by deriving closed form expressions for their block error rate (BLER) and goodput. Finally, we validate the accuracy of the derived analytical expressions using Monte-Carlo simulations and show that as the number of elements in the STAR-RIS is increased the system performance also improves. Furthermore, we graphically demonstrate the impact of imperfect channel state information and compare the performance of STAR-RIS in mode switching (MS) and energy splitting (ES) protocol.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123855518","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}
Radio Frequency Fingerprint (RFF) technology is an effective means to defend against cheating and counterfeit attacks in wireless communication. A deep learning-based RFF recognition algorithm can achieve well recognition performance, but it needs many balanced samples to train the model. However, the problem of sample imbalance is widespread in RFF identification tasks, and the number of signal samples of illegal devices is minimal. Neural network models usually can't learn these minority representations well, which seriously affects the performance of RFF recognition. Many advanced algorithms proposed to alleviate the problem of data imbalance don't perform well in the task of RFF recognition because they ignore the characteristics of RFF signals. Therefore, an algorithm based on Random Railings Enhancement (RRE) is proposed in this paper, which fills the data set with random masks according to the signal values front and rear. RRE protects the original signal's information, effectively expands the rare dataset, and has the effect of data enhancement. The experimental results show that the RRE can improve the performance of Radio Frequency (RF) identification technology tasks in the case of imbalanced data sets.
{"title":"Random Railings Enhancement For RFF Imbalanced Data Augmentation","authors":"Xiaolin Fan, Caidan Zhao, Liang Xiao, Xiangyu Huang","doi":"10.1109/WCNC55385.2023.10118947","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118947","url":null,"abstract":"Radio Frequency Fingerprint (RFF) technology is an effective means to defend against cheating and counterfeit attacks in wireless communication. A deep learning-based RFF recognition algorithm can achieve well recognition performance, but it needs many balanced samples to train the model. However, the problem of sample imbalance is widespread in RFF identification tasks, and the number of signal samples of illegal devices is minimal. Neural network models usually can't learn these minority representations well, which seriously affects the performance of RFF recognition. Many advanced algorithms proposed to alleviate the problem of data imbalance don't perform well in the task of RFF recognition because they ignore the characteristics of RFF signals. Therefore, an algorithm based on Random Railings Enhancement (RRE) is proposed in this paper, which fills the data set with random masks according to the signal values front and rear. RRE protects the original signal's information, effectively expands the rare dataset, and has the effect of data enhancement. The experimental results show that the RRE can improve the performance of Radio Frequency (RF) identification technology tasks in the case of imbalanced data sets.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125882879","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10119057
Yang Zhao, Peng Chen, Z. Cao
The target location can be realized based on the estimated directions of arrival (DOAs) when using multiple arrays. However, this leads to the increase of radar system cost. Meanwhile, the location precision depends on the high accuracy of DOA estimations, which are usually with high computational complexity. In this paper, the problem of low-cost system and low-complexity DOA estimation method are addressed. First, a low-cost intelligent reflecting surfaces (IRSs) aided radar location system is developed, where only one fully functional receiving channel is adopted. Then, a novel nonconvex-based atomic norm minimization (NC-ANM) problem is formulated by exploiting the targets’ sparsity in the spatial domain to estimate the DOA more efficiently. After getting the DOA estimations, a multi-target location method is proposed. Simulation results show that the proposed NC-ANM method outperforms the compared methods in the DOA estimation with lower computational complexity and achieves accurate location in the IRSs aided system.
{"title":"Multi-Target Location for Intelligent Reflecting Surface Aided Radar System","authors":"Yang Zhao, Peng Chen, Z. Cao","doi":"10.1109/WCNC55385.2023.10119057","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10119057","url":null,"abstract":"The target location can be realized based on the estimated directions of arrival (DOAs) when using multiple arrays. However, this leads to the increase of radar system cost. Meanwhile, the location precision depends on the high accuracy of DOA estimations, which are usually with high computational complexity. In this paper, the problem of low-cost system and low-complexity DOA estimation method are addressed. First, a low-cost intelligent reflecting surfaces (IRSs) aided radar location system is developed, where only one fully functional receiving channel is adopted. Then, a novel nonconvex-based atomic norm minimization (NC-ANM) problem is formulated by exploiting the targets’ sparsity in the spatial domain to estimate the DOA more efficiently. After getting the DOA estimations, a multi-target location method is proposed. Simulation results show that the proposed NC-ANM method outperforms the compared methods in the DOA estimation with lower computational complexity and achieves accurate location in the IRSs aided system.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125954828","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10119058
Torge Mewes, Stephan Zeitz, Peter Neuhaus, Meik Dörpinghaus, G. Fettweis
Utilizing 1-bit quantization at the analog-to-digital converter (ADC) is a promising approach to reduce the problematically high power consumption of high resolution ADCs in millimeter-wave (mmWave) and sub-terahertz (THz) communications. However, as 1-bit quantization is a highly nonlinear operation standard channel estimation algorithms cannot be applied. Therefore, we study algorithms for channel estimation in receivers with 1-bit quantization under consideration of a two-wave with diffuse power (TWDP) fading channel model, which was shown to be a realistic model for indoor communications in the mmWave regime. We combine maximum-likelihood (ML) amplitude estimation with a least-squares (LS) phase estimation approach known from literature to estimate the fading channel based on blocks of pilot symbols periodically inserted into the transmit symbol sequence. Furthermore, we apply Wiener filtering for interpolation of the channel estimates at the data blocks. The estimation performance of the proposed algorithms is evaluated numerically in terms of the mean squared error (MSE) and the suitability of the approach is demonstrated by evaluating the coded block error rate (BLER) for an exemplary system in comparison to the case with perfect channel knowledge. Our results show that almost the same BLER can be achieved by utilizing the derived estimation approach as compared to a system with perfect channel knowledge.
{"title":"Channel Estimation for Two-Wave with Diffuse Power Fading Channels under 1-bit Quantization","authors":"Torge Mewes, Stephan Zeitz, Peter Neuhaus, Meik Dörpinghaus, G. Fettweis","doi":"10.1109/WCNC55385.2023.10119058","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10119058","url":null,"abstract":"Utilizing 1-bit quantization at the analog-to-digital converter (ADC) is a promising approach to reduce the problematically high power consumption of high resolution ADCs in millimeter-wave (mmWave) and sub-terahertz (THz) communications. However, as 1-bit quantization is a highly nonlinear operation standard channel estimation algorithms cannot be applied. Therefore, we study algorithms for channel estimation in receivers with 1-bit quantization under consideration of a two-wave with diffuse power (TWDP) fading channel model, which was shown to be a realistic model for indoor communications in the mmWave regime. We combine maximum-likelihood (ML) amplitude estimation with a least-squares (LS) phase estimation approach known from literature to estimate the fading channel based on blocks of pilot symbols periodically inserted into the transmit symbol sequence. Furthermore, we apply Wiener filtering for interpolation of the channel estimates at the data blocks. The estimation performance of the proposed algorithms is evaluated numerically in terms of the mean squared error (MSE) and the suitability of the approach is demonstrated by evaluating the coded block error rate (BLER) for an exemplary system in comparison to the case with perfect channel knowledge. Our results show that almost the same BLER can be achieved by utilizing the derived estimation approach as compared to a system with perfect channel knowledge.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129957401","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10119101
Saeedeh Moloudi, Mohammad Mozaffari, Kittipong Kittichokechai, A. Höglund, Sandeep Narayanan Kadan Veedu, Y.-P. Eric Wang, Johan Bergman
The fifth-generation wireless technology is primarily designed to address a wide range of use cases mainly categorized into the enhanced mobile broadband, ultra-reliable and low-latency communication, and massive machine-type communication segments. To efficiently serve some other use cases whose requirements lie in-between these main use cases, the 3rd generation partnership project (3GPP), in Rel-17, introduce support for the reduced capability new radio (NR) devices known as RedCap with lower cost and complexity compared to legacy 5G devices. The considered complexity reduction techniques are associated with degraded link performance and coverage for the physical channels. Particularly, for the physical downlink control channel (PDCCH), which requires careful consideration, the reduction of the user equipments’ (UEs) complexity and the associated coverage loss can lead to an increase in the PDCCH blocking probability. This, in turn, can impact either the latency or the network capacity depending on the scenario. In this paper, we investigate the PDCCH blocking probability metric for RedCap devices. Specifically, we evaluate the performance of blocking probability in terms of various parameters including the number of users, size of downlink control information, size of control resource set, and the number of PDCCH candidates. Our results demonstrate that the PDCCH blocking probability increases by reducing the number of antenna branches, the number of PDCCH candidates, control resource set, and by increasing the number of scheduled UEs. We also show that the impact of reducing the DCI size is marginal on the PDCCH blocking probability. Finally, we discuss potential solutions and design guidelines for reducing the PDCCH blocking probability.
{"title":"5G Reduced Capability Devices: Analysis of Blocking Probability for Control Channels","authors":"Saeedeh Moloudi, Mohammad Mozaffari, Kittipong Kittichokechai, A. Höglund, Sandeep Narayanan Kadan Veedu, Y.-P. Eric Wang, Johan Bergman","doi":"10.1109/WCNC55385.2023.10119101","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10119101","url":null,"abstract":"The fifth-generation wireless technology is primarily designed to address a wide range of use cases mainly categorized into the enhanced mobile broadband, ultra-reliable and low-latency communication, and massive machine-type communication segments. To efficiently serve some other use cases whose requirements lie in-between these main use cases, the 3rd generation partnership project (3GPP), in Rel-17, introduce support for the reduced capability new radio (NR) devices known as RedCap with lower cost and complexity compared to legacy 5G devices. The considered complexity reduction techniques are associated with degraded link performance and coverage for the physical channels. Particularly, for the physical downlink control channel (PDCCH), which requires careful consideration, the reduction of the user equipments’ (UEs) complexity and the associated coverage loss can lead to an increase in the PDCCH blocking probability. This, in turn, can impact either the latency or the network capacity depending on the scenario. In this paper, we investigate the PDCCH blocking probability metric for RedCap devices. Specifically, we evaluate the performance of blocking probability in terms of various parameters including the number of users, size of downlink control information, size of control resource set, and the number of PDCCH candidates. Our results demonstrate that the PDCCH blocking probability increases by reducing the number of antenna branches, the number of PDCCH candidates, control resource set, and by increasing the number of scheduled UEs. We also show that the impact of reducing the DCI size is marginal on the PDCCH blocking probability. Finally, we discuss potential solutions and design guidelines for reducing the PDCCH blocking probability.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130006778","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118860
Yung Kong, Youlong Wu, Minquan Cheng
This paper considers a hierarchical caching system where a server connects with multiple mirror sites, each connecting with a distinct set of users, and both mirror sites and users are equipped with caching memories. Although there already exist works studying this setup and proposing coded caching schemes to reduce transmission loads, two main problems are remained to address: 1) the optimal communication load R1 under the uncoded placement for the first layer is still unknown. 2) the previous schemes are based on Maddah-Ali and Niesen’s data placement and delivery, which require high subpacketization level. How to achieve a good tradeoff between transmission loads and subpacketization level for the hierarchical caching system is unclear. In this paper, we aim to address these two problems. We first propose a new combination structure named hierarchical placement delivery array (HPDA), which characterizes the data placement and delivery for a hierarchical caching system. Then we construct two classes of HPDAs, where the first class leads to a scheme achieving the optimal R1 for some cases, and the second class requires a smaller subpacketization level at the cost of slight increase in transmission loads.
{"title":"Combinatorial Designs for Coded Caching on Hierarchical Networks","authors":"Yung Kong, Youlong Wu, Minquan Cheng","doi":"10.1109/WCNC55385.2023.10118860","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118860","url":null,"abstract":"This paper considers a hierarchical caching system where a server connects with multiple mirror sites, each connecting with a distinct set of users, and both mirror sites and users are equipped with caching memories. Although there already exist works studying this setup and proposing coded caching schemes to reduce transmission loads, two main problems are remained to address: 1) the optimal communication load R1 under the uncoded placement for the first layer is still unknown. 2) the previous schemes are based on Maddah-Ali and Niesen’s data placement and delivery, which require high subpacketization level. How to achieve a good tradeoff between transmission loads and subpacketization level for the hierarchical caching system is unclear. In this paper, we aim to address these two problems. We first propose a new combination structure named hierarchical placement delivery array (HPDA), which characterizes the data placement and delivery for a hierarchical caching system. Then we construct two classes of HPDAs, where the first class leads to a scheme achieving the optimal R1 for some cases, and the second class requires a smaller subpacketization level at the cost of slight increase in transmission loads.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129732745","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118987
M. A. Aygül, M. Nazzal, H. Arslan
Identifying spectrum opportunities is a crucial element of efficient spectrum utilization for future wireless networks. Spectrum sensing offers a convenient means for revealing such opportunities. Studies showed that usage of the spectrum has a high correlation over multi-dimensions, including time and frequency. However, multi-dimensional spectrum sensing requires high-cost processes. Applying compressive sensing allows for subNyquist sampling. This reduces associated training, feedback, and computation overheads of a spectrum sensing method. However, the accuracy of the signal sparsity assumption and knowledge of the precise sparsity level are necessary for the applicability of compressive sensing. It is common practice to assume a level of known sparsity. On the other hand, in reality, this presumption is incorrect. This paper proposes a method for estimating the multidimensional sparsity for spectrum sensing. By extrapolating it from its counterpart with respect to a compact discrete Fourier basis, the proposed method calculates the sparsity level over a dictionary. A machine learning estimation method achieves this inference. Extensive simulations validate a high-quality sparsity estimation. To validate this observation, real-world measurements are used, where one of the biggest Turkish telecom operators has private uplink bands in the frequency range between 852-856 MHz.
{"title":"Estimating Multi-Dimensional Sparsity Level for Spectrum Sensing","authors":"M. A. Aygül, M. Nazzal, H. Arslan","doi":"10.1109/WCNC55385.2023.10118987","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118987","url":null,"abstract":"Identifying spectrum opportunities is a crucial element of efficient spectrum utilization for future wireless networks. Spectrum sensing offers a convenient means for revealing such opportunities. Studies showed that usage of the spectrum has a high correlation over multi-dimensions, including time and frequency. However, multi-dimensional spectrum sensing requires high-cost processes. Applying compressive sensing allows for subNyquist sampling. This reduces associated training, feedback, and computation overheads of a spectrum sensing method. However, the accuracy of the signal sparsity assumption and knowledge of the precise sparsity level are necessary for the applicability of compressive sensing. It is common practice to assume a level of known sparsity. On the other hand, in reality, this presumption is incorrect. This paper proposes a method for estimating the multidimensional sparsity for spectrum sensing. By extrapolating it from its counterpart with respect to a compact discrete Fourier basis, the proposed method calculates the sparsity level over a dictionary. A machine learning estimation method achieves this inference. Extensive simulations validate a high-quality sparsity estimation. To validate this observation, real-world measurements are used, where one of the biggest Turkish telecom operators has private uplink bands in the frequency range between 852-856 MHz.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124620740","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118773
Bowen Jia, Pingzhi Fan, Qianli Wang
A low complexity doubly fractional orthogonal time-frequency space (OTFS) channel estimation method is proposed in this paper. In order to deal with the channel spread caused by fractional delay and Doppler frequency shift, and to make full use of channel sparsity in the delay Doppler (DD) domain, the channel response is estimated in the fractional DD domain. In the fractional DD domain, the channel state information (CSI) could be approximately represented by several impulse responses and their corresponding delay Doppler information. Thus, we do not process the whole responses corresponding to the entire DD domain, but find only several impulse responses iteratively. To alleviate the coupling effect between the fractional delay and Doppler dimension, mixed one- and two-dimensional (1&2D) fractional models are used, and then these models are combined in an optimization problem to get the final CSI. To further reduce the complexity, limited Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method is employed in this paper, thus resulting much reduced complexity, i.e., $mathcal{O}left( {lambda {M_0}{N_0}} right)$, compared with baseline schemes. Our simulation results show that, despite the quite low complexity, the NMSE performance of the proposed scheme is still superior to several classic methods.
{"title":"Low Complexity Doubly Fractional OTFS Channel Estimation Based on L-BFGS Method","authors":"Bowen Jia, Pingzhi Fan, Qianli Wang","doi":"10.1109/WCNC55385.2023.10118773","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118773","url":null,"abstract":"A low complexity doubly fractional orthogonal time-frequency space (OTFS) channel estimation method is proposed in this paper. In order to deal with the channel spread caused by fractional delay and Doppler frequency shift, and to make full use of channel sparsity in the delay Doppler (DD) domain, the channel response is estimated in the fractional DD domain. In the fractional DD domain, the channel state information (CSI) could be approximately represented by several impulse responses and their corresponding delay Doppler information. Thus, we do not process the whole responses corresponding to the entire DD domain, but find only several impulse responses iteratively. To alleviate the coupling effect between the fractional delay and Doppler dimension, mixed one- and two-dimensional (1&2D) fractional models are used, and then these models are combined in an optimization problem to get the final CSI. To further reduce the complexity, limited Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) method is employed in this paper, thus resulting much reduced complexity, i.e., $mathcal{O}left( {lambda {M_0}{N_0}} right)$, compared with baseline schemes. Our simulation results show that, despite the quite low complexity, the NMSE performance of the proposed scheme is still superior to several classic methods.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124628972","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10118689
Xuanyu Li, K. Niu, Jincheng Dai, Zhi-Wei Tan, Zhiheng Guo
Guessing random additive noise decoding (GRAND) is a recently proposed decoding algorithm which can achieve the error performance of maximum likelihood (ML) decoding. However, GRAND and its variants are only suitable for some short codes with high code rates and have large average query numbers. To mitigate these problems, we propose a successive cancellation list (SCL)-GRAND decoding algorithm for the cyclic redundancy check concatenated polar (CRC-polar) codes. The proposed decoder first divides the received sequence into two subblocks. Then SCL is used to decode the upper subblock and output several candidates into the candidate list. For each candidate, GRAND is used to decode the lower subblock and finally choose the most-likely codeword as the decoded result. Since the SCL is integrated into the SCL-GRAND algorithm, this algorithm can achieve lower complexity and better flexibility than the original GRAND.
{"title":"SCL-GRAND: Lower complexity and better flexibility for CRC-Polar Codes","authors":"Xuanyu Li, K. Niu, Jincheng Dai, Zhi-Wei Tan, Zhiheng Guo","doi":"10.1109/WCNC55385.2023.10118689","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10118689","url":null,"abstract":"Guessing random additive noise decoding (GRAND) is a recently proposed decoding algorithm which can achieve the error performance of maximum likelihood (ML) decoding. However, GRAND and its variants are only suitable for some short codes with high code rates and have large average query numbers. To mitigate these problems, we propose a successive cancellation list (SCL)-GRAND decoding algorithm for the cyclic redundancy check concatenated polar (CRC-polar) codes. The proposed decoder first divides the received sequence into two subblocks. Then SCL is used to decode the upper subblock and output several candidates into the candidate list. For each candidate, GRAND is used to decode the lower subblock and finally choose the most-likely codeword as the decoded result. Since the SCL is integrated into the SCL-GRAND algorithm, this algorithm can achieve lower complexity and better flexibility than the original GRAND.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121990750","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 : 2023-03-01DOI: 10.1109/WCNC55385.2023.10119121
Giovanni Interdonato, S. Buzzi, C. D’Andrea, L. Venturino
The non-orthogonal coexistence between the enhanced mobile broadband (eMBB) and the ultra-reliable low-latency communication (URLLC) in the downlink of a multi-cell massive MIMO system is investigated in this work. We provide a unified information-theoretic framework blending an infinite-blocklength analysis of the eMBB spectral efficiency (SE) in the ergodic regime with a finite-blocklength analysis of the URLLC error probability. Puncturing (PUNC) and superposition coding (SPC) are considered as alternative coexistence strategies to deal with the inter-service interference. eMBB and URLLC performances are then evaluated over different precoding techniques and power control schemes, by accounting for imperfect channel state information knowledge at the base stations, pilot-based estimation overhead, spatially correlated channels, and the structure of the radio frame. Simulation results reveal that SPC is, in many operating regimes, superior to PUNC in providing higher SE for the eMBB yet achieving the target reliability for the URLLC with high probability. However, PUNC turns to be necessary to preserve the URLLC performance in scenarios where the multi-user interference cannot be satisfactorily alleviated.
{"title":"Non-Orthogonal Multiplexing of eMBB and URLLC in Multi-cell Massive MIMO","authors":"Giovanni Interdonato, S. Buzzi, C. D’Andrea, L. Venturino","doi":"10.1109/WCNC55385.2023.10119121","DOIUrl":"https://doi.org/10.1109/WCNC55385.2023.10119121","url":null,"abstract":"The non-orthogonal coexistence between the enhanced mobile broadband (eMBB) and the ultra-reliable low-latency communication (URLLC) in the downlink of a multi-cell massive MIMO system is investigated in this work. We provide a unified information-theoretic framework blending an infinite-blocklength analysis of the eMBB spectral efficiency (SE) in the ergodic regime with a finite-blocklength analysis of the URLLC error probability. Puncturing (PUNC) and superposition coding (SPC) are considered as alternative coexistence strategies to deal with the inter-service interference. eMBB and URLLC performances are then evaluated over different precoding techniques and power control schemes, by accounting for imperfect channel state information knowledge at the base stations, pilot-based estimation overhead, spatially correlated channels, and the structure of the radio frame. Simulation results reveal that SPC is, in many operating regimes, superior to PUNC in providing higher SE for the eMBB yet achieving the target reliability for the URLLC with high probability. However, PUNC turns to be necessary to preserve the URLLC performance in scenarios where the multi-user interference cannot be satisfactorily alleviated.","PeriodicalId":259116,"journal":{"name":"2023 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122049835","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
扫码关注我们
求助内容：
应助结果提醒方式：