Xihao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xihao Li has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Huazi Zhang
Hangzhou Research Center, Huawei Technologies Company Ltd., Hangzhou, China
2 shared publications - Li Chen
School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China
2 shared publications - Jiajie Tong
Huawei Technologies Co. Ltd, Hangzhou, China
1 shared publication Jianguo Zhao
School of System Science and Engineering, Sun Yat-Sen University, Guangzhou, China
1 shared publicationLijia Yang
School of Electronics and Communication Engineering, Sun Yat-sen University, Shenzhen, China
1 shared publication- Wenhao Chen
School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China
1 shared publication
Latest Publications
- 24 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (11) , 8294-8311
Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination
Ordered statistics decoding (OSD) can achieve near maximum likelihood (ML) decoding performance for BCH codes. However, Gaussian elimination (GE) that delivers the systematic generator matrix of the code has an uncompromised latency. Addressing this challenge, this paper proposes a low-latency OSD (LLOSD) for BCH codes. Since BCH codes are binary subcodes of Reed-Solomon (RS) codes, codeword candidates can be produced using the RS systematic generator matrix, whose entries can be generated in parallel. By eliminating the non-binary codeword candidates and identifying the ML codeword, the LLOSD yields a lower latency as well as complexity than the OSD. It is shown that the LLOSD can be interpreted as generating the codeoword candidates through systematic encoding of a punctured BCH codeword, explaining its low-complexity feature. Moreover, the segmented variant is proposed to further facilitate the LLOSD. In order to decode long BCH codes, a hybrid soft decoding (HSD) is finally proposed. It integrates the LLOSD and the algebraic Chase decoding that can effectively provide extra TEPs for the LLOSD, enhancing the decoding performance. Both the complexity and performance of the proposed decoding are analyzed, demonstrating their advantage over the relevant state-of-the-art decoding.
- 24 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (11) , 8294-8311
Efficient Ordered Statistics Decoding of BCH Codes Without Gaussian Elimination
Ordered statistics decoding (OSD) can achieve near maximum likelihood (ML) decoding performance for BCH codes. However, Gaussian elimination (GE) that delivers the systematic generator matrix of the code has an uncompromised latency. Addressing this challenge, this paper proposes a low-latency OSD (LLOSD) for BCH codes. Since BCH codes are binary subcodes of Reed-Solomon (RS) codes, codeword candidates can be produced using the RS systematic generator matrix, whose entries can be generated in parallel. By eliminating the non-binary codeword candidates and identifying the ML codeword, the LLOSD yields a lower latency as well as complexity than the OSD. It is shown that the LLOSD can be interpreted as generating the codeoword candidates through systematic encoding of a punctured BCH codeword, explaining its low-complexity feature. Moreover, the segmented variant is proposed to further facilitate the LLOSD. In order to decode long BCH codes, a hybrid soft decoding (HSD) is finally proposed. It integrates the LLOSD and the algebraic Chase decoding that can effectively provide extra TEPs for the LLOSD, enhancing the decoding performance. Both the complexity and performance of the proposed decoding are analyzed, demonstrating their advantage over the relevant state-of-the-art decoding.
- 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.