A Low-Latency Decoding of CA-Polar-SPC Product Codes

This paper is concerned with a class of product codes, referred to as CA-polar-SPC codes, where the cyclic redundancy check (CRC) aided polar (CA-polar) codes are column component codes and single parity-check (SPC) codes are row component codes. With the help of SPCs, a decoding scheme is proposed to improve the performance of CA-polar codes at the expense of only a minor increase in decoding complexity and latency. Distinguished from the conventional iterative decoding of product codes, the proposed decoding outputs immediately the successfully decoded columns without waiting for the reception of the entire product block. Only those unsuccessfully decoded columns are further decoded with updated messages from the row decoder by treating the successfully decoded columns as determined messages instead of soft messages. Extensive simulation results show that the proposed CA-polar-SPC code outperforms the underlying CA-polar code over binary-input additive white Gaussian noise (Bi-AWGN) channels with only a minor increase in decoding latency.

Authors

Institutions

Publication Details

Published
2024-11-24
DOI
https://doi.org/10.1109/itw61385.2024.10806972
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Low-Latency Decoding of CA-Polar-SPC Product Codes

Xinwei Zhao, Xiao Mat
Algorithms and Data Compression
article

A Low-Latency Decoding of CA-Polar-SPC Product Codes

Xinwei Zhao, Xiao Mat
article en

Abstract

This paper is concerned with a class of product codes, referred to as CA-polar-SPC codes, where the cyclic redundancy check (CRC) aided polar (CA-polar) codes are column component codes and single parity-check (SPC) codes are row component codes. With the help of SPCs, a decoding scheme is proposed to improve the performance of CA-polar codes at the expense of only a minor increase in decoding complexity and latency. Distinguished from the conventional iterative decoding of product codes, the proposed decoding outputs immediately the successfully decoded columns without waiting for the reception of the entire product block. Only those unsuccessfully decoded columns are further decoded with updated messages from the row decoder by treating the successfully decoded columns as determined messages instead of soft messages. Extensive simulation results show that the proposed CA-polar-SPC code outperforms the underlying CA-polar code over binary-input additive white Gaussian noise (Bi-AWGN) channels with only a minor increase in decoding latency.

Sun Yat-sen University (CN)
National Key Research and Development Program of China
Openalex Percentile: Top 78%
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Low-Latency Decoding of CA-Polar-SPC Product Codes — Xinwei Zhao, Xiao Mat · (2024) | TGRS Research Map | TGRS