similar to: Butterflies in mdct.c

I took function mdct_butterfly_8 and write out transformation matrix. Then I rewrote this matrix into sequence of additions and substractions (see attachement). As I suspected I got the same as in the original code but I swaped some rows to get little higher speed. I hope I'll do the same with 16 point butterfly function combined with 8 point butterflies in a month. Who still believe that this

I did composition of butterfly8 and butterfly16 and I found, that these functions are well decomposed - decomposition doesn't lower computional speed. On the other hand the same can be done with butterfly8 - decomposition to butterfly4 (further decomposition is not possible) but there's no reason to do this. I think little improvement can be done by inlining them. Compiler and processor

libvorbis does not currently have any simd/vectorization. Following patches add generic framework for simd/vectorization and on top, add ARM-NEON simd vectorization using intrinsics. I was able to get over 34% performance improvement on my Beaglebone Black which is single Cortex-A8 based CPU. You can find more information on metrics and procedure I used to measure at

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 Experts, Can anybody please direct me to proper MDCT theory reference which will help me understand the code better? I'm trying to optimize MDCT for a embedded platform. So need good understanding about theory behind & implementation. Thanks in advance for your time. Warm Regards, Mahantesh -------------- next part -------------- An HTML attachment was scrubbed... URL:

Hi, Can someone tell me which MDCT and invMDCT equation uses? I implemented the invMDCT one given in eusipco.corrected.ps file (handed out by Monty way back) and it produces different time domain samples. I tried both the FFT method and the slow way directly from the equation and couldn't reproduce the results from the original code. This leads me to believe that the forward MDCT used in

Hi vorbis-dev! I'm working with Pattara in the oggonachip project, and wondering about the implementation of mdct.c as hardware. According your recomendations about using the floating point version, I would say, we have to implement the integerized version of mdct as a core, and use the fpu only to round the input values. By doing that, you think the result would be still acceptable? How

Hi, as we are trying to implement MDCT in hardware, we are caring now about the "n" (size of input and output vectors to and from MDCT). As I have looked in the code, this "n" is chosen from the Ogg/Vorbis stream data in info.c:_vorbis_unpack_info() which means this "n" can vary aribitrarily (as the power of 2) depending only on the value got from song data? or is

Hello I have a table describing butterfly range traits. It is composed of three columns as below Species name range size (X) latitude of range midpoint (Y) There are 11 kinds of butterflies. Each has its range size, and the latitude of each range midpoint ranges from 9 to 19. I would like to have the average range size of every degree of latitude. For example, the average range

Sorry for starting another topic, this is actually a reply to Segher's post on Sun Oct 22 on the 'mdct question' topic. I wasn't subscribed properly and so I didn't get email confirmation and thus can't add to that thread. So Segher, if the equation is indeed what you say it is, then replacing mdct_backward with this version should work, but it doesn't. Am I applying

Hi, I'm trying to determine how the frequency data that is passed to the MDCT, and output time domain data obtained from the MDCT, is changed when setting #define MDCT_INTEGERIZED For instance, the trig array, for a size 256 window begins 1.000000 0.000000 0.998795 -0.049068 0.995185 -0.098017 if INTEGERIZED is set, then it begins 16384 0 16364 -803 16305 -1605 which is simply a left shift

Hello I have a table describing butterfly range traits. It is composed of three columns as below Species name range size (X) latitude of range midpoint (Y) There are 11 kinds of butterflies. Each has its range size, and the latitude of each range midpoint ranges from 9 to 19. I would like to have the average range size of every degree of latitude. For example, the average range

Hi, I have a doubt regarding MDCT window size for OggVorbis decoder. Can the MDCT window size vary from 64 samples to 8192 samples? Specification says that "legal frame sizes are powers of two from 64 to 8192 samples" . Is this same as MDCT window size? Please help me out.. Regards, shikha <p>--- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage:

The Vorbis audio format, uses something called the Modified Discrete Cosine Transform (MDCT). I was interested in how this worked, but did not know where to start. Is this the name of a particular algorithm, or does it just mean something like a cosine transform, but not quite right? So I asked the Vorbis mailing list. Nobody answered. It was not a high priority, so I did other things for

Hi vorbis-dev, I'm investigating the mdct* function in libvorbis and writing a small client program to test it. I found that I have to set ARRAYSIZE when mdct_init(lookup, ARRAYSIZE) to minimum value of 62 otherwise it will segfault with mdct_backward. Is there any lower limit or it is more likely that my code has bug? Thank you very much, Pattara -- Please avoid sending me Word or

In vorbis/lib/mdct.h the following are defined: for integer: #define TRIGBITS 14 #define cPI3_8 6270 #define cPI2_8 11585 #define cPI1_8 15137 #define FLOAT_CONV(x) ((int)((x)*(1<<TRIGBITS)+.5)) for floats: #define cPI3_8 .38268343236508977175F #define cPI2_8 .70710678118654752441F #define cPI1_8 .92387953251128675613F #define FLOAT_CONV(x) = x Could someone explain where these values

Hello Vorbis folks, I'm one of the FFTW authors (www.fftw.org), and a few days ago I was playing with our codelet generator for fun and modified it to spit out hard-coded MDCTs of small sizes. The code (at jdj.mit.edu/~stevenj/mdct_128nr.c) for 256 samples (128 outputs) seems to be almost twice as fast as the Vorbis MDCT code for that size on my 2.2GHz P-IV (gcc 3.2.2 and flags "-O1

Hello One of my packages, untb_1.3-2, passes R CMD check under MacOSX (and apparently the systems used in the package check summary page on CRAN) but fails with the following message on R-2.6.0.tgz compiled last night on my (home) linux box. I hasten to add that I have never seen this error before on home-compiled pre-releases of R-2.6.0. Can anyone help me understand what is going on?

for months, we keep fighting issues with smbd (now at released 2.2.6), config is with spoolss, domain logon, and the client in question is an NT4 machine. server is a i386/linux 2.2.19 For a very long time, we thought it was related to oplocks, but now after having them disabled, it still is there. Level 3 Log is as follows: [2002/10/22 17:08:18, 3] smbd/ipc.c:reply_trans(480) trans

Hello all, A colleague at work set me the challenge to convert some MATLAB code into R, to see which is faster. We'd seen that benchmark comparing MATLAB 6.5 to R1.90 (and others), and so I thought that I should be able to get roughly comparable speeds. The code has lots of multiplications of matrixes, transposes, and MATLAB's "repmat". I did the code conversion, and R was about