Empirical Lower Bound on the Bitrate for the Transparent Memoryless Coding of Wideband LPC Parameters

Loading...
Thumbnail Image
File version
Author(s)
So, Stephen
Paliwal, Kuldip K
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Alex B. Gershman

Date
2006
Size

166291 bytes

16905 bytes

File type(s)

application/pdf

text/plain

Location
License
Abstract

In this letter, we determine empirical lower bounds on the bitrate required to transparently code linear predictive coding (LPC) parameters derived from wideband speech. This is achieved via extrapolation of the operating distortion-rate curve of an unconstrained vector quantizer that is trained using artificial vectors generated by a Gaussian mixture model. Memoryless coding is considered and two competing LPC parameter representations are investigated. Our results show a lower bound of 31 bits/frame when assuming high-rate linearity in the operating distortion-rate curve and 35 bits/frame for an exponential curve.We also evaluate a recent quantization scheme and compare its performance against this lower bound.

Journal Title

IEEE Signal Processing Letters

Conference Title
Book Title
Edition
Volume

13

Issue

9

Thesis Type
Degree Program
School
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Item Access Status
Note
Access the data
Related item(s)
Subject

Communications engineering

Electronics, sensors and digital hardware

Computer vision and multimedia computation

Persistent link to this record
Citation
Collections