Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/3737
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Balint, Cornel | - |
dc.date.accessioned | 2021-07-13T08:29:34Z | - |
dc.date.available | 2021-07-13T08:29:34Z | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | Balint, Cornel. Efficient vector quantization of speech spectral parameters. Timişoara: Editura Politehnica, 2004 | en_US |
dc.identifier.uri | http://primo.upt.ro:1701/primo-explore/search?query=any,contains,Efficient%20vector%20quantization%20of%20speech%20spectral%20parameters&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo | - |
dc.description.sponsorship | Most low bit rate speech coders employ linear predictive coding (LPC) which models the short-term spectral information within each speech frame as an all-pole filter. In this paper, we examine various methods in order to efficiently encode spectral parameters. Two efficient methods for LSF coding are proposed, that exploit the interframe correlation exiting between LSF parameters. Using vector predictive coding techniques, transparent coding quality was obtained at 24 – 26 bit/frame. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Timişoara: Editura Politehnica | en_US |
dc.relation.ispartofseries | Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 1 (2004), p. 283-286 | - |
dc.subject | Speech coding | en_US |
dc.subject | LSF | en_US |
dc.subject | Vector coding | en_US |
dc.subject | Predictive coding | en_US |
dc.title | Efficient vector quantization of speech spectral parameters [articol] | en_US |
dc.type | Article | en_US |
Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
BUPT_Art_Balint_f.pdf | 576.91 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.