Conjugate Gradient Algorithm for Block FIR Adaptive Filtering
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | J.S Lim | ko |
| dc.contributor.author | C.K.Un | ko |
| dc.date.accessioned | 2013-02-25T03:49:46Z | - |
| dc.date.available | 2013-02-25T03:49:46Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1993-03 | - |
| dc.identifier.citation | ELECTRONICS LETTERS, v.29, no.5, pp.428 - 429 | - |
| dc.identifier.issn | 0013-5194 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/59628 | - |
| dc.description.abstract | A fast block adaptive filter based on the conjugate gradient method is presented. The block conjugate gradient algorithm (BCGA) is derived by minimising the block mean-square error (BMSE) and generating the conjugate gradient vectors. Compared with the optimum block algorithm (OBA), this new algorithm has superior convergence properties under any input conditions. | - |
| dc.language | English | - |
| dc.publisher | Inst Engineering Technology-Iet | - |
| dc.title | Conjugate Gradient Algorithm for Block FIR Adaptive Filtering | - |
| dc.type | Article | - |
| dc.identifier.wosid | A1993LB76700003 | - |
| dc.identifier.scopusid | 2-s2.0-0027908394 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 29 | - |
| dc.citation.issue | 5 | - |
| dc.citation.beginningpage | 428 | - |
| dc.citation.endingpage | 429 | - |
| dc.citation.publicationname | ELECTRONICS LETTERS | - |
| dc.contributor.localauthor | C.K.Un | - |
| dc.contributor.nonIdAuthor | J.S Lim | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | ADAPTIVE FILTERS | - |
| dc.subject.keywordAuthor | ALGORITHMS | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 4 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.