RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING

Task of entropy group coding of data for reduce of its statistical redundancy on base of recursive group coding is considered. Recursive group coding provides effective coding of symbols of large alphabets. It is fast and in some cases more effective alternative of such methods as arithmetical codin...

Full description

Bibliographic Details
Main Authors: Н. В. Кожемякина, Н. Н. Пономаренко
Format: Article
Language:English
Published: National Aerospace University «Kharkiv Aviation Institute» 2016-06-01
Series:Радіоелектронні і комп'ютерні системи
Subjects:
Online Access:http://nti.khai.edu/ojs/index.php/reks/article/view/921
id doaj-998f32c5dd6b45fb8deebd2be3e301aa
record_format Article
spelling doaj-998f32c5dd6b45fb8deebd2be3e301aa2020-11-25T02:23:47ZengNational Aerospace University «Kharkiv Aviation Institute»Радіоелектронні і комп'ютерні системи1814-42252663-20122016-06-01042226964RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELINGН. В. КожемякинаН. Н. ПономаренкоTask of entropy group coding of data for reduce of its statistical redundancy on base of recursive group coding is considered. Recursive group coding provides effective coding of symbols of large alphabets. It is fast and in some cases more effective alternative of such methods as arithmetical coding and Huffman coding. However applications of recursive group coding are restricted by usage of statistical frequency modeling. For such modeling frequencies (or probabilities) of symbols are calculated for entire text as well as information about size sand contents of groups are stored in compressed file. In this work a modification of recursive group coding are proposed which is able effectively compress texts statistically heterogeneous by frequency characteristics. A model for synthesizing of test texts is considered. Also a new metric for estimates of uniformity of a given text is proposed. It is shown that for considered test texts the proposed modifications of recursive group coding provide up to 65% less compressed data size than conventional method.http://nti.khai.edu/ojs/index.php/reks/article/view/921рекурсивне групове кодування, ентропійне кодування, арифметичне кодування, кодування хафмана.
collection DOAJ
language English
format Article
sources DOAJ
author Н. В. Кожемякина
Н. Н. Пономаренко
spellingShingle Н. В. Кожемякина
Н. Н. Пономаренко
RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING
Радіоелектронні і комп'ютерні системи
рекурсивне групове кодування, ентропійне кодування, арифметичне кодування, кодування хафмана.
author_facet Н. В. Кожемякина
Н. Н. Пономаренко
author_sort Н. В. Кожемякина
title RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING
title_short RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING
title_full RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING
title_fullStr RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING
title_full_unstemmed RECURSIVE GROUP CODING WITH DYNAMIC FREQUENCY MODELING
title_sort recursive group coding with dynamic frequency modeling
publisher National Aerospace University «Kharkiv Aviation Institute»
series Радіоелектронні і комп'ютерні системи
issn 1814-4225
2663-2012
publishDate 2016-06-01
description Task of entropy group coding of data for reduce of its statistical redundancy on base of recursive group coding is considered. Recursive group coding provides effective coding of symbols of large alphabets. It is fast and in some cases more effective alternative of such methods as arithmetical coding and Huffman coding. However applications of recursive group coding are restricted by usage of statistical frequency modeling. For such modeling frequencies (or probabilities) of symbols are calculated for entire text as well as information about size sand contents of groups are stored in compressed file. In this work a modification of recursive group coding are proposed which is able effectively compress texts statistically heterogeneous by frequency characteristics. A model for synthesizing of test texts is considered. Also a new metric for estimates of uniformity of a given text is proposed. It is shown that for considered test texts the proposed modifications of recursive group coding provide up to 65% less compressed data size than conventional method.
topic рекурсивне групове кодування, ентропійне кодування, арифметичне кодування, кодування хафмана.
url http://nti.khai.edu/ojs/index.php/reks/article/view/921
work_keys_str_mv AT nvkožemâkina recursivegroupcodingwithdynamicfrequencymodeling
AT nnponomarenko recursivegroupcodingwithdynamicfrequencymodeling
_version_ 1724857184226902016