similar to: faster mdct's

On Tuesday 18 March 2008 20:17:52 Anton Korobeynikov wrote: > Hello, Everyone > > LLVM recently was approved to take part in Google Summer of Code 2008. > We welcome everyone to apply for this program. > > The list of ideas for (possible) projects is located at > http://llvm.org/OpenProjects.html. Surely you can suggest any other > project, if you feel, that it definitely

Hello, I would like to submit two papers that use LLVM to the Related Publications section. Both papers focus on code isolation applied to perform piecewise compiler optimizations. The code isolation process is performed by CERE, an open source tool based on LLVM. The second paper is an extended version of the first one. 1) Piecewise Holistic Autotuning of Compiler and Runtime Parameters

Hello, Everyone LLVM recently was approved to take part in Google Summer of Code 2008. We welcome everyone to apply for this program. The list of ideas for (possible) projects is located at http://llvm.org/OpenProjects.html. Surely you can suggest any other project, if you feel, that it definitely can be useful. Our common requirement for student is to submit proposal to LLVM Developers

Dear Mihail, I've added these two publications to the publications page. Please review it and let me know if I need to make any changes. In particular, if you have URLs to use for the papers, having those would be greatly appreciated. Regards, John Criswell On 11/28/17 12:05 PM, Mihail Popov via llvm-dev wrote: > > Hello, > > I would like to submit two papers that use LLVM

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

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

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

In mdct.c there's some functions including some-point butterfly. In 32-point and 16-point there are calling of smaller-point function everytime twice on each half of data. When I looked on it I found that's just linear algebra. So it can be rewritten to matrix multiplication. Some one can say: there's optimization on in register working. But imagine there's one calling 32-point,

...as promised. This describes the mdct used in my d.m.l patch. I think it is the same as the Lee fast-dct. I typed it in a kind of pseudo-TeX, 'cause the ascii art would kill me. Hope you can read TeX source; if not, ask someone who can to make a .ps/.gif/.whatever of the TeX output, and put it on a webpage or something. I'm to lazy to do it (and besides, I don't have access to TeX,

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, Sorry for this simple and maybe stupid question, I'm working in the implementation of opus for ARMv7e microcontroller using a library CMSIS/DSP used to calculate the CFFT and MDCT based on the DCT-IV. my question is: In the implementation of Celt you have used a fixed length CFFT equal to 1920, I want to know if there is some issues which can appear if a change that configuration

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

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, 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

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

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:

I'm trying to get these cleaned up and landed, but I'm running into some trouble with this patch. Using commit a08b29d88e3c (July 21) of Ne10, I'm seeing test failures for 60-point FFTs: nfft=60 inverse=0,snr = -3.312408 ** poor snr: -3.312408 ** nfft=60 inverse=1,snr = -16.079597 ** poor snr: -16.079597 ** All other sizes tested appear to work fine (84 to 140 dB of SNR). This

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

Hello, We have published two papers which build upon the LLVM Compiler Infrastructure. Would it be possible to include them in the LLVM related publications at http://llvm.org/pubs/ ? I attach below the bibliographic references: "CERE: LLVM Based Codelet Extractor and REplayer for Piecewise Benchmarking and Optimization" P. de Oliveira Castro, C. Akel, E. Petit, M. Popov, and W.