...
首页> 外文期刊>International Journal of Wireless & Mobile Networks >Modified LLL Algorithm with Shifted Start Column for Complexity Reduction
【24h】

Modified LLL Algorithm with Shifted Start Column for Complexity Reduction

机译:改进的带有移位起始列的LLL算法以降低复杂度

获取原文

摘要

Multiple-input multiple-output (MIMO) systems are playing an important role in the recent wirelesscommunication. The complexity of the different systems models challenge different researches to get a goodcomplexity to performance balance. Lattices Reduction Techniques and Lenstra-Lenstra-Lovàsz (LLL)algorithm bring more resources to investigate and can contribute to the complexity reduction purposes.In this paper, we are looking to modify the LLL algorithm to reduce the computation operations byexploiting the structure of the upper triangular matrix without “big” performance degradation. Basically,the first columns of the upper triangular matrix contain many zeroes, so the algorithm will perform severaloperations with very limited income. We are presenting a performance and complexity study and ourproposal show that we can gain in term of complexity while the performance results remains almost thesame.
机译:多输入多输出(MIMO)系统在最近的无线通信中起着重要的作用。不同系统模型的复杂性对不同的研究提出了挑战,以使性能平衡具有良好的复杂性。网格减少技术和Lenstra-Lenstra-Lovàsz(LLL)算法带来了更多资源进行研究,并且可以为降低复杂度做出贡献。本文旨在通过利用上层结构来修改LLL算法以减少计算量三角矩阵而不会“大幅”降低性能。基本上,上三角矩阵的第一列包含许多零,因此该算法将执行非常有限的收益的几种运算。我们正在进行一项性能和复杂性研究,我们的建议显示,我们可以在复杂性方面有所收获,而性能结果几乎保持不变。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号