Optimization of Hopping DFT for FS-FBMC Receivers

被引:5
作者
Al-amaireh, Husam [1 ]
Kollar, Zsolt [2 ]
机构
[1] Budapest Univ Technol & Econ, Dep Broadband Infocommun & Electromagnet Theory, Budapest, Hungary
[2] Budapest Univ Technol & Econ, Dept Measurement & Informat Syst, Budapest, Hungary
关键词
FBMC receiver; Frequency spreading; Hopping DFT; Complexity; Split-radix; Radix-2;
D O I
10.1016/j.sigpro.2021.107983
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Filter Bank Multi-Carrier (FBMC) modulation is a promising modulation technique that is expected to play an important role in future 5G systems alongside Orthogonal Frequency Division Multiplexing (OFDM). In spite of its attractive properties, mainly the signal is well localized in frequency and time, a major draw-back to FBMC is the high signal processing load compared with OFDM. Although FBMC using PolyPhase Network (PPN) requires lower computational complexity compared with Frequency Spreading (FS) implementations, FS-FBMC receivers have shown better performance compared with PPN-FBMC, especially when equalization is also considered. In this paper, we focus on reducing the complexity of FS-FBMC receivers by applying Hopping Discrete Fourier Transform (HDFT) instead of Fast Fourier Transform (FFT). Furthermore, we derive an improved HDFT based on the split radix method and analyze the resulting structure in terms of computational complexity. We show that the proposed HDFT based FS-FBMC receiver has a lower complexity and introduces a smaller delay in processing time compared to the conventional FFT based FS-FBMC receiver. (c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
引用
收藏
页数:11
相关论文
共 26 条
[11]  
Jacobsen E, 2003, IEEE SIGNAL PROC MAG, V20, P74, DOI 10.1109/MSP.2003.1184347
[12]   Low-complexity hopping DFT design based on a compact recursive structure [J].
Juang, W. -H. ;
Lai, S. -C. ;
Chen, K. -H. ;
Tsai, W. -K. ;
Luo, C. -H. .
ELECTRONICS LETTERS, 2017, 53 (01) :25-26
[13]   VLSI Architecture for Novel Hopping Discrete Fourier Transform Computation [J].
Juang, Wen-Ho ;
Lai, Shin-Chi ;
Luo, Ching-Hsing ;
Lee, Shuenn-Yuh .
IEEE ACCESS, 2018, 6 :30491-30500
[14]   FBMC Transmitters with Reduced Complexity [J].
Kollar, Zsolt ;
Al-Amaireh, Husam .
RADIOENGINEERING, 2018, 27 (04) :1147-+
[15]   Observer-Based Recursive Sliding Discrete Fourier Transform [J].
Kollar, Zsolt ;
Plesznik, Ferenc ;
Trumpf, Simon .
IEEE SIGNAL PROCESSING MAGAZINE, 2018, 35 (06) :100-106
[16]   On the Modeling of Inter-Sub-Symbol Interference in GFDM Transmission [J].
Kumar, Atul ;
Magarini, Maurizio .
IEEE COMMUNICATIONS LETTERS, 2019, 23 (10) :1730-1734
[17]   Symbol Error Probability Analysis of DFrFT-Based OFDM Systems With CFO and STO in Frequency Selective Rayleigh Fading Channels [J].
Kumar, Atul ;
Magarini, Maurizio .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2019, 68 (01) :64-81
[18]  
Mattera D, SIGNAL PROCESS
[19]   Frequency domain CFO compensation for FBMC systems [J].
Mattera, Davide ;
Tanda, Mario ;
Bellanger, Maurice .
SIGNAL PROCESSING, 2015, 114 :183-197
[20]   Design and Evaluation of a Novel Short Prototype Filter for FBMC/OQAM Modulation [J].
Nadal, Jeremy ;
Nour, Charbel Abdel ;
Baghdadi, Amer .
IEEE ACCESS, 2018, 6 :19610-19625