Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Generalised lapped orthogonal transforms

Generalised lapped orthogonal transforms

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A class of linear-phase paraunitary filter banks is developed, possessing fast implementation algorithms based on the discrete cosine transform. In this formulation, the lapped orthogonal transform is a particular case which was extended to accommodate the overlap of any number of blocks. Optimised design examples are presented.

References

    1. 1)
      • P.P. Vaidyanathan . (1993) Multirate systems and filterbanks.
    2. 2)
      • H.S. Malvar , D.H. Staelin . The LOT: Transform coding without blocking effects. IEEE Trans. , 553 - 559
    3. 3)
      • K.R. Rao , P. Yip . (1990) Discrete cosine transform: Algorithms, advantages, applications.
    4. 4)
      • H. Malvar . (1992) Signal processing with lapped transforms.
    5. 5)
      • Soman, A.K., Vaidyanathan, P.P., Nguyen, T.Q.: `Linear-phase orthonormal filter banks', Proc. IEEE Int. Conf. on Acoust., Speech, Signal Processing, April 1993, III, Minneapolis, MN, p. 209–212.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19940078
Loading

Related content

content/journals/10.1049/el_19940078
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address