Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Generic coder for binary sources: the M-coder

Generic coder for binary sources: the M-coder

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

A new entropy coder, the M-coder, based on the classical TRL code, is proposed. Unlike the ATRL coder, which is blockwise adaptive, the M-coder is a bit by bit adaptive coder. To accomplish this, the M-coder requires a probability estimation scheme for the symbols to be coded. In this way, the M-coder can be compared to the Q-coder, with an easier implementation.

Inspec keywords: runlength codes; source coding; adaptive codes; entropy codes

Other keywords: binary sources; probability estimation scheme; M-coder; TRL code; generic coder; truncated runlength code; symbol coding; bit by bit adaptive coder; entropy coder

Subjects: Codes

References

    1. 1)
      • P. Elias , N. Abramson . (1963) Information theory and coding, .
    2. 2)
      • H. Tanaka , A. Leon-Garcia . Efficient run-length encoding. IEEE Trans. , 6 , 880 - 890
    3. 3)
      • Queluz, M.P., Marichal, X., Macq, B.: `Efficient entropy coding of tree data structures', Int. Picture Coding Symp., 1994, Sacramento, p. 478–481.
    4. 4)
      • J. Mitchell , W. Pennebaker . Probability estimation of the Q-coder. IBM J. Res. Develop. , 737 - 752
    5. 5)
      • Ohnishi, R., Ueno, Y., Ono, F.: `Optimization of facsimile data compression', National Telecommunications Conf., 1977.
    6. 6)
      • W.B. Pennebaker , J.L. Mitchell , G.G. Langdon , R.B. Arps . An overview of the basic principles of the Q-coder adaptive binary arithmeticcoder. IBM J. Res. Develop. , 717 - 726
    7. 7)
      • Boliek, M., Allen, J.D., Schwartz, E.L.: `Parallel entropy using multiple coders', Data Compression Conf., 1994, Snowbird.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19950358
Loading

Related content

content/journals/10.1049/el_19950358
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address