检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]渭南师范学院网络安全与信息化学院,陕西渭南714000
出 处:《西北大学学报(自然科学版)》2016年第2期195-200,共6页Journal of Northwest University(Natural Science Edition)
基 金:国家自然科学基金资助项目(61172071);渭南市科技计划基金资助项目(2015KYJ-2-2);渭南市科技计划基金资助项目(2015KYJ-2-3);渭南师范学院科研基金资助项目(15YKP006)
摘 要:在多输入多输出(MIMO)信号检测算法中,球形译码检测算法的复杂度会随着半径的增大而迅速增加,代价较高。为了避免这一问题,提出一种改进的球形译码算法,该算法考虑改变搜索的起始位置,从最接近信号点上下限中间位置开始搜索,并根据信号点和中间位置的距离对信号点升序排序,随着译码半径的改变,排序不变,这样就减少搜索次数,降低算法复杂度。仿真结果表明,随着半径取值的增加,新型球形译码算法复杂度大幅度降低的同时,仍然保证了译码性能最接近性能最优的最大似然检测算法。The performance of sphere decoding algorithm is similar to the optimal maximum likelihood detection algorithm and the decoding complexity is greatly reduced in MIMO system.However,the complexity of detection will increase rapidly as the radius increasing and lead to the higher price.In order to avoid the complexity increasing in the detection process,this paper consider changing the search position,and make the nearest signal point to the upper and lower intermediate position as the starting position.Meanwhile,the detection order is in ascending order according to the signal point and the distance of the length of the intermediate position,the order remains unchanged with the radius changing.This method reduces the number of searches and complexity of the algorithm.Simulation results show that the new sphere decoding algorithm can greatly reduce complexity with the increase of radius and make the performance close to the maximum likelihood decoding algorithm.
关 键 词:多输入多输出 球形译码算法 译码半径 译码复杂度
分 类 号:TN941.4[电子电信—信号与信息处理] TN929[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.59.252.174