Xiaowei Wu

Dr. Xiaowei Wu

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 May 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
LYLei Yang
Lei Yang
YXYixuan Xie
Yixuan Xie
XWXiaowei Wu
Xiaowei Wu
JYJinhong Yuan
Jinhong Yuan
XCXingqing Cheng
Xingqing Cheng
LWLei Wan
Lei Wan
We propose a new class of partially informationcoupled (PIC) Turbo codes to improve the transport block (TB) error rate performance for long-term evolution (LTE) systems, while keeping the hybrid automatic repeat request protocol and the Turbo decoder for each code block (CB) unchanged. In the proposed codes, every two consecutive CBs in a TB are coupled together by sharing partial information bits. This coding structure introduces irregular variable node degree distributions in the Tanner graph of the PIC-Turbo codes. We propose a feed-forward and feed-back decoding scheme and a windowed decoding scheme to decode the whole TB by exploiting the coupled information between CBs. We calculate the extrinsic information transfer (EXIT) functions for the PIC-Turbo codes by assuming that the coupled information are perfectly decoded. An SNR gain upper bound of the PIC-Turbo codes over the LTE Turbo codes for various coupling ratios is derived by the calculated EXIT charts. Numerical results show that the proposed codes achieve an SNR gain of 0.26 dB to 0.73 dB for various code parameters at a TB error rate level of 10−2, which complies with the derived SNR gain upper bound.

18 January 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
Min QiuMin Qiu
Min Qiu
XWXiaowei Wu
Xiaowei Wu
Alexandre Graell i AmatAlexandre Graell i Amat
Alexandre Graell i Amat
JYJinhong Yuan
Jinhong Yuan
In this paper, we study a class of spatially coupled turbo codes, namely partially information-and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the coupling ratio and the encoding and decoding architectures of the underlying component codes can remain unchanged. For this work, we first provide the construction methods for partially coupled turbo codes with coupling memory m and study the corresponding graph models. We then derive the density evolution equations for the corresponding ensembles on the binary erasure channel to precisely compute their iterative decoding thresholds. Rate-compatible designs and their decoding thresholds are also provided, where the coupling and puncturing ratios are jointly optimized to achieve the largest decoding threshold for a given target code rate. Our results show that for a wide range of code rates, the proposed codes attain close-to-capacity performance and the decoding performance improves with increasing the coupling memory. In particular, the proposed partially parity-coupled turbo codes have thresholds within 0.0002 of the BEC capacity for rates ranging from 1/3 to 9/10, yielding an attractive way for constructing rate-compatible capacity-approaching channel codes.

20 July 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
XWXiaowei Wu
Xiaowei Wu
Min QiuMin Qiu
Min Qiu
JYJinhong Yuan
Jinhong Yuan
In this paper, we propose partially information coupled bit-interleaved polar coded modulation (PIC-BIPCM), which is a class of spatially coupled polar coding schemes designed for $2^{Q}$ -ary modulations. Specifically, we consider PIC-BIPCM schemes respectively constructed with three BIPCM schemes: direct BIPCM, punctured BIPCM, and multi-kernel BIPCM. We analyze the error performance of the proposed PIC-BIPCM over the binary erasure channel (BEC) via density evolution. With the analysis as a guideline, we jointly design the positions of coupled bits and the modulation bit-mapper by taking into account the partial polarization of finite length polar codes as well as the unequal error protection of high order modulations. Simulation results demonstrate significant performance improvement of the proposed PIC-BIPCM over the uncoupled BIPCM on both BEC and AWGN channels.

23 August 2022 in IEEE Photonics Technology Letters
Verified
Journal Article
Closed access
ZSZiyuan Shi
Ziyuan Shi
WWWenhao Wang
Wenhao Wang
XWXiaowei Wu
Xiaowei Wu
LYLei Yang
Lei Yang
We propose a method to accurately measure dynamic slot-power of optical signal by using the SNSPD under extremely low received power. Experimental results demonstrate that our method can measure power below −130 dBm. The uncertainty of this method can be less than 5%, and frequency of measured signal can be up to 100 Mbps.

5 August 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
Min QiuMin Qiu
Min Qiu
XWXiaowei Wu
Xiaowei Wu
JYJinhong Yuan
Jinhong Yuan
Alexandre Graell i AmatAlexandre Graell i Amat
Alexandre Graell i Amat
A new class of spatially-coupled turbo-like codes (SC-TCs), dubbed generalized spatially coupled parallel concatenated codes (GSC-PCCs), is introduced. These codes are constructed by applying spatial coupling on parallel concatenated codes (PCCs) with a fraction of information bits repeated q times. GSC-PCCs can be seen as a generalization of the original spatially-coupled parallel concatenated codes proposed by Moloudi et al. [2]. To characterize the asymptotic performance of GSC-PCCs, we derive the corresponding density evolution equations and compute their decoding thresholds. The threshold saturation effect is observed and proven. Most importantly, we rigorously prove that the rate-R GSC-PCC ensemble with 2-state convolutional component codes achieves at least a fraction 1-R/R+q of the capacity of the binary erasure channel (BEC) for repetition factor q ≥ 2 and this multiplicative gap vanishes as q tends to infinity. To the best of our knowledge, this is the first class of SC-TCs that are proven to be capacity-achieving. Further, the connection between the strength of the component codes, the decoding thresholds of GSC-PCCs, and the repetition factor is established. The superiority of the proposed codes with finite blocklength is exemplified by comparing their error performance with that of existing SC-TCs via computer simulations.

13 January 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
ZSZiyuan Shi
Ziyuan Shi
XWXiaowei Wu
Xiaowei Wu
LYLei Yang
Lei Yang
YZYueying Zhan
Yueying Zhan
DNDerrick Wing Kwan Ng
Derrick Wing Kwan Ng
QWQiang Wang
Qiang Wang
The optical communication system using pulse position modulation (PPM) and superconducting nanowire single-photon detectors (SNSPDs) has attracted considerable attention for deep space applications as it enables high speed data transmission at extremely low average signal power. The deadtime of SNSPD is a critical factor in such systems because it primarily affects the signal detection efficiency. This becomes even more crucial in high-speed systems, where the deadtime can span several symbol periods. We employ the Markov chain model to characterize the high-speed PPM-SNSPD system and investigate its behavior. Analytical expressions for symbol transition probabilities are derived to characterize system-level metrics, including the symbol error rate and achievable code rate. Analysis shows that deadtime introduces memory to the PPM-SNSPD channel, resulting in channel asymmetry. Through experimental verification and simulations, we confirmed the effectiveness of our analysis. In addition, a set of new log-likelihood ratio (LLR) expressions is proposed based on the new model. Compared with the commonly used Poisson LLR expression, our proposed LLR expressions show more than 0.5 dB performance gain.