Fast algorithms for computation of 5-point dct-ii, dct-iv,...

G - Physics – 10 – L

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G10L 19/02 (2006.01) G06F 17/14 (2006.01)

Patent

CA 2706283

A more efficient encoder/decoder is provided in which an N-point MDCT transform is mapped into smaller sized N/2-point DCT-IV, DST-IV and/or DCT-II transforms. The MDCT may be systematically decimated by factor of 2 by utilizing a uniformly scaled 5-point DCT-II core function as opposed to the DCT-IV or EFT cores used in many existing MDCT designs in audio codecs. Various transform factorizations of the 5-point transforms may be implemented to more efficiently implement a transform.

L'invention concerne un codeur / décodeur de rendement amélioré, dans lequel une transformée MDCT sur N points est interpolée pour donner des transformées DCT-IV, DST-IV et / ou DCT-II de plus petites dimensions sur N/2 points. La MDCT peut être systématiquement décimée d'un facteur 2 en utilisant une fonction de noyau DCT-II sur 5 points à facteur d'échelle uniforme, par opposition aux noyaux DCT-IV ou FFT utilisés dans de nombreux modèles existants de MDCT dans les codecs audio. Diverses factorisations des transformées sur 5 points peuvent être mises en uvre pour obtenir une transformée avec un meilleur rendement.

LandOfFree

Say what you really think

Search LandOfFree.com for Canadian inventors and patents. Rate them and share your experience with other people.

Rating

Fast algorithms for computation of 5-point dct-ii, dct-iv,... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast algorithms for computation of 5-point dct-ii, dct-iv,..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast algorithms for computation of 5-point dct-ii, dct-iv,... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFCA-PAI-O-1455159

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.