RBF growing algorithm applied to the equalization and co-channel interference rejection problem

Recently the RBF network has been successfully applied to a number of communication signal processing problems, including equalization and co-channel interference rejection. Determining the number and locations of the centers is an important but usually neglected issue. A growing RBF algorithm for determining the number and location of the centers is presented and the performance is compared to a RBF with prescribed centers. The growing algorithm's advantages are its limited need for prior information and its ability to better utilize the allocated centers. As an example, the growing algorithm reduced the number of centers by more than a factor of 2/sup 31/ over the prescribed method to achieve a desired performance for an equalization and interference rejection application.<
>