liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Implementation of low complexity FIR filters using a minimum spanning tree
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-3470-3911
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.
2004 (English)In: Proceedings of the 12th IEEE Mediterranean Electrotechnical Conference, 2004. MELECON 2004, Volume 1, IEEE , 2004, 261-264 p.Conference paper, Published paper (Other academic)
Abstract [en]

In this paper we propose a method for implementation of multiple constant multiplications, as used in, for example, FIR filters. The method is shifted difference coefficient method where the differences are selected using a minimum spanning tree. By finding a minimum spanning tree of an undirected graph, corresponding to the coefficients, an implementation of a multiple constant multiplication block with low arithmetic complexity is obtained. There are algorithms that find a minimum spanning tree in polynomial time, making the proposed method computational efficient. We also propose that the differences are computed on odd coefficients only. This reduces the number of adders in an implementation further, compared to other difference coefficient methods. Several stages of differences, i.e., a set of differences is used to compute a new set of higher order differences, may also be used. We show that the proposed method give optimal, or close to optimal, results with respect to the number of additions required for a number of FIR filter implementations.

Place, publisher, year, edition, pages
IEEE , 2004. 261-264 p.
Keyword [en]
Implementation FIR filters
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-23672DOI: 10.1109/MELCON.2004.1346826Local ID: 3167ISBN: 0-7803-8271-4 (print)OAI: oai:DiVA.org:liu-23672DiVA: diva2:243987
Conference
The 12th IEEE Mediterranean Electrotechnical Conference, 2004, May 12-15, 2004, Dubrovnik, Croatia
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2015-03-11Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textLink to full text

Authority records BETA

Ohlsson, HenrikGustafsson, OscarWanhammar, Lars

Search in DiVA

By author/editor
Ohlsson, HenrikGustafsson, OscarWanhammar, Lars
By organisation
Electronics SystemThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 266 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf