WO1999003208A2 - Transmission system using a variable length encoder - Google Patents
Transmission system using a variable length encoder Download PDFInfo
- Publication number
- WO1999003208A2 WO1999003208A2 PCT/IB1998/000945 IB9800945W WO9903208A2 WO 1999003208 A2 WO1999003208 A2 WO 1999003208A2 IB 9800945 W IB9800945 W IB 9800945W WO 9903208 A2 WO9903208 A2 WO 9903208A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- symbols
- variable length
- sequences
- input
- sequence
- Prior art date
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 20
- 238000000034 method Methods 0.000 claims description 10
- 239000000872 buffer Substances 0.000 description 10
- 230000003321 amplification Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000003199 nucleic acid amplification method Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
- H03M7/42—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
- H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
Definitions
- the present invention is related to a transmission system comprising a transmitting arrangement with a variable length encoder for encoding sequences of input symbols into variable length encoded sequences, the transmitting arrangement further comprises a transmitter for transmitting said variable length encoded sequences via a transmission medium to a receiver, the receiver comprising a variable length decoder for decoding the variable length encoded symbols into decoded sequences of symbols.
- the present invention is also related to a transmitter, a receiver, a variable length encoder, a variable length decoder, a variable length encoding method, a variable length decoding method, a tangible medium comprising a computer program for executing said methods and a signal comprising variable length encoded symbols.
- a transmission system according to the preamble is known from the book Information Theory and Reliable Communication" by Robert G. Gallager, Chapter 3, Coding for Discrete Sources, pp. 38-70, ISBN 471 29048 3.
- Transmission systems according to the preamble are used for transmitting sequences of symbols having unequal probabilities. Such sequences can be transmitted more efficiently by using short encoded sequences for input sequences having a high probability, and using longer encoded sequences for input sequences having a lower probability.
- variable length codes are the well known Morse code and the Huffman code.
- the use of variable length coding results in a decreased number of symbols that has to be transmitted for transporting a particular sequence of input symbols.
- the number of symbols required to transport a particular sequence of input symbols is substantially larger than the uncoded message. This can happen if the sequence of input symbols comprises symbols having a low probability. In such a case practical problems can arise such as overflow of buffers or the impossibility to put the encoded message in a frame having only a limited space available for it.
- the object of the present invention is to provide a transmission system according to the preamble in which the above mentioned problems do not occur anymore, without increasing the size of buffers or the available size in a frame.
- the transmission system is characterized in that the transmitting arrangement is arranged for passing the sequence of input symbols to the transmitter if the combined length of a number of variable length encoded sequences exceeds a predetermined value, said number being larger or equal to one, and in that the receiver is arranged for passing a received sequence of symbols undecoded to an output if said combined length of a number of variable length encoded sequences exceeds said predetermined value.
- variable length encoded sequences By determining the length of the variable length encoded sequences, and by transmitting the input sequences if the length of the variable length encoded sequences exceeds a predetermined value, it is possible to limit the length of the transmitted sequence of symbols to the length of the input sequences. Therewith the length of the transmitted sequences of symbols is bounded by a predetermined value.
- An embodiment of the invention is characterized in that said predetermined value is the combined length of the sequences of input symbols.
- said predetermined length is equal to the length of the sequence of input symbols or equal to the combined length of a plurality of input symbols, it is obtained that the length of the sequences of symbols is limited, and that it is ensured that the transmitter is always able to store or transmit its information in the available buffer or space in a transmission frame respectively.
- a further embodiment of the invention is characterized in that the transmitting arrangement is arranged for transmitting an indicator indicating that at least one input sequence of symbols is transmitted instead of the corresponding variable length encoded sequence of symbols, and in that the receiver is arranged to pass a received sequence of symbols undecoded to its output or to pass a received sequence of symbols to an input of the variable length decoder.
- Fig. 1 a transmission system according to a first embodiment of the invention
- FIG. 2 an alternative embodiment of the encoder 5 for use in a transmission system according to the invention.
- Fig. 3 a Huffman decoding tree to be used in the Huffman decoder used in the present invention
- a transmitter 2 comprises an encoder 5 for encoding sequences of input symbols.
- Said sequences of input symbols comprise words with a predetermined length, which can be different for subsequent words.
- the input words are applied to a buffer 8 in the encoder 5.
- the words stored in the buffer 8 are subsequently applied to a variable length encoder, which is here a Huffman encoder 10.
- the Huffman encoder 10 can be realized by a lookup table which supplies the Huffman encoded word corresponding to the input word at its output.
- the table supplies also an indication of the length of the Huffman encoded word to its output.
- An example of such a lookup table is given below for a four bit input word.
- the length of the different Huffman encoded codewords differs considerably.
- the input code word and the Huffman encoded word at the output of the Huffman encoder 10 are applied to a selector 12.
- the part of the output signal of the Huffman encoder representing the length of the currently Huffman encoded word is also applied to a comparator which compares this length with the predetermined value.
- An output signal of the comparator 10 is applied to an input of the selector 12 and a multiplexer 14. If the Huffman encoded sequence is larger than the predetermined value, the selector 12 is instructed to pass the input word of the Huffman encoder to its output.
- the output signal of the Huffman encoder 10 is passed to the output of the selector 12.
- the output signal of the comparator 3 is included as a "Huffman indicator" in the output signal of the multiplexer 14 to enable a receiver to determine whether the received words have to be decoded or not. It is observed that the function of the Huffman encoder 10, the comparator 3 and the selector 12 can be implemented by a single table. This table is presented below.
- the length of each output word is also stored in the table. It is observed that in the presented example one table is used. However it is possible that the properties (length and probabilities) of subsequent input words differ significantly. In such a case it is required to use different coding tables for subsequent input words.
- the output signal of the multiplexer 14 is applied to transmit means 16 which are arranged to transmit the output signal of the multiplexer 14 to via a transmission medium 4 to a receiver 6.
- the tasks of the transmit means 16 involve channel coding and modulation.
- the input signal is processed by receive means 18.
- the operations performed by the receive means comprise amplification, demodulation and channel decoding.
- the demultiplexer 20 separates the "Huffman indicator” and the reconstructed output signal of the selector 12. The latter is applied to an input of a Huffman decoder 22 and to an input of a selector 24.
- the output signal of the Huffman decoder 22 is applied to a further input of the selector 24. Dependent on the value of the "Huffman indicator" the (undecoded) output signal of the demultiplexer 20 or the Huffman decoded output signal of the Huffman decoder is passed to the output of the selector 24.
- the encoder 5 is arranged to compare the sum of the lengths of a plurality of Huffman encoded words with a predetermined value. This can be useful if a plurality of words have to be transmitted in a limited amount of space in a frame. By comparing said sum of lengths with a predetermined value, which can be the sum of the lengths of the uncoded words, it is possible to decide whether the plurality of words is completely transmitted as Huffman encoded words or as uncoded words.
- the buffer 30 receives the input words and passes them to an input of a buffer
- the output signal of the Huffman encoder 32 is passed to a length counter 38 and to a buffer 36.
- the length counter 38 counts the accumulated length of the Huffman encoded codewords over a certain number of encoded codewords. This number can e.g. be the number of codewords which can be a number of words that has to be transmitted in a frame.
- the length counter 38 compares the accumulated length with the predetermined value and decides whether the words are to be transmitted in Huffman encoded form or that they are to be transmitted in uncoded form. This decision is passed to the selector 40 and to the multiplexer 42. The selector 40 presents, in dependence of the decision of the length counter
- the output signal of the selector 40 multiplexed with the output signal of the length counter 38 to obtain the output signal of the encoder 5.
- the output signal of the length counter 38 is included in the output signal as "Huffman indicator".
- a Huffman tree of the Huffman code as presented above is shown.
- the Huffman tree comprises one starting node A, a plurality of intermediate nodes B to P and a plurality of end nodes 0 to 15.
- Each node is stored in a data structure in which the type of node is stored.
- pointers to subsequent nodes are stored together with the value of the bit corresponding to a transition from said node to said subsequent nodes is stored.
- the value of the corresponding decoded word is stored.
- the decoding of the Huffman encoded word "1101100" corresponding to the input word "1010" (decimal 10).
- the Huffman encoded word is processed from left to right.
- the first bit (being here "1") is read from the encoded word. Subsequently it is checked which subsequent node corresponds to the value of "1" of the current bit. From the information stored in the data structure representing node A, it is found that node B is the subsequent node. The pointer stored in the data structure representing node A is used to find the data structure to represent node B.
- node B is checked using the information stored in the corresponding data structure. Because B is an intermediate node, the next bit (being here equal to
- node 10 is the subsequent node corresponding to the final bit value "0". from the data structure representing node 10, it is found that node 10 is a final node.
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP98923028A EP0925651B1 (en) | 1997-07-11 | 1998-06-18 | Transmission system using a variable length encoder |
JP50835999A JP3960629B2 (en) | 1997-07-11 | 1998-06-18 | Transmission system using variable length encoder |
DE69826971T DE69826971T2 (en) | 1997-07-11 | 1998-06-18 | TRANSMISSION SYSTEM WITH COORDERS OF VARIABLE LENGTH |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP97202165.3 | 1997-07-11 | ||
EP97202165 | 1997-07-11 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO1999003208A2 true WO1999003208A2 (en) | 1999-01-21 |
WO1999003208A3 WO1999003208A3 (en) | 1999-04-01 |
Family
ID=8228543
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IB1998/000945 WO1999003208A2 (en) | 1997-07-11 | 1998-06-18 | Transmission system using a variable length encoder |
Country Status (7)
Country | Link |
---|---|
US (1) | US6208274B1 (en) |
EP (1) | EP0925651B1 (en) |
JP (1) | JP3960629B2 (en) |
KR (1) | KR100635794B1 (en) |
CN (1) | CN1126270C (en) |
DE (1) | DE69826971T2 (en) |
WO (1) | WO1999003208A2 (en) |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7106794B2 (en) * | 2000-08-11 | 2006-09-12 | Broadcom Corporation | System and method for Huffman shaping in a data communication system |
US6690306B1 (en) * | 2000-11-03 | 2004-02-10 | Intel Corporation | Method of generating a length-constrained huffman code |
WO2003019791A2 (en) * | 2001-08-23 | 2003-03-06 | Nortel Networks Limited | System and method for reducing the peak power in multi-carrier modulation |
EP2006840B1 (en) | 2002-09-04 | 2012-07-04 | Microsoft Corporation | Entropy coding by adapting coding between level and run-length/level modes |
EP1509046A1 (en) * | 2003-08-22 | 2005-02-23 | Alcatel | Error resistant encoded image and video transmission using variable length codes (VLC) |
DE602004020936D1 (en) | 2004-06-07 | 2009-06-10 | Agency Science Tech & Res | SYSTEMS AND METHOD FOR SCALABLE CODING AND DECODING OF DATA |
US6987468B1 (en) * | 2004-10-29 | 2006-01-17 | Microsoft Corporation | Lossless adaptive encoding and decoding of integer data |
US8707139B2 (en) * | 2006-10-18 | 2014-04-22 | Kencast, Inc. | Systems, methods, apparatus, and computer program products for providing forward error correction with low latency |
US8179974B2 (en) | 2008-05-02 | 2012-05-15 | Microsoft Corporation | Multi-level representation of reordered transform coefficients |
US8406307B2 (en) | 2008-08-22 | 2013-03-26 | Microsoft Corporation | Entropy coding/decoding of hierarchically organized data |
WO2010133763A1 (en) * | 2009-05-19 | 2010-11-25 | Nokia Corporation | Method for variable length coding and apparatus |
CN103269257B (en) * | 2013-05-13 | 2016-08-24 | 杰发科技(合肥)有限公司 | A kind of method detecting variable-length encoding code stream mistake and decoding and error detector element |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4706265A (en) * | 1984-10-30 | 1987-11-10 | Nec Corporation | Code converting system and method for band compression of digital signals |
US4955066A (en) * | 1989-10-13 | 1990-09-04 | Microsoft Corporation | Compressing and decompressing text files |
US5220325A (en) * | 1991-03-28 | 1993-06-15 | At&T Bell Laboratories | Hierarchical variable length decoder for digital video data |
EP0707425A2 (en) * | 1994-10-13 | 1996-04-17 | Oki Electric Industry Co., Ltd. | Methods of coding and decoding moving-picture signals, using self-resynchronizing variable-length codes |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3185824A (en) * | 1961-10-24 | 1965-05-25 | Ibm | Adaptive data compactor |
US3394352A (en) * | 1965-07-22 | 1968-07-23 | Electronic Image Systems Corp | Method of and apparatus for code communication |
JPS63181586A (en) * | 1987-01-23 | 1988-07-26 | Nec Corp | Variable length encoding circuit |
JPS63290021A (en) * | 1987-05-22 | 1988-11-28 | Nec Corp | Variable length coding circuit |
JPS6412621A (en) * | 1987-07-07 | 1989-01-17 | Nec Corp | Variable length decoding circuit |
US5177480A (en) * | 1988-12-07 | 1993-01-05 | British Telecommunications Public Limited Company | Data communication having transmitter-controlled mode switching from compressed-to-transparent mode but local synchronous transmitter-controlled and receiver-controlled mode switching from transparent-to-compressed mode |
-
1998
- 1998-06-18 DE DE69826971T patent/DE69826971T2/en not_active Expired - Fee Related
- 1998-06-18 EP EP98923028A patent/EP0925651B1/en not_active Expired - Lifetime
- 1998-06-18 WO PCT/IB1998/000945 patent/WO1999003208A2/en not_active Application Discontinuation
- 1998-06-18 KR KR1019997001960A patent/KR100635794B1/en not_active IP Right Cessation
- 1998-06-18 CN CN98801285A patent/CN1126270C/en not_active Expired - Fee Related
- 1998-06-18 JP JP50835999A patent/JP3960629B2/en not_active Expired - Fee Related
- 1998-07-10 US US09/113,964 patent/US6208274B1/en not_active Expired - Lifetime
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4706265A (en) * | 1984-10-30 | 1987-11-10 | Nec Corporation | Code converting system and method for band compression of digital signals |
US4955066A (en) * | 1989-10-13 | 1990-09-04 | Microsoft Corporation | Compressing and decompressing text files |
US5220325A (en) * | 1991-03-28 | 1993-06-15 | At&T Bell Laboratories | Hierarchical variable length decoder for digital video data |
EP0707425A2 (en) * | 1994-10-13 | 1996-04-17 | Oki Electric Industry Co., Ltd. | Methods of coding and decoding moving-picture signals, using self-resynchronizing variable-length codes |
Also Published As
Publication number | Publication date |
---|---|
JP2001500350A (en) | 2001-01-09 |
CN1237291A (en) | 1999-12-01 |
KR100635794B1 (en) | 2006-10-19 |
DE69826971T2 (en) | 2005-11-17 |
KR20000068519A (en) | 2000-11-25 |
EP0925651B1 (en) | 2004-10-13 |
US6208274B1 (en) | 2001-03-27 |
JP3960629B2 (en) | 2007-08-15 |
DE69826971D1 (en) | 2004-11-18 |
CN1126270C (en) | 2003-10-29 |
WO1999003208A3 (en) | 1999-04-01 |
EP0925651A2 (en) | 1999-06-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108880556B (en) | LZ 77-based lossless data compression method, error code recovery method, encoder and decoder | |
KR100489908B1 (en) | Digital information signal encoding method and apparatus | |
US6445314B1 (en) | System and method for the decoding of variable length codes | |
KR101171697B1 (en) | System and method for compressing a stream of integer-valued data | |
US6208274B1 (en) | Transmission system using a variable length encoder | |
EP0577330A2 (en) | Improved variable length decoder | |
CN102460976B (en) | For the method and apparatus of variable length code | |
US6225922B1 (en) | System and method for compressing data using adaptive field encoding | |
CN1675842B (en) | Method and apparatus arithmetic coding, and related decoding method | |
US6292115B1 (en) | Data compression for use with a communications channel | |
JP3080149B2 (en) | Pattern encoding method and decoding method, and encoding apparatus and decoding apparatus using the method | |
CN102077468A (en) | Method for a hybrid Golomb-Elias Gamma coding | |
KR100636370B1 (en) | Apparatus and method for coding using bit-precision, and apparatus and method for decoding according to the same | |
US5649074A (en) | Raster image data compression method and system | |
US6049633A (en) | Adaptive arithmetic codec method and apparatus | |
CN113541871B (en) | Method for generating code words and coder-decoder | |
US6101281A (en) | Method for improving data encoding and decoding efficiency | |
US6573847B1 (en) | Multi-table mapping for huffman code decoding | |
CN116527775A (en) | Data compression techniques using partition and don't care bit cancellation | |
EP3767457A1 (en) | Data communication | |
JPS62108663A (en) | Entropy recording system | |
US20020021233A1 (en) | Data processing apparatus and method | |
US5864308A (en) | System, coding section, arrangement, coding apparatus, and method | |
KR20180060824A (en) | New Fountain Codes with Improved Intermediate Recovery in broadcasting and operating method thereof | |
KR101726546B1 (en) | List successive cancellation decoder having efficiently hardware size |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 98801285.5 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): CN JP KR |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1998923028 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1019997001960 Country of ref document: KR |
|
ENP | Entry into the national phase |
Ref document number: 1999 508359 Country of ref document: JP Kind code of ref document: A |
|
AK | Designated states |
Kind code of ref document: A3 Designated state(s): CN JP KR |
|
AL | Designated countries for regional patents |
Kind code of ref document: A3 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWP | Wipo information: published in national office |
Ref document number: 1998923028 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1019997001960 Country of ref document: KR |
|
WWG | Wipo information: grant in national office |
Ref document number: 1998923028 Country of ref document: EP |
|
WWR | Wipo information: refused in national office |
Ref document number: 1019997001960 Country of ref document: KR |