By Topic

Computational complexity reduction in multi-processor implementation of recursive digital filters by similarity transformation

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
$33 $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

3 Author(s)
K. Negoto ; Dept. of Commun. Eng., Tokai Univ., Japan ; S. Tomiyama ; T. Takebe

Efficient computation method for recursive digital filtering is studied in multi-processor environment. The method reduces computational complexity by applying similarity transformation to the state update matrix in the block state-space representation. In implementing a cascade of 2nd order sections, it is found that the whole system is most advantageous if described as a single stage

Published in:

Circuits and Systems, 1995., Proceedings., Proceedings of the 38th Midwest Symposium on  (Volume:1 )

Date of Conference:

13-16 Aug 1995