Abstract
The unique features of generalised frequency division multiplexing (GFDM) such as low out-of-band emission, latency, and peak to average power ratio promotes it to be the foremost contender for the physical layer of next-generation communication. GFDM is considered as a generalised version of well-accepted orthogonal frequency-division multiplexing, which added an important feature named flexibility. On the other hand, these advantages are achieved at the cost of receiver complexity. In this work, the authors use the block circulant nature of the GFDM modulation matrix for reducing the complexity present in its receiver of GFDM system. They express the modulation matrix as a sum of permutation matrices and reduce the complexity involved in the computation of inverse for minimum mean square error receiver. The inversion formula is obtained by using the theory of circular arrays along with the concept of discrete Fourier transform (DFT), which they call as the extension of DFT to the modulation matrix. To validate the non-distorting nature of the proposed algorithm a set up is developed using National Instruments universal software radio peripheral (USRP) 2953R as hardware and LabVIEW as software.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
