Wenhao Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenhao Chen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Li Chen
School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China
3 shared publications - Huazi Zhang
Hangzhou Research Center, Huawei Technologies Company Ltd., Hangzhou, China
2 shared publications Changyu Wu
School of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, China
1 shared publication- Changyu Wu
School of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, China
1 shared publication Huazi Zhang
Hangzhou Research Center, Huawei Technologies Company Ltd., Hangzhou, China
1 shared publication- Jinjun Cheng
School of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, China
1 shared publication
Latest Publications
- 9 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (9) , 1981-1985
Iterative Basis Update for Ordered Statistics Decoding of Linear Block Codes
Ordered statistics decoding (OSD) requires Gaussian elimination (GE) for obtaining the most reliable independent positions (MRIPs) of the received vector. However, GE has cubic time complexity. Its sequential nature also introduces high latency in practice. To address this, the paper proposes an iterative basis update (IBU) to reduce complexity and latency of GE. Specifically, the IBU utilizes a systematic generator matrix (SGM) whose identity submatrix corresponds to a symbol position set. This set will then be iteratively updated for obtaining the MRIPs. For cyclic codes, the IBU can be further simplified by selecting multiple symbol position sets for the SGM. Our analysis and simulations show that the proposed IBU can significantly facilitate OSD without compromising decoding performance.
- 9 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (9) , 1981-1985
Iterative Basis Update for Ordered Statistics Decoding of Linear Block Codes
Ordered statistics decoding (OSD) requires Gaussian elimination (GE) for obtaining the most reliable independent positions (MRIPs) of the received vector. However, GE has cubic time complexity. Its sequential nature also introduces high latency in practice. To address this, the paper proposes an iterative basis update (IBU) to reduce complexity and latency of GE. Specifically, the IBU utilizes a systematic generator matrix (SGM) whose identity submatrix corresponds to a symbol position set. This set will then be iteratively updated for obtaining the MRIPs. For cyclic codes, the IBU can be further simplified by selecting multiple symbol position sets for the SGM. Our analysis and simulations show that the proposed IBU can significantly facilitate OSD without compromising decoding performance.
- 28 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 1286-1300
BCH Based U-UV Codes and Its SCL Decoding
U-UV codes are constructed by a number of component codes in the (U |U+V) recursive structure, where the U codes and V codes are component codes. This construction is known as the Plotkin construction and the U-UV codes are also known as the generalized concatenated codes with inner polar codes. This paper proposes U-UV codes with primitive BCH component codes as a pursuit of designing competent short-to-medium length codes for future ultra low-latency communications. The U-UV code design considers both the finite length rate of the subchannels and the equal error probability rule, yielding a good performing U-UV code that is designed for a targeted transmission rate. The successive cancellation list (SCL) decoding and its complexity reduction variant are proposed to maximize the code’s performance. Their decoding complexity and latency are analyzed. Decoding performance of the U-UV codes is further studied, showing that SCL decoding of the U-UV codes can approach its approximated maximum likelihood (ML) decoding bound. They can outperform other competent short-to-medium length codes, including polar codes, BCH codes and tail-biting convolutional (TBC) codes.
- 28 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 1286-1300
BCH Based U-UV Codes and Its SCL Decoding
U-UV codes are constructed by a number of component codes in the (U |U+V) recursive structure, where the U codes and V codes are component codes. This construction is known as the Plotkin construction and the U-UV codes are also known as the generalized concatenated codes with inner polar codes. This paper proposes U-UV codes with primitive BCH component codes as a pursuit of designing competent short-to-medium length codes for future ultra low-latency communications. The U-UV code design considers both the finite length rate of the subchannels and the equal error probability rule, yielding a good performing U-UV code that is designed for a targeted transmission rate. The successive cancellation list (SCL) decoding and its complexity reduction variant are proposed to maximize the code’s performance. Their decoding complexity and latency are analyzed. Decoding performance of the U-UV codes is further studied, showing that SCL decoding of the U-UV codes can approach its approximated maximum likelihood (ML) decoding bound. They can outperform other competent short-to-medium length codes, including polar codes, BCH codes and tail-biting convolutional (TBC) codes.
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (9) , 5065-5077
U-UV Coding for Bit-Interleaved Coded Modulation
U-UV codes were recently proposed as a competent short-to-medium length coding scheme. With well designed component codes, U-UV codes can outperform similar rate cyclic redundancy check (CRC)-polar codes with the successive cancellation (SC) and the SC list (SCL) decoding. In order to improve the coded transmission spectral efficiency, this paper proposes the bit-interleaved coded modulation (BICM) scheme with U-UV codes as the channel codes. A bit interleaver structure is proposed to facilitate the component code rate allocation based on the polarized subchannel capacities. Under the BICM paradigm, the component code rates can be allocated by first estimating the modulation subchannel capacities, then adjusting based on the finite length rates and the equal error probability rule. Theoretical performance bounds and their approximations on decoding error rates are further analyzed. It provides the theoretical benchmarks for our simulations and guides the optimized design of the coded modulation scheme. Finally, simulation results of the U-UV coded BICM scheme are provided to demonstrate its error-correction competency. It can outperform the relevant bit-interleaved polar coded modulation (BIPCM) scheme.
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 71 (9) , 5065-5077
U-UV Coding for Bit-Interleaved Coded Modulation
U-UV codes were recently proposed as a competent short-to-medium length coding scheme. With well designed component codes, U-UV codes can outperform similar rate cyclic redundancy check (CRC)-polar codes with the successive cancellation (SC) and the SC list (SCL) decoding. In order to improve the coded transmission spectral efficiency, this paper proposes the bit-interleaved coded modulation (BICM) scheme with U-UV codes as the channel codes. A bit interleaver structure is proposed to facilitate the component code rate allocation based on the polarized subchannel capacities. Under the BICM paradigm, the component code rates can be allocated by first estimating the modulation subchannel capacities, then adjusting based on the finite length rates and the equal error probability rule. Theoretical performance bounds and their approximations on decoding error rates are further analyzed. It provides the theoretical benchmarks for our simulations and guides the optimized design of the coded modulation scheme. Finally, simulation results of the U-UV coded BICM scheme are provided to demonstrate its error-correction competency. It can outperform the relevant bit-interleaved polar coded modulation (BIPCM) scheme.