.png){kind=icon}
返回
Extended LLL Algorithm for Efficient Signal Precoding in Multiuser Communication Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2010.03.092235.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The lattice reduction method proposed by Lenstra, Lenstra and Lovasz (LLL algorithm) is extensively employed to perform precoding in multiuser downlink communications and also to improve suboptimal detectors in MIMO point-to-point systems. Existing implementations of this algorithm provide as an output a matrix that contains the transformations to be done over the initial channel matrix in order to get a transformed matrix with less correlated columns. However, there are some specific applications where the inverse of this transformation matrix is also required, and this must be calculated after the LLL algorithm. In this work we propose an efficient way to calculate the inverse of the transformation matrix inside the LLL algorithm to avoid the necessity of a matrix inversion, reducing in this way the computational cost.
Keyword:
Lattice reduction
vector precoding
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容