Low Complexity Transceiver Design for GFDM
Arman Farhang, Nicola Marchetti, Linda E. Doyle

TL;DR
This paper introduces low-complexity transceiver designs for GFDM, leveraging matrix sparsification and FFT to reduce computational costs while maintaining optimal performance, making GFDM more practical for 5G systems.
Contribution
Novel transceiver structures for GFDM are proposed, utilizing matrix sparsification and FFT, significantly reducing complexity without performance loss.
Findings
Substantial computational complexity reduction achieved.
Proposed algorithms maintain optimal performance.
Closed-form solutions for ZF and MMSE filters derived.
Abstract
Due to its attractive properties, generalized frequency division multiplexing (GFDM) is recently being discussed as a candidate waveform for the fifth generation of wireless communication systems (5G). GFDM is introduced as a generalized form of the widely used orthogonal frequency division multiplexing (OFDM) modulation scheme and since it uses only one cyclic prefix (CP) for a group of symbols rather than a CP per symbol, it is more bandwidth efficient than OFDM. In this paper, we propose novel transceiver structures for GFDM by taking advantage of the particular structure in the modulation matrix. Our proposed transmitter is based on modulation matrix sparsification through application of fast Fourier transform (FFT) to reduce the implementation complexity. A unified receiver structure for matched filter (MF), zero forcing (ZF) and minimum mean square error (MMSE) receivers is 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.
