Please use this identifier to cite or link to this item: https://doi.org/10.1109/ISCAS.2008.4541948
DC FieldValue
dc.titleComplexity reduction for frequency-response masking filters using serial masking
dc.contributor.authorWei, Y.
dc.contributor.authorLian, Y.
dc.date.accessioned2014-06-19T03:03:16Z
dc.date.available2014-06-19T03:03:16Z
dc.date.issued2008
dc.identifier.citationWei, 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.isbn9781424416844
dc.identifier.issn02714310
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/69665
dc.description.abstractIn 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.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/ISCAS.2008.4541948
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/ISCAS.2008.4541948
dc.description.sourcetitleProceedings - IEEE International Symposium on Circuits and Systems
dc.description.page2438-2441
dc.description.codenPICSD
dc.identifier.isiut000258532102071
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.