发明名称 LOWER COMPLEXITY COMPUTATION OF LATTICE REDUCTION
摘要 <p>A signal vector is received over a plurality of channels. A channel matrix H is determined that represents at least one of the plurality of channels. An iterative algorithm such as Lenstra-Lenstra-Lovasz is used to determining a change of basis matrix T that when multiplied with the channel matrix H converges to a matrix H*T that is more orthogonal than the channel matrix H. In one aspect the iterative algorithm is upwardly bounded in the number of iterations (e.g., 20 or 30 iterations) that it may perform for any specific channel realization to determine the change of basis matrix T. In another aspect the algorithm is initiated with a matrix derived from a previously determined change of basis matrix. Both aspects may be combined in a single method or device, or either employed separately.</p>
申请公布号 WO2007135520(A2) 申请公布日期 2007.11.29
申请号 WO2007IB01275 申请日期 2007.05.16
申请人 NOKIA CORPORATION;NOKIA, INC.;HEISKALA, JUHA 发明人 HEISKALA, JUHA
分类号 主分类号
代理机构 代理人
主权项
地址