Abstract
In this letter, we propose a new symbol detection method for faster-than-Nyquist signaling (FTNS) systems. Based on frame theory, we formulate a symbol detection problem as a under-determined linear equation on a finite set. The problem is reformulated as a sum-of-absolute-values (SOAV) optimization that can be efficiently solved by the fast iterative shrinkage thresholding algorithm (FISTA). The proximity operator for the convex optimization is derived analytically. Simulation results are given to show that the proposed method can successfully detect symbols in faster-than-Nyquist signaling systems and has lower complexity in terms of computation time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
