similar to: Unused entries in code book

hello, does anybody know whether the codewords have a special meaning? whether they have a different influence like the quantization matriy in jpeg? e.g. do lower or the first entries have a greater influence than the last or higher codewords? thanks gerald

Hi, We are porting the Ogg Vorbis fixed point decoder to a 24 bit fixed point precision processor. We are trying to reduce the number of cycles for MIPS optimization. In this process we observed that most of the songs do not have "maximum codeword length" greater than 24 bits. We are planning to reduce most of the double word operations (in our case 32 bit data is stored as double

Hi, From the vorbis decoder specification, it is clear that the decoder needs to have all the codebooks before decoding can actually begin. I will appreciate if someone can clear the following questions: 1. I guess the codebooks are derived from the actual input data. Probably the encoder may be making two passes through the input. The first pass finds out the frequency of different symbols

Hi, Realtime SIP and Extensions are working fine but facing some problems with Voicemail. Added an entry to extconfig.conf voicemail => mysql,asterisk,voicemail_users Created the corresponding table and an entry for mailbox 201. This is also reflected in the CLI as shown below. CLI> realtime load voicemail mailbox 201 Column Name Column Value

Hello folks, The codebook infrastructure for Vorbis is now well underway. This is it! The last piece needed for *real* bitstreams. To that end, I have a decent VQ codebook generator running. I was originally using some farily typical merge/split algorithms and then decided that the right way to do this was to model a VQ codebook as an m-dimensional set of bubbles (like a foam). I know there

Hi, I am a bit confused on how code-words are derived from the codeword lengths. I will appreciate if someone can point me in the correct direction. I will take the example of an actual codebook that i found in a valid vorbis encoded file as shown below. [SK] +------Codebook [0] -------- [SK] Codebook Dimensions = 1 [SK] Codebook Entries = 8 [SK] Unordered [SK] 1, 6, 3, 7, 2, 5, 4, 7, [SK] NO

Hello Monty, Sorry for the wrong subject title last time. A little more clarification needed. When reading bit-by-bit, there is no MSb/LSb, just 'first bit' and 'last bit'. The Huffman tree is traversed from 'first bit' to last bit'. This is a conceptual layer above the bitpacker; all you need to know is what order the bits come out, which happens to be LSb-first.

Hi, I'm trying to install asterisk on Dell power edge 2800 running Fedora core 3. I don't have have any zaptel cards, so trying to use ztdummy. /dev/zap is successfuly created... but I see some problems while starting asterisk ... chan_zap fails to load. Can somebody please help me in overcoming this problem. I was able to run asterisk on other normal PCs running Fedora core 3. Is this

Hi All, Is it possible to go beyond 250 concurrent ZAP channels with some tweaking or workaround ? Meetme uses zap channels, so we could have a max of 250 conference ports. Is it possible to higher this ? "An Asterisk system can only handle a *max. of 250 concurrent ZAP channels*. This is due to the design limit (255) within the ZAP channel driver." Thanks, ~Vamsi -------------- next

Hi, I was able to work out SIP trunk between Asterisk and CCM 4.x without any issues. Whereas SIP trunk in CCM 5.x is not working with Asterisk. Asterisk is sending OPTIONS messages to CCM 5.x for which CCM is not replying. For the same reason Asterisk is marking it as UNREACHABLE. Anybody got Asterisk and CCM 5.x intergation working. How can I fix the problem which I'm facing with CCM 5.x?

Hi radeonhd, nouveau, mesa3d developers, Firstly, thank you all very much for all the important work you do. I've been working as a part-time developer on the "Spring RTS" project (open-source game engine) which runs on linux (and other os). Some time ago I tried the engine on the open-source ATI radeonhd driver, which I understand to be partly based on mesa 3d, and all textures

I was just somewhat curious as to what lossless compression is used... is it just huffman? Tony Arcieri --- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage: http://www.xiph.org/ogg/

I've made a block diagram of the encoder because I tried to find out, how it works http://stoffke.freeshell.65535.net/ogg/block.html Although there are specifiation docs, that give very detailed information about single aspects of the encoding (or decoding) , I'm missing documenations that give a more general overview, about how the encoder works. (Vorbis Illuminated seems a bit

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).

hello all, we are developing and porting vorbis1decoder on a 24 bit platform. in the process we came across somedoubts about node bytes and leaf words. from the specification we got that we are arranging the huffman codeword tree into an array. the nodebytes are the number of bytes that are required to represent a node and leafwords are the no. of bytes required to represent the leaf i.e the

I want to analyse compressed data between VQ and Huffman coding steps. Where in source code can I access to data massive for this goal. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://lists.xiph.org/pipermail/vorbis/attachments/20090916/4529e42d/attachment-0001.htm

Thanks Vamsi I have not been able to locate pwlib - 1.6.6 or openh323 1_13_5. I found the latest versions through sourceforge and I found some older versions on another site, but not these versions. This has been quite frustrating. Anyway, I think by using the asterisk-oh323 branch under channels in the asterisk source tree I will have more luck. At present it seems to compile successfully, but

If your phones are setup to connect to the asterisk box by name, then a smart DNS server can just point phones to the backup box after failure. However, since asterisk running on the backup box doesn't know about the phones, this is only half the solution ________________________________ From: Mohamed A. Gombolaty [mailto:mgombolaty@noorgroup.net] Sent: Thursday, June 30, 2005 8:30 AM To:

hi kuhlen, what you said is correct. i am talking about how you are going to arrange these codewords into an array, i.e. in the function _make_decode_table. there he uses node bytes and leaf words for memory management. i got a 24 bit platform. so if i assume that max. codeword length that could be possible as 24 bits can i allocate a memory of (2 * used entries - 2), to arrange the whole tree in

Ein eingebundener Text mit undefiniertem Zeichensatz wurde abgetrennt. Name: nicht verf?gbar URL: https://stat.ethz.ch/pipermail/r-help/attachments/20061008/19f386e1/attachment.pl