箱约束最小二乘问题的列重排
Column Reordering for Box-Constrained Integer Least Squares Problems
摘要:
盒子约束整数最小二乘问题(BILS)是MIMO无线通信应用中的一个重要问题。通常,使用球形解码算法(树搜索算法)来解决该问题。为了使搜索算法更有效,必须对BILS问题中的信道矩阵的列进行重新排序。据我们所知,目前有两种列重新排序算法提供了最好的已知结果。两者都使用所有可用的信息,但它们分别来自几何和代数的观点,看起来不同。在本文中,我们修改一个,使其计算效率更高,更容易理解。然后我们证明了修改后的一个和另一个在理论上实际上给出了相同的列重排。最后,我们提出了一个新的数学等价算法,这是更计算效率,仍然是容易理解的。
英文摘要:
The box-constrained integer least squares problem (BILS) arises in MIMO wireless communications applications. Typically a sphere decoding algorithm (a tree search algorithm) is used to solve the problem. In order to make the search algorithm more efficient, the columns of the channel matrix in the BILS problem have to be reordered. To our knowledge, there are currently two algorithms for column reordering that provide the best known results. Both use all available information, but they were derived respectively from geometric and algebraic points of view and look different. In this paper we modify one to make it more computationally efficient and easier to comprehend. Then we prove the modified one and the other actually give the same column reordering in theory. Finally we propose a new mathematically equivalent algorithm, which is more computationally efficient and is still easy to understand.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。