Reduced Complexity MIMO MMSE-DFE

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-12-01 DOI:10.1109/ACSSC.2005.1599869

Wen-Chih Kan, G. Sobelman

引用次数: 1

Abstract

We present a reduced complexity MIMO MMSE-DFE coefficient computation algorithm which is based on an improvement to the fast block algorithm developed in N. Al-Dhahir and A.H. Sayed (2000). We have achieved a nearly 50% reduction in complexity by eliminating the computation of unnecessary terms. The effects due to finite precision arithmetic on SNR are also considered and a minimum fixed-point word length of 32 bits results in no noticeable performance loss. Hardware implementation issues depend on several factors and these are also discussed

查看原文本刊更多论文

减少复杂性MIMO MMSE-DFE

我们提出了一种降低复杂性的MIMO MMSE-DFE系数计算算法，该算法基于对N. Al-Dhahir和A.H. Sayed(2000)开发的快速块算法的改进。通过消除不必要项的计算，我们已经将复杂性降低了近50%。考虑了有限精度算法对信噪比的影响，最小定点字长为32位不会导致明显的性能损失。硬件实现问题取决于几个因素，并对这些因素进行了讨论

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.

自引率

0.00%

发文量