Reduced Complexity Calculation of LMMSE Filter Coefficients for GFDM
Maximilian Matth\'e, Ivan Gaspar, Dan Zhang, Gerhard Fettweis
TL;DR
This paper introduces a low-complexity algorithm for calculating LMMSE filter coefficients in GFDM, significantly reducing computational complexity by exploiting matrix block circularity, with potential applicability to other circular waveforms.
Contribution
It presents a novel, simplified method for LMMSE filter coefficient calculation in GFDM that reduces complexity from cubic to quadratic order.
Findings
Complexity reduced from cubic to quadratic order.
Method exploits block circularity of matrices.
Applicable to other circular pulse shaping waveforms.
Abstract
A low-complexity algorithm for calculation of the LMMSE filter coefficients for GFDM in a block-fading multipath environment is derived in this letter. The simplification is based on the block circularity of the involved matrices. The proposal reduces complexity from cubic to squared order. The proposed approach can be generalized to other waveforms with circular pulse shaping.
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.