WO2002095955A1 - Method of decoding a variable-length codeword sequence - Google Patents
Method of decoding a variable-length codeword sequence Download PDFInfo
- Publication number
- WO2002095955A1 WO2002095955A1 PCT/IB2002/001878 IB0201878W WO02095955A1 WO 2002095955 A1 WO2002095955 A1 WO 2002095955A1 IB 0201878 W IB0201878 W IB 0201878W WO 02095955 A1 WO02095955 A1 WO 02095955A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- states
- state
- group
- code
- bit time
- Prior art date
Links
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
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/3944—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes for block codes, especially trellis or lattice decoding thereof
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/3955—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using a trellis with a reduced state space complexity, e.g. M-algorithm or T-algorithm
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/6312—Error control coding in combination with data compression
- H03M13/6318—Error control coding in combination with data compression using variable length codes
Definitions
- the present invention relates to a method of source decoding variable-length codeword sequences, said source decoding being based on an associated state diagram comprising a plurality of states and on a code, a state being a node in the graph through which possible decoded codeword sequences may pass.
- the invention also relates to a decoder, said decoder utilizing said method.
- Such a method may be used in any system using variable-length codes like, for example, a video or audio communication system.
- a video communication system typically comprises a source encoding system, a channel and a source decoding system.
- Said source encoding system generates a codeword sequence and transmits it through said channel to said source decoding system that decodes it by virtue of a shared code.
- Said shared code defines a plurality of symbols.
- a codeword sequence comprises a plurality of symbols. The decoding is made through a state diagram (classically known as bit directed graph) as shown in Fig.1.
- the state diagram comprises an X-axis that represents bit times, and an Y-axis that represents an alphabet of the shared code, which comprises a set of values.
- the alphabet comprises three values "1", "01", "00”.
- a box represents a state of the state diagram.
- a path is represented by transitions between different states and a decoded sequence is represented by a path and a beginning state (generally state 0) and an ending state.
- the received codeword sequence contains errors; hence, there is a plurality of possible decoded codeword sequences.
- Said state diagram gives the possible decoded codeword sequences, a state being a node in the graph through which the possible decoded codeword sequences may pass.
- One optimal method is to look for the whole possible decoded codeword sequences by virtue of the code, independently of the received sequence, and to select the best decoded codeword sequence at the end of the state diagram construction.
- a solution to find the best complete decoded codeword sequence is then to search among these sequences for the one that has the smallest distance (in accordance with a chosen metric) from the received sequence.
- the method according to the invention comprises a step of reducing the states in the state diagram in such a way that, at a bit time, only a number N of states in a group of states is saved on the basis of a criterion derived from a partial metric computation and otherwise independently of an alphabet of said code, a group being associated with a bit time.
- the decoder comprises states reduction means adapted to save, at a bit time, only a number N of states in a group of states on the basis of a criterion derived from a partial metric computation and otherwise independently of an alphabet of said code, a group being associated with a bit time.
- the method of source decoding is characterized in that the criterion is such that only one state S is saved among all the states of a group G which have the same number of symbols SY, in accordance with a best metric condition.
- the method of source decoding is characterized in that the criterion is such that the saved states have the best metrics in said group of states.
- the number of states N is fixed in this case. Therefore, such a criterion leads to a state diagram whose complexity is stable and does not increase with the bit time, contrary to the optimal case, and such a criterion leads to a state diagram that does not depend anymore on the length of the sent codeword sequence. Moreover, it gives a good Packet Error rate performance contrary to the Park & Miller method of the prior art.
- Fig. 1 illustrates a state diagram of a method of source decoding of variable- length codeword sequences according to the prior art
- Fig. 2 is a schematic diagram of a video communication system wherein the method of source decoding according to the invention is used
- Fig. 3 is a first state diagram of a method of source decoding of variable- length codeword sequences according to a first embodiment of the invention
- Fig. 5 is a first graph showing first performance of the method according to the invention, illustrated in Fig. 3 and Fig.4,
- Fig. 6 is a second graph showing second performance of the method according to the invention, illustrated in Fig. 3 and Fig.4, and
- Fig. 7 is a third graph showing complexity results of the method according to the invention, illustrated in Fig. 3 and Fig.4.
- Fig. 8 is a third state diagram showing one implementation of the method according to the invention, illustrated in Fig.3 and Fig.4.
- the present invention relates to a method of source decoding variable-length codeword sequences based on an associated state diagram comprising a plurality of states. Said method is used in particular in a Variable-Length-Code decoder called VLC decoder as shown in Fig.2 within a video communication system VS.
- said video communication system VS comprises a source encoding system S-ENC comprising a VLC encoder VLC-ENC, a channel CH and a source decoding system S-DEC comprising said VLC decoder.
- the source encoding system S-ENC encodes a codeword sequence SQ via the VLC encoder and transmits it through said channel CH during a plurality of bit times to said source decoding system S-DEC which decodes it via the VLC decoder VLC-DEC by virtue of a shared code C.
- the transmission is made bit by bit.
- a codeword sequence SQ has a variable length L_SQ. This means that the sent codeword sequences SQs may have different lengths, hence, the received codeword sequences SQr may have different lengths.
- a codeword sequence SQ comprises a plurality of symbols S Y that are defined through the shared code C. Note that one symbol SY comprises at least one bit.
- Fig. 3 illustrates such a state diagram.
- the X-axis represents the bit times.
- the Y-axis represents an alphabet of the code C used, the alphabet comprising a set of values which also represent values that may be taken by the symbols S Y.
- the state diagram of Fig. 3 comprises 6 groups of states GO to G5, each being associated with the bit times BO to B5 respectively.
- a group G corresponds to all the states calculated at each bit time Bj (j>0) when a codeword sequence SQr is received, whatever the alphabet of the code C.
- a box in the state diagram represents a state S.
- a number T of symbols is indicated in each state box. It represents the number of symbols SY within a partial received sequence SQr at a certain bit time Bj. It also represents the number of symbols within a corresponding possible decoded codeword sequence SQd.
- S211 means that this state S belongs to the group G2, to the code value Cl and is the first state in this group G2 for the code value Cl.
- a state may be the ending state or an intermediate state of different paths, therefore, we can say that such a state S at a bit time Bj represents a node in the graph through which possible decoded codewords sequences may pass, which are also called decoded symbol sequences.
- a first step 1) of reducing the states in the state diagram is performed.
- a bit time Bj (j>0)
- only a number N of states in a group G of states is saved in relation to a criterion based on a partial metric computation and otherwise independently of the alphabet of said code C, a group G being associated with a bit time Bj.
- the number N of states is either upper-bounded by the bit time in a first embodiment, or equal to a given value NBMAX in a second embodiment.
- the reduction step comprises two sub-steps.
- a first sub-step A computations of partial metrics on partial sequences are performed.
- the adjective "partial” means that a computation of a metric is performed before the end of the reception of the whole sequence SQr.
- the metric computation is performed in accordance with a "Maximum A Posteriori" criterion called MAP criterion, which, as known to those skilled in the art, is equivalent to the computation of a Euclidean distance between a partial received sequence SQr and the partial sent sequence SQd after modulation, followed by weighting by a factor depending on the codeword probabilities of appearance.
- m(i) ⁇ i (
- SQr is a part of the sent sequence SQr corresponding to the emission of the code Ci.
- the construction of the state diagram is effected as a function of the received sequence SQr, contrary to the optimal method as stated in the prior art. Indeed, at each bit time, there are some states which are removed on the basis of partial metric computations which depend on partial received sequences, whereas in the prior art, no states are removed and whole metric computations are performed at the end of the state diagram construction, or the state removal techniques are not close enough to the optimum.
- the reduction criterion is applied.
- the criterion is such that only one state is saved among all the states of a group G which have the same number T of symbols S Y, in accordance with a best metric condition.
- a metric associated with a considered state S is one of the partial metrics computed in the first sub-step A) of a partial sequence which goes up to said considered state S.
- the second state S221 is saved because it has a better metric than the third state S231.
- For the number of symbols T 2, there is only one state S211, said state is kept.
- One advantage of this first embodiment is that the complexity of the state diagram is now easily bounded: the bit time value is in fact an obvious maj oration of the number N of states. However, as said number N of states is not fixed, it still depends on the length of the sent codeword sequence SQs. Therefore, the complexity will still increase with the bit time.
- the criterion is such that the saved states S have the best metric, no matter the symbol or bit value, or the number of symbols or bits.
- the first and sixth states S411 and S432 are saved because they have the best metrics. The other states are removed. Note that all the states S with the same number of symbols SY, here with the number 3, can be removed.
- NBMAX can be fixed as we want, as NBMAX is invariant, the complexity does not increase with the bit time or consequently with the length of the sent codeword sequence SQs, contrary to the optimal method or Park & Miller method of the prior art.
- the reduction step is performed independently of the code C alphabet or elements' probability of appearance, contrary to the Park & Miller method.
- a final decision which is the same for both embodiments, is taken. It consists of a second step 2) of selecting a final best state Sf, among the saved states, as being the state with the best metric, and of determining the best decoded codeword sequence SQd which has the same number of symbols SY as the sent codeword sequence
- the VLC decoder knows the number of symbols NB_SY sent by the VLC encoder within a sent sequence SQs, and, on the other hand, the length L_SQs in bits of said sent sequence SQs for the end of the diagram construction.
- best metric is understood to mean the sequence reaching the best, hence the highest probability in the sense of the MAP criterion, which is equivalent to the best, hence the lowest minimal distance in the sense of the metric m(i) defined above.
- the decoding is effected by going backward from the selected final best state Sf onto the path of the corresponding sequence in the state diagram, in order to recover the values of the symbols SY which have been sent through the sent sequence SQs.
- Fig. 5 and Fig. 6 show performances of the method according to the invention compared to other methods for source decoding of variable-length codeword sequences.
- the following method performances are illustrated: hard VLC decoding "HARD” (in circles), optimal soft VLC decoding “OPTIMAL” (in squares), Park & Miller VLC decoding “P&M” (in triangles up), and first embodiment of the method decoding according to the invention “AMAP- 1" (in crosses), second embodiment of the method decoding according to the invention "AMAP-2" (in triangles right).
- the hard VLC method is a method usually applied on fixed-length codeword sequences.
- the optimal method as defined in the prior art, is a method with no state reduction and no approximation.
- the other methods are approximate methods.
- K states kept at each bit time, there are K states kept, as it is the decoded codeword sequence which has the best metric for each set of states, which symbols have the same value [Ci, ... , , ... , QJ that is kept.
- a code CA is considered for the four above- mentioned methods.
- a code CB is considered for the four above- mentioned methods.
- the method according to the invention involves, in a first step, a first forward propagation with a metric computation process, where pointers to previous states are saved, and in a second step a trace-back process to establish the best decoded codeword sequence corresponding to one state selected from all the saved states.
- the first forward propagation keeps, at each bit time, only the states S which have the best metric among all the states of their group G which have the same number of symbols SY, as mentioned before.
- the state diagram will be described with the help of the following structures.
- state which comprises: the number of symbols up to a considered state (which is compared with the number of symbols of the sent sequence for the final decision), the number of bits up to the considered state (which corresponds to the number of bit time step), the value of the symbol on the transition leading to the considered state (saved for the trace-back process), the cumulative metric up to the transition leading to the considered state, a first pointer PSTATE_PREV to the previous state, - a second pointer PSTATE_VERT_NEXT to the next "vertical" state to be investigated.
- the first one PSTATE_PREV is necessary for the trace-back operation, and the second one PSTATE_VERT_NEXT allows the scanning of the "vertical" states, i.e. all the states for the same bit time Bj.
- An example is given in Fig. 8 to illustrate this.
- the forward process for the first embodiment is effected as follows. At a bit time Bj, from a state Slj:
- the first forward propagation keeps, at each bit time, NBMAX states, which have the best, metric, as mentioned before.
- NBMAX states which have the best, metric, as mentioned before.
- the structures used are the same as for the first embodiment.
- the present invention is not limited to the aforementioned embodiments and variations and modifications are possible without departing from the spirit and scope of the invention as defined in the appended claims. In this respect, the following closing remarks are made. It is to be noted that the present invention is not limited to the aforementioned video application. It can be used within any application using variable-length coding and can support the cost of said decoding (in terms of computational complexity and time delay, said time delay, in the method according to the invention, is dependent on the end of the reception of a whole sequence because of the trace-back process). Typically, this can be used for instance in video, audio or text compression.
- the integrated circuit comprises a set of instructions.
- said set of instructions which is contained, for example, in a computer programming memory or in a decoder memory, may cause the computer or the decoder to carry out the different steps of the source decoding method.
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR10-2003-7000973A KR20030036624A (en) | 2001-05-22 | 2002-05-21 | Method of decoding a variable-length codeword sequence |
US10/477,889 US6891484B2 (en) | 2001-05-22 | 2002-05-21 | Method of decoding a variable-length codeword sequence |
JP2002592298A JP2004533766A (en) | 2001-05-22 | 2002-05-21 | Method for decoding a variable length codeword sequence |
DE60215807T DE60215807T2 (en) | 2001-05-22 | 2002-05-21 | METHOD FOR DECODING A SEQUENCE OF CODEWORDS OF VARIABLE LENGTH |
EP02730624A EP1397869B1 (en) | 2001-05-22 | 2002-05-21 | Method of decoding a variable-length codeword sequence |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP01401349 | 2001-05-22 | ||
EP01401349.4 | 2001-05-22 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2002095955A1 true WO2002095955A1 (en) | 2002-11-28 |
Family
ID=8182740
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IB2002/001878 WO2002095955A1 (en) | 2001-05-22 | 2002-05-21 | Method of decoding a variable-length codeword sequence |
Country Status (8)
Country | Link |
---|---|
US (1) | US6891484B2 (en) |
EP (1) | EP1397869B1 (en) |
JP (1) | JP2004533766A (en) |
KR (1) | KR20030036624A (en) |
CN (1) | CN1463500A (en) |
AT (1) | ATE344551T1 (en) |
DE (1) | DE60215807T2 (en) |
WO (1) | WO2002095955A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2004082148A1 (en) * | 2003-03-11 | 2004-09-23 | Koninklijke Philips Electronics N.V. | Method and device for building a variable-length error code |
Families Citing this family (49)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR20050039873A (en) * | 2002-09-11 | 2005-04-29 | 코닌클리케 필립스 일렉트로닉스 엔.브이. | Method and device for source decoding a variable-length soft-input codewords sequence |
CN100394693C (en) * | 2005-01-21 | 2008-06-11 | 华中科技大学 | Coding and decoding method for variable long code |
CN100527847C (en) * | 2007-03-16 | 2009-08-12 | 清华大学 | Variable-length code decoding method based on zero-prefix code |
CN101562747B (en) * | 2009-05-19 | 2010-08-25 | 华中科技大学 | Method for resolving and rebuilding video coding predictive residue block |
US9288089B2 (en) | 2010-04-30 | 2016-03-15 | Ecole Polytechnique Federale De Lausanne (Epfl) | Orthogonal differential vector signaling |
US9077386B1 (en) | 2010-05-20 | 2015-07-07 | Kandou Labs, S.A. | Methods and systems for selection of unions of vector signaling codes for power and pin efficient chip-to-chip communication |
US9251873B1 (en) | 2010-05-20 | 2016-02-02 | Kandou Labs, S.A. | Methods and systems for pin-efficient memory controller interface using vector signaling codes for chip-to-chip communications |
US9288082B1 (en) | 2010-05-20 | 2016-03-15 | Kandou Labs, S.A. | Circuits for efficient detection of vector signaling codes for chip-to-chip communication using sums of differences |
US8948272B2 (en) | 2012-12-03 | 2015-02-03 | Digital PowerRadio, LLC | Joint source-channel decoding with source sequence augmentation |
CN105379170B (en) | 2013-04-16 | 2019-06-21 | 康杜实验室公司 | High-bandwidth communication interface method and system |
CN105393512B (en) | 2013-06-25 | 2019-06-28 | 康杜实验室公司 | Vector signaling with low receiver complexity |
US9806761B1 (en) | 2014-01-31 | 2017-10-31 | Kandou Labs, S.A. | Methods and systems for reduction of nearest-neighbor crosstalk |
WO2015117102A1 (en) | 2014-02-02 | 2015-08-06 | Kandou Labs SA | Method and apparatus for low power chip-to-chip communications with constrained isi ratio |
WO2015131203A1 (en) | 2014-02-28 | 2015-09-03 | Kandou Lab, S.A. | Clock-embedded vector signaling codes |
US11240076B2 (en) | 2014-05-13 | 2022-02-01 | Kandou Labs, S.A. | Vector signaling code with improved noise margin |
US9509437B2 (en) * | 2014-05-13 | 2016-11-29 | Kandou Labs, S.A. | Vector signaling code with improved noise margin |
US9112550B1 (en) | 2014-06-25 | 2015-08-18 | Kandou Labs, SA | Multilevel driver for high speed chip-to-chip communications |
WO2016007863A2 (en) | 2014-07-10 | 2016-01-14 | Kandou Labs, S.A. | Vector signaling codes with increased signal to noise characteristics |
US9432082B2 (en) | 2014-07-17 | 2016-08-30 | Kandou Labs, S.A. | Bus reversable orthogonal differential vector signaling codes |
KR102243423B1 (en) | 2014-07-21 | 2021-04-22 | 칸도우 랩스 에스에이 | Multidrop data transfer |
US9461862B2 (en) | 2014-08-01 | 2016-10-04 | Kandou Labs, S.A. | Orthogonal differential vector signaling codes with embedded clock |
US9674014B2 (en) | 2014-10-22 | 2017-06-06 | Kandou Labs, S.A. | Method and apparatus for high speed chip-to-chip communications |
KR102517583B1 (en) | 2015-06-26 | 2023-04-03 | 칸도우 랩스 에스에이 | High speed communications system |
US10055372B2 (en) | 2015-11-25 | 2018-08-21 | Kandou Labs, S.A. | Orthogonal differential vector signaling codes with embedded clock |
US10003315B2 (en) | 2016-01-25 | 2018-06-19 | Kandou Labs S.A. | Voltage sampler driver with enhanced high-frequency gain |
US10003454B2 (en) | 2016-04-22 | 2018-06-19 | Kandou Labs, S.A. | Sampler with low input kickback |
CN115085727A (en) | 2016-04-22 | 2022-09-20 | 康杜实验室公司 | High performance phase locked loop |
WO2017185070A1 (en) | 2016-04-22 | 2017-10-26 | Kandou Labs, S.A. | Calibration apparatus and method for sampler with adjustable high frequency gain |
US10193716B2 (en) | 2016-04-28 | 2019-01-29 | Kandou Labs, S.A. | Clock data recovery with decision feedback equalization |
US10153591B2 (en) | 2016-04-28 | 2018-12-11 | Kandou Labs, S.A. | Skew-resistant multi-wire channel |
US10333741B2 (en) | 2016-04-28 | 2019-06-25 | Kandou Labs, S.A. | Vector signaling codes for densely-routed wire groups |
US10056903B2 (en) | 2016-04-28 | 2018-08-21 | Kandou Labs, S.A. | Low power multilevel driver |
US9906358B1 (en) | 2016-08-31 | 2018-02-27 | Kandou Labs, S.A. | Lock detector for phase lock loop |
US10411922B2 (en) | 2016-09-16 | 2019-09-10 | Kandou Labs, S.A. | Data-driven phase detector element for phase locked loops |
US10200188B2 (en) | 2016-10-21 | 2019-02-05 | Kandou Labs, S.A. | Quadrature and duty cycle error correction in matrix phase lock loop |
US10200218B2 (en) | 2016-10-24 | 2019-02-05 | Kandou Labs, S.A. | Multi-stage sampler with increased gain |
US10372665B2 (en) | 2016-10-24 | 2019-08-06 | Kandou Labs, S.A. | Multiphase data receiver with distributed DFE |
EP4216444A1 (en) | 2017-04-14 | 2023-07-26 | Kandou Labs, S.A. | Pipelined forward error correction for vector signaling code channel |
CN110945830B (en) | 2017-05-22 | 2022-09-09 | 康杜实验室公司 | Multimode data driven clock recovery circuit |
US10608676B2 (en) * | 2017-06-27 | 2020-03-31 | Intel Corporation | Bit-alignment testing for obtaining FEC code lock |
US10116468B1 (en) | 2017-06-28 | 2018-10-30 | Kandou Labs, S.A. | Low power chip-to-chip bidirectional communications |
US10686583B2 (en) | 2017-07-04 | 2020-06-16 | Kandou Labs, S.A. | Method for measuring and correcting multi-wire skew |
US10693587B2 (en) | 2017-07-10 | 2020-06-23 | Kandou Labs, S.A. | Multi-wire permuted forward error correction |
US10203226B1 (en) | 2017-08-11 | 2019-02-12 | Kandou Labs, S.A. | Phase interpolation circuit |
US10326623B1 (en) | 2017-12-08 | 2019-06-18 | Kandou Labs, S.A. | Methods and systems for providing multi-stage distributed decision feedback equalization |
US10467177B2 (en) | 2017-12-08 | 2019-11-05 | Kandou Labs, S.A. | High speed memory interface |
KR102347396B1 (en) | 2017-12-28 | 2022-01-04 | 칸도우 랩스 에스에이 | Synchronously Switched Multi-Input Demodulating Comparator |
US10554380B2 (en) | 2018-01-26 | 2020-02-04 | Kandou Labs, S.A. | Dynamically weighted exclusive or gate having weighted output segments for phase detection and phase interpolation |
US11831472B1 (en) | 2022-08-30 | 2023-11-28 | Kandou Labs SA | Pre-scaler for orthogonal differential vector signalling |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5588028A (en) * | 1993-02-02 | 1996-12-24 | U.S. Robotics | Simplified trellis decoder |
US5446758A (en) * | 1993-07-08 | 1995-08-29 | Motorola, Inc. | Device and method for precoding |
US6233290B1 (en) * | 1995-04-13 | 2001-05-15 | California Institute Of Technology | Method for noncoherent coded modulation |
AT405470B (en) * | 1997-10-10 | 1999-08-25 | Kratochwil Konrad | Method and arrangement for the transmission of digital data |
US6246347B1 (en) * | 1997-10-27 | 2001-06-12 | Philips Electronics North America Corporation | Controller for a variable length decoder |
US6151370A (en) * | 1998-02-12 | 2000-11-21 | Lucent Technologies Inc. | Path-oriented decoder for signal-dependent noise |
-
2002
- 2002-05-21 JP JP2002592298A patent/JP2004533766A/en not_active Withdrawn
- 2002-05-21 WO PCT/IB2002/001878 patent/WO2002095955A1/en active IP Right Grant
- 2002-05-21 CN CN02801786A patent/CN1463500A/en active Pending
- 2002-05-21 AT AT02730624T patent/ATE344551T1/en not_active IP Right Cessation
- 2002-05-21 KR KR10-2003-7000973A patent/KR20030036624A/en not_active Application Discontinuation
- 2002-05-21 US US10/477,889 patent/US6891484B2/en not_active Expired - Fee Related
- 2002-05-21 DE DE60215807T patent/DE60215807T2/en not_active Expired - Fee Related
- 2002-05-21 EP EP02730624A patent/EP1397869B1/en not_active Expired - Lifetime
Non-Patent Citations (3)
Title |
---|
BALAKIRSKY V B: "Joint source-channel coding with variable length codes", INFORMATION THEORY. 1997. PROCEEDINGS., 1997 IEEE INTERNATIONAL SYMPOSIUM ON ULM, GERMANY 29 JUNE-4 JULY 1997, NEW YORK, NY, USA,IEEE, US, 29 June 1997 (1997-06-29), pages 419, XP010239935, ISBN: 0-7803-3956-8 * |
DEMIR N ET AL: "Joint source/channel coding for variable length codes", DATA COMPRESSION CONFERENCE, 1998. DCC '98. PROCEEDINGS SNOWBIRD, UT, USA 30 MARCH-1 APRIL 1998, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, PAGE(S) 139-148, ISBN: 0-8186-8406-2, XP010276616 * |
PARK M ET AL: "JOINT SOURCE-CHANNEL DECODING FOR VARIABLE-LENGTH ENCODED DATA BY EXACT AND APPROXIMATE MAP SEQUENCE ESTIMATION", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE INC. NEW YORK, US, vol. 48, no. 1, January 2000 (2000-01-01), pages 1 - 6, XP000912965, ISSN: 0090-6778 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2004082148A1 (en) * | 2003-03-11 | 2004-09-23 | Koninklijke Philips Electronics N.V. | Method and device for building a variable-length error code |
Also Published As
Publication number | Publication date |
---|---|
KR20030036624A (en) | 2003-05-09 |
JP2004533766A (en) | 2004-11-04 |
EP1397869B1 (en) | 2006-11-02 |
CN1463500A (en) | 2003-12-24 |
DE60215807D1 (en) | 2006-12-14 |
DE60215807T2 (en) | 2007-09-13 |
EP1397869A1 (en) | 2004-03-17 |
US20040155802A1 (en) | 2004-08-12 |
ATE344551T1 (en) | 2006-11-15 |
US6891484B2 (en) | 2005-05-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1397869B1 (en) | Method of decoding a variable-length codeword sequence | |
US6597742B1 (en) | Implementing reduced-state viterbi detectors | |
Park et al. | Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation | |
CA2147816C (en) | Punctured convolutional encoder | |
CN107026656B (en) | CRC-assisted medium-short code length Polar code effective decoding method based on disturbance | |
US5901182A (en) | Metric sifting in breadth-first decoding of convolutional coded data | |
EP0333324A2 (en) | Matched spectral null trellis codes for partial response channels | |
JPH11508440A (en) | Optimal soft output decoder for tail-biting lattice code | |
KR100227094B1 (en) | Soft decision viterbi decoding with large constraint lengths | |
US8081719B2 (en) | Method and system for improving reception in wired and wireless receivers through redundancy and iterative processing | |
KR20090009892A (en) | Radix-4 viterbi decoding | |
JP4836379B2 (en) | Method for decoding encoded data having entropy code, and corresponding decoding device and transmission system | |
Han et al. | A maximum-likelihood soft-decision sequential decoding algorithm for binary convolutional codes | |
EP0920138B1 (en) | Method and system for decoding tailbiting convolution codes | |
Fossorier et al. | Complementary reliability-based decodings of binary linear block codes | |
JP2715398B2 (en) | Error correction codec | |
US6836516B2 (en) | Decoding method and apparatus | |
US6948114B2 (en) | Multi-resolution Viterbi decoding technique | |
CN102291198A (en) | channel decoding method and device | |
JPH11500298A (en) | Method of forming transition distance and receiver of cellular radio system | |
Luna et al. | Iterative maximum-likelihood trellis decoding for block codes | |
US7032165B2 (en) | ACS unit in a decoder | |
EP0674397A2 (en) | Viterbi decoder comprising downsized circuits | |
KR20010019469A (en) | Iterative decoding of block codes using reduced search soft output Viterbi algorithm | |
JP3171801B2 (en) | Decoding method and apparatus using trace deletion method for Viterbi algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): CN JP KR US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2002730624 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 028017862 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1020037000973 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 1020037000973 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10477889 Country of ref document: US Ref document number: 2002592298 Country of ref document: JP |
|
WWP | Wipo information: published in national office |
Ref document number: 2002730624 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 2002730624 Country of ref document: EP |