Aolin Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Aolin Liu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Bowen Feng
Harbin Institute of Technology (Shenzhen)
3 shared publications - Qinyu Zhang
Harbin Institute of Technology (Shenzhen)
3 shared publications - Ye Wang
Pengcheng Laboratory, Shenzhen, China
3 shared publications - Ke Zhang
Pengcheng Laboratory, Shenzhen, China
2 shared publications - Chulong Liang
Department of Electronic Engineering, City University of Hong Kong, Hong Kong
1 shared publication - Geng Li
The Second Affiliated Hospital of Guangzhou University of Chinese Medicine (Guangdong Provincial Hospital of Chinese Medicine), the Second Clinical Medical College of Guangzhou University of Chinese Medicine Guangzhou China
1 shared publication
Latest Publications
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 552-556
Design of Parity-Check Concatenated Polar Codes From EBCH Codes
Error detection is a critical function of channel coding in practical communication systems. Through a combination of theoretical analysis and experimental validation, it is concluded that the undetected error rate (UER) in the high signal-to-noise ratio (SNR) regime is predominantly determined by the code weight distribution. Existing polar code constructions based on extended BCH (EBCH) codes exhibit outstanding weight distribution properties. Building on this, a conversion strategy is proposed to transform dynamic frozen bits into parity-check (PC) bits, thereby incorporating error detection capability into the designed decoder. Simulation results demonstrate that the proposed schemes outperform cyclic redundancy check (CRC) concatenated polar codes in both block error rate (BLER) and UER under high-SNR conditions.
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 552-556
Design of Parity-Check Concatenated Polar Codes From EBCH Codes
Error detection is a critical function of channel coding in practical communication systems. Through a combination of theoretical analysis and experimental validation, it is concluded that the undetected error rate (UER) in the high signal-to-noise ratio (SNR) regime is predominantly determined by the code weight distribution. Existing polar code constructions based on extended BCH (EBCH) codes exhibit outstanding weight distribution properties. Building on this, a conversion strategy is proposed to transform dynamic frozen bits into parity-check (PC) bits, thereby incorporating error detection capability into the designed decoder. Simulation results demonstrate that the proposed schemes outperform cyclic redundancy check (CRC) concatenated polar codes in both block error rate (BLER) and UER under high-SNR conditions.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 914-928
A Design Methodology for Optimizing Minimum Weight and Error Coefficient of PAC Codes
A design methodology is proposed to optimize the minimum weight and error coefficient of polarization-adjusted convolutional (PAC) codes, enhancing their maximum likelihood (ML) performance based on a theoretical analysis of code asymptotic behavior. Employing an adapted multilevel list search algorithm to identify minimum-weight codewords, the methodology comprises three deterministic optimization algorithms. First, an iterative rate-profiling optimization algorithm substantially reduces the number of minimum-weight codewords through efficient pairwise exchanges of information and frozen indices. Second, a tree search optimization algorithm progressively extends the convolutional impulse response, exploring superior solutions within a theoretically constrained search space. Third, a joint optimization algorithm synthesizes the two algorithms, alternately refining the rate-profiling and convolutional pre-transform. Complexity analysis underscores the computational efficiency of these algorithms for short PAC codes, while optimization results confirm the strong capability of the proposed methodology in improving the minimum weight and error coefficient. With moderate-to-large list decoding for code lengths of 64 to 256, the proposed PAC codes consistently outperform state-of-the-art polar code variants, attaining or approaching the random coding union (RCU) bound. Additionally, the proposed PAC codes demonstrate the capability to exceed the normal approximation (NA) bound at low-to-moderate code rates.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 914-928
A Design Methodology for Optimizing Minimum Weight and Error Coefficient of PAC Codes
A design methodology is proposed to optimize the minimum weight and error coefficient of polarization-adjusted convolutional (PAC) codes, enhancing their maximum likelihood (ML) performance based on a theoretical analysis of code asymptotic behavior. Employing an adapted multilevel list search algorithm to identify minimum-weight codewords, the methodology comprises three deterministic optimization algorithms. First, an iterative rate-profiling optimization algorithm substantially reduces the number of minimum-weight codewords through efficient pairwise exchanges of information and frozen indices. Second, a tree search optimization algorithm progressively extends the convolutional impulse response, exploring superior solutions within a theoretically constrained search space. Third, a joint optimization algorithm synthesizes the two algorithms, alternately refining the rate-profiling and convolutional pre-transform. Complexity analysis underscores the computational efficiency of these algorithms for short PAC codes, while optimization results confirm the strong capability of the proposed methodology in improving the minimum weight and error coefficient. With moderate-to-large list decoding for code lengths of 64 to 256, the proposed PAC codes consistently outperform state-of-the-art polar code variants, attaining or approaching the random coding union (RCU) bound. Additionally, the proposed PAC codes demonstrate the capability to exceed the normal approximation (NA) bound at low-to-moderate code rates.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 5481-5494
A Path Probability Perspective on Rate-Profiling Design for Polarization-Adjusted Convolutional (PAC) Codes Under List Decoding
A novel rate-profiling design is proposed for polarization-adjusted convolutional (PAC) codes under list decoding, adopting a path probability perspective. Inspired by the concepts of Hamming distance and Hamming weight, the concepts of path probability distance (PPD) and path probability weight (PPW) are innovatively introduced to measure the disparity between the erroneous paths and the correct path for PAC codes under probabilistic decoding. An in-depth analysis of the recursion of node log-likelihood ratios (LLRs) in the factor graph is conducted, elucidating the derivation of a lower bound on the PPW as a consequential outcome. Utilizing the concept of the PPW, a rate-profiling design algorithm is proposed to establish the reliability ranking for the bit-channels of PAC codes. Simulation results demonstrate that PAC codes employing the proposed rate-profiling exhibit advantages over alternative rate-profiling and other state-of-the-art polar coding schemes across various block lengths and code rates under short decoding list sizes.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 5481-5494
A Path Probability Perspective on Rate-Profiling Design for Polarization-Adjusted Convolutional (PAC) Codes Under List Decoding
A novel rate-profiling design is proposed for polarization-adjusted convolutional (PAC) codes under list decoding, adopting a path probability perspective. Inspired by the concepts of Hamming distance and Hamming weight, the concepts of path probability distance (PPD) and path probability weight (PPW) are innovatively introduced to measure the disparity between the erroneous paths and the correct path for PAC codes under probabilistic decoding. An in-depth analysis of the recursion of node log-likelihood ratios (LLRs) in the factor graph is conducted, elucidating the derivation of a lower bound on the PPW as a consequential outcome. Utilizing the concept of the PPW, a rate-profiling design algorithm is proposed to establish the reliability ranking for the bit-channels of PAC codes. Simulation results demonstrate that PAC codes employing the proposed rate-profiling exhibit advantages over alternative rate-profiling and other state-of-the-art polar coding schemes across various block lengths and code rates under short decoding list sizes.