An efficient tree‐structured vector quantization using dynamic triangular inequality elimination

Chu, Chao Ping; Yeh, Cheng Yu; Hwang, Shaw‐Hwa

doi:10.1002/tee.22038

Cited by 4 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where the coefficients q i are referred to as the ISPs in the cosine domain and a [16] is the last predictor coefficient. A Chebyshev polynomial is used to solve (4) and (5).…”

Section: Linear Prediction Analysismentioning

confidence: 99%

“…Conventionally, VQ conducts a full search to ensure that a codeword is best matched with an arbitrary input vector, but the full search requires an enormous computational load. Thus, a continuous effort has been made to simplify the search complexity of an encoding process in a great volume of published studies [14][15][16][17][18][19][20][21][22][23][24][25]. These approaches are further classified into three types in terms of the way the complexity is simplified, including the tree-structured VQ (TSVQ) techniques [14][15][16], the TIE-based approaches [18][19][20] and the equal-average equal-variance equal-norm nearest neighbor search (EEENNS) based algorithms [21][22][23][24][25].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Search Complexity Improvement of Vector Quantization to Immittance Spectral Frequency Coefficients in AMR-WB Speech Codec

2016

View full text Add to dashboard Cite

An adaptive multi-rate wideband (AMR-WB) code is a speech codec developed on the basis of an algebraic code-excited linear-prediction (ACELP) coding technique, and has a double advantage of low bit rates and high speech quality. This coding technique is widely used in modern mobile communication systems for a high speech quality in handheld devices. However, a major disadvantage is that a vector quantization (VQ) of immittance spectral frequency (ISF) coefficients occupies a significant computational load in the AMR-WB encoder. Hence, this paper presents a triangular inequality elimination (TIE) algorithm combined with a dynamic mechanism and an intersection mechanism, abbreviated as the DI-TIE algorithm, to remarkably improve the complexity of ISF coefficient quantization in the AMR-WB speech codec. Both mechanisms are designed in a way that recursively enhances the performance of the TIE algorithm. At the end of this work, this proposal is experimentally validated as a superior search algorithm relative to a conventional TIE, a multiple TIE (MTIE), and an equal-average equal-variance equal-norm nearest neighbor search (EEENNS) approach. With a full search algorithm as a benchmark for search load comparison, this work provides a search load reduction above 77%, a figure far beyond 36% in the TIE, 49% in the MTIE, and 68% in the EEENNS approach.

show abstract

“…where the coefficients q i are referred to as the ISPs in the cosine domain and a [16] is the last predictor coefficient. A Chebyshev polynomial is used to solve (4) and (5).…”

Section: Linear Prediction Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Search Complexity Improvement of Vector Quantization to Immittance Spectral Frequency Coefficients in AMR-WB Speech Codec

2016

View full text Add to dashboard Cite

show abstract

“…Over the years, much effort has been made to address the issue of computational load reduction for VQ codebook search, including those based on the equal-average equal-variance equal-norm nearest neighbor search (EEENNS) algorithms (10)(11)(12)(13)(14) and the triangular inequality elimination (TIE) algorithms. (15)(16)(17)(18) The EEENNS algorithm, derived from the equal-average nearest neighbor search (ENNS) and the equal-average equal-variance nearest neighbor search (EENNS) approaches, uses three significant features of a vector, i.e., the mean value, the variance, and the norm, as a three-level elimination criterion to reject impossible codewords. Thus, the aim of the computational load reduction can be reached.…”

Section: Introductionmentioning

confidence: 99%

High-efficiency Vector Quantization Codebook Search Algorithms for Extended Adaptive Multi-ratewideband Audio Coder

Yeh¹,

Lai²

2019

Sensors and Materials

View full text Add to dashboard Cite

The extended adaptive multi-rate-wideband (AMR-WB+) is a standard audio codec stipulated by the 3rd Generation Partnership Project (3GPP). It has been experimentally validated by 3GPP that an AMR-WB+ audio codec well outperforms others when encoding speech or audio signals at bitrates below 24 kbps, but at the cost of high computational load, particularly when performing the vector quantization (VQ) of immittance spectral frequency (ISF) coefficients. For this sake, by no means can an AMR-WB+ audio codec implemented on mobile devices meet the energy efficiency requirement. As a solution to this problem, in this paper, we present two high-efficiency triangular inequality elimination (TIE)-based algorithms for VQ codebook search. The first is referred to as the iterative TIE (ITIE) search algorithm, and the other is substantially the combined use of ITIE and the equal-average nearest neighbor search (ENNS) algorithm, both of which are subsequently applied to quantize the vectors of ISF coefficients. Most of the codewords are ruled out herein as the candidates using one-level and two-level rejection criteria, leading to a significantly reduced number of codeword searches but still maintaining the same coding quality. With a full search algorithm as a benchmark, this work shows a reduction in the total number of operations of more than 75.21%, a figure far beyond 60.23% using the TIE algorithm with a dynamic and an intersection mechanism (DI-TIE), 60.85% using ENNS, and 64.88% using the equal-average equal-variance equal-norm nearest neighbor search (EEENNS) algorithm. Moreover, this work can be implemented on handheld devices equipped with multiple sensing components, e.g., smartphones, to provide various multimedia and audio applications, and the energy saving requirement can be achieved as well.

show abstract

“…Conventionally, VQ conducts a full search to ensure a codeword best matched with an arbitrary input vector, but a full search requires an enormous computational load. Thus, as in a great volume of published studies [7][8][9][10][11][12][13][14][15][16], a continuous effort has been made to simplify the search complexity of an encoding process. These approaches are further classified into two types in terms of the way the complexity is simplified.…”

Section: Introductionmentioning

confidence: 99%

Efficient binary search space‐structured VQ encoder applied to a line spectral frequency quantisation in G.729 standard

et al. 2016

Self Cite

View full text Add to dashboard Cite

An efficient tree‐structured vector quantization using dynamic triangular inequality elimination

Cited by 4 publications

References 8 publications

A Search Complexity Improvement of Vector Quantization to Immittance Spectral Frequency Coefficients in AMR-WB Speech Codec

A Search Complexity Improvement of Vector Quantization to Immittance Spectral Frequency Coefficients in AMR-WB Speech Codec

High-efficiency Vector Quantization Codebook Search Algorithms for Extended Adaptive Multi-ratewideband Audio Coder

Efficient binary search space‐structured VQ encoder applied to a line spectral frequency quantisation in G.729 standard

Contact Info

Product

Resources

About