similar to: Large codebook?

I'm copying the flac-dev list to see if anyone has any feedback also... --- Juhana Sadeharju <kouhia@nic.funet.fi> wrote: > Hello again. I had time to check the paper out. I have filled the > steps given in the paper with formulae, and then written a piece of > C code. It is not complete code, but could be a reasonable start. > Maybe there is one typo in the paper -- I have

[ I'm not in the list because I didn't find a digested version; please move the lists to sourceforge.net, and we would have the digested version. I read the replies from the archive. ] Hello. Would it be possible to allow Vorbis use the same codebook for multiple files? I could keep a 650 MB codebook on CD-R and use that for all my audiofiles. If that is possible, how much the

Hi all Suppose I have a dim=c(2,2,3) matrix A, say: A[,,1]= a b c d A[,,2]= e f g h A[,,3]= i j k l Suppose that I want to create a 2x2 matrix X, which picks elements from the above-mentioned submatrices according to an index matrix J referring to the "depth" dimension: J= 1 3 2 3 In other words, I want X to be X= a j g l since the matrix J says that the (1,1)-element should be

Hello Spse I have a matrix, say 1 2 3 4 5 6 7 8 9 and I would like to expand it by repeating rows within the matrix, to get, if the repeating factor is 2, say: 123 123 456 456 789 789 (or columnwise as well) . There must be a smart way of doing that? Many thanks Juhana Vartiainen juhana.vartiainen at labour.fi -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-

Hello everybody! Spse I have the following X <- seq(1:100) #(a dim(100) sequence of integers 1:100 representing the possible actions of player 1 and player2 in a game) BR2X<- br2(X) #(a dim(100) sequence of points on range (1,100) representing the best response function of player 2 to player 1:s actions) BR1X<- br1(X) #(a dim(100) sequence of points on range (1,100)

I'm trying to get speex to encode a bit faster, mainly by rewriting a few functions in SSE and translating the GCC __asm__ to VC __asm. There's 2 functions I'm targeting, first is vq_nbest which consumes 40% of the time at high complexity and split_cb_search_shape_sign. Which consumes just over 30%. I've split out two functions from: cb_search_precompute_energy - loop at the

>From: Josh Coalson <j_coalson@yahoo.com> > >I'm copying the flac-dev list to see if anyone has any >feedback also... I'm supposed to be there myself since yesterday but have not got the first digest yet. >First, the results they show are for compression of data >that has already been lossily quantized to fewer bits per >sample, e.g. u-Law and A-Law are

Hi, Please brace yourselves for some possibly stupid questions. Why are there only 2 codebooks for floors and many more for residue values? What makes the encoding of floor values fundamentally different from encoding residue values? I have a basic understanding of VQ, and looking at the floor decode function, it all makes sense 1) Read the codebook index from the stream 2) Do a

Hello, Jean-Marc Valin schrieb: >>I am planning on creating a steganographic extension for speex/CELP. >>Since speex/CELP is lossy, there should be quite many bits that one >>can use for hiding data. > > Quite the opposite. Speex uses very few bits, so every bit you corrupt > is likely to be heard. You would need to use "fractions of bits" at a > time.

Hi guys, This is my first post, I?m a brazilian programmer and I think speex is a great project. :) I'm working on a free software project and I was planning to use speex on it. I have used the java speex version in another project and that worked well, and this time I was planning to use a JNI version to get the latest features. ok, lets get to the point. :) I would need to mix some audio

I've been trying to get some data from the National Survey for Family Growth into R - however, the data is in a .dat file and the data I need doesn't have any spaces or commas separating fields - rather you have to look into the codebook and what number of digits along the line the data you need is. The data I want are the following, where 1,12,int means that the data I'm interested

Anexed is my function for reading codebooks and the Vq Table. My problem is: I read a codeBook number of 41, so i called this function above 41 times. The firtst time, the sync patterns (BCV) is alligned correctly, so it reads correctly. the sencond time it is executed, the patter is not there anymore and there are only 8 BCV in my file. function fReadBits1 is the same as the ogg's read bit

heh...:) maybe I?ll just answer "the number is 42". ;) well... some guys did mixing using *G.722 *encoded frames... maybe we could ask them: 8P http://ieeexplore.ieee.org/Xplore/login.jsp?url=/iel5/4054516/4054517/04054870.pdf?isnumber=4054517&prod=CNF&arnumber=4054870&arSt=2045&ared=2048&arAuthor=G.+Agnello%3B+R.+M.+Dansereau and a little off-topic, but fun for

Is there a currently existing method in an R package for creating a codebook from a dataframe? Preferably, I would like to be able to export to a text file all relevant information. Thanks, Harold [[alternative HTML version deleted]]

Hi, can someone help me understand and experiment with Speex in a better way than my knowledge. I want to change the LPC filter order of the Speex algorithm. I think I need to change the LPC order( or lpcSize) in modes.c file. but to make it work I need to modify the codebook also, can someone tell me how to go about changing the codebook entries to support the changed order of prediction.

Hi, I am trying to implement ogg vorbis real time decoder on SHARC ADSP 21364 processor. I am writing my own version of the decoder using the documentation vorbis_I_spec.pdf from xiph.org. However I am facing certain hurdles in floor curve decoding during audio packet decode. In the spec it says that [cval] = read from packet using codebook number [so and so] in *scalar context*.(page no 43).

Hi, all I am studying the ogg-vorbis algorithm but I have less knowledge about the codebook structure of vorbis. After tracing the release source code, I found it doesn't use huffman tree to decode the huffman code instead of using a special mapping and pre-look. The memory requirement seems similar with huffman tree decoding. Could anyone tell me how the vorbis huffman decoding works

>There's plenty of areas for improvements that don't require incompatible changes like this one. can u please tell me what do I do to make it more exact waveform coder for music rather than speech. I understand that its meant for speech, but I was just using it for music... I am interested in getting the residual as small as possible using speex. Can you please tell me the areas to

Skipped content of type multipart/mixed-------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 252 bytes Desc: OpenPGP digital signature Url : http://lists.xiph.org/pipermail/speex-dev/attachments/20060719/1f7ff5c0/signature.pgp

Hello, I recently measured the distances ndist[0][nb_subvect-1] which are used to make the decicion, which codebook entries are to be used in libspeex/cb_search.c (function split_cb_search_shape_sign). For that I took a couple of audio books (all german speech), downsampled the tracks to 8kHz and encoded them with "speexenc -n --bitrate 15000 ..." (I used svn revision 11825). Usually,