Low-Complexity Joint Channel Estimation and List Decoding of Short Codes
Mustafa Cemil Co\c{s}kun, Gianluigi Liva, Johan \"Ostman and, Giuseppe Durisi

TL;DR
This paper introduces a low-complexity joint channel estimation and list decoding scheme for short codes, reducing pilot overhead and improving decoding performance in Rayleigh block-fading channels.
Contribution
It proposes a novel pilot-assisted transmission scheme that uses minimal pilots for initial channel estimation and applies non-coherent decoding to enhance short code decoding.
Findings
Achieves up to 1.2 dB gain over traditional schemes
Reduces pilot overhead significantly
Demonstrates effectiveness with QPSK signaling
Abstract
A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step. The final decision of the message is obtained by applying a non-coherent decoding metric to the codewords composing the list. This allows one to use very few pilots, thus reducing the channel estimation overhead. The method is applied to an ordered statistics decoder for communication over a Rayleigh block-fading channel. Gains of up to dB as compared to traditional PAT schemes are demonstrated for short codes with QPSK signaling. The approach can be generalized to other list decoders, e.g., to list decoding of polar codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Error Correcting Code Techniques · Cooperative Communication and Network Coding
