A novel and efficient solution to block-based joint-detection using approximate Cholesky factorization
A novel and efficient solution to block-based joint-detection using approximate Cholesky factorization
复制标题
使用近似 Cholesky 分解的基于块的联合检测的新颖且有效的解决方案
DOI：
10.1109/pimrc.1998.731413
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
N. W. Anderson
中科院分区：
文献类型：
--
作者：
H. Karimi;N. W. Anderson
尽管迫零块线性均衡器 (ZF-BLE) 代表了应用于 UMTS TD-CDMA 空中接口提案的联合检测问题的入门级解决方案，但在支持长数据序列、多个用户和具有长脉冲响应的信道时，它仍然伴随着令人望而却步的计算复杂性。造成这种计算复杂性的主要原因是需要对稀疏但大的相关矩阵执行 Cholesky 分解。本文提出了一种新技术，该技术利用 Cholesky 因子的伪块托普利茨性质来导出近似三角分解，从而可以显着降低计算复杂性和有限精度效应，而性能却几乎没有下降。该技术同样适用于其他基于块的线性或决策反馈联合检测方案，其操作依赖于 Cholesky 分解。
Despite the fact that the zero-forcing block-linear equalizer (ZF-BLE) represents an entry-level solution to the joint-detection problem as applied to the TD-CDMA air-interface proposal for UMTS, it is nevertheless accompanied by a prohibitive computational complexity when supporting long data sequences, multiple users and channels with long impulse responses. A primary contributor to this computational complexity is the need to perform a Cholesky factorization of a sparse yet large correlation matrix. This paper presents a novel technique which exploits the pseudo block-Toeplitz nature of the Cholesky factor to derive an approximate triangular factorization, thereby allowing significant reductions in computational complexity and finite-precision effects at the expense of little or no degradation in performance. The technique is equally applicable to other block-based linear or decision-feedback joint-detection schemes whose operation relies on the Cholesky factorization.