Efficient Adaptive Algorithms Based on Zero-Error Probability Maximization 


Vol. 39,  No. 5, pp. 237-243, May  2014


PDF
  Abstract

In this paper, a calculation-efficient method for weight update in the algorithm based on maximization of the zero-error probability (MZEP) is proposed. This method is to utilize the current slope value in calculation of the next slope value, replacing the block processing that requires a summation operation in a sample time period. The simulation results shows that the proposed method yields the same performance as the original MZEP algorithm while significantly reducing the computational time and complexity with no need for a buffer for error samples. Also the proposed algorithm produces faster convergence speed than the algorithm that is based on the error-entropy minimization.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

N. Kim, "Efficient Adaptive Algorithms Based on Zero-Error Probability Maximization," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 5, pp. 237-243, 2014. DOI: .

[ACM Style]

Namyong Kim. 2014. Efficient Adaptive Algorithms Based on Zero-Error Probability Maximization. The Journal of Korean Institute of Communications and Information Sciences, 39, 5, (2014), 237-243. DOI: .

[KICS Style]

Namyong Kim, "Efficient Adaptive Algorithms Based on Zero-Error Probability Maximization," The Journal of Korean Institute of Communications and Information Sciences, vol. 39, no. 5, pp. 237-243, 5. 2014.