Namyong Kim, Journal of Internet Computing and Services, Vol. 15, No. 5, pp. 17-24, Oct. 2014
10.7472/jksii.2014.15.5.17, Full Text:  HTML
Keywords: constant modulus error, computational complexity, Gradient, Impulsive noise, zero-error probability

Abstract

Blind algorithms designed to maximize the probability that constant modulus errors become zero carry out some summation operations for a set of constant modulus errors at an iteration time inducing heavy complexity. For the purpose of reducing this computational burden induced from the summation, a new approach to the estimation of the zero-error probability (ZEP) of constant modulus errors (CME) and its gradient is proposed in this paper. The ZEP of CME at the next iteration time is shown to be calculated recursively based on the currently calculated ZEP of CME. It also is shown that the gradient for the weight update of the algorithm can be obtained by differentiating the ZEP of CME estimated recursively. From the simulation results that the proposed estimation method of ZEP-CME and its gradient produces exactly the same estimation results with a significantly reduced computational complexity as the block-processing method does.

Statistics
Cite this article