## Abstract

The performance of the adaptive algorithm is mainly evaluated by the following two : 1) the characteristics for the convergence and 2) the reduction of the computational requirements per sample time. The algorithm (*) is composed by the block signal processing and the orthogonal projection as that is relatively satisfied with these requirements. Furthermore, method which convergence speed of the (*) speed up is 'shifting' technique. And, we can consider the adaptive algorithm (**) which can be derived by introducing the 'shifting' technique to the (*). The algorithm (**) has faster convergence speed than that of (*). From the point of view of computational requirements, however, the (**) is inferior to the (*). The purpose of this paper is to present a new adaptive algorithm whose computational requirements are less than that of the algorithm, (**).

Original language | English |
---|---|

Pages (from-to) | 718-721 |

Number of pages | 4 |

Journal | Proceedings - IEEE International Symposium on Circuits and Systems |

Volume | 2 |

Publication status | Published - Jan 1 1996 |

Event | Proceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA Duration: May 12 1996 → May 15 1996 |

## All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering