Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reduced Complexity Optimal Detection of Binary Faster-than-Nyquist Signaling (1703.02400v1)

Published 3 Mar 2017 in cs.IT and math.IT

Abstract: In this paper, we investigate the detection problem of binary faster-than-Nyquist (FTN) signaling and propose a novel sequence estimation technique that exploits its special structure. In particular, the proposed sequence estimation technique is based on sphere decoding (SD) and exploits the following two characteristics about the FTN detection problem: 1) the cor- relation between the noise samples after the receiver matched filter, and 2) the structure of the intersymbol interference (ISI) matrix. Simulation results show that the proposed SD-based sequence estimation (SDSE) achieves the optimal performance of the maximum likelihood sequence estimation (MLSE) at reduced computational complexity. This paper demonstrates that FTN signaling has the great potential of increasing the data rate and spectral efficiency substantially, when compared to Nyquist signaling, for the same bit-error-rate (BER) and signal-to-noise ratio (SNR).

Citations (16)

Summary

We haven't generated a summary for this paper yet.