Volume 43 Issue 5
May  2017
Turn off MathJax
Article Contents
ZHANG Chenyu, LIU Rongke. Low-complexity algorithm for FTN signal based on SOVA[J]. Journal of Beijing University of Aeronautics and Astronautics, 2017, 43(5): 998-1003. doi: 10.13700/j.bh.1001-5965.2016.0351(in Chinese)
Citation: ZHANG Chenyu, LIU Rongke. Low-complexity algorithm for FTN signal based on SOVA[J]. Journal of Beijing University of Aeronautics and Astronautics, 2017, 43(5): 998-1003. doi: 10.13700/j.bh.1001-5965.2016.0351(in Chinese)

Low-complexity algorithm for FTN signal based on SOVA

doi: 10.13700/j.bh.1001-5965.2016.0351
Funds:

National Natural Science Foundation of China 91438116

Shanghai Innovation Foundation of Aerospace Science and Technology SAST2015089

More Information
  • Corresponding author: LIU Rongke, E-mail:rongke_liu@cqjj8.com
  • Received Date: 28 Apr 2016
  • Accepted Date: 22 Jul 2016
  • Publish Date: 20 May 2017
  • Faster-than-Nyquist (FTN) signaling is a transmission method with high bit density and inevitable inter-symbol interference. Based on soft output Viterbi algorithm (SOVA), a low complexity receiver for FTN was introduced. The number of comparison in the backtracking process was adjusted by the result of survivor path and competitive path, and was reduced during the process. In application, a fixed backtracking length was searched and defined by statistical value, which was shorter than that in SOVA. The presented method reduces the complexity and time delay in the FTN signal detector. Without deteriorating bit error rate (BER), the number of comparison operations is reduced by 2/3, the number of registers is reduced by more than 50%, and the system delay is reduced by more than 50%.

     

  • loading
  • [1]
    MAZO J E.Faster-than-Nyquist signaling[J]. Bell Labs Tecnical Journal, 1975, 54(8):1451-1462.
    [2]
    ANDERSON J B, RUSEK F, OWALL V.Faster-than-Nyquist signaling[J]. Proceedings of the IEEE, 2013, 101(8):1817-1830. doi: 10.1109/JPROC.2012.2233451
    [3]
    PRLJA A, ANDERSON J B, RUSEK F.Receivers for faster-than-Nyquist signaling with and without turbo equalization[C]//IEEE International Symposium on International Theory.Piscataway, NJ:IEEE Press, 2008:464-468.
    [4]
    ANDERSON J B, PRLJA A, RUSEK F.New reduced state space BCJR algorithms for the ISI channel[C]//IEEE International Symposium on Information Theory.Piscataway, NJ:IEEE Press, 2009:889-893.
    [5]
    ANDERSON J B, PRLJA A.Turbo equalization and an M-BCJR algorithm for strongly narrowband intersymbol interference[C]//International Symposium on Information Theory and its Applications.Piscataway, NJ:IEEE Press, 2010:261-266.
    [6]
    PRLJA A, ANDERSON J B.Reduced-complexity receivers for strongly narrowband intersymbol interference introduced by faster-than-Nyquist signaling[J]. IEEE Transactions on Communications, 2012, 60(9):2591-2601. doi: 10.1109/TCOMM.2012.070912.110296
    [7]
    RUSEK F, COLAVOLPE G, SUNDBERG C E W.40 years with the Ungerboeck model:A look at its potentialities[J]. IEEE Signal Processing Magazine, 2015, 32(3):156-161. doi: 10.1109/MSP.2014.2374221
    [8]
    RUSEK F, LONCAR M, PRLJA A.A comparison of Ungerboeck and Forney models for reduced-complexity ISI equalization[C]//IEEE Global Telecommunications Conference.Piscataway, NJ:IEEE Press, 2007:1431-1436.
    [9]
    FORNEY G D.Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference[J]. IEEE Transactions on Information Theory, 1972, 18(3):363-378. doi: 10.1109/TIT.1972.1054829
    [10]
    LONCAR M, RUSEK F.On reduced-complexity equalization based on Ungerboeck and forney observation models[J]. IEEE Transactions on Signal Processing, 2008, 56(8):3784-3789. doi: 10.1109/TSP.2008.920142
    [11]
    BAEK M S, HUR N H, LIM H.Novel interference cancellation technique based on matrix computation for FTN communication system[C]//IEEE Military Communications Conference.Piscataway, NJ:IEEE Press, 2014:830-834.
    [12]
    RINGH E.Low complexity algorithm for faster-than-Nyquist signaling:Using coding to avoid an NP-hard problem[D]. Stockholm:Royal Institute of Technology, 2013.
    [13]
    NIE S Y, GUO M X, SHEN Y H.Precoding based on matrix decomposition for faster-than-Nyquist signaling[C]//5th International Conference on Electronics Information and Emergency Communication.Piscataway, NJ:IEEE Press, 2015:194-197.
    [14]
    HAGENAUER J, HOEHER P.A Viterbi algorithm with soft decision outputs and its applications[C]//IEEE Global Telecommunication Conference and Exhibition.Piscataway, NJ:IEEE Press, 1989:1680-1686.
    [15]
    LIVERIS A, GEORGHIADES C.Exploiting faster-than-Nyquist signaling[J]. IEEE Transactions on Communications, 2003, 51(9):1502-1511. doi: 10.1109/TCOMM.2003.816943
    [16]
    UNGERBOECK G.Adaptive maximum-likelihood receiver for carrier-modulated data-transmission systems[J]. IEEE Transactions on Communications, 1974, 22(5):624-636. doi: 10.1109/TCOM.1974.1092267
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(3)  / Tables(2)

    Article Metrics

    Article views(1064) PDF downloads(299) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return