Table of Contents
Fetching ...

Frequency-Domain Decoupling for MIMO-GFDM Spatial Multiplexing

Ching-Lun Tai, Borching Su, Cai Jia

TL;DR

A class of GFDM prototype filters is investigated, enabling frequency-domain decoupling during processing at the GFDM receiver, and an efficient MIMO-GFDM detection method based on depth-first sphere decoding is subsequently proposed with this class of filters.

Abstract

Generalized frequency division multiplexing (GFDM) is considered a non-orthogonal waveform and known to encounter difficulties when using in the spatial multiplexing mode of multiple-input-multiple-output (MIMO) scenario. In this paper, a class of GFDM prototype filters, under which the GFDM system is free from inter-subcarrier interference, is investigated, enabling frequency-domain decoupling in the processing at the GFDM receiver. An efficient MIMO-GFDM detection method based on depth-first sphere decoding is then proposed with such class of filters. Numerical results confirm a significant reduction in complexity, especially when the number of subcarriers is large, compared with existing methods presented in recent years.

Frequency-Domain Decoupling for MIMO-GFDM Spatial Multiplexing

TL;DR

A class of GFDM prototype filters is investigated, enabling frequency-domain decoupling during processing at the GFDM receiver, and an efficient MIMO-GFDM detection method based on depth-first sphere decoding is subsequently proposed with this class of filters.

Abstract

Generalized frequency division multiplexing (GFDM) is considered a non-orthogonal waveform and known to encounter difficulties when using in the spatial multiplexing mode of multiple-input-multiple-output (MIMO) scenario. In this paper, a class of GFDM prototype filters, under which the GFDM system is free from inter-subcarrier interference, is investigated, enabling frequency-domain decoupling in the processing at the GFDM receiver. An efficient MIMO-GFDM detection method based on depth-first sphere decoding is then proposed with such class of filters. Numerical results confirm a significant reduction in complexity, especially when the number of subcarriers is large, compared with existing methods presented in recent years.

Paper Structure

This paper contains 8 sections, 1 theorem, 12 equations, 2 figures, 1 table.

Key Result

Theorem 1

Let ${\bf A}$ be a GFDM matrix derived from its FD prototype filter ${\bf g}_f$ and assume that ${\bf g}_f$ contains at most $M$ consecutive nonzero entries (i.e., there exist ${\bf g}_1 \in \mathbb{C}^M$ and an integer $l$, $0\leq l < D$) such that Consequently, the matrix $\tilde{{\bf H}}$ as defined in (eq:y) can be decomposed into the form where ${\bf U} = ({\bf \Pi}_{KR} \otimes {\bf I}_M)(

Figures (2)

  • Figure 1: Performance comparison for $K=256,M=4,T=2$
  • Figure 2: Performance comparison for $K=512,M=2,T=2$

Theorems & Definitions (2)

  • Theorem 1
  • proof