共查询到20条相似文献,搜索用时 515 毫秒
1.
2.
当网络中存在突发大时延时,就会出现极大丢包率或极大端到端时延的情况,从而难以获得好的语音质量。对于这个问题,提出针对突发大时延存在下的自适应语音缓冲算法。算法通过控制语音包在语音缓冲队列中的位置来控制语音包的播放时间,从而可以尽量减小语音裂缝(Gap)的出现。算法将突发大时延存在下的最大丢包率可以扩大到20%,而一般的预测算法只能容忍5-10%的最大丢包率。通过基于听觉模型的客观音质评价(PESQ)仿真计算,以及实际应用表明本文的算法对有突发大时延存在的网络中的语音通信质量有一定的改善作用。 相似文献
3.
4.
由于目前语音增强方法或算法难以对语音频谱在时频域上的结构化信息进行有效建模和利用。然而,深度学习中的RBM、DNN等模型擅长对数据中的结构化信息进行建模,而且具有从数据的低层结构化信息提取更高层的结构化信息的能力。基于分类深度神经网络的语音增强,该方法对于低信噪比非平稳语音增强可得到高可懂度的增强语音,但语音音质损失严重。基于DNN的最小均方误差回归拟合语音增强方案,该语音增强方案还说明大语音数据训练能保证DNN较充分学习到噪声语音谱和干净语音谱之间复杂的非线性关系。 相似文献
5.
为提高DNN模型在无线通信中信道估计精度,提出一种基于1D-Concatenate的信道估计DNN模型优化方法。该方法将Concatenate进行一维(1D)数据转换,以跳跃连接的方式引入DNN模型,抑制梯度消失问题,运用1D-Concatenate恢复网络训练过程中丢失的数据特征,提高DNN信道估计精度。为验证优化方法的有效性,选取较典型的基于DNN的无线通信信道估计模型进行对比仿真实验。实验结果表明,本文提出的优化方法对已有DNN模型的估计增益提升可达77.10%,在高信噪比下信道增益提升可达3 dB。该优化方法能有效提高DNN模型在无线通信中的信道估计精度,特别是高信噪比下提升效果显著。 相似文献
6.
7.
为解决实时音频传输中数据丢包恢复延时长的问题,基于网络环境中音频相关性理论提出了一种实时音频数据丢包恢复的方法.该方法充分利用了语音信号帧间的相关性,并结合均值滤波与多项拟合算法,较好地实现了丢包数据的实时恢复.计算机仿真结果表明,该方法能够准确恢复丢失的音频数据,效果良好,具有延时小,占用带宽小等特点. 相似文献
8.
基于网络编码的多跳无线网络可靠组播 总被引:2,自引:0,他引:2
多跳无线网络中实现可靠组播面临许多挑战,数据丢失恢复是其中的核心问题之一。该文提出一种基于8GF(2)域的随机线性网络编码的多跳无线网络中高效可靠组播(Network Coding Reliable Multicast,NCRM)算法,克服了XOR编码方式的局限性,将原始数据包划分成不同"代"(generation)进行发送,恢复节点采用随机线性网络编码方式发送编码包,发生丢包的组播组成员发送携带丢包比特向量的NACK(Negative ACKnowledgement),经过邻居恢复、多跳恢复或源端恢复,完成可靠组播过程。该文建立了节点丢失恢复过程的齐次马尔科夫链数学模型,给出理论平均时延和重传跳数。NS2仿真结果验证了理论分析模型的准确性。数值结果表明,与PGM(PragmaticGeneral Multicast)和CoreRM可靠组播协议相比,NCRM算法显著改善了网络吞吐量和丢失恢复延时等性能。 相似文献
9.
10.
11.
12.
Sofiene Jelassi Habib Youssef Christian Hoene Guy Pujolle 《Telecommunication Systems》2012,49(1):17-34
The perceptual quality of VoIP conversations depends tightly on the pattern of packet losses, i.e., the distribution and duration
of packet loss runs. The wider (resp. smaller) the inter-loss gap (resp. loss gap) duration, the lower is the quality degradation.
Moreover, a set of speech sequences impaired using an identical packet loss pattern results in a different degree of perceptual
quality degradation because dropped voice packets have unequal impact on the perceived quality. Therefore, we consider the
voicing feature of speech wave included in lost packets in addition to packet loss pattern to estimate speech quality scores. We distinguish
between voiced, unvoiced, and silence packets. This enables to achieve better correlation and accuracy between human-based subjective and machine-calculated objective scores. 相似文献
13.
Adaptive Speech Streaming Based on Packet Loss Prediction Using Support Vector Machine for Software‐Based Multipoint Control Unit over IP Networks 下载免费PDF全文
An adaptive speech streaming method to improve the perceived speech quality of a software‐based multipoint control unit (SW‐based MCU) over IP networks is proposed. First, the proposed method predicts whether the speech packet to be transmitted is lost. To this end, the proposed method learns the pattern of packet losses in the IP network, and then predicts the loss of the packet to be transmitted over that IP network. The proposed method classifies the speech signal into different classes of silence, unvoiced, speech onset, or voiced frame. Based on the results of packet loss prediction and speech classification, the proposed method determines the proper amount and bitrate of redundant speech data (RSD) that are sent with primary speech data (PSD) in order to assist the speech decoder to restore the speech signals of lost packets. Specifically, when a packet is predicted to be lost, the amount and bitrate of the RSD must be increased through a reduction in the bitrate of the PSD. The effectiveness of the proposed method for learning the packet loss pattern and assigning a different speech coding rate is then demonstrated using a support vector machine and adaptive multirate‐narrowband, respectively. The results show that as compared with conventional methods that restore lost speech signals, the proposed method remarkably improves the perceived speech quality of an SW‐based MCU under various packet loss conditions in an IP network. 相似文献
14.
15.
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 effects are a function of packet lengthB and probability of packet loss PL . We have also studied tbe benefits of an odd-even sample-interpolation procedure that mitigates these effects (at the cost of increased decoding delay). The procedure is based on arranging a2B -block of codewords into twoB -sample packets, an odd-sample packet and an even-sample packet. If one of these packets is lost, the odd (or even) samples of the2B -block are estimated from the even (or odd) samples by means of adaptive interpolation. Perceptual considerations indicate that packet lengths most robust to losses are in the range 16-32 ms, irrespective of whether interpolation is used or not. With these packet lengths, tolerable PL values, which are strictly input-speech-dependent, can be as high as 2 to 5 percent without interpolation and 5 to 10 percent with interpolation. These observations are based on a computer simulation with three sentence-length speech inputs, and on informal listening tests. 相似文献
16.
17.
A packet speech multiplexer is analysed using a fluid approximation for the flow of packets in and out of the multiplexer. Delay distributions and fractional packet loss are determined with a small amount of computation. Comparisons with a simulation using real speech show the analysis to be accurate. 相似文献
18.
《Selected Areas in Communications, IEEE Journal on》1989,7(5):729-738
Unlike data traffic, the voice packet stream from a node has very high correlation between consecutive packets. In addition, in order for the speech to be properly reconstructed, a delay constraint must be satisfied. A queueing model that accurately predicts packet loss probabilities for such a system is presented. Analytical results are obtained from an embedded bivariate Markov chain and are validated by a simulation program. Based on this model, the impact of the delay constraint, talkspurt detection thresholds, and packet size on packet loss are studied. Two schemes, named `instant' and `random', for discarding late packets are considered. Simulation results show that better performance can be obtained by using the latter scheme 相似文献
19.
20.
Analysis of packet loss processes in high-speed networks 总被引:5,自引:0,他引:5
Cidon I. Khamisy A. Sidi M. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》1993,39(1):98-108
The packet loss process in a single-server queueing system with a finite buffer capacity is analyzed. The model used addresses the packet loss probabilities for packets within a block of a consecutive sequence of packets. An analytical approach is presented that yields efficient recursions for the computation of the distribution of the number of lost packets within a block of packets of fixed or variable size for several arrival models and several numbers of sessions. Numerical examples are provided to compare the distribution obtained with that obtained using the independence assumption to compute the loss probabilities of packets within a block. The results show that forward error correction schemes become less efficient due to the bursty nature of the packet loss processes; real-time traffic might be more sensitive to network congestion than was previously assumed; and the retransmission probability of ATM messages has been overestimated by the use of the independence assumption 相似文献