起始列移位的改进LLL算法
Modified LLL algorithm with shifted start column
摘要：
多输入多输出（MIMO）系统在当前的无线通信中扮演着重要的角色。不同的系统模型的复杂性对不同的研究提出了挑战，以获得良好的复杂性和性能平衡。格约简技术和Lenstra-Lenstra-Lovasz（LLL）算法带来了更多的研究资源，有助于降低复杂度。在本文中，我们正在寻找修改的LLL算法，以减少计算操作，利用上三角矩阵的结构，而没有大的性能下降。基本上，上三角矩阵的第一列包含许多零，因此该算法将执行几个操作，收入非常有限。我们提出了一个性能和复杂性的研究，我们的建议表明，我们可以获得在复杂性方面，而性能结果几乎保持不变。
英文摘要：
Multiple-input multiple-output (MIMO) systems are playing an important role in the recent wireless communication. The complexity of the different systems models challenge different researches to get a good complexity to performance balance. Lattices Reduction Techniques and Lenstra-Lenstra-Lovasz (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 by exploiting 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 several operations with very limited income. We are presenting a performance and complexity study and our proposal show that we can gain in term of complexity while the performance results remains almost the same.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
