摘要
LTE-A(改进的长期演进)上行支持一种基于Clustered DFT-S-OFDM(集合式离散傅里叶变换扩展正交频分复用)的非连续频域资源分配方式,而为了在PUSCH(物理上行共享信道)中实现这种分配方式,求解组合索引成了一个关键问题。针对这个问题,文章提出一种基于组合数系统的贪婪算法,以查表的方式取代传统的全搜索算法,查找次数从O(N4)降到了O(N)。最后通过在DSP(数字信号处理器)中实现该算法,证实了该算法具有更强的可行性和有效性。
In LTE-Advanced (LTE-A)uplinks,a non-contiguous frequency resource allocation based on clustered DFT-S-OFDM is supported.In order to implement such resource allocation in PUSCH,solving the combinatorial index becomes a crit-ical issue.With regard to this issue,this paper presents a combinatorial system-based greedy algorithm,which uses table checkup instead of the conventional full-search algorithm,reducing the number of searching times from O(N 4 )to O(N ).This algorithm is realized in DSP,verifying its greater feasibility and effectiveness.
出处
《光通信研究》
北大核心
2015年第5期75-78,共4页
Study on Optical Communications
基金
国家科技重大专项资助课题(2012ZX03001-009-004)
