DocumentCode :
3227089
Title :
Variable Length Coding for Fixed Rate, Low Latency, Low Complexity Compression Applications
Author :
Shoa, Alireza
Author_Institution :
Sigma Designs Inc., Burlington
fYear :
2008
fDate :
25-27 March 2008
Firstpage :
544
Lastpage :
544
Abstract :
In order to maximize coding efficiency the coding algorithm must ensure the probability of encoding a sequence of n quantized symbols at a rate smaller than R is maximized (i.e. there is no need to increase the quantization step size). This optimization problem is different from the one solved by algorithms like Huffman coding in which it is assumed that a large sequence of symbols are being coded. We proposed a new coding algorithm that solves the above optimization problem.
Keywords :
data compression; image coding; variable length codes; Huffman coding; image compression; low complexity compression applications; variable length coding; Algorithm design and analysis; Bit rate; Compression algorithms; Data compression; Delay; Image coding; Image processing; Partial response channels; Process design; Quantization; Variable length coding; fixed rate; low latency compression;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 2008. DCC 2008
Conference_Location :
Snowbird, UT
ISSN :
1068-0314
Print_ISBN :
978-0-7695-3121-2
Type :
conf
DOI :
10.1109/DCC.2008.51
Filename :
4483371
Link To Document :
بازگشت