DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bang, Seung Chan | ko |
dc.contributor.author | Ann, Souguil | ko |
dc.contributor.author | Song, Iickho | ko |
dc.date.accessioned | 2007-07-24T09:33:17Z | - |
dc.date.available | 2007-07-24T09:33:17Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1994-12 | - |
dc.identifier.citation | IEEE SIGNAL PROCESSING LETTERS, v.1, no.12, pp.196 - 198 | - |
dc.identifier.issn | 1070-9908 | - |
dc.identifier.uri | http://hdl.handle.net/10203/861 | - |
dc.description.abstract | In the previous analysis of the dual sign algorithm (DSA), Gaussian signals were assumed. When the desired response contains additive impulsive interference, however, the analysis seems to be inadequate. In this letter, performance analysis of the DSA is considered when the signals are zero-mean stationary Gaussian, and the additive noise of the desired response is zero-mean stationary contaminated-Gaussian (CG). Through computer simulations, our analysis is validated. It is also shown that the DSA is less vulnerable to impulsive interference than the least-mean square (LMS) algorithm. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Performance Analysis of the Dual Sign Algorithm for Additive Contaminated-Gaussian Noise | - |
dc.type | Article | - |
dc.identifier.wosid | 000207086400005 | - |
dc.identifier.scopusid | 2-s2.0-0028752098 | - |
dc.type.rims | ART | - |
dc.citation.volume | 1 | - |
dc.citation.issue | 12 | - |
dc.citation.beginningpage | 196 | - |
dc.citation.endingpage | 198 | - |
dc.citation.publicationname | IEEE SIGNAL PROCESSING LETTERS | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Song, Iickho | - |
dc.contributor.nonIdAuthor | Bang, Seung Chan | - |
dc.contributor.nonIdAuthor | Ann, Souguil | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.