• DocumentCode
    3117560
  • Title

    Generalized faster-than-Nyquist signaling

  • Author

    Zhou, Jing ; Li, Daoben ; Wang, Xuesong

  • Author_Institution
    Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    1478
  • Lastpage
    1482
  • Abstract
    We extend the concept of faster-than-Nyquist (FTN) signaling to linear digital modulation using arbitrary modulation pulses, called generalized faster-than-Nyquist signaling (GFTN). A universal definition of nominal bandwidth is given so that “how fast” can be measured for GFTN like FTN using T-orthogonal pulses. The capacities and their asymptotic behaviors are compared between GFTN and Nyquist signaling. We show that the gain of GFTN increases unboundedly with SNR. In high SNR regime the power gain is considerable. Our extension from FTN to GFTN gives more freedom on the design of pulses to achieve good performance and acceptable detection complexity.
  • Keywords
    modulation; signal detection; FTN signaling; GFTN; SNR regime; T-orthogonal pulses; arbitrary modulation pulses; asymptotic behaviors; generalized faster-than-Nyquist signaling; linear digital modulation; power gain; signal detection complexity; AWGN channels; Bandwidth; Channel capacity; Complexity theory; Digital modulation; Signal to noise ratio;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6283509
  • Filename
    6283509