WO2005101668A1 - Procede de decodage conjoint source-canal et decodeur conjoint source-canal associe - Google Patents
Procede de decodage conjoint source-canal et decodeur conjoint source-canal associe Download PDFInfo
- Publication number
- WO2005101668A1 WO2005101668A1 PCT/FR2005/000645 FR2005000645W WO2005101668A1 WO 2005101668 A1 WO2005101668 A1 WO 2005101668A1 FR 2005000645 W FR2005000645 W FR 2005000645W WO 2005101668 A1 WO2005101668 A1 WO 2005101668A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- decoder
- channel
- probabilities
- symbols
- decoding
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 230000005540 biological transmission Effects 0.000 claims abstract description 28
- 230000007704 transition Effects 0.000 claims description 11
- 238000004891 communication Methods 0.000 abstract description 4
- 238000003817 vacuum liquid chromatography Methods 0.000 description 12
- 241000710173 Carnation latent virus Species 0.000 description 11
- 238000010586 diagram Methods 0.000 description 10
- 238000004422 calculation algorithm Methods 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 5
- 238000006243 chemical reaction Methods 0.000 description 4
- 230000033001 locomotion Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000013459 approach Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 3
- 101150115425 Slc27a2 gene Proteins 0.000 description 2
- 239000000654 additive Substances 0.000 description 2
- 230000000996 additive effect Effects 0.000 description 2
- 230000000052 comparative effect Effects 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 239000013598 vector Substances 0.000 description 2
- 241000122235 Junco hyemalis Species 0.000 description 1
- 241000677647 Proba Species 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000009977 dual effect Effects 0.000 description 1
- 238000007429 general method Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000009827 uniform distribution Methods 0.000 description 1
Classifications
-
- 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/29—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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2957—Turbo codes and decoding
-
- 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
-
- 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/45—Soft decoding, i.e. using symbol reliability information
-
- 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
Definitions
- the present invention relates to a joint source-channel decoding method. It also relates to a combined source-channel decoder associated.
- the invention finds a particularly advantageous application in the field of coding and decoding digital data transmitted in a communication channel, in particular data transmitted in MPEG (Moving Picture Expert Group) coding on UMTS mobile telephone channels.
- MPEG Motion Picture Expert Group
- the most efficient digital communication systems at present rely on source and channel coding systems which are optimized separately.
- the purpose of the source encoder is to minimize the redundancy of the source signal to be transmitted.
- the channel coder introduces redundancy in a controlled manner.
- Decoding methods with non-parametric source estimation Decoding methods that break free from a model become more generic and can therefore be applied to different sources.
- the currently known estimation methods only concern the estimation of symbol probabilities, whether stationary probabilities (see J. Wen and JD V ⁇ llasenor, "Utilizing Soft Information in decoding of Variable Length Codes", Proceedings of DCC, Snowbird, Utah, USA, March 1999) or, at best, transition probabilities from first-order Markov sources (see C. Weidmann and P. Siohan, “Joint source-channel decoding with online source estimation » Proceedings of Coresa '03, Lyon, France, January 2003).
- type b) method provides the upper bound in terms of performance-
- Decoding methods with parametric source estimation are a first step towards implementation in practical applications.
- the method described in the article by AH Murad et al cited above has several shortcomings.
- a first general criticism is that the MAP (maximum a posteriori) decoding algorithm used is extremely complex because it is carried out by means of a decoding trellis which corresponds to the product of 3 decoding trellises. elementary.
- the estimation method itself it should be noted that the 8 parameters estimated at the coder are assumed to be transmitted without error. and all at once. This assumption does not take into account the fact that this transmission has a high cost.
- the decoder corresponds to the implementation of a general method of obtaining the optimal decoded sequence within the meaning of the MAP.
- This approach is based on dynamic programming and does not offer a simplified embodiment.
- the method is limited to the calculation of the stationary probabilities of the various VLC symbols and does not take into account the case, more interesting from the point of view of potential performance gains, of Markovian sources. More recently, the article by C. Weidmann and P.
- Siohan cited above proposes a DCSC technique including, in the source decoder, a module for estimating statistics for Markovian sources of order 1.
- the principle of DCSC is based on the technique of serial turbo codes with a first encoder which is a variable length encoder.
- the decoding then applies the turbo principle between the channel decoder and a flexible VLC code decoder.
- This scheme had been proposed initially by Bauer and Hagenauer for a source without memory and then extended by Guyader et al to the case of Markovian sources, based each time on a MAP criterion (symbol or sequence).
- the estimation method described in the article by C. Weidmann and P. Siohan cited above applies to this type of DCSC scheme.
- the source decoding part is described in the form of a BCJR (Bahl Cocke Jelinek Raviv) algorithm with a trellis which operates at bit and symbol level.
- BCJR Binary Cocke Jelinek Raviv
- a variant of the Baum-Welch algorithm makes it possible to express the estimation of statistics of source symbols by reusing the variables of the front and rear phases of the BCJR.
- the method has the disadvantage of a very high cost in complexity.
- a comparison made with a hypothesis of perfect estimation of the source see M. Jeanne, P.
- the present invention integrates a simple and effective method for estimating the VLC symbol source statistics which, on the contrary, is integrated at the bit level. It is based on European patent No. 1,230,736 which already proposed a flexible source decoding process, or DCSC, carried out at bit level. In particular, it has been shown in this patent that a turbo decoding technique can produce greatly improved performance if the first channel decoder constituting the decoder uses both the knowledge of the tree structure of the VLC code and the statistics associated with the branches of the tree. Depending on the source model, the useful statistic may correspond to stationary or transition probabilities.
- This object is achieved, according to the present invention, by means of a joint source-channel decoding process of digital data received by a decoder-channel of a digital data decoder, said digital data received coming from the transmission, through a transmission channel, of transmitted digital data encoding discrete values, or symbols, from a source, the probabilities associated with said symbols being applied to a decoding-channel trellis of said channel decoder, in particular remarkable in that said probabilities are estimated of statistically from occurrences of the symbols estimated by said decoder.
- the main advantages obtained by the decoding method according to the invention are as follows: - performance gains during the decoding of Markov sources coded with VLCs.
- the invention provides that said probabilities are probabilities p (i) of occurrences of symbols i or probabilities p (i / j) transitions between symbols i and j.
- the probability noted p (i / j) signifies, more precisely, the probability of the occurrence of the symbol i following the occurrence of the symbo le j.
- said probabilities are estimated iteratively, by accumulation of the symbol information estimated at the output of the decoder.
- an advantageous embodiment of the invention consists in that, said symbols being coded according to a variable length coding represented by a binary tree of finite size, said probabilities are associated with each branch of said tree and applied to the corresponding stages of said decoding-channel lattice.
- the decoding method which is the subject of the invention can be implemented by a joint source-data channel decoder.
- said joint decoder also comprises a histogram generator of occurrences of the symbols estimated by the decoder, means for calculating probabilities associated with said restored symbols, and means for applying said probabilities to a channel decoding trellis of the channel decoder. More particularly, it is expected that, said channel decoding trellis being a decoding trellis in binary values, said means for applying said probabilities is a module for converting symbol probabilities into binary values probabilities.
- FIG. 1 is a general diagram of a coding / decoding chain of digital data from a source through a “noisy” transmission channel including a joint source-channel decoder according to the invention.
- FIG. 2 is a general diagram of a joint source-channel decoder according to the invention.
- FIG. 3 is a detailed diagram of the decoder of FIG. 2 in the case of turbo-coding.
- FIG. 4 is a comparative diagram giving the bit error rate (BER) as a function of the useful signal to noise ratio (Ebu / NO) for the Markov source of order 1 proposed by Murad and Fuja, according to a decoding method " tandem ”(pointil les), a DCSC method with perfect knowledge of the source (solid line) and the DCSC method according to the invention with estimate of the source (dashes).
- BER bit error rate
- Ebu / NO useful signal to noise ratio
- FIG. 5 is a comparative diagram giving the bit error rate (BER) as a function of the useful signal to noise ratio (Ebu / NO) for a Gauss Markov source quantized on 4 levels, of correlation 0.9, according to a method “tandem” decoding (dotted lines), a DCSC method with perfect knowledge of the source (solid line) and the DCSC method according to the invention with estimation of the source (dashes).
- FIG. 1 shows a diagram of transmission, through a transmission channel 40, of digital data coming from a transmitter made up of elements 10, 20, 30 intended for a reception stage, or decoder, made up of elements 50, 60.
- Said transmitter comprises a source 10 of symbols i, j, ...
- CLV variable length coding table
- a so-called coding channel coding is applied to said data, for example a parallel convolutional turbo coding.
- the transmission channel 40 is a noisy channel, modeled for example by a simple BBAG (White Additive Gaussian Noise) channel.
- the reception stage, or decoder, comp makes a joint channel-source decoder 50 with estimation of the source statistics.
- the digital data coming from the joint decoder 50 are applied to a decoder 60 of the variable length code CLV, which could be that of the video decoder MPEG4, so as to provide at the output of the decoder an estimate of the values of the symbols i, j ,.
- the decoder 50 comprises a channel decoder 51, preferably of the trellis type, capable of producing flexible information called "a posteriori proba bility »APP.
- a threshold 52 is applied to the noisy outgoing data so as to restore said data in terms of digital data in the form of bits 0 or 1.
- a CLV decoder 53 per table makes it possible to transform the bits received into symbols i, j, .. ..
- the estimation of the statistics of the symbols i, j, ... of the source is carried out by iteration by means of a histogram generator 54 allowing the calculation of the probabilities of the symbols, ie the stationary probabilities p (i) for the model without memory, that is the transition p (i / j) probabilities for the Markov model of order 1.
- a conversion module 56 symbol probabilities-> bit probabilities with the CLV tree intended to inject the bit level probabilities into the channel decoder 51.
- This conversion module 56 is the same as that used in European patent No. 1,230,736. However, in the context of the invention illustrated in FIG.
- FIG. 3 provides a diagram of a particular embodiment of the joint decoder 50 of FIG. 2 in the case of channel coding carried out according to the technique of turbo coding involved, in addition to the channel decoder convolutional 51, a second convolutional channel decoder 51 ′, each convolutional channel decoder being associated with a convolutional channel coder at the level of the channel coding 30 of FIG. 1.
- the transition from one to the other of the coders or decoders -channel is done through an interlacing law E or the inverse law E *.
- the APP at the output of the second convolutional decoder 51 ′ is thresholded.
- the bits at the output of this threshold 52 are used to find symbols i, j, ... thanks to table 53 of the CLV coding.
- a histogram 54 makes it possible to count for each symbol the number transmitted or, while keeping in memory the trace of the previous symbol having been decoded, the number corresponding to each successive pair of symbols.
- This histogram 54 therefore makes it possible to calculate stationary probabilities p (i) and probabilities p (i / j) of transition between symbols (in the case where the source is assumed with memory of order 1). These probabilities will then be used to calculate the branch probabilities of the CLV tree.
- This calculation detailed in European patent n ° 1 230 736 makes it possible to carry out the symbol-bit conversion of FIG. 3. This conversion is essential in order to be able to insert these source probabilities, which are then in the form of branch probabilities of the CLV tree, in the corresponding stages of the decoding trellis of the first co-evolving decoder-channel 51.
- the diagram in FIG. 3 corresponds to a type of decoding mode d). If the blocks appearing in bold in FIG. 3 were deleted, in other words if the decoder 50 operated without any prior knowledge of the source, and that at the last iteration only thresholding and hard decoding by CLV table were carried out, a “tandem” type decoding a) would be performed. Finally, if we suppose that instead of a simple estimation, as in case d), the first channel decoder 51 has perfect knowledge of the source 10 and uses both the structure of the CLV tree and the exact source statistic, we would be in case b).
- Figures 4 and 5 illustrate the results of these three methods for two different sources.
- the gains in signal to noise ratio (measured by the Ebu / NO ratio) of the DCSC method proposed by the invention, compared to the tandem diagram a) are of the order of 2 dB if we observe the 3rd iteration of the turbo decoder at a bit error rate (BER) of 10 "3.
- BER bit error rate
- results obtained by the joint decoding process and the joint decoder according to the invention are practically merged with those of the conceivable performance upper bound fixed by the system of type a) .
- the results are shown in FIG. 5.
- the gain achieved by the invention is also 2 dB, again by observing the BER at 10 "3 on the 3rd iteration of the turbo code. The results are still almost confused, even better because of the relative imprecision of the simulation conditions, with those of the theoretical limit b).
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/594,254 US20070140375A1 (en) | 2004-03-25 | 2005-03-16 | Joint-source channel decoding method and associated joint source-channel decoder |
JP2007504442A JP4537447B2 (ja) | 2004-03-25 | 2005-03-16 | ソース・チャンネル連合デコード方法と関連するソース・チャンネル連合デコーダ |
EP05739429A EP1728330A1 (fr) | 2004-03-25 | 2005-03-16 | Procede de decodage conjoint source-canal et decodeur conjoint source-canal associe |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0450593 | 2004-03-25 | ||
FR0450593 | 2004-03-25 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005101668A1 true WO2005101668A1 (fr) | 2005-10-27 |
Family
ID=34945037
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2005/000645 WO2005101668A1 (fr) | 2004-03-25 | 2005-03-16 | Procede de decodage conjoint source-canal et decodeur conjoint source-canal associe |
Country Status (6)
Country | Link |
---|---|
US (1) | US20070140375A1 (fr) |
EP (1) | EP1728330A1 (fr) |
JP (1) | JP4537447B2 (fr) |
KR (1) | KR20060129537A (fr) |
CN (1) | CN1961487A (fr) |
WO (1) | WO2005101668A1 (fr) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN117014107A (zh) * | 2023-10-07 | 2023-11-07 | 华侨大学 | 基于Markov信源的联合信源信道编码方法及系统 |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2604966C (fr) * | 2005-04-04 | 2011-09-13 | Research In Motion Limited | Systeme et methode de codage et de decodage de signaux d'information au moyen d'information apriorique |
US7623725B2 (en) * | 2005-10-14 | 2009-11-24 | Hewlett-Packard Development Company, L.P. | Method and system for denoising pairs of mutually interfering signals |
KR101402903B1 (ko) * | 2007-11-08 | 2014-06-02 | 삼성전자주식회사 | 이동통신 시스템의 복호 장치 및 방법 |
EP2362658A1 (fr) * | 2010-02-26 | 2011-08-31 | Research In Motion Limited | Procédés de codage et de décodage, et dispositifs utilisant des ensembles de codes doubles |
US8924815B2 (en) * | 2011-11-18 | 2014-12-30 | Sandisk Enterprise Ip Llc | Systems, methods and devices for decoding codewords having multiple parity segments |
CN102523076B (zh) * | 2012-01-04 | 2014-05-14 | 西安电子科技大学 | 通用可配置的高速率Turbo码译码方法 |
US8948272B2 (en) | 2012-12-03 | 2015-02-03 | Digital PowerRadio, LLC | Joint source-channel decoding with source sequence augmentation |
CN104022846B (zh) * | 2014-05-30 | 2017-12-29 | 华为技术有限公司 | 译码的方法及rnc |
US20170214413A1 (en) * | 2016-01-21 | 2017-07-27 | HGST Netherlands B.V. | Joint source-channel coding with dynamic dictionary for object-based storage |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2001035535A1 (fr) * | 1999-11-09 | 2001-05-17 | France Telecom | Procede de decodage de donnees codees a l'aide d'un code entropique, dispositif de decodage et systeme de transmission correspondants |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4942467A (en) * | 1988-12-05 | 1990-07-17 | General Electric Company | Predictor controlled encoder for digital transmission systems |
US6128765A (en) * | 1998-08-20 | 2000-10-03 | General Electric Company | Maximum A posterior estimator with fast sigma calculator |
US6892343B2 (en) * | 2000-03-27 | 2005-05-10 | Board Of Regents Of The University Of Nebraska | System and method for joint source-channel encoding, with symbol decoding and error correction |
US7010052B2 (en) * | 2001-04-16 | 2006-03-07 | The Ohio University | Apparatus and method of CTCM encoding and decoding for a digital communication system |
US7466658B2 (en) * | 2002-08-14 | 2008-12-16 | Telefonaktiebolaget L M Ericsson (Publ) | Receiver and method for decoding of truncated data |
AU2003272833A1 (en) * | 2002-09-17 | 2004-04-08 | Vladimir Ceperkovic | Fast codec with high compression ratio and minimum required resources |
-
2005
- 2005-03-16 US US10/594,254 patent/US20070140375A1/en not_active Abandoned
- 2005-03-16 KR KR1020067021614A patent/KR20060129537A/ko not_active Application Discontinuation
- 2005-03-16 EP EP05739429A patent/EP1728330A1/fr not_active Withdrawn
- 2005-03-16 JP JP2007504442A patent/JP4537447B2/ja not_active Expired - Fee Related
- 2005-03-16 CN CNA2005800171150A patent/CN1961487A/zh active Pending
- 2005-03-16 WO PCT/FR2005/000645 patent/WO2005101668A1/fr active Application Filing
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2001035535A1 (fr) * | 1999-11-09 | 2001-05-17 | France Telecom | Procede de decodage de donnees codees a l'aide d'un code entropique, dispositif de decodage et systeme de transmission correspondants |
Non-Patent Citations (1)
Title |
---|
LU W-W ET AL: "A fast-adaptive Huffman coding algorithm", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE INC. NEW YORK, US, vol. 41, no. 4, April 1993 (1993-04-01), pages 535 - 538, XP002270119, ISSN: 0090-6778 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN117014107A (zh) * | 2023-10-07 | 2023-11-07 | 华侨大学 | 基于Markov信源的联合信源信道编码方法及系统 |
Also Published As
Publication number | Publication date |
---|---|
US20070140375A1 (en) | 2007-06-21 |
EP1728330A1 (fr) | 2006-12-06 |
JP2007531363A (ja) | 2007-11-01 |
CN1961487A (zh) | 2007-05-09 |
JP4537447B2 (ja) | 2010-09-01 |
KR20060129537A (ko) | 2006-12-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2005101668A1 (fr) | Procede de decodage conjoint source-canal et decodeur conjoint source-canal associe | |
EP0891656B1 (fr) | Procede et dispositif de codage convolutif de blocs de donnees, et procede et dispositif de decodage correspondants | |
EP1378089B1 (fr) | Décodage et égalisation turbo conjointe pour transmission MIMO avec interférence intersymboles | |
EP0808538B1 (fr) | Dispositif de reception de signaux numeriques a structure iterative, module et procede correspondants | |
EP1362447A1 (fr) | Procede et systeme de codage-decodage iteratif de flux de donnees numeriques codees par combinaisons spatio-temporelles, en emission et reception multiple | |
EP1230736B1 (fr) | Procede de decodage de donnees codees a l'aide d'un code entropique, dispositif de decodage et systeme de transmission correspondants | |
FR2808632A1 (fr) | Procede de turbo-decodage avec reencodage des informations erronees et retroaction | |
FR2804260A1 (fr) | Procede de transmission numerique de type a codage correcteur d'erreurs | |
EP1128589B1 (fr) | Critère d'interruption pour un décodeur turbo | |
EP1527521B1 (fr) | Dispositif et procede de decodage robuste de codes arithmetiques | |
FR2807895A1 (fr) | Procedes et dispositifs de codage et de decodage et systemes les mettant en oeuvre | |
EP1282254A1 (fr) | Codage et décodage de canal pour modulation à grand nombre d'etats | |
Kliewer et al. | Combining FEC and optimal soft-input source decoding for the reliable transmission of correlated variable-length encoded signals | |
WO2006108768A1 (fr) | Procédé et dispositif de décodage d'un code à longueur variable prenant en compte une information de probabilité a priori | |
FR2805418A1 (fr) | Procede de transmission numerique de type a codage correcteur d'erreurs | |
FR2972878A1 (fr) | Procede d'encodage correcteur d'erreur, procede de decodage et dispositifs associes. | |
EP1525663A1 (fr) | Compression de donnees numeriques robuste au bruit de transmission | |
EP1443658A1 (fr) | Procédé de contrôle du nombre d'itérations d'un processus de décodage itératif et dispositif pour la mise en oeuvre du procédé | |
FR2811832A1 (fr) | Procedes, dispositifs et appareils d'optimisation adaptative pour la transmission de signaux codes | |
EP0758167B1 (fr) | Procédé de décodage à sorties ponderées mettant en oeuvre l'algorithme de Viterbi en fonctionnement par blocs | |
WO1998035475A1 (fr) | Dispositif d'egalisation et de decodage de canal | |
FR2800941A1 (fr) | Procede de decodage de donnees codees a l'aide d'un code entropique, dispositif de decodage et systeme de transmission correspondants | |
FR2776151A1 (fr) | Procede et dispositif de decodage d'un canal de transmission radiofrequence, notamment pour une diffusion numerique terrestre utilisant une modulation ofdm | |
van den Borne et al. | Codes for writing on dirty paper | |
WO2018172694A1 (fr) | Construction de turbocodes à rendements compatibles |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
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: 2005739429 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007504442 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2007140375 Country of ref document: US Ref document number: 10594254 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020067021614 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200580017115.0 Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 2005739429 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020067021614 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 10594254 Country of ref document: US |