ﻻ يوجد ملخص باللغة العربية
Faster-than-Nyquist (FTN) is a promising paradigm to improve bandwidth utilization at the expense of additional intersymbol interference (ISI). In this paper, we apply state-of-the-art deep learning (DL) technology into receiver design for FTN signaling and propose two DL-based new architectures. Firstly, we propose an FTN signal detection based on DL and connect it with the successive interference cancellation (SIC) to replace traditional detection algorithms. Simulation results show that this architecture can achieve near-optimal performance in both uncoded and coded scenarios. Additionally, we propose a DL-based joint signal detection and decoding for FTN signaling to replace the complete baseband part in traditional FTN receivers. The performance of this new architecture has also been illustrated by simulation results. Finally, both the proposed DL-based receiver architecture has the robustness to signal to noise ratio (SNR). In a nutshell, DL has been proved to be a powerful tool for the FTN receiver design.
This letter proposes a blind symbol packing rartio estimation for faster-than-Nyquist (FTN) signaling based on state-of-the-art deep learning (DL) technology. The symbol packing rartio is a vital parameter to obtain the real symbol rate and recover t
In this paper, we investigate the sequence estimation problem of faster-than-Nyquist (FTN) signaling as a promising approach for increasing spectral efficiency (SE) in future communication systems. In doing so, we exploit the concept of Gaussian sepa
A deep learning assisted sum-product detection algorithm (DL-SPA) for faster-than-Nyquist (FTN) signaling is proposed in this paper. The proposed detection algorithm concatenates a neural network to the variable nodes of the conventional factor graph
Reduced complexity faster-than-Nyquist (FTN) signaling systems are gaining increased attention as they provide improved bandwidth utilization for an acceptable level of detection complexity. In order to have a better understanding of the tradeoff bet
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