共查询到20条相似文献,搜索用时 156 毫秒
1.
语音谱参数的增强双预测多级矢量量化的码本设计方法 总被引:1,自引:0,他引:1
表征语音谱参数的线性预测编码(LPC)参数被广泛用于各种语音编码算法。甚低位率语音编码算法要求使用尽可能少的位率编码语音谱参数。文章提出了语音谱参数的增强双预测多级矢量量化算法(EDPMSVQ)的码本设计方法。这种改进的多级矢量量化方法充分利用语音谱参数的短时相关和长时相关特性,采用了有记忆的多级矢量量化算法(MSVQ),对语音谱参数的每一维分别使用不同的预测系数;并且通过利用相邻语音帧间语音谱参数的强相关和弱相关的不同特点,采用了分别对应于强相关和弱相关的两个预测值集合,进一步减小了语音谱参数编码位率。增强双预测多级矢量量化方法能够实现20位的语音谱参数近似“透明”量化,同时能够使语音谱参数量化时的计算复杂度略有减少,所需的存储空间大为减少。 相似文献
2.
提出了一种抗噪声语音特征。首先计算语音信号单边自相关序列的差分序列,再计算该差分序列的线性预测系数,进一步求出例说系数。实验证明,传统的线性预测例谱系数和边自相关序列的一性预测倒谱数相比,采用单边自相关序列差分序列的线性预测倒谱系数作为语音信号的特征矢量,可以提高语音识别系统对带噪音语音的识别率。 相似文献
3.
提出一种卡尔曼滤波语音增强算法的统一计算设备架构并行实现方案。该方案通过离散余弦变换把含噪语音分解为不相关的DCT系数,使原来的时域串行处理转化为统一计算设备架构并行处理,只需较少的线性预测阶数,节省运算时间。实验结果表明:与时域卡尔曼滤波比较,该方法有更高的输出分段信噪比,其统一计算设备架构加速方案可有效缩短语音增强运算的时间。 相似文献
4.
本文的目的是阐明一种Mel频率倒谱参数特征的改进算法。该算法是通过线性预测的方法从语音信号中提取出残差相位,同时将残差相位与传统的MFCC相结合,并应用到语音识别系统中。该改进算法比传统的MFCC算法具有更好的识别率。 相似文献
5.
线性预测倒谱参数(LPCC)能很好的体现人的声道特性,而梅尔倒谱参数(MFCC)能很好的模拟人耳的听觉效应。针对MFCC在不同频率段的识别精度不一致和LPCC不能准确模拟人的听觉系统问题,将MFCC参数和IMFCC参数分别作为语音不同频率段的特征参数,结合线性预测参数(LPCC),均衡滤波器的分布,完整覆盖到整个频率段范围。将梅尔倒谱参数和线性预测参数结合起来作为语音识别的特征提取参数。实验结果表明,改进之后的算法从效率上和识别率上都有不同程度的提高。 相似文献
6.
7.
8.
9.
10.
为了充分利用能量与线性预测编码(Linear prediction coding,LPC)系数之间的相关性,提高能量参数量化效率,提出了一种基于隐马尔可夫模型(Hidden Markov model,HMM)的能量参数预测量化算法.通过适当假设,使用HMM模拟能量参数和LPC系数之间的相关性,其中离散化后的能量参数组成隐状态序列,量化后的LPC系数组成可现测序列.然后利用HMM预测每一超帧中的能量参数的变化轨迹,并根据预测出的能量轨迹对预测残差进行分模式矢量量化(Mode-based vector quantization,MBQ).仿真实验中能量参数量化后的平均失真为2.668 dB,与线性预测量化算法相比下降了14.O%,表明本文算法通过利用能量参数与LPC系数的相关性,能够有效地提高能量参数量化效率. 相似文献
11.
《Computers & chemistry》1989,13(3):179-184
This paper shows how a course-grained parallel computer, the Alliant FX/80, can be used to speed up the processing of NMR data. Examples of simple vector operations are first shown and the level of parallelization that can be achieved is discussed. Speed enhancements of over 450 are achieved in the ideal case of vector addition. For NMR processing, the FFT algorithm is speeded up by 18 times and smaller but significant enhancements are achieved for other algorithms. 相似文献
12.
电力设备的稳定运行关系到人们的生命和财产安全,通过安装传感器对时序波形信号进行采集,对信号进行分析处理,可以实现对电力设备的故障诊断。集合经验模态分解(Ensemble Empirical Mode Decomposition,EEMD)算法在非线性、非平稳的信号处理领域有其独特的优势,但是由于其算法复杂度较大,作为运算密集型的算法在串行执行的情况下运算速度无法满足实际需求。因此,借助分布式计算框架Storm并行处理的特点,提出了基于Storm的EMD过程并行和信号分段并行的两种EEMD分解方式。实验表明,两种并行化方案都比传统的串行执行方式速度更快,并且基于分段并行的方式由于其更高的并行度,在长信号处理中更具优势。两种并行EEMD算法的提出为时序信号的快速处理提供了可靠的解决方案。 相似文献
13.
语音信号处理算法众多,但用于语音处理算法验证和开发的可视化研究平台极少。基于MATLAB GUI技术,完成语音信号典型时频特征参数提取和显示系统仿真平台的设计。可实现多种格式音频文件的载入和播放、波形和频谱显示、以及线性预测倒谱系数和美尔倒谱系数的计算、存储和显示等功能。系统界面友好、操作方便,可实现参数的交互输入并控制显示结果。仿真结果验证了相关时频特征参数提取算法的正确性,提高了对算法或数据处理效果的直观认识。 相似文献
14.
多媒体会议中多点控制单元(multi-point controlling unit,简称MCU)在多点会议中提供音频、视频和数据等的集中处理能力,其中音频处理能力是最基本的,也是实时性要求最高的要素.针对多点多媒体会议的实际应用需求,归类并分析了多种自适应多点语音混合处理方案,提出了采用自对齐加权的高性能混音方案.该方案不使用在实时多媒体处理中广泛运用的饱和运算,所以不引入新的噪声,因而具有较低的算法复杂度,其混合处理结果具有良好的听觉主观舒适感.同时,这套方案具有较好的并行处理特性,使用DSP等硬件较易实现,可以广泛应用在多媒体会议系统的实现中. 相似文献
15.
Dragan Bošnački Stefan Edelkamp Damian Sulewski Anton Wijs 《International Journal on Software Tools for Technology Transfer (STTT)》2011,13(1):21-35
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). Our improvements target the numerical components of the traditional sequential algorithms. In particular, we capitalize on the fact that in most of them operations like matrix–vector multiplication and solving systems of linear equations are the main complexity bottlenecks. Since linear algebraic operations can be implemented very efficiently on GPGPUs, the new parallel algorithms show considerable runtime improvements compared to their counterparts on standard architectures. We implemented our parallel algorithms on top of the probabilistic model checker PRISM. The prototype implementation was evaluated on several case studies in which we observed significant speedup over the standard CPU implementation of the tool. 相似文献
16.
17.
多维流序列并行预测算法研究 总被引:1,自引:0,他引:1
提出并行算法MSSF-VQ(Multiple Sequential Stream Forecast algorithm based on Vector Quantization),以解决多维序列流的未来趋势预测问题.算法利用矢量空间表示序列流的计算模型,并采用量子化技术离散处理连续序列流,然后提出了序列流矢量概率树的构造算法和搜索算法,最后阐述了算法步骤.真实流序列上的实验结果表明,MSSF-VQ算法预测的准确率高,速度快,在线处理占用的空间小,并有良好的扩展性. 相似文献
18.
19.
Much work has been accomplished in the past on the subject of parallel query processing and optimization in parallel relational database systems; however, little work on the same subject has been done in parallel object-oriented database systems. Since the object-oriented view of a database and its processing are quite different from those of a relational system, it can be expected that techniques of parallel query processing and optimization for the latter can be different from the former. In this paper, we present a general framework for parallel object-oriented database systems and several implemented query processing and optimization strategies together with some performance evaluation results. In this work, multiwavefront algorithms are used in query processing to allow a higher degree of parallelism than the traditional tree-based query processing. Four optimization strategies, which are designed specifically for the multiwavefront algorithms and for the optimization of single as well as multiple queries, are introduced. The query processing algorithms and optimization strategies have been implemented on a parallel computer, nCUBE2; and the results of a performance evaluation are presented in this paper. The main emphases and the intended contributions of this paper are (1) data partitioning, query processing and optimization strategies suitable for parallel OODBMSs, (2) the implementation of the multiwavefront algorithms and optimization strategies, and (3) the performance evaluation results. 相似文献
20.
Certain algorithms and their computational complexity are examined for use in a VLSI implementation of the real-time pattern classifier described in Part I of this work. The most computationally intensive processing is found in the classifier training mode wherein subsets of the largest and smallest eigenvalues and associated eigenvectors of the input data covariance pair must be computed. It is shown that if the matrix of interest is centrosymmetric and the method for eigensystem decomposition is operator-based, the problem architecture assumes a parallel form. Such a matrix structure is found in a wide variety of pattern recognition and speech and signal processing applications. Each of the parallel channels requires only two specialized matrix-arithmetic modules. These modules may be implemented as linear arrays of processing elements having at most O(N) elements where N is the input data vector dimension. The computations may be done in O(N) time steps. This compares favorably to O(N3) operations for a conventional, or general, rotation-based eigensystem solver and even the O(2N2) operations using an approach incorporating the fast Levinson algorithm for a matrix of Toeplitz structure since the underlying matrix in this work does not possess a Toeplitz structure. Some examples are provided on the convergence of a conventional iterative approach and a novel two-stage iterative method for eigensystem decomposition. 相似文献