loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC '95)
Constraining the size of the instantaneous alphabet in trellis quantizers
Snowbird, Utah
March 28-March 30
ISBN: 0-8186-7012-6
M.F. Larsen, Brigham Young Univ., Provo, UT, USA
R.L. Frost, Brigham Young Univ., Provo, UT, USA
A method is developed for decreasing the computational complexity of a trellis quantizer (TQ) encoder. We begin by developing a rate-distortion theory under a constraint on the average instantaneous number of quanta considered. This constraint has practical importance: in a TQ, the average instantaneous number of quanta is exactly the average number of multiplies required at the encoder. The theory shows that if the conditional probability of each quanta is restricted to a finite region of support, the instantaneous number of quanta considered can be made quite small at little or no cost in SQNR performance. Simulations of TQs confirm this prediction. This reduction in complexity makes practical the use of model-based TQs (MTQs), which had previously been considered computationally unreasonable. For speech, performance gains of several dB SQNR over adaptive predictive schemes at a similar computational complexity are obtained using only a first-order MTQ.
Index Terms:
quantisation (signal); trellis codes; computational complexity; rate distortion theory; speech coding; probability; instantaneous alphabet; model based trellis quantizers; computational complexity; encoder; rate-distortion theory; size constraint; conditional probability; average instantaneous number of quanta; simulations; speech coding; SQNR; first-order MTQ
Citation:
M.F. Larsen, R.L. Frost, "Constraining the size of the instantaneous alphabet in trellis quantizers," dcc, pp.23, Data Compression Conference (DCC '95), 1995
Usage of this product signifies your acceptance of the Terms of Use.