一种基于优先树脉冲取代的固定码本搜索方法

分析了G.722.2中的固定码本结构及其搜索方法,结合深度优先树与脉冲取代法各自的优点,提出了一种新的方法——基于优先树脉冲取代的固定码本搜索方法,该方法在基本保持语音质量的前提下,可使固定码本搜索计算复杂度降低,从而使G.722.2的编码运行时间进一步减少。实验结果表明,与G.722.2中采用的深度优先树搜索方法相比,基于优先树脉冲取代的固定码本搜索方法可以在不影响语音质量的前提下,使固定码本搜索复杂度降低85%以上。     

Trellis-coded vector quantisation based on modified set partitionmethod and partial vector search scheme

An efficient trellis-coded vector quantisation (TCVQ) algorithm based on the modified set partition method and partial distance search scheme is presented. Using the modified set partition method, the minimum distance within a subset can be maximised as much as possible, thus improving the performance of the TCVQ. A novel partial distance search method based on the codebook structure of TCVQ is also proposed to reduce the computational complexity of the minimum distortion encoding for TCVQ. Experimental results show that it can reduce the computational complexity by ~60-90% depending on the codebook size     

Fast codebook searching in a SOM-based vector quantizer for image compression

We propose a novel method for fast codebook searching in self-organizing map (SOM)-generated codebooks. This method performs a non-exhaustive search of the codebook to find a good match for an input vector. While performing an exhaustive search in a large codebook with high dimensional vectors, the encoder faces a significant computational barrier. Due to its topology preservation property, SOM holds a good promise of being utilized for fast codebook searching. This aspect of SOM remained largely unexploited till date. In this paper we first develop two separate strategies for fast codebook searching by exploiting the properties of SOM and then combine these strategies to develop the proposed method for improved overall performance. Though the method is general enough to be applied for any kind of signal domain, in the present paper we demonstrate its efficacy with spatial vector quantization of gray-scale images.     

Improved Populating Code-Excited Linear Predictive Coder

