Open AccessResearch on Speech Codec with Compression using Legendre Polynomials
Author(s) -
Arun Ananthanarayanan,
S. Ananthi,
K. A. Padmanabhan,
Bhagwan Shree Ram
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.e1061.0785s319
Subject(s) - computer science , codebook , legendre polynomials , algorithm , speech coding , encode , speech recognition , narrowband , computation , huffman coding , data compression , mathematics , telecommunications , mathematical analysis , biochemistry , chemistry , gene
Speech Codecs have been developed in several forms over the past 30 years and are used in Cellular digital telephony. Based on the throat excitation pulses and mouth cavity filter model, all the methods aim to encode the speech samples without much loss of clarity. The complexity of the methods using codebook searching, filtering and matrix inversion, all need heavy computations, leading to timing constraints. After describing a tutorial elucidating the essentials of the present methods, a different direct method of encoding, suggested by the spherical harmonic oscillator functions of Legendre, is introduced. Its performance and simplicity are such that the same may find its applications soon.