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.

中文翻译：

---

使用USRP的GFDM系统的低复杂度实现

通用频分复用（GFDM）的独特功能（如低带外发射，延迟和峰均功率比）使它成为下一代通信物理层的最主要竞争者。GFDM被认为是公认的正交频分复用的通用版本，它增加了一个名为灵活性的重要功能。另一方面，以接收器复杂性为代价获得这些优点。在这项工作中，作者利用GFDM调制矩阵的块循环特性来降低GFDM系统接收器中存在的复杂性。他们将调制矩阵表示为置换矩阵的总和，并减少了最小均方误差接收器的逆计算所涉及的复杂性。利用圆形阵列理论以及离散傅里叶变换（DFT）的概念获得了反演公式，他们将其称为DFT扩展到调制矩阵。为了验证所提出算法的非失真性质，使用National Instruments通用软件无线电外围设备（USRP）2953R作为硬件，以及LabVIEW作为软件，开发了一种设置。