Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ISCAS.2008.4541948
DC Field | Value | |
---|---|---|
dc.title | Complexity reduction for frequency-response masking filters using serial masking | |
dc.contributor.author | Wei, Y. | |
dc.contributor.author | Lian, Y. | |
dc.date.accessioned | 2014-06-19T03:03:16Z | |
dc.date.available | 2014-06-19T03:03:16Z | |
dc.date.issued | 2008 | |
dc.identifier.citation | Wei, Y., Lian, Y. (2008). Complexity reduction for frequency-response masking filters using serial masking. Proceedings - IEEE International Symposium on Circuits and Systems : 2438-2441. ScholarBank@NUS Repository. https://doi.org/10.1109/ISCAS.2008.4541948 | |
dc.identifier.isbn | 9781424416844 | |
dc.identifier.issn | 02714310 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/69665 | |
dc.description.abstract | In this paper, we proposed computationally efficient filter structures based on the frequency response masking (FRM) technique for the synthesis of arbitrary bandwidth sharp FIR filters. A two-step masking approach is introduced in the new structures to further reduce the arithmetic operations in the overall filter compared to original FRM structure. It was shown, by means of examples, that additional 12% to 17% savings in terms of numbers of arithmetic operations are achievable for the new structures. ©2008 IEEE. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISCAS.2008.4541948 | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.doi | 10.1109/ISCAS.2008.4541948 | |
dc.description.sourcetitle | Proceedings - IEEE International Symposium on Circuits and Systems | |
dc.description.page | 2438-2441 | |
dc.description.coden | PICSD | |
dc.identifier.isiut | 000258532102071 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.