• The Journal of the Acoustical Society of Korea
• /
• v.26 no.3
• /
• pp.109-114
• /
• 2007

In this paper, we Propose a pyramid VQ to quantize the transform coefficients of TCX module for the audio improvement of AMR-WB+ codec. The Proposed pyramid VQ is compared to the $RE_8$ Lattice VQ used in the AMR-WB+ standard codec. demonstrating improvement 4% and 5.7%. respectively, in Mean Squared Error (MSE) and 3.3% and 4.7%. respectively, in Perceptual Evaluation of Audio Quality (PEAQ) by 8-dimensional and 16-dimensional Pyramid VQ.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.4
• /
• pp.333-339
• /
• 2004

This Paper proposes the vector quantizer-pyramid vector quantizer(VQ-PVQ) structure. Also both predictive structure and safety-net concept are combined into the VQ-PVQ to quantize the IPC parameter of wideband speech codec. The Performance is compared to the LPC vector quantizer used in the AMR-WB(ITU-T G.722.2). demonstrating reduction in both spectral distortion and encoding memory.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.345-346
• /
• 2007

In this paper, we propose a Pyramid VQ(PVQ) to quantize the transform coefficients of TCX module for the music improvement of AMR-WB+ codec. The proposed PVQ is compared to the $RE_8$ Lattice VQ used in the AHR-WB+ standard codec, demonstrating improvement 4% and 5.7%, respectively, in Mean Squared Error(MSE) and 3.3% and 4.7%, respectively, in Perceptual Evaluation of Audio Quality(PEAQ) by 8-dimensional and 16-dimensional Pyramid VQ.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.32-39
• /
• 2002

Vector quantization for image compression needs expensive encoding time to find the closest codeword to the input vector. This paper proposes a search algorithm for fast vector quantization encoding. Firstly, we derive a robust condition based on the efficient topological structure of the codebook to dramatically eliminate unnecessary matching operations from the search procedure. Then, we Propose a fast search algorithm using the elimination condition. Simulation results show that with little preprocessing and memory cost, the encoding time of the proposed algorithm is reduced significantly while the encoding quality remains the same with respect to the full search algorithm. It is also found that the Proposed algorithm outperforms the existing search algorithms.