Matrix Characterization for GFDM Systems: Low-Complexity MMSE Receivers and Optimal Prototype Filters
Po-Chih Chen, Borching Su, and Yenming Huang

TL;DR
This paper introduces a matrix-based approach to analyze GFDM systems, enabling the design of low-complexity MMSE receivers and optimal filters that match OFDM performance without noise enhancement.
Contribution
It proposes a new matrix characterization for GFDM, deriving conditions for low-complexity MMSE receivers and optimal prototype filters, improving system efficiency and performance.
Findings
Low-complexity MMSE implementation exists with unitary GFDM matrices.
Optimal prototype filters are derived, matching OFDM's MSE performance.
Unitary GFDM matrices of power-of-two size are verified to exist.
Abstract
In this paper, a new matrix-based characterization of generalized-frequency-division-multiplexing (GFDM) transmitter matrices is proposed, as opposed to traditional vector-based characterization with prototype filters. The characterization facilitates deriving properties of GFDM (transmitter) matrices, including conditions for GFDM matrices being nonsingular and unitary, respectively. Using the new characterization, the necessary and sufficient conditions for the existence of a form of low-complexity implementation for a minimum mean square error (MMSE) receiver are derived. Such an implementation exists under multipath channels if the GFDM transmitter matrix is selected to be unitary. For cases where this implementation does not exist, a low-complexity suboptimal MMSE receiver is proposed, with its performance approximating that of an MMSE receiver. The new characterization also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
