摘要
降低计算复杂度是联合检测的主要问题,论文基于此提出了基于ε近似算法的联合检测技术。把联合检测问题转化为带约束的二次规划问题,通过二次规划问题的ε近似算法进行求解。最后针对不同参数对该算法进行性能仿真和结果分析,并与快速傅立叶变换算法进行性能和计算复杂度的比较。仿真结果表明:文章提出的新联合检测算法具有较强的抗多径干扰能力,同时比已有算法具有较低的计算复杂度。
In order to reduce the computational complexity during the joint detection, this paper peoposes a new approach based on ε-approximation algorithm. The proposed approach first turns the problem of joint detection into a quadratic optimization problem with some constraints, then the efficient ε -approximation algorithms are applied to directly estimate the transmitted signals, then aiming at different parameters, the simulation results of performance are given and analyzed, finally the proposed algorithm and the Fourier algorithm are compared. Simulations show that the proposed algorithm possesses stronger capability of suppressing multipath interference and lower computational complexity than the existed algorithms.
出处
《信息安全与通信保密》
2009年第9期63-65,共3页
Information Security and Communications Privacy
关键词
多址干扰
联合检测
ε逼近算法
性能分析
multiple access interference
joint detection
ε-approximation algorithm
performance analysis
