首页> 外文期刊>International Journal of Computer Networks & Communications >Performance and Complexity Analysis of a Reduced Iterations LLL Algorithm
【24h】

Performance and Complexity Analysis of a Reduced Iterations LLL Algorithm

机译:简化迭代LLL算法的性能和复杂性分析

获取原文
           

摘要

Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recentwireless communication. The complexity and the performance of the systems are driving the differentstudies and researches. Lattices Reduction techniques bring more resources to investigate the complexityand performances of such systems.In this paper, we look to modify a fixed complexity verity of the LLL algorithm to reduce the computationoperations by reducing the number of iterations without important performance degradation. Our proposalshows that we can achieve a good performance results while avoiding extra iteration that doesn’t bringmuch performance.
机译:在最近的无线通信中,多输入多输出(MIMO)系统正在发挥越来越重要的作用。系统的复杂性和性能正在推动着不同的研究和研究。网格减少技术为研究此类系统的复杂性和性能带来了更多资源。本文旨在修改LLL算法的固定复杂度,以通过减少迭代次数而不会降低性能,而不会降低性能。我们的建议表明,我们可以取得良好的效果,同时避免不必要的重复迭代,而不会带来太多性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号