Speech compression exploiting linear prediction coefficients codebook and hamming correction code algorithm

  • Authors:
  • Islam Amro;Raed Abu Zitar;Hussein Bahadili

  • Affiliations:
  • Al-Quds Open University, Al-Quds, Palestine;New York Institute of Technology, Amman, Jordan;Department of Computer Information Sciences, Arab Academy of Business and Financial Science, Amman, Jordan

  • Venue:
  • International Journal of Speech Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a replacement algorithm for Linear Prediction Coefficients (LPC) along with Hamming Correction Code based Compressor (HCDC) algorithms are investigated for speech compression. We started with an CELP system with order 12 and with Discrete Cosine Transform (DCT) based residual excitation. Forty coefficients with transmission rate of 5.14 kbps were first used. For each frame of the testing signals we applied a multistage HCDC, we tested the compression performance for parities from 2 to 7, we were able to achieve compression only at parity 4. This rate reduction was made with no compromise in the original CELP signal quality since compression is lossless. The compression approach is based on constructing dynamic reflection coefficients codebook, this codebook is constructed and used simultaneously using a certain store/retrieve threshold. The initial linear prediction codec we used is excited by a discrete cosine transform (DCT) residual, the results were tested using the MOS and SSNR, we had acceptable ranges for the MOS (average 3.6), and small variations of the SSNR (卤5 db).