Adaptive asymptotic Bayesian equalization using a signal space partitioning technique

Ren Jr Chen*, Wen-Rong Wu

*此作品的通信作者

研究成果: Article同行評審

6 引文 斯高帕斯(Scopus)

摘要

The Bayesian solution is known to be optimal for symbol-by-symbol equalizers: however, its computational complexity is usually very high. The signal space partitioning technique has been proposed to reduce complexity. It was shown that the decision boundary of the equalizer consists of a set of hyperplanes. The disadvantage of existing approaches is that the number of hyperplanes cannot be controlled. In addition, a state-search process, that is not efficient for time-varying channels, is required to find these hyperplanes. In this paper, we propose a new algorithm to remedy these problems. We propose an approximate Bayesian criterion that allows the number of hyperplanes to be arbitrarily set. As a consequence, a tradeoff can be made between performance and computational complexity. In many cases, the resulting performance loss is small, whereas the computational complexity reduction can be large. The proposed equalizer consists of a set of parallel linear discriminant functions and a maximum operation. An adaptive method using stochastic gradient descent has been developed to identify the functions. The proposed algorithm is thus inherently applicable to time-varying channels. The computational complexity of this adaptive algorithm is low and suitable for real-world implementation.

原文English
文章編號1284835
頁(從 - 到)1376-1386
頁數11
期刊IEEE Transactions on Signal Processing
52
發行號5
DOIs
出版狀態Published - 1 5月 2004

指紋

深入研究「Adaptive asymptotic Bayesian equalization using a signal space partitioning technique」主題。共同形成了獨特的指紋。

引用此