Pith. sign in

REVIEW

Efficient Decoders for Short Block Length Codes in 6G URLLC

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.09572 v2 pith:FLMV2VPR submitted 2022-06-20 cs.IT math.IT

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

This paper reviews the potential channel decoding techniques for ultra-reliable low-latency communications (URLLC). URLLC is renowned for its stringent requirements including ultra-reliability, low end-to-end transmission latency, and packet-size flexibility. These requirements exacerbate the difficulty of the physical-layer design, particularly for the channel coding and decoding schemes. To satisfy the requirements of URLLC, decoders must exhibit superior error-rate performance \black{and} low decoding complexity. \black{Also, it is desired that decoders be universal} to accommodate various coding schemes. This paper provides a comprehensive review and comparison of different candidate decoding techniques for URLLC in terms of their error-rate performance and computational complexity for structured and random short codes. We further make recommendations of the decoder selections and suggest several potential research directions.

Discussion (0). Continue with ORCID to comment.

Pith tools