作者: N. Jayant , S. Christensen
DOI: 10.1109/TCOM.1981.1094975
关键词: Speech recognition 、 Packet switching 、 Transmission delay 、 Decoding methods 、 Speech coding 、 Processing delay 、 Network packet 、 Fast packet switching 、 Packet loss 、 Algorithm 、 Computer science
摘要: We have studied the effects of random packet losses in digital speech systems based on 12-bit PCM and 4-bit adaptive DPCM coding. The are a function length B probability loss P L . also tbe benefits an odd-even sample-interpolation procedure that mitigates these (at cost increased decoding delay). is arranging 2B -block codewords into two -sample packets, odd-sample even-sample packet. If one packets lost, odd (or even) samples estimated from even odd) by means interpolation. Perceptual considerations indicate lengths most robust to range 16-32 ms, irrespective whether interpolation used or not. With lengths, tolerable values, which strictly input-speech-dependent, can be as high 2 5 percent without 10 with These observations computer simulation three sentence-length inputs, informal listening tests.