An Evolving Update Interval Algorithm for The Optimal Step-size Affine Projection Algorithm
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 송주만 | - |
dc.contributor.author | 이석영 | - |
dc.contributor.author | 최현택 | - |
dc.contributor.author | 박부견 | - |
dc.date.accessioned | 2021-12-08T16:42:39Z | - |
dc.date.available | 2021-12-08T16:42:39Z | - |
dc.date.issued | 20131112 | - |
dc.identifier.uri | https://www.kriso.re.kr/sciwatch/handle/2021.sw.kriso/4745 | - |
dc.description.abstract | This paper introduces an evolving update interval algorithm for the optimal step-size affine projection algorithm. The optimal step-size affine projection algorithm is one of numerous approaches to get better performance for the affine projection algorithm. It is suggested by analyzing the mean square deviation of fixed step-size affine projection algorithm. With the optimal step-size affine projection algorithm, in this paper, by evolving the update interval, it is able to show much better performance. From the MSD analysis, the learning curve is dived into two stage: the transient stage and the steady-state. By finding the cross point of affine projection algorithm’s learning curve, the update interval is modified. By updating the weight vector for updated interval, the proposed algorithm reduces the computational complexity. With the proposed algorithm from simulations, it shows higher convergence rate and lower steady-state error.ection algorithm. It is suggested by analyzing the mean square deviation of fixed step-size affine projection algorithm. With the optimal step-size affine projection algorithm, in this paper, by evolving the update interval, it is able to show much better performance. From the MSD analysis, the learning curve is dived into two stage: the transient stage and the steady-state. By finding the cross point of affine projection algorithm’s learning curve, the update interval is modified. By updating the weight vector for updated interval, the proposed algorithm reduces the computational complexity. With the proposed algorithm from simulations, it shows higher convergence rate and lower steady-state error. | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.title | An Evolving Update Interval Algorithm for The Optimal Step-size Affine Projection Algorithm | - |
dc.title.alternative | An Evolving Update Interval Algorithm for The Optimal Step-size Affine Projection Algorithm | - |
dc.type | Conference | - |
dc.citation.title | ISPACS 2013 | - |
dc.citation.volume | 1 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 131 | - |
dc.citation.endPage | 135 | - |
dc.citation.conferenceName | ISPACS 2013 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(34103) 대전광역시 유성구 유성대로1312번길 32042-866-3114
COPYRIGHT 2021 BY KOREA RESEARCH INSTITUTE OF SHIPS & OCEAN ENGINEERING. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.