By Topic

A dedicated high-level language for implementing nonrecursive filter banks and transforms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Parfieniuk, M. ; Dept. of Real-Time Syst., Bialystok Univ. of Technol., Bialystok, Poland

This paper presents a novel approach to implementing nonrecursive filter banks and transforms. A dedicated high-level language has been developed for describing such systems more clearly, compactly, and quickly than using both MATLAB/Simulink and SPL, the known tools of this sort. Its syntax is aimed at tightly connecting code to the signal flow graph of a transform and at allowing algorithms to be expressed in terms of elementary transformations: plane rotations, reflections, lifting steps, delays, etc. These have been achieved by defining the language expression as the specification of both transformation and data flow branches it acts on. Unlike the mentioned platforms, our approach prevents excessive use of matrix notation, which, however, is supported in a MATLAB-like style. Given a description, the associated code generator produces quite efficient Java, C++, or C routines, which are useful in rapid prototyping applications based on subband processing of signals and in transform optimization.

Published in:

Mixed Design of Integrated Circuits and Systems (MIXDES), 2010 Proceedings of the 17th International Conference

Date of Conference:

24-26 June 2010