光通信研究Issue(5)：75-78,4.DOI:10.13756/j.gtxyj.2015.05.022
LTE-A PUSCH 组合索引求解算法与 DSP 实现
Solving algorithm for combinatorial index in LTE-A PUSCH and DSP realization
摘要
Abstract
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.关键词
改进的长期演进/物理上行共享信道/资源分配/组合索引/数字信号处理器实现Key words
LTE-A/PUSCH/resource allocation/combinatorial index/DSP realization分类
信息技术与安全科学引用本文复制引用
李小文,周瑶,张爱平,冯友波..LTE-A PUSCH 组合索引求解算法与 DSP 实现[J].光通信研究,2015,(5):75-78,4.基金项目
国家科技重大专项资助课题(2012ZX03001-009-004) （2012ZX03001-009-004）
