Design of finite-word-length FIR filters with least-squares error
| dc.citation.epage | 1596 | en_US |
| dc.citation.issue | 8 | en_US |
| dc.citation.spage | 1591 | en_US |
| dc.citation.volume | 80 | en_US |
| dc.citation.woscount | 3 | |
| dc.contributor.author | Kao, YA | en_US |
| dc.contributor.author | Chen, SG | en_US |
| dc.contributor.department | 電子工程學系及電子研究所 | zh_TW |
| dc.contributor.department | Department of Electronics Engineering and Institute of Electronics | en_US |
| dc.date.accessioned | 2014-12-08T15:44:59Z | |
| dc.date.available | 2014-12-08T15:44:59Z | |
| dc.date.issued | 2000-08-01 | en_US |
| dc.description.abstract | This paper proposes a new algorithm for designing finite word length linear-phase FIR filters. The new algorithm produces finite-precision least-squares error (LSE) solutions with much reduced search time than the brute-force full search algorithm. It is different from the full search algorithm that tries all possible combinations directly. The new algorithm utilizes geometric properties of a hyper-space to pinpoint potential solutions in a much more restricted way. Accordingly, a much smaller search space is generated. (C) 2000 Elsevier Science B.V. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/S0165-1684(00)00058-X | en_US |
| dc.identifier.issn | 0165-1684 | en_US |
| dc.identifier.journal | SIGNAL PROCESSING | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/S0165-1684(00)00058-X | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/30365 | |
| dc.identifier.wosnumber | WOS:000088402700014 | |
| dc.language.iso | en_US | en_US |
| dc.title | Design of finite-word-length FIR filters with least-squares error | en_US |
| dc.type | Article | en_US |