Jiajie Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jiajie Li has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Warren J. Gross
McGill University
3 shared publications - Marwan Jalaleddine
Department of Electrical and Computer Engineering, McGill University, Montreal, QC, Canada
2 shared publications - Mohamad Ali Jarkas1 shared publication
- Sihui Shen1 shared publication
Latest Publications
- Open Access
Enabling Fast Polar SC Decoding with IR-HARQ
To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. For very high-throughput applications, Successive Cancellation (SC) decoding is particularly appealing for polar codes owing to its high area efficiency. In this paper, we propose modifications to SC decoders that employ special nodes to accelerate decoding. Our modifications enable the use of polar IR-HARQ with SC decoding for high throughput applications. Compared to the unmodified SC IR-HARQ scheme, our proposed approach allows us to achieve a 72% reduction in node traversals with a polar code of length 2048. Simulation results confirm that the proposed special node modifications do not cause any degradation in FER performance.
Open AccessEnabling Fast Polar SC Decoding with IR-HARQ
To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. For very high-throughput applications, Successive Cancellation (SC) decoding is particularly appealing for polar codes owing to its high area efficiency. In this paper, we propose modifications to SC decoders that employ special nodes to accelerate decoding. Our modifications enable the use of polar IR-HARQ with SC decoding for high throughput applications. Compared to the unmodified SC IR-HARQ scheme, our proposed approach allows us to achieve a 72% reduction in node traversals with a polar code of length 2048. Simulation results confirm that the proposed special node modifications do not cause any degradation in FER performance.
- Open Access
Enhanced Successive Cancellation List Decoder for Long Polar Codes Targeting 6G Air Interface
The 6th generation communication standard's air interface requires innovation in channel coding to fulfill anticipated energy and area cost reduction requirements. In this paper, we propose algorithmic techniques to enable the implementation of long polar codes (e.g., length 8K bits) in next-generation communications standards by addressing key challenges in memory usage and computational complexity presented by successive decoding list (SCL) polar decoding. Perturbation-enhanced (PE) successive cancelation list (SCL) decoders with a list size of $L$ reach the decoding performance of the SCL decoder with a list size of $2L$. The proposed bias-enhanced (BE) SCL decoders, which simplifies the PE SCL decoder based on insights gained by an ablation study, returns similar decoding performance to PE SCL decoders. Also, proposed BE generalized partitioned SCL (GPSCL) decoders with a list size of $8$ have a $67\%$ reduction in the memory usage and similar decoding performance compared to SCL decoders with a list size of $16$. Furthermore, input-distribution-aware (IDA) decoding is applied to BE GPSCL decoders. Up to $5.4\times$ reduction in the computational complexity is achieved compared to SCL decoders with a list size of $16$. The degraded decoding performance is at most $0.05\text{ dB}$ compared to BE GPSCL decoders without IDA decoding.Open AccessEnhanced Successive Cancellation List Decoder for Long Polar Codes Targeting 6G Air Interface
The 6th generation communication standard's air interface requires innovation in channel coding to fulfill anticipated energy and area cost reduction requirements. In this paper, we propose algorithmic techniques to enable the implementation of long polar codes (e.g., length 8K bits) in next-generation communications standards by addressing key challenges in memory usage and computational complexity presented by successive decoding list (SCL) polar decoding. Perturbation-enhanced (PE) successive cancelation list (SCL) decoders with a list size of $L$ reach the decoding performance of the SCL decoder with a list size of $2L$. The proposed bias-enhanced (BE) SCL decoders, which simplifies the PE SCL decoder based on insights gained by an ablation study, returns similar decoding performance to PE SCL decoders. Also, proposed BE generalized partitioned SCL (GPSCL) decoders with a list size of $8$ have a $67\%$ reduction in the memory usage and similar decoding performance compared to SCL decoders with a list size of $16$. Furthermore, input-distribution-aware (IDA) decoding is applied to BE GPSCL decoders. Up to $5.4\times$ reduction in the computational complexity is achieved compared to SCL decoders with a list size of $16$. The degraded decoding performance is at most $0.05\text{ dB}$ compared to BE GPSCL decoders without IDA decoding. - Open Access
Hardware-friendly IR-HARQ for Polar SCL Decoders
To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. The baseline IR-HARQ scheme's reliance on set-based operations leads to irregular memory access patterns, posing significant challenges for efficient hardware implementation. Furthermore, the introduction of new bit types increases the number of fast nodes that are decoded without traversing the sub-tree, resulting in a substantial area overhead when implemented in hardware. To address these issues and improve hardware compatibility, we propose transforming the set-based operations within the polar IR-HARQ scheme into binary vector operations. Additionally, we introduce a new fast node integration approach that avoids increasing the number of fast nodes, thereby minimizing the associated area overhead. Our proposed scheme results in a memory overhead of 25-27% compared to successive cancellation list (SCL) decoding without IR-HARQ support.
Open AccessHardware-friendly IR-HARQ for Polar SCL Decoders
To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. The baseline IR-HARQ scheme's reliance on set-based operations leads to irregular memory access patterns, posing significant challenges for efficient hardware implementation. Furthermore, the introduction of new bit types increases the number of fast nodes that are decoded without traversing the sub-tree, resulting in a substantial area overhead when implemented in hardware. To address these issues and improve hardware compatibility, we propose transforming the set-based operations within the polar IR-HARQ scheme into binary vector operations. Additionally, we introduce a new fast node integration approach that avoids increasing the number of fast nodes, thereby minimizing the associated area overhead. Our proposed scheme results in a memory overhead of 25-27% compared to successive cancellation list (SCL) decoding without IR-HARQ support.