article · SHILAP Revista de lepidopterología · 2014
Linear Predictive Coding for Speech Compression
Yasir Saleem, Faisal Hayat, Arslan Iqbal
Cited by 0Open access
Abstract
Telecommunication industry is growing and different services are rapidly introduced by different competitors to attract the users. Speech communication and its quality conservation is the most prevalent and common service provided by almost all companies. The objective of this project is the development of a LPC (Linear Predictive Coding) based voice coder. Attributes for speech like pitch, voiced and unvoiced decision and silence were extracted and speech was modeled using LDR (Levinson Durbin Recursion) and SDA (Steepest Descent Algorithm). LPC filter is analyzed and its model is implemented. LPC's different attributes complexity, delay and bitrate are deliberated and tradeoffs are highlighted. The results were analyzed and quality of speech was determined using spectrograph and by listening to the synthesized speech. At the end quality of original and synthesized speech is discussed and shown graphically and a soft comparison between both above mentioned technique is also added.
Cite this paper
Saleem, Y., Hayat, F., & Iqbal, A. (2014). Linear Predictive Coding for Speech Compression. SHILAP Revista de lepidopterología.
Saleem, Yasir, et al. “Linear Predictive Coding for Speech Compression.” SHILAP Revista de lepidopterología, 2014.
Saleem, Yasir, Faisal Hayat, and Arslan Iqbal. 2014. “Linear Predictive Coding for Speech Compression.” SHILAP Revista de lepidopterología.
Saleem, Y., Hayat, F. and Iqbal, A. (2014) ‘Linear Predictive Coding for Speech Compression’, SHILAP Revista de lepidopterología.
@article{saleem2014linear,
title = {{Linear Predictive Coding for Speech Compression}},
author = {Saleem, Yasir and Hayat, Faisal and Iqbal, Arslan},
journal = {SHILAP Revista de lepidopterología},
year = {2014}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.