분산 추정을 위한 아크탄젠트 기반의 Diffusion NLMS 알고리즘
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 남상원 | - |
dc.contributor.author | 김진 | - |
dc.contributor.author | 박종훈 | - |
dc.date.accessioned | 2021-07-30T05:17:18Z | - |
dc.date.available | 2021-07-30T05:17:18Z | - |
dc.date.created | 2021-05-14 | - |
dc.date.issued | 2017-11 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/3978 | - |
dc.description.abstract | Popular diffusion adaptive filter algorithms based on mean-square can not be robust in impulsive noise environments. To overcome such difficulty, a arctangent-cost-function based diffusion NLMS is proposed in this paper. The proposed algorithm can be approximated by the NLMS algorithm in case of no impulsive noise or by zero update when the impulsive interference occurs. Finally, it is demonstrated through system identification simulations that the proposed algorithm yields better MDS performance rather than other diffusion based adaptive filtering algorithms. | - |
dc.language | 한국어 | - |
dc.language.iso | ko | - |
dc.publisher | 대한전자공학회 | - |
dc.title | 분산 추정을 위한 아크탄젠트 기반의 Diffusion NLMS 알고리즘 | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 남상원 | - |
dc.identifier.bibliographicCitation | 대한전자공학회 학술대회, pp.491 - 493 | - |
dc.relation.isPartOf | 대한전자공학회 학술대회 | - |
dc.citation.title | 대한전자공학회 학술대회 | - |
dc.citation.startPage | 491 | - |
dc.citation.endPage | 493 | - |
dc.type.rims | ART | - |
dc.type.docType | Proceeding | - |
dc.description.journalClass | 3 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | other | - |
dc.identifier.url | http://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE07276353 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.