Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder
 
research article

Optimizing Polar Codes for Reduced Latency Successive Cancellation List Decoder

Zhou, Huayi
•
Ren, Yuqing  
•
Li, Jiajie
Show more
December 23, 2024
IEEE Communications Letters

This paper presents the application of genetic algorithms (GenAlg) to optimize polar codes for reducing the decoding latency of fast cyclic redundancy check aided successive cancellation list decoders. The theoretical decoding time steps (TS) in code construction are assessed under the constraint of a maximum special node size. The GenAlg employed iteratively utilizes mutation and crossover to reduce decoding TS by generating more large special nodes while maintaining acceptable performance. By avoiding redundant simulations, the GenAlg iterations are reduced by 5 orders of magnitude. Synthesis results indicate that the proposed scheme can reduce latency by up to 20.2% compared to 5G codes.

  • Details
  • Metrics
Type
research article
DOI
10.1109/LCOMM.2024.3521080
Scopus ID

2-s2.0-85213459421

Author(s)
Zhou, Huayi
Ren, Yuqing  
Li, Jiajie
Gross, Warren J.
Date Issued

2024-12-23

Published in
IEEE Communications Letters
Subjects

code construction

•

genetic algorithm

•

optimizations of polar codes

•

Reduced decoding latency

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
TCL  
Available on Infoscience
January 13, 2025
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/242721
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés