WO2006090302A2 - Dispositif et procede permettant de corriger des erreurs dans un train de donnees - Google Patents

Dispositif et procede permettant de corriger des erreurs dans un train de donnees Download PDF

Info

Publication number
WO2006090302A2
WO2006090302A2 PCT/IB2006/050475 IB2006050475W WO2006090302A2 WO 2006090302 A2 WO2006090302 A2 WO 2006090302A2 IB 2006050475 W IB2006050475 W IB 2006050475W WO 2006090302 A2 WO2006090302 A2 WO 2006090302A2
Authority
WO
WIPO (PCT)
Prior art keywords
bis
words
sync
errors
ldc
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/IB2006/050475
Other languages
English (en)
Other versions
WO2006090302A3 (fr
Inventor
Bram Van Den Bosch
Martinus W. Blum
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
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 Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Publication of WO2006090302A2 publication Critical patent/WO2006090302A2/fr
Publication of WO2006090302A3 publication Critical patent/WO2006090302A3/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11BINFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10Digital recording or reproducing
    • G11B20/18Error detection or correction; Testing, e.g. of drop-outs
    • G11B20/1866Error detection or correction; Testing, e.g. of drop-outs by interleaving
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11BINFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10Digital recording or reproducing
    • G11B20/18Error detection or correction; Testing, e.g. of drop-outs
    • G11B20/1833Error detection or correction; Testing, e.g. of drop-outs by adding special lists or symbols to the coded information
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13Linear codes
    • H03M13/15Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/29Coding, 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/2954Coding, 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 using Picket codes or other codes providing error burst detection capabilities, e.g. burst indicator codes and long distance codes [LDC]
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11BINFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10Digital recording or reproducing
    • G11B20/12Formatting, e.g. arrangement of data block or words on the record carriers
    • G11B2020/1264Formatting, e.g. arrangement of data block or words on the record carriers wherein the formatting concerns a specific kind of data
    • G11B2020/1265Control data, system data or management information, i.e. data used to access or process user data
    • G11B2020/1267Address data
    • G11B2020/1271Address data the address data being stored in a subcode, e.g. in the Q channel of a CD
    • G11B2020/1272Burst indicator subcode [BIS]
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11BINFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B20/00Signal processing not specific to the method of recording or reproducing; Circuits therefor
    • G11B20/10Digital recording or reproducing
    • G11B20/12Formatting, e.g. arrangement of data block or words on the record carriers
    • G11B2020/1264Formatting, e.g. arrangement of data block or words on the record carriers wherein the formatting concerns a specific kind of data
    • G11B2020/1288Formatting by padding empty spaces with dummy data, e.g. writing zeroes or random data when de-icing optical discs
    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11BINFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B2220/00Record carriers by type
    • G11B2220/20Disc-shaped record carriers
    • G11B2220/25Disc-shaped record carriers characterised in that the disc is based on a specific recording technology
    • G11B2220/2537Optical discs
    • G11B2220/2541Blu-ray discs; Blue laser DVR discs

Definitions

  • the present invention relates to a device and a method for error correction of a data stream comprising user data encoded into long distance code (LDC) words, control data encoded into burst indicating subcode (BIS) words and SYNC data, said LDC words and said BIS words being alternately arranged in physical clusters starting with SYNC data. Further, the present invention relates to a computer program for implementing said method on a computer.
  • LDC long distance code
  • BIOS burst indicating subcode
  • the error correction mechanism mainly consists of two error correction codes: the LDC (long distance code) and the BIS (burst interleaved code).
  • the LDC code is applied to the user data and can correct random errors and burst errors.
  • the BIS code is applied to the addresses and control information, which is interleaved with the user data. This BIS code can be used to indicate long burst errors to the LDC code, by means of which the LDC can efficiently correct erasures. The fact that a location of a codeword will be indicated as an erasure to the
  • LDC depends on the status (found or not) of the SYNC patterns and correction status (corrected or not) of the BIS bytes, surrounding the corresponding data byte in the received data stream, which is, for instance, read from a record carrier, such as an optical disc.
  • the current Blu-Ray Disc specification doesn't contain any information about good or bad erasure strategies. It just contains the description of the principle that BIS bytes and SYNC patterns can be used to generate the LDC erasures.
  • a method for error correction is defined in claim 15.
  • a computer program comprising program code means for causing a computer to perform the steps of the said method, when said computer program is executed on a computer is defined in claim 16.
  • Preferred embodiments of the invention are defined in the dependent claims.
  • This invention provides an advantageous strategy, that can be used to generate the LDC erasures out of the BIS corrections (BIS byte was correct or not) and SYNC pattern information (SYNC was found at the expected location or not).
  • the invention is based on the idea to provide the ability to influence the general behavior, in particular the aggressiveness, of the erasure correction of the data stream by use of separate control settings. Instead of having to choose between a number of distinct strategies, the user thus has a limited number of parameters (i.e. control settings) that allow the user to control the general main behavior of the erasure strategy, like how aggressive the erasure correction should be in certain situations.
  • the control settings are generally independent of each other, i.e. changing one control setting shouldn't affect the optimal settings for the other control settings. Hence, the result of the erasure correction is easily predictable.
  • Aggressiveness here refers to the number of locations of LDC words that are marked as erasures given a certain pattern of BIS errors and SYNC errors. The more locations are marked as erasures, the more aggressive the erasure strategy is.
  • Marking certain locations as erasures has to be done carefully: marking locations that contain errors as erasures increases the error correction capability, but marking locations that doesn't contain errors as erasures decreases the error correction capability. On discs with burst errors, erasures shall be put if the surrounding BIS bytes /
  • SYNC patterns are erroneous because this indicates that the LDC bytes will also be erroneous. So for discs with mainly burst errors, the erasure strategy shall generally be more aggressive, i.e. erasures shall be marked at locations where errors are expected. On discs with random errors, any erasures shall not be put because the fact that the surrounding BIS bytes / SYNC pattern are erroneous doesn't give any information about the LDC bytes. So for discs with mainly random errors, the erasure strategy shall generally be more defensive, i.e. there shall not be marked many erasures.
  • a user is thus able to adapt the erasure strategy, i.e. the user can use the information of the erroneous BIS bytes / SYNC patterns in different ways, e.g. depending on the particular disc if desired.
  • a memory for storing said control settings set by the user or the manufacturer of said device.
  • the control settings can be pre-set and stored in the device.
  • a user interface can be provided for allowing the user of said device to set said control settings, e.g.
  • control settings can be changed.
  • the control settings comprise three different rules as defined in claims 5 to 12 which can be provided to control the behavior of the erasure correction.
  • said rules include one or more conditions (or parameters) which allow the user or manufacturer to influence the behavior, in particular the aggressiveness, of the erasure correction.
  • Each rule relates to a different kind of aggressiveness:
  • different thresholds can be defined which are used according to rule 1 to determine if a small number, in particular less than five, preferably one or two, of subsequent holes, which are surrounded by many BIS / SYNC errors, shall be interpreted as BIS / SYNC errors.
  • different thresholds can be defined which are used according to rule 2 to determine if a small number, in particular less than five, preferably one or two, of subsequent isolations, which are surrounded by many good BIS / SYNC data, shall be interpreted as good BIS / SYNC data.
  • control unit comprises a preprocessing unit for applying said first and/or second rule and a processing unit for applying said third rule.
  • the result of the first preprocessing unit is preferably taken as an input.
  • the preprocessing unit may further be divided into a first subunit for applying in a first step said first rule or said second rule and a second subunit for applying in a second subsequent step the other of said first or second rule not applied by said first subunit taking into account the result obtained by said first subunit.
  • the first and second rules are implemented in the preprocessing unit in such a way that it allows the straightforward combination with the third rule: the first and second rule are implemented by having a conditional replacement of BIS errors and/or SYNC errors by good BIS words or good SYNC data and vice versa.
  • Fig. 1 illustrates the process of encoding a physical cluster of the BD-RW
  • Fig. 2 illustrates the process of decoding a physical cluster of the BD-RW according to the invention
  • Fig. 3 illustrates a schematic diagram of an optical disk reproducing apparatus in which the present invention may be advantageously embodied
  • Fig. 4 illustrates a detailed block diagram for explaining the method of correcting errors in accordance with the invention
  • Fig. 5 illustrates different scenarios of dealing with holes in burst errors according to the invention
  • Fig. 6 illustrates different scenarios of dealing with isolations according to the invention
  • Fig. 7 illustrates different scenarios of using different wing sizes according to the invention
  • Fig. 8 illustrates a schematic diagram of a control unit according to the invention
  • Fig. 9 illustrates a schematic diagram of a preprocessing unit of said control unit according to the invention
  • Fig. 10 illustrates different scenarios of using a half- wing strategy according to the invention
  • Fig. 11 illustrates different scenarios of using a full-wing strategy according to the invention
  • Fig. 12 illustrates different scenarios of using a zero-wing strategy according to the invention.
  • BD-RW Blu-ray Disc Rewritable
  • BD-ROM Blu-ray Disk ROM
  • user data such as A/V data and various contents is encoded through multiple data processing steps to be recorded on the BD-RW.
  • User data of a predetermined size is converted into data frames, scrambled data frames, a data block, a long distance code (LDC) block, and a LDC cluster in turn.
  • user control data corresponding to the user data is converted into an access block, a burst indicating subcode (BIS) block, and a burst indicating subcode (BIS) cluster in turn.
  • a BIS cluster encoded in this manner is divided into three parts of the same size and each part is inserted between two data blocks of an LDC cluster, each data block being of a predefined size.
  • SYNC data is added to one LDC cluster and one BIS cluster recorded in this manner, which constitutes one physical cluster.
  • one physical cluster comprises 155 columns (SYNC data exclusive) and 496 rows.
  • SYNC data has a size of 20 bits
  • each of the first- column through fourth-column LDC data blocks has a size of 38 bytes
  • each of the first- column through third-column BIS data blocks has a size of one byte.
  • An error in each 1-byte BIS data block can be detected by conventional Reed Solomon (RS) decoding sequences.
  • RS Reed Solomon
  • a specific erasure strategy might, for example, conclude that the LDC bytes in between the BIS errors (or in between the BIS error and the SYNC error) probably contain errors and it will mark these LDC bytes as erasures.
  • LDC error correction the corresponding locations in the LDC words are treated as erasures, and can thus be more easily corrected.
  • Fig. 3 illustrates a schematic diagram of an optical disk reproducing apparatus as disclosed in WO 2004/021619 A2 in which the present invention may be advantageously embodied.
  • the apparatus comprises an optical pickup 11 for reproducing recorded signals from an optical disk 10 such as a BD-RW disk or a BD-ROM disk, a VDP system 12 for converting the reproduced signal into a binary signal, retrieving digital data from the binary signal, decoding the digital data, correcting errors in data, and controlling the overall decoding operation, and a D/A converter 13 for converting decoded digital data into analog signals.
  • the VDP system 12 responsive to a user request performs reproduction of the optical disk 10 loaded into the apparatus.
  • the VDP system 12 comprises a plurality of conceptional blocks: a demodulation unit 120, a SYNC error detecting unit 121, a separating unit 122, a BIS deinterleaving unit 123, a BIS block buffer 124, a BIS decoding unit 125, control unit 126, an LDC deinterleaving unit 127, an LDC block buffer 128, and an LDC decoding unit 129.
  • the SYNC error detecting unit 121 detects 20-bit SYNC data from a data stream demodulated by the demodulation unit 120 and compares the detected SYNC data with preset predictive SYNC data to determine whether an error occurs in the SYNC data.
  • the separating unit 122 separates the data stream from the demodulation unit 120 into BIS data and LDC data.
  • the BIS deinterleaving unit 123 deinterleaves the BIS data and stores the BIS data in the BIS block buffer 124.
  • the BIS decoding unit 125 performs RS decoding operations on the BIS data stored in the BIS block buffer 124 to determine whether an error occurs as shown in Fig. 2. The determination result is sent to the control unit 126.
  • the control unit 126 determines whether to mark an LDC byte as erasure.
  • the LDC deinterleaving unit 127 deinterleaves LDC data from the separating unit 122 and stores the LDC data in the LDC block buffer 128.
  • the LDC decoding unit 128 performs RS decoding operations on the LDC data stored in the LDC block buffer 128. If the LDC byte is marked as an erasure by the control unit 126 the corresponding location in the LDC word will be treated as an erasure during the LDC error correction and this location can thus be more easily corrected.
  • control unit 126 By use of a memory 14 storing control settings and/or a user interface 15 for input of control settings the control unit 126 can be provided with said control settings for control of the erasure strategy.
  • control unit 126 By use of a memory 14 storing control settings and/or a user interface 15 for input of control settings the control unit 126 can be provided with said control settings for control of the erasure strategy.
  • a first rule included in the control setting relates to how to deal with single, double or more subsequent holes in burst errors.
  • a good BIS byte / SYNC pattern is meant that is surrounded by bad BIS bytes / SYNC patterns; with a double hole in a burst error, two consecutive good BIS bytes / SYNC patterns are meant that are surrounded by bad BIS bytes / SYNC patterns, etc..
  • the decision when holes in burst errors shall be filled up is a choice, e.g. of the user or the manufacturer of the decoder, that influences the aggressiveness of the erasure strategy related to these holes.
  • Filling a hole means that if there is a good BIS byte / SYNC pattern that is surrounded by bad BIS bytes / SYNC patterns (i.e. a hole), that BIS byte / SYNC pattern will be treated as if it was bad. This is done because it is expected that the BIS byte / SYNC pattern was correct "by accident", i.e. that the surrounding LDC bytes will be mainly wrong bytes.
  • Fig. 5 illustrates four identical scenarios (i.e. four rows) of a sequence of BIS bytes / SYNC patterns separated by LDC bytes to which different strategies of handling single holes have been applied.
  • a circle means a good BIS byte / SYNC pattern
  • a cross means a bad BIS byte / SYNC pattern
  • a line means that the corresponding LDC locations are marked as erasures.
  • a different erasure strategy i.e. a different setting for the first rule, has been applied.
  • the first line of Fig. 5 shows an erasure strategy that doesn't put erasures around single holes, i.e.
  • the last line shows an erasure strategy that puts erasures around the single holes, i.e. a very aggressive strategy.
  • the lines in the middle show erasure strategies that use more complex strategies to decide if erasures are put around single holes, i.e. they look in a wider window to the surrounding BIS bytes / SYNC patterns to get a better picture about the scenario.
  • the control setting for the first rule it is possible to gradually increase the aggressiveness of the erasure correction related to holes.
  • Aggressive strategies always put erasures around single (or more subsequent) holes, more defensive ones will only erase when there are no other bad BIS bytes / SYNC patterns in the neighborhood. The same can be said about double (or more subsequent) holes.
  • the first rule could use different conditions for single, double or more subsequent holes.
  • a second rule included in the control setting relates to how to deal with single, double or more subsequent isolations in burst errors.
  • a bad BIS byte / SYNC pattern is meant that is surrounded by good BIS bytes / SYNC patterns; with a double isolation, tow consecutive bad BIS bytes / SYNC patterns are meant that are surrounded by good BIS bytes / SYNC patterns, etc..
  • Erasure strategies are only useful during burst errors: If there is a purely random error pattern, erasure correction shall not be performed because this will rather limit the error correction capability instead of extending it.
  • Single bad BIS bytes / SYNC patterns can indicate a random error pattern or a very short burst error. In the first case no erasure correction shall be made; in the latter case the neighboring locations shall be marked as erasures. This is again a choice, e.g. of the user or manufacturer, how aggressive the erasure strategy is related to isolations, i.e. by deciding when to remove isolations. Removing isolations means that if there is a bad BIS byte / SYNC pattern that is surrounded by good BIS bytes / SYNC patterns (i.e. an isolation), this will be treated as if it was good. This is done because it is expected that the BIS byte / SYNC pattern was bad "by accident" (random error), i.e. that the surrounding LDC bytes will be mainly good.
  • Fig. 6 illustrates - like Fig. 5 - four identical scenarios (i.e. four rows) of a sequence of BIS bytes / SYNC patterns separated by LDC bytes, to which different erasure strategies, i.e. different settings for the second rule, have been applied.
  • the first line shows an erasure strategy that puts erasures around the single isolations, i.e. a very aggressive strategy.
  • the last line shows an erasure strategy that doesn't put erasures around single isolations, i.e. a very defensive strategy.
  • the lines in the middle show erasure strategies that use more complex strategies to decide if erasures are put around single isolations, i.e. they look in a wider window to the surrounding BIS bytes / SYNC patterns to get a better picture about the scenario.
  • the second rule By changing the control setting for the second rule, it is possible to gradually increase the defensiveness (or decrease the aggressiveness) of the erasure correction related to isolations.
  • Aggressive strategies always put erasures around single isolations, more defensive ones will only erase when there are other bad BIS bytes / SYNC patterns in the neighborhood. The same can be said about double (or more subsequent) isolations.
  • the second rule could use different conditions for single, double or more subsequent isolations.
  • a third rule included in the control setting relates to the wing size.
  • wing size it is meant how many locations will be flagged as erasures that are in between a good and a bad BIS byte / SYNC pattern. It shall be remarked here that inbetween two consecutive bad BIS bytes / SYNC patterns everything will be flagged as erasures, so the amount of erasures that are flagged at the boundaries can be seen as the size of the 'wings' of the erasure indication. Since there is no information available how many locations need to be erased at the boundaries, it is again a choice, e.g. of the user or the manufacturer, how aggressive the erasure strategy, related to the boundaries, should be.
  • Fig. 7 illustrating three identical scenarios (i.e. three rows) of a sequence of BIS bytes / SYNC patterns separated by LDC bytes, to which different erasure strategies, i.e. different settings for the third rule, have been applied..
  • the first line of Fig. 7 shows a scenario which has a wing size of 0.5, i.e. the erasures are put up to half the interval in between a bad and a good BIS byte / SYNC pattern.
  • the second line shows a scenario which has a wing size of 0, i.e. no erasures are put in the interval in between a bad and a good BIS byte / SYNC pattern, i.e. a very defensive strategy.
  • the second line shows a scenario which has a wing size of 1, i.e. erasures are put in the complete interval in between a bad and a good BIS byte / SYNC pattern, i.e. a very aggressive strategy.
  • the third rule by changing the control setting for the third rule, it is possible to gradually increase the aggressiveness of the erasure correction at the boundaries of (burst) errors by gradually increasing the wing size.
  • the third rule thus also controls the number of locations marked as erasures around single (or more subsequent) holes and/or isolations, which also influences the aggressiveness, i.e. the more locations are marked as erasures, the more aggressive the erasure correction will be.
  • the first two control settings are quite similar. These two settings, i.e. the control over how to deal with holes and isolation, are handled in the so-called preprocessing unit 261, which receives flags from the SYNC detection (unit 121) and the BIS correction (unit 125) as input. These settings have to do with the "frequency content" of the erasing process: is it desired to immediately stop erasing when a good BIS byte / SYNC pattern in a burst of bad BIS bytes/SYNC patterns (or the other way around) is recognized? To control this, some well-known concept as FIR- filters or flywheels can be used. Alternatively, some non- linear filters or dedicated solutions can be used.
  • the third control setting (rule), i.e. the control over the wing size, is handled in the so-called processing unit 262, which receives the preprocessed flags of the preprocessing unit 261 as input.
  • the processing unit 262 can be implemented with a very simple Boolean expression, as is usually done in the known single- step-erasure strategies.
  • the output of the processing unit 262 is finally provided to the LDC decoder 129.
  • a preferred embodiment for the preprocessing unit 261 is presented in Fig. 9, since it has superior qualities concerning flexibility, comprehensibility for the user and predictability. It will implement the first and second rule by conditionally changing certain BIS errors and/or SYNC errors in good BIS words or good SYNC words and vice versa.
  • This dedicated solution has a two-step process for the preprocessing itself: In the first step (performed in the first subunit 2611), holes can be filled depending on the surrounding BIS bytes / SYNC patterns. In the second step (performed in the second subunit 2612), the isolations can be removed depending on the surrounding BIS bytes / SYNC patterns.
  • the second step uses the BIS bytes / SYNC patterns after the filling of the single/double holes, so these are preferably really two serial steps, not parallel ones.
  • the order of the two steps can is reversed, which would make the system much more defensive for the same settings of the steps. In this way, it completely follows the split up between the preprocessing step and the actual erasure strategy (processing) step, that was made based on the control settings.
  • Bad-burst-size-max max(size of bad-burst on the left, size of bad-burst on the right).
  • Bad-burst-size-min min(size of bad-burst on the left, size of bad-burst on the right).
  • FILL SINGLE HOLE HIGH and FILL SINGLE HOLE LOW being user settings and Bad-burst-size-max and Bad-burst-size-min as defined above.
  • FILL DOUBLE HOLE HIGH and FILL_ DOUBLE HOLE LOW being user settings and Bad-burst-size-max and Bad-burst-size-min as defined above.
  • FILL DOUBLE HOLE HIGH and FILL_ DOUBLE HOLE LOW are thus used as thresholds influencing the aggressiveness of the erasure correction, i.e. the lower the thresholds the more aggressive the erasure correction.
  • a preferred implementation of the second rule relating to the removal of isolations is as follows (according to this implementation in this step the BIS bytes/SYNC pattern stream after the filling of the holes is taken into account): A single isolations will be removed if
  • REMOVE SINGLE ISOLATION _LOW or REMOVE_DOUBLE_ISOLATION_HIGH and REMO VE_ DOUBLE ISOLATION LOW, respectively, are thus used as thresholds influencing the aggressiveness of the erasure correction, i.e. the higher the thresholds the more aggressive the erasure correction.
  • a preferred implementation of the third rule relating to the wing size is as follows. The only thing that needs to be control in this step is the wing size. In this implementation it is chosen that there are only three different wing sizes (full wings, no wings and half wings), since this provides enough flexibility to the user and allows a very simple implementation.
  • locations of LDC bytes shall be marked as erasures if the one of the preprocessed BIS byte / SYNC pattern that is adjacent to this location is bad, i.e. if the preprocessed neighboring BIS byte / SYNC pattern on the left OR the preprocessed neighboring BIS byte / SYNC pattern on the right is bad.
  • Fig. 11 Different scenarios of a sequence of good and bad BIS bytes / SYNC patterns where this full wing size strategy for the third rule has been applied are shown in Fig. 11.
  • locations of LDC bytes shall be marked as erasures if the both preprocessed BIS bytes / SYNC patterns that are adjacent to this location are bad, i.e. if the preprocessed neighboring BIS byte / SYNC pattern on the left AND the preprocessed neighboring BIS byte / SYNC pattern on the right is bad.
  • Fig. 12 Different scenarios of a sequence of good and bad BIS bytes / SYNC patterns where this zero wing size strategy for the third rule has been applied are shown in Fig. 12.
  • the present invention proposes an erasure strategy that has a limited number of parameters that directly control some control setting, which the user or manufacturer can directly control in order to determine the aggressiveness of the erasure correction.
  • a system is provided that comprises, in a preferred embodiment, multiple steps, each step providing the ability to gradually increase/decrease one kind of aggressiveness of the erasure correction.
  • the invention can be advantageously applied in reading and writing devices for reading and/or writing information from/to optical record carriers, such as CD, DVD or BD discs.
  • the method according to the present can be implemented in software stored in microprocessor or on a memory device, e.g. for use in a drive as part of a PC for accessing data carriers.
  • the invention can preferably be implemented in an integrated circuit, i.e. the claimed device can also be an IC.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Signal Processing (AREA)
  • General Physics & Mathematics (AREA)
  • Algebra (AREA)
  • Mathematical Physics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Detection And Correction Of Errors (AREA)
  • Error Detection And Correction (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Signal Processing For Digital Recording And Reproducing (AREA)

Abstract

L'invention concerne un dispositif et un procédé correspondant permettant de corriger des erreurs dans un train de données qui comprend des données utilisateur codées en mots de code long distance (LDC), des données de commande codées en mots de sous-code indiquant des rafales (BIS) et des données SYNC, les mots LCD et BIS étant alternativement agencés en grappes physiques commençant avec les données SYNC. Afin de s'assurer que le résultat d'une correction d'effacement peut être prédit et que cette correction d'effacement est compréhensible et d'utilisation facile, un dispositif prévu comprend: une unité de séparation (122) permettant de séparer les mots LDC et les mots BIS du train de données, un décodeur LDC (129) permettant de décoder les mots LDC et de corriger les erreurs et les effacements dans lesdits mots LDC, un décodeur BIS (125) permettant de décoder les mots BIS et de détecter les erreurs BIS dans lesdits mots BIS, un détecteur SYNC (121) permettant de détecter les données SYNC et les erreurs SYNC dans lesdites données SYNC, une unité de commande (126) permettant de marquer des effacements afin de décoder les mots LDC en fonction des erreurs BIS et des erreurs SYNC par marquage d'emplacements dans les mots LDC adjacents aux erreurs BIS et/ou aux erreurs SYNC comme effacements dépendant de paramètres de commande qui déterminent le comportement de la correction d'effacement du décodeur LDC.
PCT/IB2006/050475 2005-02-22 2006-02-14 Dispositif et procede permettant de corriger des erreurs dans un train de donnees Ceased WO2006090302A2 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP05101316.7 2005-02-22
EP05101316 2005-02-22

Publications (2)

Publication Number Publication Date
WO2006090302A2 true WO2006090302A2 (fr) 2006-08-31
WO2006090302A3 WO2006090302A3 (fr) 2006-11-09

Family

ID=36733329

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2006/050475 Ceased WO2006090302A2 (fr) 2005-02-22 2006-02-14 Dispositif et procede permettant de corriger des erreurs dans un train de donnees

Country Status (2)

Country Link
TW (1) TW200641814A (fr)
WO (1) WO2006090302A2 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109841250A (zh) * 2017-11-24 2019-06-04 光宝科技股份有限公司 译码状态的预测系统建立方法与操作方法

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7975208B2 (en) 2006-12-21 2011-07-05 Mediatek Inc. Method and apparatus for high speed optical recording

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EA002453B1 (ru) * 1998-07-27 2002-04-25 Конинклейке Филипс Электроникс Н.В. Кодирование многословной информации посредством пословного чередования
KR20040021039A (ko) * 2002-09-02 2004-03-10 엘지전자 주식회사 고밀도 광디스크의 에러정정 방법
US7281193B2 (en) * 2004-09-27 2007-10-09 Mediatek Inc. Method and apparatus for decoding multiword information

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109841250A (zh) * 2017-11-24 2019-06-04 光宝科技股份有限公司 译码状态的预测系统建立方法与操作方法
CN109841250B (zh) * 2017-11-24 2020-11-13 建兴储存科技股份有限公司 译码状态的预测系统建立方法与操作方法

Also Published As

Publication number Publication date
TW200641814A (en) 2006-12-01
WO2006090302A3 (fr) 2006-11-09

Similar Documents

Publication Publication Date Title
EP1410390B1 (fr) Procede d'enregistrement de donnees et support d'enregistrement
US7730379B2 (en) Method and apparatus for error code correction
US7849379B2 (en) Device and method for determining a defective area on an optical media
US7058875B2 (en) Method of correcting data on a high-density recording medium
KR19980025094A (ko) 부호 오류 정정/검출 디코더
SE465442B (sv) Foerfarande foer lagring och laesning samt anordning foer laesning av digital information som valfritt aer skyddad eller inte skyddad genom en felkorrigerande kod
JP2009199718A (ja) データファイル伝送方法
JP2005293724A (ja) 誤り箇所の検出方法、その方法を利用する誤り検出回路、誤り訂正回路、および再生装置
JP2004507030A (ja) ビットストリームを記憶又は復号化する方法
KR100567361B1 (ko) 저작권 보호 방법, 재생 방법, 재생 장치, 기록 방법 및기록 장치
WO2006090302A2 (fr) Dispositif et procede permettant de corriger des erreurs dans un train de donnees
CN100385552C (zh) 用来解码盘片读取信号的装置及其方法
KR101001494B1 (ko) 어플리케이션용 복사 방지
JP2007527589A (ja) コピー防止光ディスクのコピー
KR20040017383A (ko) 어드레스 데이터 변조 방법 및 장치, 그 어드레스 데이터복조방법 및 장치, 그리고 그 기록매체
KR100315768B1 (ko) 고속의 데이타재생을 위한 메모리액세스방법 및 이를 채용한dvd시스템
KR100218094B1 (ko) 광 디스크의 고밀도 기록방법
US20060077841A1 (en) Method of recording data on optical storage medium and apparatus thereof
KR20090100611A (ko) 데이터 에러 정정 방법 및 장치
JP2007287293A (ja) 記録媒体再生装置
KR19990018767A (ko) 디브이디-램 디스크의 고속 초기화 방법
HK1127154A (en) Copy protection for applications

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06710898

Country of ref document: EP

Kind code of ref document: A2

WWW Wipo information: withdrawn in national office

Ref document number: 6710898

Country of ref document: EP