By Topic

New Recursive Fast Radix-2 Algorithm for the Modulated Complex Lapped Transform

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)
Britanak, V. ; Inst. of Inf., Bratislava, Slovakia

A new recursive fast radix-2 algorithm for an efficient computation of the modulated complex lapped transform (MCLT) is presented. Based on a new proposed alternative recursive sparse matrix factorization for the MDCT (modified discrete cosine transform) matrix and a relation between the MDCT and the MDST (modified discrete sine transform), firstly a new recursive fast radix-2 MDST algorithm is derived. The corresponding fast MDCT and MDST computational structures are regular and complementary to each other. Consequently, this fact enables us by their composition to construct a fast MCLT computational structure representing the fast recursive radix-2 MCLT algorithm. The fast MCLT computational structure is regular and all its stages may be realized in parallel. Combining the proposed fast radix-2 MCLT algorithm with an existing generalized fast mixed-radix MDCT algorithm defined for the composite lengths N = 2 × qm, m ≥ 2, where q is an odd positive integer, we can compute the MCLT for the composite lengths N = 2n × qm, n, m ≥ 2, thus supporting a wider range of transform sizes compared to existing fast MCLT algorithms.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 12 )