Coded Faster-than-Nyquist Signaling for Short Packet Communications
Emre Cerci, Adem Cicek, Enver Cavus, Ebrahim Bedeer, Halim, Yanikomeroglu

TL;DR
This paper explores using faster-than-Nyquist signaling combined with low-density parity-check codes to improve short packet communication performance in low-latency, ultra-reliable systems, achieving better error rates with lower complexity.
Contribution
It introduces a low-complexity FTN signaling detection method combined with NB-LDPC codes tailored for URLLC, outperforming existing near-optimal detectors in error rate and computational efficiency.
Findings
Outperforms close-to-optimal FTN detectors in error rate.
Reduces computational complexity significantly.
Enhances performance for short packet URLLC communications.
Abstract
Ultra-reliable low-latency communication (URLLC) requires short packets of data transmission. It is known that when the packet length becomes short, the achievable rate is subject to a penalty when compared to the channel capacity. In this paper, we propose to use faster-than-Nyquist (FTN) signaling to compensate for the achievable rate loss of short packet communications. We investigate the performance of a combination of a low complexity detector of FTN signaling used with nonbinary low-density parity-check (NB-LDPC) codes that is suitable for low-latency and short block length requirements of URLLC systems. Our investigation shows that such combination of low-complexity FTN signaling detection and NB-LDPC codes outperforms the use of close-to-optimal FTN signaling detectors with LDPC codes in terms of error rate performance and also has a considerably lower computational complexity.
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.
