WO2003094358A1 - Dispositif et procede de masquage d'une erreur - Google Patents

Dispositif et procede de masquage d'une erreur Download PDF

Info

Publication number
WO2003094358A1
WO2003094358A1 PCT/EP2003/003607 EP0303607W WO03094358A1 WO 2003094358 A1 WO2003094358 A1 WO 2003094358A1 EP 0303607 W EP0303607 W EP 0303607W WO 03094358 A1 WO03094358 A1 WO 03094358A1
Authority
WO
WIPO (PCT)
Prior art keywords
value
decoding
information unit
block
information
Prior art date
Application number
PCT/EP2003/003607
Other languages
German (de)
English (en)
Inventor
Daniel Homm
Ralph Sperschneider
Original Assignee
Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V.
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 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. filed Critical Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V.
Priority to CA002482866A priority Critical patent/CA2482866C/fr
Priority to EP03747407A priority patent/EP1495548B1/fr
Priority to DE50302479T priority patent/DE50302479D1/de
Priority to AU2003226791A priority patent/AU2003226791A1/en
Publication of WO2003094358A1 publication Critical patent/WO2003094358A1/fr
Priority to US10/976,540 priority patent/US7428684B2/en
Priority to HK05101227A priority patent/HK1069026A1/xx

Links

Classifications

    • G—PHYSICS
    • G10—MUSICAL INSTRUMENTS; ACOUSTICS
    • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
    • G10L19/005—Correction of errors induced by the transmission channel, if related to the coding 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/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • 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/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • 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/65—Purpose and implementation aspects
    • H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
    • H03M13/6516—Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/65—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using error resilience
    • H04N19/69—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using error resilience involving reversible variable length codes [RVLC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
    • H04N19/89—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder
    • H04N19/895—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder in combination with error concealment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Definitions

  • the present invention relates to the transmission of data via a faulty transmission channel and in particular to a concept for concealing an error in a faulty or potentially faulty information unit which has been transmitted via the faulty channel.
  • FEC Forward Error Correction
  • FEC Forward Error Correction
  • This concept introduces redundancy into the data stream through an encoder. This redundancy can then be used in a decoder, for example using a Viterbi decoding block, in order to correct transmission errors which have occurred during the transmission.
  • a disadvantage of this method is the fact that by adding redundancy in the encoder, the transmission rate over the channel is increased. Especially with heavily disturbed transmission channels, e.g. wireless transmission channels, however, there is often no other choice in order to enable reliable reception in the receiver / decoder even under less than optimal channel conditions.
  • a main goal is to compress audio or video data as much as possible in order to enable transmission over channels which are typically not particularly disturbed, such as, for example, wired channels, which permit a limited data rate .
  • entropy codes are often used in such known compression methods as are standardized in the MPEG family Entropy coding of guaranteed data such as e.g. B. spectral values used.
  • a well-known representative of an entropy coding method is the so-called Huffman coding, which enables a set of values to be coded with almost minimal redundancy.
  • a problem with Huff an codes is that a data stream of Huffman code words does not show where a code word begins (apart from the first code word) and where a code word ends.
  • a data stream of Huffman code words typically consists of a series of binary ones and zeros.
  • a decoder decodes such a data stream from Huffman code words with knowledge of the code table on which the coding is based.
  • the code table which can also be represented as a code tree, is designed in such a way that the end of a code word is inherent due to the prefix freedom of the code (only code pages in the code tree are valid code words).
  • the Huffman code has the property that all "branches" of the tree are closed, ie lead to valid code words.
  • Reversible code words such as. B.
  • symmetrical code words can also have the property that they lead to a code tree in which not all branches are terminated by valid code words.
  • a decoder will therefore already recognize during the course of the decoding whether an error has occurred if the decoder encounters such an invalid code word, ie a code word that is not provided in the code table.
  • the decoder cannot determine with certainty whether the error was exactly in the code word that was recognized as invalid.
  • the number of valid code words in this code table has been chosen to be as low as possible for data compression reasons, ren only a few invalid code words, so that a decoder may only come across an invalid code word a few code words after the occurrence of the transmission error in the bit stream.
  • an error in the bit stream thus leads to continuation errors which, however, no longer affect the entire remaining bit stream as in the Huffman code, but which typically only spread over a few code words after the error has occurred.
  • the backward decoder is provided which, if it is assumed that there is only a single bit error in the data stream, will also output a few code words as apparently correct code words in the reverse direction due to the continuation errors.
  • An error can be recognized if the forward decoder and the backward decoder for information units of the same ordinal number in the block of information units output different decoded information units.
  • Dan US Pat. No. 5,852,469 therefore proposes to discard all outputs in this error area and to use coded information units for further processing on the receiver side only from the starting point of the block of code words to the beginning of the error or overlap area, and only further to use decoded information units from the end point of the block of code words to the end (viewed in the forward direction) of the overlap area.
  • DE 198 40 835 AI also discloses a device and a method for entropy coding information words and a device and method for decoding entropy-coded information words.
  • an error concealment technique Possible error concealment techniques consist of simply replacing an incorrect value with its neighboring intact value. If both intact values that border on an error are known, weighted members tel values from the left and right margins are used to artificially replace the " incorrect value, ie to obscure.
  • Other error concealment techniques mentioned use interpolation using two adjacent values between which there is an error.
  • one-sided prediction from the front or from behind be made with respect to the overlap area in order to replace a faulty value with a "possibly relatively intact" value.
  • a disadvantage of this concept is the fact that it is problematic if several successive information units have been affected by continuation errors. Interpolation- or prediction-based obfuscation techniques will quickly reach their limits in this case, and the quality of the error obfuscation will decrease more and more.
  • US Patent No. 6,104,754 discloses a moving picture coding / decoding system using coding with variable length code words.
  • reversible code words of variable length are used, which can be decoded from the front and from the back. If a forward decoder detects an error and a reverse decoder also detects an error, the area including the two errors, if it does not overlap, is discarded. If the area overlaps, however, the output of the forward decoder is taken until the error excluding the error. The output of the reverse decoder is then taken from the error. Alternatively, the output of the backward decoder can be taken until the error, and then the output of the forward decoder from the error.
  • the output of the forward decoder is taken to the error and the output of the backward decoder is taken from the error. If both decoders detect an error in the same code word, then the incorrect code word is discarded, the output of the forward decoder is by Error is taken, and the output of the backward " decoder is taken to error.
  • DE 19959038 AI discloses a method for decoding digital audio data, in which an error detection is carried out as a function of transmitted reference values, preferably scale factors.
  • reference values of a frequency range are compared with previous reference values of the same frequency range in order to generate a feature that is compared with a threshold value. If the feature is above the specified threshold, this is indicated by means of a signal.
  • reference values marked as errors are replaced by previous reference values which have been stored.
  • the object of the present invention is to provide an improved concept for concealing an error in a faulty or potentially faulty information unit.
  • the present invention is based on the knowledge that if, for reasons of clarity, only a single bit error is assumed, one of the two different values for the information unit, which are output by the forward decoder and the backward decoder, is the correct value .
  • these properties are not taken into account due to the classic known error concealment techniques. It is assumed here that in the case of two different values for the same information unit, a problem has arisen which can be masked by the fact that both values are eliminated at the same time.
  • “throwing away” correct- and, instead, an examination of the " two values is carried out in order to select the value as a veiled information unit that appears more plausible.
  • an error concealment device comprises a device for selecting the value output by the forward decoder or that of the value output to the backward decoder as an information unit, depending on which value fulfills a predetermined criterion, ie is plausible, so that a potential error in the information unit is obscured.
  • the concept according to the invention has the advantage that continuation errors with only one incorrect code word in the transmission stream can actually be completely eliminated by the forward decoding on the one hand and the backward decoding on the other hand if the selection leads to a correct value based on the predetermined criterion. If a differential coding has been applied to the information units, even this one incorrect code word can also be completely reconstructed on the basis of the difference information from forward or backward.
  • the plausibility check that is to say the selection of a value of the pair of values of the two decoders, is carried out on the basis of a previously known property of the information signal determined by the information units, which can be an audio and / or video signal, for example.
  • Scale factors of an audio signal for example, have the property that they do not generally change particularly strongly from one scale factor band to the next.
  • the predetermined criterion is that the decoder output value is used which differs less from a last intact or already reconstructed scale factor than the other decoder output value.
  • the predetermined criterion is used that the scale factors do not change particularly strongly from block to block, so that a suitable scale factor is used to decide which of the two decoder output values is the better one of a previous block is used.
  • the predetermined criterion can also be designed in terms of energy.
  • the energy changes relatively little from a scale factor band of an earlier block to the same scale factor band in the later block or a scale factor band of the current block and the next scale factor band of the current block.
  • the energy of the spectral values in the corresponding scale factor bands must be determined in order to be able to carry out the plausibility check.
  • the predetermined criterion can also be selected in such a way that not only does one proceed from one pair of values to the next in the overlap area, but that several or all value pairs are used in the overlap area.
  • all possible paths can be constructed through all pairs of values, in order to then select the path that is together with the predetermined criterion is closest, ie, for the ". as the lowest total change has.
  • the total change is a weighted or unweighted sum of individual changes and a way selection to be made so by a value pair to the next.
  • the advantage of the concept according to the invention is that, in principle, a complete reconstruction can be achieved in the event of a single bit error.
  • obfuscation can be achieved if the decoder generates a sufficient number of continuation errors in the forward and reverse directions so that an overlap area, i.e. an error concealment area arises in which there are two different "suggestions" of the two decoders for an information unit of a certain ordinal number in the block.
  • a complete reconstruction is not possible in this case, since decoded values between several bit errors are generally not correct.
  • the predetermined criterion depends on a previously known property of information units, on a current, previous out previous and / or subsequent block domestic shown 'information signal from, wherein the predetermined criterion is satisfied when a property of the information signal taking account of the selected value closer to the Restaurantkann- th property is as a property of the information signal taking account of a non-selected value.
  • FIG. 1 shows a block diagram of a device for error concealment according to the invention
  • Fig. 2 is a sketch showing the occurrence of an error concealment area due to continuation errors in both the forward decoder and the reverse decoder;
  • FIG. 3 shows a schematic diagram to illustrate the error concealment according to the invention, in which the predetermined criterion is based on a recently correctly decoded information unit or a recently concealed and possibly correct one
  • Fig. 4 is a schematic diagram according to an alternative embodiment of the present invention, in which a previous block of decoded
  • FIG. 1 shows a preferred exemplary embodiment of an inventive device for concealing errors.
  • a memory 10 in which a sequence of bits 12 is stored, which represent a block of reversible code words of variable length.
  • the first code word CWl could, for example, comprise three bits, while the second code word comprises only two bits and the last code word CWn comprises, for example, five bits.
  • the bit stream 12 presents itself to both a forward decoder 14 and a backward decoder only as a sequence of bits, since the beginning and the end of a code word, as has been explained, are inherent and not explicitly included.
  • the forward decoder is designed to start decoding the bit stream 12 starting from a starting point SP, which is shown by way of example in FIG. 1 at the left end of the stream, while the reverse decoder 16 is designed to perform a decoding of the bit stream 12 from an end point EP, which is shown in FIG. 1 at the right end of the bit stream 12.
  • Both the forward decoder 14 and the backward decoder 16 feed means 18 for determining an error concealment area.
  • the forward decoder supplies a forward decoding value for the first code word CW1, then a next forward decoding value for the code word CW2 etc.
  • the backward decoder supplies a backward decoding value first for the code word CWn and then for that Code word CW (nl), etc.
  • An error sintering range is given if the forward decoder 14 and the backward decoder 16 supply different output values for one and the same code word.
  • the error concealment area is present when two different “suggestions” for one and the same information unit are supplied to the device for determining an error concealment area.
  • the overlap area is generated by initially only one decoder, e.g. B. the forward decoder works.
  • the other decoder in the example the backward decoder, is only activated when it encounters an error and aborts the decoding, so that if the backward decoder also stops working due to the error, an overlap area may have arisen.
  • the device 22 for selecting is designed to select the value of the two alternatives which fulfills a predetermined criterion, which leads to an error or a potential error in the information unit or correspondingly in the code word being concealed.
  • the device 22 thus delivers error-concealed information units at its output 24, although it is pointed out that this information is ideally error-concealed, that is to say it has been completely reconstructed if only a single incorrect code word was present in the bit stream 12 and the selection is due to has given correct values of the predetermined criterion.
  • a criterion indicator which is supplied to the device 22 in order to change from one predetermined criterion to another predetermined criterion depending on a property of the information signal indicated by the indicator, which is determined by the information units switch.
  • the predetermined criterion will depend on the previously known property of an information signal determined by the information units, wherein the information signal can be an audio signal and / or a video signal.
  • FIG. 2 is a more detailed illustration of the initial situation at which the error concealment technique according to the invention nik comes into play.
  • the block of reversible code words of variable length 12 with a start point SP and end point EP ' is shown, and in addition, registered variable over the symbolized by small squares code words length ordinal numbers for the variable length code words are ,
  • the block of variable length code words comprises a total of 23 code words.
  • the illustration in FIG. 2 is only schematic, since the length in bits of the individual code words of variable length is of course not the same for each code word, but differs from code word to code word.
  • the forward decoder will output forward decoding values which are correct information units up to atomic number 11 and are only faulty from atomic number 12, as symbolized by small dots in the corresponding squares of FIG. 2 is. Only at atomic number 18 is the forward decoder set to an invalid, e.g. encounter non-symmetrical code word, which was caused by bit error 12, but which, due to the error propagation, only led to an invalid code word for the code word with ordinal number 18. The forward decoder will therefore cease to output at code word # 18.
  • the backward decoder works analogously, it begins at the end point EP of block 12 and will deliver correct results up to the code word with the ordinal number 13 and only then deliver erroneous results. Furthermore, it is assumed that the backward decoder encounters an invalid code word only at the code word with the ordinal number 7 and recognizes that an error has occurred somewhere ahead. Of course, the decoder is not aware that the error in code word No. 12 has occurred. He must therefore assume that, in extreme cases, no error propagation has occurred. In other words, this means that the error in code word No. 12 could also have been in code word No. 7 on the one hand or in code word No. 18 on the other hand. The entire range from the code word with the number 7 to the code word with the number 18, which represents the error concealment area, is therefore ambiguous.
  • the information units coded by the variable length codewords are scale factors of an audio signal coded according to an MPEG standard.
  • a predetermined property of audio signals is that scale factors generally do not change particularly strongly from one scale factor band to the next, ie from one scale factor to the next next scale factor in terms of frequency. In other words, it means that small changes between successive scales- factors are more likely than larger " changes.
  • the predetermined criterion in the example shown in FIG. 3 is therefore that both the forward decoding value for the code word with the ordinal number 7 or for the information unit with the ordinal number 7 and the backward decoding value for the
  • the code word or the information unit with the ordinal number 7 are compared with a threshold value as a reference, the last intact scale factor, which is denoted by 34 in FIG. 3, being used as the threshold value.
  • the value that is closer to the scale factor 34 for atomic number 6 is used as the “error-concealed” scale factor 36.
  • a first step is ended and a second step is started in order to also conceal an error for the code word with the ordinal number 8.
  • the two suggestions of the forward decoder and the backward decoder for code word No. 8 are taken and compared with the just reconstructed scale factor 36 in order to add another error-concealed, i.e. reconstructed to generate scale factor 38.
  • the same is carried out analogously from the other side of the error concealment area until an average scale factor m is encountered from both sides, if this exists.
  • the error-concealed value generated from the left-hand approximation will differ from the error-concealed value generated from the right-hand approximation.
  • One of the two values could be selected at random. Alternatively, however, it is preferred in this case to take an average of these two values or any value that lies between these two values. This value for the average atomic number m is very likely to be an incorrect value, but this will not lead to a major deviation, since it is based on constructed values to the left and right of the atomic number m.
  • the predetermined criterion can be performed in the frequency direction based on the previous or subsequent scale factor.
  • An alternative possibility is shown in FIG. 4. 4, the predetermined criterion is not determined on the basis of the frequency factor adjacent to the scale block from the current block, but rather on the basis of the scale factor with the same ordinal number from the previous block.
  • the two suggestions of the forward decoder and the backward decoder are compared to the same order number scale factor of the previous block to then take the suggestion that is less different from the previous block scale factor as it was displayed is, for scale factors in many cases it applies that they change from block to block only to a limited extent.
  • a selection between the predetermined criterion shown in FIG. 3 and the predetermined criterion shown in FIG. 4 can be carried out on the basis of the criterion indicator.
  • the criterion indicator can, for example, be given to the bit stream generated by the encoder as side information, for example to indicate for each block whether or not the scale factors change significantly in terms of the scale factor band in this block or with respect to a temporally adjacent block. If the scale factors change very strongly in a current block, the predetermined criterion shown in FIG. 3 will not work so well. In this case, the criterion shown in FIG.
  • the criterion indicator will be such that the device 22 is initialized in such a way that it uses the error concealment criterion shown in FIG on the previous block and not on frequency-related scale factors, as built in FIG. 3.
  • the device 22 for selecting is therefore designed to determine the energy of either adjacent or temporally successive scale factor bands using the likewise decoded spectral values in order to then take the scale factor proposal, in which the lower energy change results.
  • the predetermined criterion is determined not only for a pair of values in the error concealment area, but also for a plurality of pairs.
  • the device is designed for selection in order to determine an overall property for a plurality of different paths in the error concealment area. Each path runs between different forward and backward decoding values in different "zigzag paths".
  • the selection device is designed to select the decoding values that lie on the path that has an overall property that corresponds to the predetermined one
  • the overall property is a weighted or unweighted sum of individual properties of the path.
  • the predetermined criterion can be based on any information contained in the data stream anyway in modern coding methods, which allows a statement about a property of the size to be reconstructed.
  • Such information is based on the example of audio signals L / R or M / S stereo information, which is also an indicator of whether the information in the two stereo channels is very different or similar and thus also represents a rough measure of the signal statistics and thus defining a known property of the information signal.
  • the error concealment method according to the invention can be implemented in hardware or in software.
  • the implementation can take place on a digital storage medium, in particular a floppy disk or CD with electronically readable control signals, which can cooperate with a programmable computer system in such a way that the corresponding method is carried out.
  • the invention thus also consists in a computer program product with program code stored on a machine-readable carrier for carrying out the method according to the invention when the computer program product runs on a computer.
  • the invention can thus be implemented as a computer program with a program code for carrying out the method if the computer program runs on a computer.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Health & Medical Sciences (AREA)
  • Computational Linguistics (AREA)
  • Human Computer Interaction (AREA)
  • Acoustics & Sound (AREA)
  • Mathematical Physics (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Electrical Discharge Machining, Electrochemical Machining, And Combined Machining (AREA)
  • Application Of Or Painting With Fluid Materials (AREA)
  • Error Detection And Correction (AREA)
  • Image Processing (AREA)

Abstract

L'invention concerne un dispositif de masquage d'une erreur dans une unité d'information défectueuse ou potentiellement défectueuse. Ledit dispositif produit des valeurs de sortie d'un décodeur aval (14) et d'un décodeur amont (16) différentes les unes des autres, et indiquant ainsi une zone de masquage d'erreur (18). Les différentes valeurs d'une même unité d'information sont examinées au sujet d'un critère prédéfini afin de choisir la valeur (22) remplissant le critère prédéfini, c.-à-d. la valeur qui est plausible. Ainsi, il est possible d'éliminer ou de réduire les erreurs de poursuite créées lors du décodage de blocs constitués de mots code réversibles de longueur variable, sans avoir d'effet sur un taux de compression.
PCT/EP2003/003607 2002-04-29 2003-04-07 Dispositif et procede de masquage d'une erreur WO2003094358A1 (fr)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CA002482866A CA2482866C (fr) 2002-04-29 2003-04-07 Dispositif et procede pour la dissimulation d'une erreur
EP03747407A EP1495548B1 (fr) 2002-04-29 2003-04-07 Dispositif et procede de masquage d'une erreur
DE50302479T DE50302479D1 (de) 2002-04-29 2003-04-07 Vorrichtung und verfahren zum verschleiern eines fehlers
AU2003226791A AU2003226791A1 (en) 2002-04-29 2003-04-07 Device and method for masking a fault
US10/976,540 US7428684B2 (en) 2002-04-29 2004-10-29 Device and method for concealing an error
HK05101227A HK1069026A1 (en) 2002-04-29 2005-02-16 Device and method for masking a fault

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE10219133.6 2002-04-29
DE10219133A DE10219133B4 (de) 2002-04-29 2002-04-29 Vorrichtung und Verfahren zum Verschleiern eines Fehlers

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US10/976,540 Continuation US7428684B2 (en) 2002-04-29 2004-10-29 Device and method for concealing an error

Publications (1)

Publication Number Publication Date
WO2003094358A1 true WO2003094358A1 (fr) 2003-11-13

Family

ID=29224884

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2003/003607 WO2003094358A1 (fr) 2002-04-29 2003-04-07 Dispositif et procede de masquage d'une erreur

Country Status (7)

Country Link
EP (1) EP1495548B1 (fr)
AT (1) ATE318467T1 (fr)
AU (1) AU2003226791A1 (fr)
CA (1) CA2482866C (fr)
DE (2) DE10219133B4 (fr)
HK (1) HK1069026A1 (fr)
WO (1) WO2003094358A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2437170C2 (ru) * 2006-10-20 2011-12-20 Франс Телеком Ослабление чрезмерной тональности, в частности, для генерирования возбуждения в декодере при отсутствии информации

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0732855A2 (fr) * 1995-03-15 1996-09-18 Kabushiki Kaisha Toshiba Système de codage et/ou décodage d'images en mouvement, et système de codage à longueur variable
EP0966107A1 (fr) * 1997-10-02 1999-12-22 Kabushiki Kaisha Toshiba Decodeur de longueur variable et procede de decodage
DE19840835A1 (de) * 1998-09-07 2000-03-16 Fraunhofer Ges Forschung Vorrichtung und Verfahren zum Entropiecodieren von Informationswörtern und Vorrichtung und Verfahren zum Decodieren von Entropie-codierten Informationswörtern
US6104754A (en) * 1995-03-15 2000-08-15 Kabushiki Kaisha Toshiba Moving picture coding and/or decoding systems, and variable-length coding and/or decoding system
WO2000068934A1 (fr) * 1999-05-07 2000-11-16 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Procede et dispositif pour masquer une erreur dans un signal audio code, et procede et dispositif de decodage d'un signal audio code
DE19959038A1 (de) * 1999-12-08 2001-06-28 Bosch Gmbh Robert Verfahren zur Dekodierung von digitalen Audiodaten

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0732855A2 (fr) * 1995-03-15 1996-09-18 Kabushiki Kaisha Toshiba Système de codage et/ou décodage d'images en mouvement, et système de codage à longueur variable
US6104754A (en) * 1995-03-15 2000-08-15 Kabushiki Kaisha Toshiba Moving picture coding and/or decoding systems, and variable-length coding and/or decoding system
EP0966107A1 (fr) * 1997-10-02 1999-12-22 Kabushiki Kaisha Toshiba Decodeur de longueur variable et procede de decodage
DE19840835A1 (de) * 1998-09-07 2000-03-16 Fraunhofer Ges Forschung Vorrichtung und Verfahren zum Entropiecodieren von Informationswörtern und Vorrichtung und Verfahren zum Decodieren von Entropie-codierten Informationswörtern
WO2000068934A1 (fr) * 1999-05-07 2000-11-16 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Procede et dispositif pour masquer une erreur dans un signal audio code, et procede et dispositif de decodage d'un signal audio code
DE19959038A1 (de) * 1999-12-08 2001-06-28 Bosch Gmbh Robert Verfahren zur Dekodierung von digitalen Audiodaten

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
FRAENKEL A S ET AL: "BIDIRECTIONAL HUFFMAN CODING", COMPUTER JOURNAL, OXFORD UNIVERSITY PRESS, SURREY, GB, vol. 33, no. 4, 1 August 1990 (1990-08-01), pages 296 - 307, XP000159500, ISSN: 0010-4620 *
TAKISHIMA T ET AL: "REVERSIBLE VARIABLE LENGTH CODES", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE INC. NEW YORK, US, vol. 43, no. 2/4, PART 1, 1 February 1995 (1995-02-01), pages 158 - 162, XP000506544, ISSN: 0090-6778 *
ZHANG R ET AL: "VIDEO CODING WITH OPTIMAL INTER/INTRA-MODE SWITCHING FOR PACKET LOSS RESILIENCE", IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, IEEE INC. NEW YORK, US, vol. 18, no. 6, June 2000 (2000-06-01), pages 966 - 976, XP000954577, ISSN: 0733-8716 *

Also Published As

Publication number Publication date
CA2482866A1 (fr) 2003-11-13
CA2482866C (fr) 2008-07-08
HK1069026A1 (en) 2005-05-06
AU2003226791A1 (en) 2003-11-17
ATE318467T1 (de) 2006-03-15
EP1495548A1 (fr) 2005-01-12
EP1495548B1 (fr) 2006-02-22
DE50302479D1 (de) 2006-04-27
DE10219133B4 (de) 2007-02-22
DE10219133A1 (de) 2003-11-13

Similar Documents

Publication Publication Date Title
EP1112621B1 (fr) Dispositif et procede pour effectuer un codage entropique de mots d'information et dispositif et procede pour decoder des mots d'information ayant subi un codage entropique
EP0393526B2 (fr) Procédé de codage numérique
EP0609300B1 (fr) Procede de transmission ou de memorisation d'un signal audio code numerise compose d'une sequence de blocs d'informations, par des canaux brouilles
DE19846721B4 (de) Verfahren zur Kodierung und Dekodierung und Vorrichtung zum Kodieren oder Dekodieren
DE19952683B4 (de) Vorrichtung und Verfahren zum Senden und Empfangen von Video-Daten
DE19907728C2 (de) Vorrichtung und Verfahren zum Erzeugen eines Datenstroms und Vorrichtung und Verfahren zum Lesen eines Datenstroms
EP1495548B1 (fr) Dispositif et procede de masquage d'une erreur
DE3500115A1 (de) Verfahren zum codieren eines datenbitmusters, anordnung zur durchfuehrung des verfahrens und anordnung zum decodieren des mit dem verfahren erhaltenen kanalbitflusses
EP1290808B1 (fr) Systeme de transmission de donnees base sur le procede du saut de frequences
EP1153481B1 (fr) Procede et dispositif pour produire un flux de donnees constitue de mots de code de longueur variable, et procede et dispositif pour lire un flux de donnees constitue de mots de code de longueur variable
DE3134831A1 (de) System zur uebertragung digitaler informationssignale
DE10114834B4 (de) System zur Datenübertragung nach dem Frequenzsprungverfahren
EP1016236A1 (fr) Decodage rapide de donnees codees par convolution, partiellement recues
EP1458103B1 (fr) Méthode et dispositif de codage/décodage d'un signal audio
WO2000039933A1 (fr) Procede et dispositifs pour le codage ou le decodage d'un signal audio ou d'un train de bits
DE10226902B4 (de) Verfahren und Vorrichtung zum Erkennen von schlechten oder unzuverlässigen Codewortblöcken
DE9218826U9 (de) Schaltungsanordnung zum Übertragen von Datensignalen innerhalb eines Videotext-Datenstroms
DE10243787A1 (de) Verfahren zur Decodierung einer codierten Bitfolge
EP1047199A2 (fr) Dispositif et méthode de transmission de données
DE3526914A1 (de) Verfahren zur gegen buendelfehler unempfindlichen blockweisen rbertragung digitaler daten
DE10245639A1 (de) Verfahren zur Bitfehlerreduzierung einer zu übertragenden Datenbitfolge und zur empfangseitigen Decodierung dieser Datenbitfolge

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 BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE 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 NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL 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): GH GM KE LS MW MZ 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 IT LU MC NL 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
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2482866

Country of ref document: CA

WWE Wipo information: entry into national phase

Ref document number: 10976540

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2003747407

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2003747407

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWG Wipo information: grant in national office

Ref document number: 2003747407

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP