WCWenhao Chen

Wenhao Chen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Wenhao Chen has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Iterative Basis Update for Ordered Statistics Decoding of Linear Block Codes

    by Xihao Li, Wenhao Chen, Li Chen, Huazi Zhang

    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.


  • BCH Based U-UV Codes and Its SCL Decoding

    by Wenhao Chen, Jinjun Cheng, Changyu Wu, Li Chen, Huazi Zhang

    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.


  • U-UV Coding for Bit-Interleaved Coded Modulation

    by Changyu Wu, Wenhao Chen, Li Chen, Huazi Zhang

    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.