Pub Date : 2024-12-16DOI: 10.1109/LCOMM.2024.3518088
Ningping Yu;Xianling Wang;Yue Tian
The increasing demand for indoor location-based services (LBS) and the widespread use of mobile devices have spurred the development of accurate indoor localization systems for smartphones. Implementing these systems requires real-time responsiveness, non-cooperative communication with targets, and reliable localization capabilities. However, conventional active and passive localization systems face challenges, such as the necessity of target cooperation or latency caused by low measurement frequency. Additionally, the uncertainty in localization evaluation is often overlooked. In response to these issues, we present a WiFi-assisted non-cooperative fingerprint localization system (WiNCDN) that utilizes a dropout-based neural network. WiNCDN quickly gathers a large number of responses from WiFi devices by employing a hiding mechanism in the 802.11 protocol. Moreover, the system can make informed decisions based on localization confidence. Our findings demonstrate that WiNCDN enables real-time target tracking in various scenarios, including line-of-sight (LoS) and non-line-of-sight (NLoS) situations. Compared to existing methods, the results indicate that WiNCDN achieves a better balance between accuracy and robustness.
{"title":"WiNCDN: A Novel WiFi-Assisted Non-Cooperative Indoor Localization System via Dropout-Based Neural Network","authors":"Ningping Yu;Xianling Wang;Yue Tian","doi":"10.1109/LCOMM.2024.3518088","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3518088","url":null,"abstract":"The increasing demand for indoor location-based services (LBS) and the widespread use of mobile devices have spurred the development of accurate indoor localization systems for smartphones. Implementing these systems requires real-time responsiveness, non-cooperative communication with targets, and reliable localization capabilities. However, conventional active and passive localization systems face challenges, such as the necessity of target cooperation or latency caused by low measurement frequency. Additionally, the uncertainty in localization evaluation is often overlooked. In response to these issues, we present a WiFi-assisted non-cooperative fingerprint localization system (WiNCDN) that utilizes a dropout-based neural network. WiNCDN quickly gathers a large number of responses from WiFi devices by employing a hiding mechanism in the 802.11 protocol. Moreover, the system can make informed decisions based on localization confidence. Our findings demonstrate that WiNCDN enables real-time target tracking in various scenarios, including line-of-sight (LoS) and non-line-of-sight (NLoS) situations. Compared to existing methods, the results indicate that WiNCDN achieves a better balance between accuracy and robustness.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"353-357"},"PeriodicalIF":3.7,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.1109/LCOMM.2024.3517670
Zhongjun Yang;Li Chen
For polar codes, bit-flipping strategy can significantly improve the error-correction performance of the belief propagation (BP) decoding. However, the existing BP flipping (BPF) decoding algorithms require many attempts, due to their inefficiency in locating the erroneous positions. This leads to high decoding complexity, limiting their practical applications, especially for long polar codes. In this letter, an enhanced BPF (EBPF) decoding algorithm is proposed. It requires fewer flipping attempts, but yields an advanced decoding performance. By better utilizing the reliability and divergence of bit estimations, a novel weighted metric (WM) is introduced to identify the possible erroneous positions. During each new decoding attempt, the EBPF decoding takes turns to flip these positions. Our simulation results show that, with the same number of flipping attempts, the proposed decoding outperforms the generalized BPF (GBPF) decoding and the state-of-the-art BP correction (BPC) decoding.
{"title":"An Enhanced Belief Propagation Decoding Algorithm With Bit-Flipping for Polar Codes","authors":"Zhongjun Yang;Li Chen","doi":"10.1109/LCOMM.2024.3517670","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3517670","url":null,"abstract":"For polar codes, bit-flipping strategy can significantly improve the error-correction performance of the belief propagation (BP) decoding. However, the existing BP flipping (BPF) decoding algorithms require many attempts, due to their inefficiency in locating the erroneous positions. This leads to high decoding complexity, limiting their practical applications, especially for long polar codes. In this letter, an enhanced BPF (EBPF) decoding algorithm is proposed. It requires fewer flipping attempts, but yields an advanced decoding performance. By better utilizing the reliability and divergence of bit estimations, a novel weighted metric (WM) is introduced to identify the possible erroneous positions. During each new decoding attempt, the EBPF decoding takes turns to flip these positions. Our simulation results show that, with the same number of flipping attempts, the proposed decoding outperforms the generalized BPF (GBPF) decoding and the state-of-the-art BP correction (BPC) decoding.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"348-352"},"PeriodicalIF":3.7,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403857","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this letter, we analyze the performance of asynchronous cell-free multiple-input multiple-output orthogonal frequency division multiplexing (CF mMIMO-OFDM) system with mixed coherent and non-coherent transmission approaches. To this end, we first obtain the achievable downlink sum-rate for the mixed coherent and non-coherent transmissions, and then provide a closed-form expression for the case with the maximum ratio precoding. Subsequently, an efficient access point (AP) clustering algorithm is proposed to group APs into a set of coherent clusters. Numerical results demonstrate that the mixed coherent and non-coherent transmissions can effectively improve the sum-rate of CF mMIMO-OFDM systems under asynchronous reception.
{"title":"Asynchronous Cell-Free Massive MIMO-OFDM: Mixed Coherent and Non-Coherent Transmissions","authors":"Guoyu Li;Shaochuan Wu;Changsheng You;Wenbin Zhang;Guanyu Shang","doi":"10.1109/LCOMM.2024.3518485","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3518485","url":null,"abstract":"In this letter, we analyze the performance of asynchronous cell-free multiple-input multiple-output orthogonal frequency division multiplexing (CF mMIMO-OFDM) system with mixed coherent and non-coherent transmission approaches. To this end, we first obtain the achievable downlink sum-rate for the mixed coherent and non-coherent transmissions, and then provide a closed-form expression for the case with the maximum ratio precoding. Subsequently, an efficient access point (AP) clustering algorithm is proposed to group APs into a set of coherent clusters. Numerical results demonstrate that the mixed coherent and non-coherent transmissions can effectively improve the sum-rate of CF mMIMO-OFDM systems under asynchronous reception.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"363-367"},"PeriodicalIF":3.7,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.1109/LCOMM.2024.3518234
Lijuan Zhang;Liang Chi;Cheng He;Tingting Lang;Zhongpeng Wang
In this letter, we propose a novel unsupervised detector for RIS-assisted received spatial modulation (RIS-RSM) systems utilizing a clustering-based approach. The combination of reconfigurable intelligent surfaces (RIS) and spatial modulation (SM) presents a promising direction for beyond 5G (B5G) networks, enhancing spectral and energy efficiency. However, existing signal detection methods for RIS-RSM assume perfect channel state information (CSI), which is impractical due to the passive nature of RIS. To overcome this, we first transform the unsupervised detection problem of RIS-RSM into a clustering problem and apply unsupervised clustering algorithms from machine learning to eliminate the need for CSI acquisition. Given that traditional clustering algorithms like K-means are insufficient for this application, we propose a novel clustering detector by leveraging the unique amplitude and phase characteristics of the channel in RIS-RSM systems. Simulation results demonstrate that our proposed detector can maintain excellent detection performance that is basically consistent with the optimal detector ML without the need for CSI, marking a significant advancement in RIS-RSM signal detection.
{"title":"A Novel Clustering-Based Detector for RIS-Assisted Spatial Modulation Systems","authors":"Lijuan Zhang;Liang Chi;Cheng He;Tingting Lang;Zhongpeng Wang","doi":"10.1109/LCOMM.2024.3518234","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3518234","url":null,"abstract":"In this letter, we propose a novel unsupervised detector for RIS-assisted received spatial modulation (RIS-RSM) systems utilizing a clustering-based approach. The combination of reconfigurable intelligent surfaces (RIS) and spatial modulation (SM) presents a promising direction for beyond 5G (B5G) networks, enhancing spectral and energy efficiency. However, existing signal detection methods for RIS-RSM assume perfect channel state information (CSI), which is impractical due to the passive nature of RIS. To overcome this, we first transform the unsupervised detection problem of RIS-RSM into a clustering problem and apply unsupervised clustering algorithms from machine learning to eliminate the need for CSI acquisition. Given that traditional clustering algorithms like K-means are insufficient for this application, we propose a novel clustering detector by leveraging the unique amplitude and phase characteristics of the channel in RIS-RSM systems. Simulation results demonstrate that our proposed detector can maintain excellent detection performance that is basically consistent with the optimal detector ML without the need for CSI, marking a significant advancement in RIS-RSM signal detection.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"358-362"},"PeriodicalIF":3.7,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-16DOI: 10.1109/LCOMM.2024.3518538
Xupeng Niu;Dengao Li;Jumin Zhao;Long Tan;Ruiqin Bai
Semantic communication represents a novel paradigm for meeting the substantial data transmission demands of sixth-generation (6G) mobile communications. To address the challenges of information redundancy, conflicts, asynchrony, and internal interference among multimodal data, this letter introduces an expandable semantic communication system (ESCS). We propose a generic multimodal cross-attention (MMCA) module that enhances interactions among heterogeneous features under the guidance of an autonomously selected leader. By employing dual-contrastive learning, we impose stringent requirements for the feature representation capabilities of the transmitter, enabling it to differentiate between samples containing heterogeneous data. Evaluation results from four tasks under additive white Gaussian noise (AWGN) and fading channels indicate that the proposed system significantly outperforms state-of-the-art methods regarding storage overhead, task accuracy, and channel utilization.
{"title":"ESCS: An Expandable Semantic Communication System for Multimodal Data Based on Contrastive Learning","authors":"Xupeng Niu;Dengao Li;Jumin Zhao;Long Tan;Ruiqin Bai","doi":"10.1109/LCOMM.2024.3518538","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3518538","url":null,"abstract":"Semantic communication represents a novel paradigm for meeting the substantial data transmission demands of sixth-generation (6G) mobile communications. To address the challenges of information redundancy, conflicts, asynchrony, and internal interference among multimodal data, this letter introduces an expandable semantic communication system (ESCS). We propose a generic multimodal cross-attention (MMCA) module that enhances interactions among heterogeneous features under the guidance of an autonomously selected leader. By employing dual-contrastive learning, we impose stringent requirements for the feature representation capabilities of the transmitter, enabling it to differentiate between samples containing heterogeneous data. Evaluation results from four tasks under additive white Gaussian noise (AWGN) and fading channels indicate that the proposed system significantly outperforms state-of-the-art methods regarding storage overhead, task accuracy, and channel utilization.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"368-372"},"PeriodicalIF":3.7,"publicationDate":"2024-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-13DOI: 10.1109/LCOMM.2024.3516939
Rongchi Xu;Hao Chen;Ling Liu;Baoming Bai
Polar codes and polarization-adjusted convolutional (PAC) codes can achieve good performance with successive cancellation list (SCL) decoding. When constructed by the Reed-Muller rate profile, the rate of PAC code is limited, and its performance is not competitive for large block lengths under the SCL decoder with small or modest list sizes. How to design optimal polar codes and PAC codes for SCL decoding are still open problems. In this letter, we analyse the probability of the correct path in the list according to the path metric in SCL decoding. We calculate the path metric range and log-likelihood ratio of each sub-channel. Then we select the frozen bits to maximize the probability of the correct path in the list. Simulation results show that the proposed polar codes and PAC codes have better performance compared with other advanced constructions at a wide range of code rates and block lengths.
{"title":"Path Metric Range and LLR-Based Design of Polar Codes and PAC Codes for SCL Decoding","authors":"Rongchi Xu;Hao Chen;Ling Liu;Baoming Bai","doi":"10.1109/LCOMM.2024.3516939","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3516939","url":null,"abstract":"Polar codes and polarization-adjusted convolutional (PAC) codes can achieve good performance with successive cancellation list (SCL) decoding. When constructed by the Reed-Muller rate profile, the rate of PAC code is limited, and its performance is not competitive for large block lengths under the SCL decoder with small or modest list sizes. How to design optimal polar codes and PAC codes for SCL decoding are still open problems. In this letter, we analyse the probability of the correct path in the list according to the path metric in SCL decoding. We calculate the path metric range and log-likelihood ratio of each sub-channel. Then we select the frozen bits to maximize the probability of the correct path in the list. Simulation results show that the proposed polar codes and PAC codes have better performance compared with other advanced constructions at a wide range of code rates and block lengths.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"338-342"},"PeriodicalIF":3.7,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-13DOI: 10.1109/LCOMM.2024.3516780
Mengnan Hao;Guanghui Song;Ying Li;Jianxiang Yan
This letter proposes a novel superimposed pilot (SP) on-off division multiple access (ODMA) transmission scheme for massive multiple-input multiple-output (MIMO) unsourced random access (URA). In this scheme, the SP conveys on-off pattern information by sharing the transmission frame with data load, utilizing the super sparse property of ODMA to minimize multi-user interference. On the receiver side, an energy detection aided non-Bayesian superimposed pilot detection (NB-SPD) receiver is designed to recover the messages transmitted by the active users. Furthermore, a low complexity successive interference cancellation (SIC) is used to enhance the performance. Numerical results demonstrate superior performance compared to state-of-the-art approaches.
{"title":"Superimposed Pilot ODMA Transmission for Massive MIMO Unsourced Random Access","authors":"Mengnan Hao;Guanghui Song;Ying Li;Jianxiang Yan","doi":"10.1109/LCOMM.2024.3516780","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3516780","url":null,"abstract":"This letter proposes a novel superimposed pilot (SP) on-off division multiple access (ODMA) transmission scheme for massive multiple-input multiple-output (MIMO) unsourced random access (URA). In this scheme, the SP conveys on-off pattern information by sharing the transmission frame with data load, utilizing the super sparse property of ODMA to minimize multi-user interference. On the receiver side, an energy detection aided non-Bayesian superimposed pilot detection (NB-SPD) receiver is designed to recover the messages transmitted by the active users. Furthermore, a low complexity successive interference cancellation (SIC) is used to enhance the performance. Numerical results demonstrate superior performance compared to state-of-the-art approaches.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"333-337"},"PeriodicalIF":3.7,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403923","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-13DOI: 10.1109/LCOMM.2024.3516957
Erkang Dong;Zhuxian Lian;Yajun Wang;Zhangfeng Ma;Bibo Zhang;Lin Ling;Chuanjin Zu;Yuanjiang Li
In the intelligent reflecting surface (IRS) aided near-field systems, the IRS reflection phases, influenced by the coupling between the IRS units, significantly affect the performance. To improve the performance gains of near-field systems, the channel models based on IRS partitioning scheme are proposed for air-to-ground (A2G) millimeter-wave (mmWave) systems. The corresponding IRS reflection phases are designed, consisting of both the IRS unit-dependent reflection phases and the sub-surface-dependent reflection phases. The designed reflection phases not only compensate for phase variations introduced by the mismatches in the azimuth and elevation angles of IRS units but also for the phase variations due to the existence of distance differences from transceiver to the centers of sub-surfaces. Using the proposed partitioning scheme, the influence of the coupling between the IRS units on the reflection phase can be effectively mitigated. To further explore the impact of the IRS partitioning scheme on performance, a power leakage ratio, which is defined as the ratio of the leakage power using the partitioning scheme to the total received signal power, is introduced. Numerical results show that the received signal power of the proposed channel model matches that of the near-field model using the ideal reflection phases very well.
{"title":"Intelligent Reflecting Surface Partitioning-Based Channel Modeling and Performance Analysis","authors":"Erkang Dong;Zhuxian Lian;Yajun Wang;Zhangfeng Ma;Bibo Zhang;Lin Ling;Chuanjin Zu;Yuanjiang Li","doi":"10.1109/LCOMM.2024.3516957","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3516957","url":null,"abstract":"In the intelligent reflecting surface (IRS) aided near-field systems, the IRS reflection phases, influenced by the coupling between the IRS units, significantly affect the performance. To improve the performance gains of near-field systems, the channel models based on IRS partitioning scheme are proposed for air-to-ground (A2G) millimeter-wave (mmWave) systems. The corresponding IRS reflection phases are designed, consisting of both the IRS unit-dependent reflection phases and the sub-surface-dependent reflection phases. The designed reflection phases not only compensate for phase variations introduced by the mismatches in the azimuth and elevation angles of IRS units but also for the phase variations due to the existence of distance differences from transceiver to the centers of sub-surfaces. Using the proposed partitioning scheme, the influence of the coupling between the IRS units on the reflection phase can be effectively mitigated. To further explore the impact of the IRS partitioning scheme on performance, a power leakage ratio, which is defined as the ratio of the leakage power using the partitioning scheme to the total received signal power, is introduced. Numerical results show that the received signal power of the proposed channel model matches that of the near-field model using the ideal reflection phases very well.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"343-347"},"PeriodicalIF":3.7,"publicationDate":"2024-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-12DOI: 10.1109/LCOMM.2024.3516486
Ken R. Duffy;Peihong Yuan;Joseph Griffin;Muriel Médard
We establish that it is possible to extract accurate blockwise and bitwise soft output (SO) from Guessing Codeword Decoding (GCD) with minimal additional computational complexity by considering it through the lens of Guessing Random Additive Noise Decoding (GRAND). Blockwise SO can be used to control decoding misdetection rate, while bitwise SO results in a soft-input soft-output (SISO) decoder that can be used for efficient iterative decoding of long, high redundancy codes.
{"title":"Soft-Output Guessing Codeword Decoding","authors":"Ken R. Duffy;Peihong Yuan;Joseph Griffin;Muriel Médard","doi":"10.1109/LCOMM.2024.3516486","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3516486","url":null,"abstract":"We establish that it is possible to extract accurate blockwise and bitwise soft output (SO) from Guessing Codeword Decoding (GCD) with minimal additional computational complexity by considering it through the lens of Guessing Random Additive Noise Decoding (GRAND). Blockwise SO can be used to control decoding misdetection rate, while bitwise SO results in a soft-input soft-output (SISO) decoder that can be used for efficient iterative decoding of long, high redundancy codes.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"328-332"},"PeriodicalIF":3.7,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-12-12DOI: 10.1109/LCOMM.2024.3516359
Welelaw Lakew;Arafat Al-Dweik;Tasneem Assaf
This letter considers the performance analysis of orthogonal frequency division multiplexing (OFDM)-single-input multiple-output (SIMO) with time-domain interleaving (TDI) using zero-forcing (ZF) equalizers. The system instantaneous signal-to-noise ratio (SNR) is derived and used to evaluate the bit error rate (BER) and outage probability (OP) semi-analytically for various modulation schemes and number of receiving antennas. The obtained analytical results, corroborated by Monte Carlo simulation, show that the spatial diversity of the receiving antennas significantly impacts the noise amplification limitation inherent to TDI. Therefore, unlike the single-input single-output (SISO)-TDI with ZF equalization, the SIMO-TDI can provide significant gain over SIMO-OFDM. For example, the BER improvement of the TDI using two-antenna was about 7 dB when compared to OFDM with the same number of antennas, which is drastically different from the SISO scenario.
{"title":"Performance Analysis of OFDM-SIMO Systems With Time-Domain Interleaving","authors":"Welelaw Lakew;Arafat Al-Dweik;Tasneem Assaf","doi":"10.1109/LCOMM.2024.3516359","DOIUrl":"https://doi.org/10.1109/LCOMM.2024.3516359","url":null,"abstract":"This letter considers the performance analysis of orthogonal frequency division multiplexing (OFDM)-single-input multiple-output (SIMO) with time-domain interleaving (TDI) using zero-forcing (ZF) equalizers. The system instantaneous signal-to-noise ratio (SNR) is derived and used to evaluate the bit error rate (BER) and outage probability (OP) semi-analytically for various modulation schemes and number of receiving antennas. The obtained analytical results, corroborated by Monte Carlo simulation, show that the spatial diversity of the receiving antennas significantly impacts the noise amplification limitation inherent to TDI. Therefore, unlike the single-input single-output (SISO)-TDI with ZF equalization, the SIMO-TDI can provide significant gain over SIMO-OFDM. For example, the BER improvement of the TDI using two-antenna was about 7 dB when compared to OFDM with the same number of antennas, which is drastically different from the SISO scenario.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"29 2","pages":"323-327"},"PeriodicalIF":3.7,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：