By Topic

SVD-based design and new structures for variable fractional-delay digital filters

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

2 Author(s)
Tian-Bo Deng ; Dept. of Inf. Sci., Toho Univ., Japan ; Nakagawa, Y.

This paper shows that the problem of designing one-dimensional (1-D) variable fractional-delay (VFD) digital filter can be elegantly reduced to the easier subproblems that involve one-dimensional (1-D) constant filter (subfilter) designs and 1-D polynomial approximations. By utilizing the singular value decomposition (SVD) of the variable design specification, we prove that both 1-D constant filters and 1-D polynomials possess either symmetry or anti-symmetry simultaneously. Therefore, a VFD filter can be efficiently obtained by designing 1-D constant filters with symmetrical or antisymmetrical coefficients and performing 1-D symmetrical or antisymmetrical approximations. To perform the weighted-least-squares (WLS) VFD filter design, a new WLS-SVD method is also developed. Moreover, an objective criterion is proposed for selecting appropriate subfilter orders and polynomial degrees. Our computer simulations have shown that the SVD-based design and WLS-SVD design can achieve much higher design accuracy with significantly reduced filter, complexity than the existing WLS design method. Another important part of the paper proposes two new structures for efficiently implementing the resulting VFD filter, which require less computational complexity than the so-called Farrow structure.

Published in:

Signal Processing, IEEE Transactions on  (Volume:52 ,  Issue: 9 )