A fast clustering algorithm for equalization using RBF networks

The radial basis function (RBF) network has been used in a digital channel´s equalization for its identical structure to the optimal Bayesian Symbol-decision equalizer. The important problem in the equalization using RBF is to find the correct centers. A clustering algorithm has been proposed to find the desired centers. In fact, the problem can be changed to find the center´s element set because of the inter-relation between the center´s elements. A fast clustering algorithm using the inter-relation for RBF network equalization is proposed. The simulation results show its better convergency and less calculation than the traditional clustering algorithm