Blind signal processing algorithms based on recursive gradient estimation

초록

Blind algorithms based on the Euclidean distance (ED) between the output distribution function and a set of Dirac delta functions have a heavy computational burden of O(NM) due to some double summation operations for the sample size N and M symbol points. In this paper, a recursive approach to the estimation of the ED and its gradient is proposed to reduce the computational complexity for efficient implementation of the algorithm. The ED of the algorithm is comprised of information potentials (IPs), and the IPs at the next iteration can be calculated recursively based on the currently obtained IPs. Utilizing the recursively estimated IPs, the next step gradient for the weight update of the algorithm can be estimated recursively with the present gradient. With this recursive approach, the computational complexity of gradient calculation has only O(N). The simulation results show that the proposed gradient estimation method holds significantly reduced computational complexity keeping the same performance as the block processing method. © © 2015 Institute of Advanced Engineering and Science. All rights reserved.

키워드