Hi, EricThanks~ setting the msq_limit to 0 solved my problem.But actually if you take a look my code, I am inserting the packets to the queue after calling fg.start()
fg.start() while n < nbytes: send_pkt_A(
struct.pack('!H', pktnoA) + 'A' + (pkt_sizeA - 3) * chr(pktnoA & 0xff))
On Tue, Oct 17, 2006 at 12:00:11AM -0400, Dawei Shen wrote:
> Sorry, my previous email is sent by mistake, let me restate my questions:
>
> Hey Eric, Michael and other friends:
>
> My code is working well now. But I met two new problems, which are not so
> crucial, but really important to me.
>
On Mon, Oct 16, 2006 at 11:47:13PM -0400, Dawei Shen wrote:
> Hey Eric, Michael and other friends:
>
> My code is working well now. But I met two new problems, which are not so
> crucial, but really important to me.
>
> 1. When I initilize the Viterbi algorithm, I wish that for the first trunk
>
Sorry, my previous email is sent by mistake, let me restate my questions:Hey Eric, Michael and other friends:My code is working well now. But I met two new problems, which are not so crucial, but really important to me.
1.
When I initilize the Viterbi algorithm, I wish that for the first trunk
of d
Hey Eric, Michael and other friends:My code is working well now. But I met two new problems, which are not so crucial, but really important to me.1. When I initilize the Viterbi algorithm, I wish that for the first trunk of data, ninput_items >= Viterbi algorithm's working length, let's say ninput_