1Introduction,TheCode--ExcitedLinearPredictive(CELP)[13coderprovidedgoodqualityspeechatmediumandlowbitrates,butthisqualityspeechwasatthecostofverycomputationalcomplexity.Recently,therealtimeimplementationoftheCELPcodersonalowpricedigitalsignalprocessorchi…     

Peano scanning based fast encoding algorithm for vectorquantisation

An effective method for encoding image-input blocks in vector quantisation (VQ) is proposed. For each codeword in the codebook, a group of Peano scannings of selected feature vectors is computed. Each Peano scanning acts as a transform from a higher dimension to one dimension, while preserving neighbourhood adjacency. An ordered list of the Peano scannings and their link to the codebook is stored. Coding is conducted by restricting the search to two windows of codewords with the closest Peano scannings to that of the input block. Each window centre is found in logarithmic time proportional to the codebook size. The number of codewords to be searched is fixed, and is determined by some additional distortion that is acceptable over exhaustive search methods. Coded images show no significant degradation, while maintaining considerable constant search-time savings over exhaustive search methods. The algorithm can be used with other fast full-search equivalent methods, and can use savings from other methods in searching within the windows as well     

ITU-T G.723.1语音编码器中自适应码本搜索算法分析

本文先对ITU-T G.723.1语音编解码器结构、工作方式做了简单的描述,然后对其中的基音预测模块做了算法上的具体分析,对输入、输出给该模块的参数做了明确说明,指出搜索过程是按照目标矢量(原始语音经过一系列处理后)与自适应码本贡献(用过去的激励重建语音)差值的平方最小化准则进行的。     

一种进化模拟退火矢量量化图像编码新算法

模拟进化和模拟退火是解决全局优化问题的随机搜索技术,它们在工程领域有着广泛的应用.本文将这两种技术有机结合,提出了一种进化模拟退火算法,并用其解决图像编码矢量量化码书设计问题.实验表明,算法具有收敛速度快、码书性能佳等优点.     

A fuzzy classified vector quantizer for image coding

Vector quantization of images raises problems of complexity in codebook search and subjective quality of images. The family of image vector quantization algorithms proposed in this paper addresses both of those problems. The fuzzy classified vector quantizer (FCVQ) is based on fuzzy set theory and consists basically in a method of extracting a subcodebook from the original codebook, biased by the features of the block to be coded. The incidence of each feature on the blocks is represented by a fuzzy set that captures its (possibly subjective) nature. Unlike the classified vector quantizer (CVQ), in the FCVQ a specific subcodebook is extracted for each block to be coded, allowing a better adaptation to the block. The CVQ may be regarded as a special case of the FCVQ. In order to explore the possible correlation between blocks, an estimator for the degree of incidence of features on the block to be coded is included. The estimate is based on previously coded blocks and is obtained by maximizing a possibility; a distribution that intends to represent the subjective knowledge on the feature's possibility of occurrence conditioned to the coded blocks is used. Some examples of the application of a FCVQ coder to two test images are presented. A slight improvement on the subjective quality of the coded images is obtained, together with a significant reduction on the codebook search complexity and, when applying the estimator, a reduction of the bit rate     

基于改进禁止搜索算法的矢量量化码书设计

本文提出了基于改进禁止搜索(TS)算法的矢量量化(VQ)码书设计方法.禁止搜索算法的关键是如何定义一个解以及如何在当前解的基础上生成邻域解.由于码书设计的两个优化准则是最邻近条件和聚类质心条件,本文提出了两种禁止搜索算法的解描述方案,其相应算法分别叫基于码书的禁止搜索(CB-TS)算法和基于聚类划分的禁止搜索(PB-TS)算法.为了提高禁止搜索算法的性能,文中在禁止搜索算法中融入了模拟退火(SA)机制.为了进一步提高码书性能,文中还将码书设计的传统LBG算法融入禁止搜索算法中.结果表明,基于禁止搜索的两种码书设计方案所生成的码书性能都比LBG算法有明显提高.     

Fast vector-sum codebook search method for low bit rate speechcoding

A fast vector-sum codebook search method for low bit rate speech coding is presented. In this method, the codebook search is simplified by designing a vector-sum codebook that consists of orthonormal regular pulse basis vectors. A further simplification is achieved by adopting backward filtering. The method proposed has significantly reduced computational complexity, compared with the conventional VSELP, without producing any additional degradation in the quality of the synthesised speech     

基于G.729语音编码非零脉冲位置信息的隐藏算法

VoIP以语音流为传输媒介,具有传输数据量大和应用广泛的优点。但VoIP系统也面临数据安全和隐私泄露的安全威胁。针对编码标准G.729固定码本搜索的非遍历特性和具有一定冗余性的特点,该文提出基于G.729语音编码非零脉冲位置信息的隐藏算法。该算法在固定码本搜索过程中,利用秘密信息控制码本的搜索过程,并在非零脉冲位置和秘密信息之间构建函数进行信息隐藏。在搜索过程中利用最不重要脉冲替换思想并采用最小化失真准则控制由秘密信息的嵌入带来的音质失真。实验结果表明:算法隐藏容量可达400 bit/s,算法具有良好的隐蔽性(PESQ平均值约为3.45)。     

Fast codebook search algorithm for unconstrained vectorquantisation

Vector quantisation (VQ) is a well known data compression technique which maps an ordered set of real numbers into a single integer. However, it is difficult to achieve accurate compression with the use of unconstrained Voronoi VQ when the codebook level and vector dimensionality are very large, due to the extremely high real-time computational complexity involved in full codebook search. To overcome this difficulty, a classified pre-selection method is proposed. Compared to the conventional full search method, the algorithm reduces the computational complexity involved in the code vector selection procedure by 70%~90% with almost no loss in coder performance, at the cost of only a slight increase in the storage requirement     

A vector quantizer with minimum visible distortion

A method for designing codebooks for vector quantization (VQ) based on minimum error visibility in a reconstructed picture is described. The method uses objective measurements to define visibility for the picture being coded. The proposed VQ is switched type, i.e., the codebook is divided into subcodebooks, each of which is related to a given subrange of error visibility. Codebook optimization is carried out on the basis of a particular definition of visible distortion of the reconstructed image. Subjective judgment of the test results, carried out at 0.5 b/pel bit rate, indicates that the proposed VQ enables low-distortion images to be reconstructed even when subcodebooks with a small number of codewords are used, thus reducing the codebook search time to about 10% of that required by a fixed VQ (both inside and outside the training set)     

An Embedded ACELP Speech Coding Based on the AMR‐WB Codec

This letter proposes a new embedded speech coding structure based on the Adaptive Multi‐Rate Wideband (AMR‐WB) standard codec. The proposed coding scheme consists of three different bitrates where the two lower bitrates are embedded into the highest one. The embedded bitstream was achieved by modifying the algebraic codebook search procedure adopted for the AMR‐WB codec. The proposed method provides the advantage of scalability due to the embedded bitstream, while it inevitably requires some additional computational complexity for obtaining two different code vectors of the higher bitrate modes. Compared to the AMR‐WB codec, the embedded coder shows improved speech qualities for two higher bitrate modes with a slightly increased bitrate caused by the decreased coding efficiency of the algebraic codebook.     

Efficient codebooks for vector quantization image compression withan adaptive tree search algorithm

This paper discusses some algorithms to be used for the generation of an efficient and robust codebook for vector quantization (VQ). Some of the algorithms reduce the required codebook size by 4 or even 8 b to achieve the same level of performance as some of the popular techniques. This helps in greatly reducing the complexity of codebook generation and encoding. We also present a new adaptive tree search algorithm which improves the performance of any product VQ structure. Our results show an improvement of nearly 3 dB over the fixed rate search algorithm at a bit rate of 0.75 b/pixel     

二维网格编码矢量量化及其在静止图像量化中的应用

该文提出了在二维码书空间中，在矢量量化（VQ）的基础上，应用网格编码量化（TCQ）的思想来实现量化的新方法－－二维网格编码矢量量化（2D－TCVQ）。该方法首先把小码书扩展成大的虚码书，然后用网格编码矢量量化（TCVQ）的方法在扩大的二维码书空间中用维物比算法来寻找最佳量化路径。码书扩大造成第一子集最小失真减小从提高了量化性能。由于二维TCVQ采用的码书尺寸较小，因而可以应用到低存贮、低功耗的编解码环境。仿真结果表明，同一码书尺寸下，二维TCVQ比TCVQ好0．5dB左右。同时，该方法具有计算量适中，解码简单以及对误差扩散不敏感的优点。     

On reducing computational complexity of codebook search in CELPcoding

A computationally efficient codebook search method in code-excited linear prediction is proposed. The method can reduce the computational complexity by almost one half compared to the frequency-domain codebook search method that is currently regarded as the fastest search method, while giving almost the same quality of speech. This reduction is possible as a result of the simultaneous use of frequency-domain search and code vector sparsity     

Resource Allocation of Limited Feedback in Clustered Wireless Mesh Networks

This paper focuses on resource allocation problem of limited feedback in OFDM-based clustered wireless mesh networks. Firstly, the channel quantization codebook is designed according to the equal probability quantizer and joint power, rate and channel quantization threshold codebook scheme (PRCQT) is proposed. Secondly, we deduce the subcarrier allocation criterion utilizing the Lagrange multiplier method. Finally, stochastic resource allocation scheme of limited feedback (SRALF) utilizing the stochastic optimization tools for OFDM-based clustered WMNs is proposed. Simulation results demonstrate SRALF+PRCQT scheme not only improves the network throughput, but also has advantage of limited feedback overhead.     

小波激励线性预测编码（WELP）：一种新的低速语音编码方法

在低速语音编译码系统中，常采用码本激励线性预测编码ＣＥＬＰ，其中随机码本的码本结构及应的索算法直接影响着语音编译码系统的语音质量和实时实现中的运算量。