dc.contributor.author | Llorens, A. J. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.contributor.author | Ni, H. C. | en |
dc.creator | Llorens, A. J. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.creator | Ni, H. C. | en |
dc.date.accessioned | 2019-04-08T07:47:01Z | |
dc.date.available | 2019-04-08T07:47:01Z | |
dc.date.issued | 2005 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/44114 | |
dc.description.abstract | In this paper, we present computationally efficient algorithms for obtaining a particular class of optimal quantized representations of finite-impulse response (FIR) filters. We consider a scenario where each quantization level is associated with a certain integer cost and, given an FIR filter with real coefficients, our goal is to find the quantized representation that minimizes a certain error criterion under a constraint on the total cost of all quantization levels used to represent the filter coefficients. We first formulate the problem as a constrained shortest path problem and discuss how an efficient dynamic programming algorithm can be used to obtain the optimal quantized representation for arbitrary quantization sets. We then develop a greedy algorithm which has even lower computational complexity and is shown to be optimal when the quantization levels and their associated costs satisfy a certain, easily checkable criterion. For the special case of the quantization set that involves levels that are sums of signed powers-of-two and whose cost is captured by the number of powers of two used in their representation, the total integer cost relates to the cost of the very large-scale integration implementation of the given FIR filter and our analysis clarifies the optimality of previously proposed algorithms in this setting. © 2005, The Institute of Electrical and Electronics Engineers, Inc. All rights reserved. | en |
dc.source | IEEE Transactions on Circuits and Systems II: Express Briefs | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-26844531248&doi=10.1109%2fTCSII.2005.850786&partnerID=40&md5=b42913720bb7b4609cf16d6377a7cc9f | |
dc.subject | Dynamic programming | en |
dc.subject | Integer programming | en |
dc.subject | Computational complexity | en |
dc.subject | Constraint theory | en |
dc.subject | Fir filters | en |
dc.subject | Coefficient quantization | en |
dc.subject | Finite-impulse response (fir) filter design | en |
dc.subject | Optimal greedy algorithm | en |
dc.subject | Powers-of-two coefficients | en |
dc.title | Quantization of FIR Filters Under a Total Integer Cost Constraint | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/TCSII.2005.850786 | |
dc.description.volume | 52 | |
dc.description.issue | 9 | |
dc.description.startingpage | 576 | |
dc.description.endingpage | 580 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Article | en |
dc.source.abbreviation | IEEE Trans.Circuits Syst.Express Briefs | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |