Design of linear phase FIR filters in subexpression space using mixed integer linear programming
In this paper, a novel optimization technique is proposed to optimize filter coefficients of linear phase finite-impulse response (FIR) filter to share common subexpressions within and among coefficients. Existing approaches of common subexpression elimination optimize digital filters in two stages:...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/91421 http://hdl.handle.net/10220/4659 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-91421 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-914212020-03-07T14:02:40Z Design of linear phase FIR filters in subexpression space using mixed integer linear programming Yu, Ya Jun Lim, Yong Ching DRNTU::Engineering::Electrical and electronic engineering In this paper, a novel optimization technique is proposed to optimize filter coefficients of linear phase finite-impulse response (FIR) filter to share common subexpressions within and among coefficients. Existing approaches of common subexpression elimination optimize digital filters in two stages: first, an FIR filter is designed in a discrete space such as finite wordlength space or signed power-of-two (SPT) space to meet a given specification; in the second stage, an optimization algorithm is applied on the discrete coefficients to find and eliminate the common subexpressions. Such a two-stage optimization technique suffers from the problem that the search space in the second stage is limited by the finite wordlength or SPT coefficients obtained in the first stage optimization. The new proposed algorithm overcomes this problem by optimizing the filter coefficients directly in subexpression space for a given specification. Numerical examples of benchmark filters show that the required number of adders obtained using the proposed algorithm is much less than those obtained using two-stage optimization approaches. Published version 2009-06-23T04:25:29Z 2019-12-06T18:05:23Z 2009-06-23T04:25:29Z 2019-12-06T18:05:23Z 2007 2007 Journal Article Yu, Y. J., & Lim. Y. C. (2007). Design of Linear phase FIR filters in subexpression space using mixed integer linear programming. IEEE Transactions on Circuits and Systems-I: Regular Papers. 54 (10), 2330-2338. 1549-8328 https://hdl.handle.net/10356/91421 http://hdl.handle.net/10220/4659 10.1109/TCSI.2007.904599 en IEEE transactions on circuits and systems-I : regular papers © 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site. 9 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Electrical and electronic engineering |
spellingShingle |
DRNTU::Engineering::Electrical and electronic engineering Yu, Ya Jun Lim, Yong Ching Design of linear phase FIR filters in subexpression space using mixed integer linear programming |
description |
In this paper, a novel optimization technique is proposed to optimize filter coefficients of linear phase finite-impulse response (FIR) filter to share common subexpressions within and among coefficients. Existing approaches of common subexpression elimination optimize digital filters in two stages: first, an FIR filter is designed in a discrete space such as finite wordlength space or signed power-of-two (SPT) space to meet a given specification; in the second stage, an optimization algorithm is applied on the discrete coefficients to find and eliminate the common subexpressions. Such a two-stage optimization technique suffers from the problem that the search space in the second stage is limited by the finite wordlength or SPT coefficients obtained in the first stage optimization. The new proposed algorithm overcomes this problem by optimizing the filter coefficients directly in subexpression space for a given specification. Numerical examples of benchmark filters show that the required number of adders obtained using the proposed algorithm is much less than those obtained using two-stage optimization approaches. |
format |
Article |
author |
Yu, Ya Jun Lim, Yong Ching |
author_facet |
Yu, Ya Jun Lim, Yong Ching |
author_sort |
Yu, Ya Jun |
title |
Design of linear phase FIR filters in subexpression space using mixed integer linear programming |
title_short |
Design of linear phase FIR filters in subexpression space using mixed integer linear programming |
title_full |
Design of linear phase FIR filters in subexpression space using mixed integer linear programming |
title_fullStr |
Design of linear phase FIR filters in subexpression space using mixed integer linear programming |
title_full_unstemmed |
Design of linear phase FIR filters in subexpression space using mixed integer linear programming |
title_sort |
design of linear phase fir filters in subexpression space using mixed integer linear programming |
publishDate |
2009 |
url |
https://hdl.handle.net/10356/91421 http://hdl.handle.net/10220/4659 |
_version_ |
1681038081722941440 |