Open AccessLow complex implementation of GFDM system using USRP
Author(s) -
Valluri Siva Prasad,
Vejandla Kishore,
Mani Venkata Vakamulla
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2019.1106
Subject(s) - universal software radio peripheral , software defined radio , orthogonal frequency division multiplexing , computer science , modulation (music) , multiplexing , algorithm , minimum mean square error , circulant matrix , electronic engineering , computer engineering , theoretical computer science , telecommunications , mathematics , channel (broadcasting) , engineering , physics , statistics , estimator , acoustics
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.