No Arabic abstract
Faster than Nyquist (FTN) signaling is an attractive transmission technique that is capable of improving the spectral efficiency with additional detection complexity at the receiver. Semidefinite relaxation (SDR) based FTN detectors are appealing as they provide good performance with linear decoding complexity. In this paper, we propose a soft-output semidefinite relaxation (soSDR) based FTN detector which has a similar polynomial complexity order when compared to its counterpart that only produces hard-output decisions. The main complexity reduction lies in re-using the candidate sequences generated in the Gaussian randomization (GR) step to produce reliable soft-output values, which approximate the calculation of the log-likelihood ratio (LLR) inputs for the channel decoder. The effectiveness of the proposed soSDR algorithm is evaluated using polar codes with successive cancellation decoding (SCD) through simulations, and its performance is compared against the state-of-the-art techniques from the literature. Simulation results show that the proposed soSDR algorithm provides reliable LLR values and strikes a good balance between detection complexity and bit error rate (BER) performance.
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 separability and propose two probabilistic data association (PDA) algorithms with polynomial time complexity to detect binary phase-shift keying (BPSK) FTN signaling. Simulation results show that the proposed PDA algorithm outperforms the recently proposed SSSSE and SSSgb$K$SE algorithms for all SE values with a modest increase in complexity. The PDA algorithm approaches the performance of the semidefinite relaxation (SDRSE) algorithm for SE values of $0.96$ bits/sec/Hz, and it is within the $0.5$ dB signal-to-noise ratio (SNR) penalty at SE values of $1.10$ bits/sec/Hz for the fixed values of $beta = 0.3$.
Faster-than-Nyquist (FTN) signaling is a promising non-orthogonal pulse modulation technique that can improve the spectral efficiency (SE) of next generation communication systems at the expense of higher detection complexity to remove the introduced inter-symbol interference (ISI). In this paper, we investigate the detection problem of ultra high-order quadrature-amplitude modulation (QAM) FTN signaling where we exploit a mathematical programming technique based on the alternating directions multiplier method (ADMM). The proposed ADMM sequence estimation (ADMMSE) FTN signaling detector demonstrates an excellent trade-off between performance and computational effort enabling, for the first time in the FTN signaling literature, successful detection and SE gains for QAM modulation orders as high as 64K (65,536). The complexity of the proposed ADMMSE detector is polynomial in the length of the transmit symbols sequence and its sensitivity to the modulation order increases only logarithmically. Simulation results show that for 16-QAM, the proposed ADMMSE FTN signaling detector achieves comparable SE gains to the generalized approach semidefinite relaxation-based sequence estimation (GASDRSE) FTN signaling detector, but at an experimentally evaluated much lower computational time. Simulation results additionally show SE gains for modulation orders starting from 4-QAM, or quadrature phase shift keying (QPSK), up to and including 64K-QAM when compared to conventional Nyquist signaling. The very low computational effort required makes the proposed ADMMSE detector a practically promising FTN signaling detector for both low order and ultra high-order QAM FTN signaling systems.
Faster-than-Nyquist (FTN) signaling is a promising non-orthogonal physical layer transmission technique to improve the spectral efficiency of future communication systems but at the expense of intersymbol-interference (ISI). In this paper, we investigate the detection problem of FTN signaling and formulate the sequence estimation problem of any $M$-ary phase shift keying (PSK) FTN signaling as an optimization problem that turns out to be non-convex and nondeterministic polynomial time (NP)-hard to solve. We propose a novel algorithm, based on concepts from semidefinite relaxation (SDR) and Gaussian randomization, to detect any $M$-ary PSK FTN signaling in polynomial time complexity regardless of the constellation size $M$ or the ISI length. Simulation results show that the proposed algorithm strikes a balance between the achieved performance and the computational complexity. Additionally, results show the merits of the proposed algorithm in improving the spectral efficiency when compared to Nyquist signaling and the state-of-the-art schemes from the literature. In particular, when compared to Nyquist signaling at the same error rate and signal-to-noise ratio, our scheme provides around $17%$ increase in the spectral efficiency at a roll-off factor of 0.3.
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 the origin symbols from the received symbols by calculating the intersymbol interference (ISI). To the best of our knowledge, this is the first effective estimation approach for symbol packing rartio in FTN signaling and has shown its fast convergence and robustness to signal-to-noise ratio (SNR) by numerical simulations. Benefiting from the proposed blind estimation, the packing-ratio-based adaptive FTN transmission without dedicate channel or control frame becomes available. Also, the secure FTN communications based on secret symbol packing rartio can be easily cracked.