Proves that PAC codes with rate profiles below polarized cutoff rates have Pareto-bounded sequential decoding complexity, and demonstrates a code built on this rule that gains over 0.75 dB at FER 1e-5.
Performance and Complexity of Sequential Decoding of PAC Codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes is given. A method for bounding the complexity of sequential decoding of PAC codes is proposed.
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
PAC codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design
Proves that PAC codes with rate profiles below polarized cutoff rates have Pareto-bounded sequential decoding complexity, and demonstrates a code built on this rule that gains over 0.75 dB at FER 1e-5.