Metraipolis › archive › dc_6bf58c5523fd
Low-Complexity Recurrent Neural Network Detector for Faster-than-Nyquist Signaling — arXiv:2608.04155
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04155
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:13:26.046Z
- SHA-256 of the archived text
19a7b738bd5cd40b8c34cbe3d77485e9bf4f05f1b12668e66471474a1750b8db- Stable URL of this page
https://metraipolis.com/documento/dc_6bf58c5523fd
How to cite
Low-Complexity Recurrent Neural Network Detector for Faster-than-Nyquist Signaling — arXiv:2608.04155 — arXiv (en), https://arxiv.org/abs/2608.04155 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6bf58c5523fd (Metraipolis archive dc_6bf58c5523fd, sha256 19a7b738bd5cd40b8c34cbe3d77485e9bf4f05f1b12668e66471474a1750b8db)
BibTeX
@misc{dc6bf58c5523fd,
title = {Low-Complexity Recurrent Neural Network Detector for Faster-than-Nyquist Signaling — arXiv:2608.04155},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04155},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6bf58c5523fd; sha256 19a7b738bd5cd40b8c34cbe3d77485e9bf4f05f1b12668e66471474a1750b8db},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04155. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This study proposes a low-complexity, bidirectional, single-pass Elman recurrent neural network detector for binary phase-shift keying signals transmitted with faster-than-Nyquist signaling. Since the faster-than-Nyquist intersymbol interference has a short, finite memory, the classical Elman recurrent neural network, which contains no gating mechanism, is a sufficient and parameter-efficient model. The proposed detector processes the received sequence in both forward and backward directions in a single pass, forming a learned counterpart of the optimal BCJR forward-backward recursion. Under a root-raised-cosine pulse over an additive white Gaussian noise channel, simulations for two compression factors show that the proposed detector, with only twenty-five to sixty-five trainable parameters, attains a bit error rate very close to that of the M-BCJR algorithm, while reducing the look-up-table hardware cost by thirty-eight to forty-six percent and using no explicit division or exponential operations. A more compact configuration offers up to a sixty-seven percent reduction at a small performance penalty. To the best of our knowledge, this is the first study to investigate the classical Elman recurrent neural network architecture for the faster-than-Nyquist detection problem. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-06 in eess.SP). Categorie arXiv: Signal Processing (eess.SP). Pagina del lavoro: https://arxiv.org/abs/2608.04155 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:03:54.938Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).