Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2019, Vol. 42 ›› Issue (3): 7-13.doi: 10.13190/j.jbupt.2018-157

• Papers • Previous Articles     Next Articles

Low-Complexity MMSE Demodulation Algorithm for GFDM

HUANG Xiang-dong, WANG Hui-jie, LI Ming-shi, CAO Yue-bin   

  1. School of Electrical and Information Engineering, Tianjin University, Tianjin 300072, China
  • Received:2018-07-17 Online:2019-06-28 Published:2019-06-20

Abstract: Aiming at the problem that the computation complexity of the existing minimum mean square error (MMSE) demodulator with generalized frequency division multiplexing (GFDM) over frequency selective channel is relatively high, a matrix deconstruction based low-complexity MMSE GFDM receiver is proposed. By utilization of the particular structures (sparse, quasi-tridiagonal, block-symmetric, etc.) in a series of large-sized matrices involved in the receiver, either of large-sized matrix manipulations (including matrix multiplication and matrix inversion) is partitioned into small-sized matrix manipulations, thereby considerably reducing the computational complexity. Quantitively speaking, the times of complex multiplications consumed by the proposed MMSE receiver is 2-3 amount levels lower than the original MMSE receiver. Moreover, simulation shows that the proposed receiver does not suffer from any bit-error-rate degradation. Therefore, the proposed MMSE GFDM receiver possesses vast potentials for future 5G demodulation applications.

Key words: generalized frequency division multiplexing, minimum mean square error, frequency selective channel, low-complexity

CLC Number: