Sciweavers

Share
SCIA
2005
Springer

A Graph Representation of Filter Networks

10 years 8 months ago
A Graph Representation of Filter Networks
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finite impulse response filters. The efficiency is due to the significantly reduced number of multiplications and additions per data sample that is required. The computational gain is dependent on the choice of network structure and the graph representation compactly incorporates the network structure in the design objectives. Consequently the graph representation forms a framework for searching the optimal network structure. It also removes the requirement of a layered structure, at the cost of a less compact representation.
Björn Svensson, Mats T. Andersson, Hans Knuts
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where SCIA
Authors Björn Svensson, Mats T. Andersson, Hans Knutsson
Comments (0)
books