Pith. sign in

REVIEW

Approaching the Finite Blocklength Capacity within 0.025dB by Short Polar Codes and CRC-Aided Hybrid Decoding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.03254 v1 pith:A6FT3DS2 submitted 2019-10-08 cs.IT math.IT

classification cs.ITmath.IT
keywords decodingblocklengthcapacitycrc-aidedfiniteperformanceradiusreceived
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this letter, we explore the performance limits of short polar codes and find that the maximum likelihood (ML) performance of a simple CRC-polar concatenated scheme can approach the finite blocklength capacity. Then, in order to approach the ML performance with a low average complexity, a CRC-aided hybrid decoding (CA-HD) algorithm is proposed and its decoding process is divided into two steps. In the first step, the received sequence is decoded by the adaptive successive cancellation list (ADSCL) decoding. In the second step, CRC-aided sphere decoding with a reasonable initial radius is used to decode the received sequence. To obtain the reasonable radius, the CRC bits of the survival paths in ADSCL are recalculated and the minimum Euclidean distance between the survival path and the received sequence is chosen as the initial radius. The simulation results show that CA-HD can achieve within about $0.025$dB of the finite blocklength capacity at the block error ratio $10^{-3}$ with code length $128$ and code rate $1/2$.

Discussion (0). Continue with ORCID to comment.

Pith tools