search for: aes135_opus_celt

Dear all I'm working on the implementation of the MDCT for the processor ARM-Cortex-M4 I'm trying to replicate the behavior of the MDCT for several overlapped values however I realized that current implementation of the MDCT is very close to the theory only in case in which we have and overlap exactly equal to N/2 where N is the size of the input vector as is shown in the examples for

Dear all, in chapter 2 of http://jmvalin.ca/papers/aes135_opus_celt.pdf it is mentioned, that encoder and decoder has an algorithmic delay of 6.5 ms (lookahead and resampling delay). In Table 54 of https://tools.ietf.org/html/rfc6716 different delays for the resampler of the SILK encoder are given. However, I measure the same round trip delay for opus encoder->...

...rreo.udistrital.edu.co> wrote: > thanks you so much for your answer. > > On Thu, Apr 13, 2017 at 8:59 AM, Jean-Marc Valin <jmvalin at jmvalin.ca> > wrote: > >> Hi Diego, >> >> You might find figure 3 or this paper useful: >> https://jmvalin.ca/papers/aes135_opus_celt.pdf >> >> It shows the MDCT window for a 5 ms frame, but the (non-zero) overlap is >> always 120 samples regarless of the frame size. You can either see it as >> partial overlap, or as a full-overlap with a window that has zeros on >> the sides. >> >> Cheer...