GFDM System Low-Complexity Algorithm Based on Sparse Matrix
In response to the high complexity of generalized frequency division multiplexing(GFDM)systems and their inability to flexibly adapt to various future communication system applications,a low-complexity modulation and demodulation algorithm based on sparse matrices for GFDM isproposed.Firstly,the system model of GFDM is analyzed,resulting in two different modulation structures.Subsequently,different preprocessing techniques are applied to the two modulation structures to demonstrate varying degrees of sparsity in the modulation matrices.The sparse matrices are then rearranged to obtain distinct block diagonal matrices.Ultimately,by exploiting the special properties of block diagonal matrices,it is possible to effectively reduce the computational complexity of GFDM systems.Simulation results evidently demonstrate that under scenarios with a large number of narrowband subcarriers or a small number of wideband subcarriers,both low-complexity algorithms not only achieve good complexity performance but also highlight the advantages of the flexible time-frequency structure of GFDM.
new multicarrier technologygeneralized frequency division multiplexingcomplexitysparse matrix
NETL
NSTL
万方数据
