RU94004747A - Method for compressing and loosening fixed-length elementary streams - Google Patents

Method for compressing and loosening fixed-length elementary streams

Info

Publication number
RU94004747A
RU94004747A RU94004747/09A RU94004747A RU94004747A RU 94004747 A RU94004747 A RU 94004747A RU 94004747/09 A RU94004747/09 A RU 94004747/09A RU 94004747 A RU94004747 A RU 94004747A RU 94004747 A RU94004747 A RU 94004747A
Authority
RU
Russia
Prior art keywords
dictionaries
fixed
fixed length
input source
length
Prior art date
Application number
RU94004747/09A
Other languages
Russian (ru)
Inventor
Д.А. Железцов
Original Assignee
Д.А. Железцов
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Д.А. Железцов filed Critical Д.А. Железцов
Priority to RU94004747/09A priority Critical patent/RU94004747A/en
Publication of RU94004747A publication Critical patent/RU94004747A/en

Links

Abstract

FIELD: code conversion; reduction of data redundancy in complex data transmission systems. SUBSTANCE: method involves introduction of the following operations; storage and correction of repetition frequencies of fixed-length elementary streams in exchange dictionaries as they arrive from input source; sorting out of location of each fixed-length elementary stream by decrease in repetition frequency in exchange dictionaries, probability of arrival of all fixed-length elementary streams being considered to be equal and their repetition rate being "1"; periodic and simultaneous correction of location codes of each fixed-length elementary stream in exchange dictionaries, Huffman code being used as location code. EFFECT: elimination of drawbacks typical of prototype, including reduction of redundancy of data streams with due account of probability properties of input source. 2 cl

Claims (1)

Изобретение относится к преобразованию кодов и может быть использовано для уменьшения избыточности информации в системах передачи данных сложных информационных систем. Целью изобретения является уменьшение избыточности двоичных информационных потоков данных с учетом вероятностных свойств входного источника. Поставленная цель достигается путем введения операций запоминания и корректировки частот повторения элементарных потоков фиксированной длины в словарях перестановок по мере их поступления от входного источника, сортировки местоположения каждого элементарного потока фиксированной длины по убыванию частот повторения в словарях перестановок, причем в начальном состоянии считается что вероятности появления всех элементарных потоков фиксированной длины одинаковы и их частоты повторения равны 1, периодической и одновременной корректировки кодов местоположения каждого элементарного потока фиксированной длины в словарях перестановок, причем в качестве кодов местоположения служат коды Хаффмана.The invention relates to code conversion and can be used to reduce redundancy of information in data transmission systems of complex information systems. The aim of the invention is to reduce the redundancy of binary information data streams taking into account the probabilistic properties of the input source. This goal is achieved by introducing the operations of storing and adjusting the repetition frequencies of elementary flows of a fixed length in permutation dictionaries as they arrive from an input source, sorting the locations of each elementary stream of fixed length in decreasing frequency of repetitions in a dictionary of permutations, and in the initial state it is considered that the probabilities of all elementary flows of fixed length are the same and their repetition frequencies are equal to 1, periodic and simultaneous correction location codes for each elementary stream of fixed length in permutation dictionaries, moreover, Huffman codes are used as location codes.
RU94004747/09A 1994-02-11 1994-02-11 Method for compressing and loosening fixed-length elementary streams RU94004747A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
RU94004747/09A RU94004747A (en) 1994-02-11 1994-02-11 Method for compressing and loosening fixed-length elementary streams

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
RU94004747/09A RU94004747A (en) 1994-02-11 1994-02-11 Method for compressing and loosening fixed-length elementary streams

Publications (1)

Publication Number Publication Date
RU94004747A true RU94004747A (en) 1996-07-27

Family

ID=48447163

Family Applications (1)

Application Number Title Priority Date Filing Date
RU94004747/09A RU94004747A (en) 1994-02-11 1994-02-11 Method for compressing and loosening fixed-length elementary streams

Country Status (1)

Country Link
RU (1) RU94004747A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7934137B2 (en) 2006-02-06 2011-04-26 Qualcomm Incorporated Message remapping and encoding

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7934137B2 (en) 2006-02-06 2011-04-26 Qualcomm Incorporated Message remapping and encoding

Similar Documents

Publication Publication Date Title
EP1057269B1 (en) Block-wise adaptive statistical data compressor
US4876541A (en) Stem for dynamically compressing and decompressing electronic data
US5973630A (en) Data compression for use with a communications channel
Núñez et al. Gbit/s lossless data compression hardware
US5528628A (en) Apparatus for variable-length coding and variable-length-decoding using a plurality of Huffman coding tables
CA2438309C (en) Method and apparatus for adaptive data compression
US6633242B2 (en) Entropy coding using adaptable prefix codes
AU684013B2 (en) Compact source coding tables for encoder/decoder system
US6100824A (en) System and method for data compression
US5561690A (en) High speed variable length code decoding apparatus
US5877711A (en) Method and apparatus for performing adaptive data compression
EP0663730B1 (en) Apparatus for decoding variable length codes
JPH09214353A (en) Data compressor and data decoder
Langdon et al. A double-adaptive file compression algorithm
KR20020075889A (en) Data compression having more effective compression
US5663725A (en) VLC decoder with sign bit masking
RU94004747A (en) Method for compressing and loosening fixed-length elementary streams
Yang et al. Universal lossless coding of sources with large and unbounded alphabets
Weiss et al. Putting data on a diet
JPH08223055A (en) Variable-length cord decoder
Sasilal et al. Arithmetic coding-A reliable implementation
US6714145B1 (en) Method and apparatus for integer-based encoding and decoding of bits
JPH08265165A (en) High-speed variable-length code decoder
RU2080738C1 (en) Method for compression of information signals
KR100275267B1 (en) High speed variable length code decoding apparatus