DocumentCode
2076783
Title
Turing complexity of fixed-rate quantization
Author
Hui, Dennis
Author_Institution
Adv. Dev. & Res., Ericsson Inc., Research Triangle Park, NC, USA
fYear
1998
fDate
22-26 Jun 1998
Firstpage
20
Lastpage
21
Abstract
The rate of increase of quantization complexity, as the rate of quantization increases, is investigated under a Turing machine framework. It is shown that the problem of asymptotically optimal scalar quantization has polynomial encoding complexity if the distribution function corresponding to the one-third power of the source density is polynomially computable with high probability
Keywords
Turing machines; computational complexity; optimisation; probability; quantisation (signal); source coding; Turing complexity; Turing machine; asymptotically optimal scalar quantization; distribution function; fixed-rate quantization; high probability; lossy source coding; polynomial encoding complexity; quantization complexity; source density; Costs; Distributed computing; Distribution functions; Magnetic heads; Performance loss; Polynomials; Quantization; Rate distortion theory; Source coding; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 1998
Conference_Location
Killarney
Print_ISBN
0-7803-4408-1
Type
conf
DOI
10.1109/ITW.1998.706383
Filename
706383
Link To Document