检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李飞 苏永钢 付磊 王蔚戎 LI Fei;SU Yonggang;FU Lei;WANG Weirong(College of Electronic and Information Engineering,Hebei University,Baoding 071000,China)
出 处:《北京邮电大学学报》2024年第3期83-89,共7页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(62103126)。
摘 要:针对广义频分复用(GFDM)系统复杂度偏高,不能灵活应对未来通信系统多种应用场景的问题,提出了基于稀疏矩阵的GFDM低复杂度调制解调算法。首先,分析GFDM的系统模型,得到2种不同的调制结构;然后,分别对2种调制结构进行不同的预处理,使调制矩阵表现出不同的稀疏性;再对稀疏矩阵重新排列,得到不同的块对角矩阵;最后,利用块对角矩阵的特殊性质,可有效降低GFDM系统的计算复杂度。仿真实验结果表明,在大量窄带子载波或少量宽带子载波场景下,2种低复杂度算法不仅能取得较好的复杂度性能,还能突显GFDM灵活时频结构的优势。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 CFDM 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.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.198