在IDMA系统中,交织序列区分不同用户,其产生是随机且独立的。但一些交织序列互相关系数接近1,这严重影响通信性能。因此提 出一种应用于IDMA通信系统中的粒子群交织算法。该方法以互相关矩阵作为适应度 函数,采用粒子群算法寻找最优交织序列。仿真表明,该算法的性能优于非随机交 织、随机交织和基于进化算法的交织。
- Abstract:
- Interleavers are employed as the means of users separation which are generated independently and randomly in IDMA system.But cross correlation coefficients of some interleavers sequences are near to1, which seriously affect the performance of communication.In this paper, interleavers algorithm based on particle swarm is proposed,and applies it in IDMA system.The covariance matrix is used as a fitness function, and the optimum interleavers are computed by particle swarm algorithm.The simulation results show that the proposed algorithm has better performance than un-random inter-leavers,independent and random interleavers and evolutionary interleavers
声明:本文内容及配图由入驻作者撰写或者入驻合作网站授权转载。文章观点仅代表作者本人,不代表电子发烧友网立场。文章及其配图仅供工程师学习之用,如有内容侵权或者其他违规问题,请联系本站处理。 举报投诉