Pith. sign in

REVIEW

Ordered-Statistics Decoding with Adaptive Gaussian Elimination Reduction for Short Codes

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 2206.10957 v2 pith:7L2PECLS submitted 2022-06-22 cs.IT math.IT

classification cs.ITmath.IT
keywords decodingproposedadaptivecomplexityconditiondecodereliminationgaussian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we propose an efficient ordered-statistics decoding (OSD) algorithm with an adaptive Gaussian elimination (GE) reduction technique. The proposed decoder utilizes two decoding conditions to adaptively remove GE in OSD. The first condition determines whether GE could be skipped in the OSD process by estimating the decoding error probability. Then, the second condition is utilized to identify the correct decoding result during the decoding process without GE. The proposed decoder can break the ``complexity floor'' in OSD decoders introduced by the GE overhead. Simulation results advise that when compared with the latest schemes in the literature, the proposed approach can significantly reduce the decoding complexity at high SNRs without any degradation in the error-correction capability.

Discussion (0). Continue with ORCID to comment.

Pith tools