similar to: request bit allocation info!

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

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

Hi, On http://www.speex.org/docs/manual/speex-manual/node11.html#SECTION001140000000000000000 the bitrate for Speex Wideband mode 9 and 10 is 9 34,400 10 42,400 On http://tools.ietf.org/html/draft-ietf-avt-rtp-speex-03 the bitrate for Speex Wideband mode 9 and 10 is 9 34.2 kbit/s 10 42.2 kbit/s I believe the draft contains the right values: E.g. mode 10 Narrowband mode 7 -> 492

Hi Sebastian, It boils down to this: The previous heuristic solver could return infinite cost solutions in some rare cases (despite finite-cost solutions existing). The new solver is still heuristic, but it should always return a finite cost solution if one exists. It does this by avoiding early reduction of infinite spill cost nodes via R1 or R2. To illustrate why the early reductions can be a

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

Hi, I have a 5-nodes GlusterFS cluster with Distributed-Replicate. There are 180 bricks in total. The OS is CentOS6.5, and GlusterFS is 3.11.0. I find many bricks are offline when we generate some empty files and rename them. I see xfs call trace in every node. For example, Nov 16 11:15:12 node10 kernel: XFS (rdc00d28p2): Internal error xfs_trans_cancel at line 1948 of file fs/xfs/xfs_trans.c.

On Thu, Nov 16, 2017 at 6:23 AM, Paul <flypen at gmail.com> wrote: > Hi, > > I have a 5-nodes GlusterFS cluster with Distributed-Replicate. There are > 180 bricks in total. The OS is CentOS6.5, and GlusterFS is 3.11.0. I find > many bricks are offline when we generate some empty files and rename them. > I see xfs call trace in every node. > > For example, > Nov 16

Hi Lang, I'm surprised about the fact that you omit R1/R2 reductions in some cases. Can you give a more detailed description of the bug (e.g. a PBQP dump)? Best regards, Sebastian Lang Hames wrote: > Hi Sachin, llvm-dev, > > I've just committed a new PBQP solver which, among other things, > should take care of this bug. > > Please let me know how it works out for you.

Somehow I've ended up with duplicate domids. domid=15 name=node14 (names sanitized) # virsh list --all Id Name State ---------------------------------------------------- 1 node1 running 2 node2 running 3 node3 running 5 node4 running 6

Hi, Could you help me? i have a problem with file on disperse volume. When i try to read this from mount point i recieve error, # md5sum /mnt/glfs/vmfs/slake-test-bck-m1-d1.qcow2 md5sum: /mnt/glfs/vmfs/slake-test-bck-m1-d1.qcow2: Input/output error Configuration and status of volume is: # gluster volume info vol1 Volume Name: vol1 Type: Disperse Volume ID:

> Page 3: > > To be compliant with this specification, implementations MUST support > 8 kHz sampling rate (narrowband)" and SHOULD support 8 kbps bitrate. > The sampling rate MUST be 8, 16 or 32 kHz. > > There is a type above after (narrowband), there is a " extra character. > > I don't understand what is the motivation to specify "SHOULD

On Sun, 2010-01-31 at 13:28 +1100, Lang Hames wrote: > Hi Sebastian, > > It boils down to this: The previous heuristic solver could return > infinite cost solutions in some rare cases (despite finite-cost > solutions existing). The new solver is still heuristic, but it should > always return a finite cost solution if one exists. It does this by > avoiding early reduction of

Hi Sachin, llvm-dev, I've just committed a new PBQP solver which, among other things, should take care of this bug. Please let me know how it works out for you. Cheers, Lang. On Tue, Dec 15, 2009 at 5:54 PM, Lang Hames <lhames at gmail.com> wrote: > Hi Sachin, > > Yes. Bernhard Scholz and I have just discussed a fix for this. I hope to > commit it in the next few days. I

Jeff, It's in the manual: http://www.speex.org/docs/manual/speex-manual/node10.html (table 3 and 4). However, if you're asking this, you're probably trying to do something wrong, or the hard way. You probably shouldn't be taking speex output, and trying to "count bytes". If you are using the API, then you will just get the bits out, and then you'll know how

Hi, I am using iproute2 to setup fowarding, adding routes like "ip route add 192.168.1.3 via 192.168.1.2" I was wondering where in the kernel I can insert probabilistic packet loss only for forwarded packets? So that for instance I can drop 5% of all forwarded packets? I don''t need help with the actual code, just need help finding where to insert this code :) Thanks! George

Hi, from time to time i am having mails delivered to my anon maildrop which completely break mailbox listing. I ignored it mostly as this is an anon maildrop for one time emails so loosing spam wasnt an issue. Today i had a mailbox which wouldnt list at all which was caused by 50 consecutive mails beeing broken. (I am showing the last 20 in the web interface) After some debugging i found a bunch

Hi, Guys I am starting looking the source code of Speex. Maybe a little silly, but I can not find the implementation of the function speex_encode(). Only something like below void speex_encode(void *state, float *in, SpeexBits *bits) { (*((SpeexMode**)state))->enc(state, in, bits); } Does that mean some of the detail implementation is embedded in lib without source code? I am new in

Hello, ????????at the beginning I want to underline that I've read SpeeX documentation and did some tests. I know that SpeeX was designed for networks in which packets arrive without errors, or don't arrive at all. SpeeX is very attractive if we consider low bit rates. I need to use SpeeX in very noisy environment, where speech quality doesn't matter, I'm interested in 2kb/s

Hi all We are about to send an updated version of the internet draft "RTP Payload Format for the Speex Codec" to the IETF AVT working group. Before submitting we would like your input, if you have any comments or input please send them to the mailing list. If we don't get any comments in 1 week (by 22. May 2007) we will go ahead and submit it to the IETF. Of course you can comment

I'm completely new to speex and I'm having issues adding it to my application. I can pass raw PCM and that works fine so I know my transmission code is fine however when I try to encode/decode using speex I get noise almost like a whining/buzzing sound. I'm sure it's and issue in my code but I'm not sure where to start looking other then my gut tells me I'm not sizing or