Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F11/00—Error detection; Error correction; Monitoring
• • 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/27—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 using interleaving techniques
  • H03M13/2703—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 using interleaving techniques the interleaver involving at least two directions
• • G—PHYSICS
  • G11—INFORMATION STORAGE
  • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
  • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
  • G11B20/10—Digital recording or reproducing
  • G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
  • G11B20/1833—Error detection or correction; Testing, e.g. of drop-outs by adding special lists or symbols to the coded information
• • G—PHYSICS
  • G11—INFORMATION STORAGE
  • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
  • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
  • G11B20/10—Digital recording or reproducing
  • G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
  • G11B20/1866—Error detection or correction; Testing, e.g. of drop-outs by interleaving
• • 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/35—Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
• • 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/47—Error detection, forward error correction or error protection, not provided for in groups H03M13/01 - H03M13/37
• • G—PHYSICS
  • G11—INFORMATION STORAGE
  • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
  • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
  • G11B20/10—Digital recording or reproducing
  • G11B20/12—Formatting, e.g. arrangement of data block or words on the record carriers
  • G11B2020/1264—Formatting, e.g. arrangement of data block or words on the record carriers wherein the formatting concerns a specific kind of data
  • G11B2020/1265—Control data, system data or management information, i.e. data used to access or process user data
  • G11B2020/1267—Address data
  • G11B2020/1271—Address data the address data being stored in a subcode, e.g. in the Q channel of a CD
  • G11B2020/1272—Burst indicator subcode [BIS]
• • G—PHYSICS
  • G11—INFORMATION STORAGE
  • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
  • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
  • G11B20/10—Digital recording or reproducing
  • G11B20/18—Error detection or correction; Testing, e.g. of drop-outs
  • G11B20/1833—Error detection or correction; Testing, e.g. of drop-outs by adding special lists or symbols to the coded information
  • G11B2020/1846—Error detection or correction; Testing, e.g. of drop-outs by adding special lists or symbols to the coded information using a picket code, i.e. a code in which a long distance code [LDC] is arranged as an array and columns containing burst indicator subcode [BIS] are multiplexed for erasure decoding

Definitions

• the invention relates to a method as recited in the preamble of Claim 1.
• US Patents 4,559,625 to Berlekamp et al, and US 5,299,208 to Blaum et al disclose the decoding of interleaved and error protected information words, wherein an error pattern found in a first word may give a clue to locate errors in another word of the same group of words.
• the references use a standardized format and a fault model that has multisymbol error bursts across various words. Occurrence of an error in a particular word presents a strong probability for an error to occur at a corresponding symbol position pointed at in a next word or words. This procedure often raises the number of corrected errors.
• the present inventors have recognized a problem with this principle: a clue will only materialize when the clue word has been fully corrected.
• the invention is characterized according to the characterizing part of Claim 1.
• the clue found may result in or point to an erasure symbol.
• error correction will proceed in a more powerful manner.
• many codes will correct at most t errors when no error locative indication is known.
• Given the erasures locations generally a larger number e>t of erasures may be corrected.
• the protection against a combination of bursts and random errors will improve.
• the providing of erasure locations will require the use of only a lower number of syndrome symbols, thus simplifying the calculation.
• the invention may be used in a storage environment as well as in a transmission environment.
• the invention also relates to a method for decoding information so encoded, to an encoding and/ or decoding device for use with the above method, and to a carrier provided with information for interfacing to such encoding and/ or decoding. Further advantageous aspects of the invention are recited in dependent Claims. BRIEF DESCRIPTION OF THE DRAWING
• Figure 1 a system with encoder, carrier, and decoder
• Figure 5 a picket code and burst indicator subcode
• Figure 6 a burst indicator subcode format
• Figure 1 shows a comprehensive system according to the invention, that is provided with an encoder, a carrier, and a decoder.
• the embodiment is used for encoding, storing, and finally decoding a sequence of samples or multibit symbols derived from an audio or video signal, or from data.
• Terminal 20 receives a stream of symbols that by way of example have an eight bit size.
• Splitter 22 recurrently and cyclically transfers first symbols intended for the clue words to encoder 24. Furthermore, splitter 22 transfers all other symbols to encoder 26.
• the clue words are formed by encoding the associated data into code words of a first multi-symbol error correcting code.
• This code may be a Reed-Solomon code, a product code, an interleaved code, or a combination thereof.
• the target words are formed by encoding into code words of a second multi- symbol error correcting code.
• all code words will have a uniform length, but this is not a strict requirement.
• both codes will be Reed-Solomon codes with the first one a subcode of the second code.
• the clue words will have in general a much higher degree of error protection, and contain relatively fewer non-redundant symbols.
• Block 28 the code words so formed are transferred to one or more outputs of which an arbitrary number has been indicated, so that the distribution on a medium to be discussed later will become uniform.
• Block 30 symbolizes the medium itself that receives the encoded data. This may in fact relate to direct writing in an appropriate write-mechanism-plus-medium combination. Alternatively, the medium may be realized as a copy from a master encoded medium such as a stamp. Preferably, storage will be optical and fully serial, but other configurations may be used.
• the various words will be read again from the medium. Then the clue words of the first code will be sent to decoder 34, and decoded as based on their inherent redundancies.
• box 35 receives these clues and contains a program for using one or more different strategies for translating such clues to erasure locations.
• the target words are decoded in decoder 36. Under control of the erasure locations, the error protection of the target words is raised to an acceptable level.
• all decoded words are demultiplexed by means of element 38 conformingly to the original format to output 40.
• Figure 2 illustrates a relatively simple code format.
• the coded information has been notionally arranged in a block of 16 rows and 32 columns of symbols, that is 512 symbols.
• Storage on a medium is serially column-by-column starting at the top left column.
• the hatched region contains check symbols, and words 0, 4, 8, and 12 have 8 check symbols each and constitute clue words.
• the other words contain 4 check symbols each and constitute target words.
• the whole block contains 432 information symbols and 80 check symbols. The latter may be localized in a more distributed manner over their respective words.
• a part of the information symbols may be dummy symbols.
• the Reed- Solomon code allows to correct in each clue word up to four symbol errors. Actual symbol errors have been indicated by a crosses. In consequence, all clue words may be decoded correctly, inasmuch as they never have more than four errors.
• the two errors in word 4 produce an erasure flag in both associated columns.
• random errors 62, 68, nor string 54 constitute clues for words 5, 6, 7, because each of them contains only a single clue word.
• an erasure may result in a zero error pattern, because an arbitrary error in an 8- bit symbol has a 1/256 probability to cause again a correct symbol.
• a long burst crossing a particular clue word may produce a correct symbol therein.
• this correct symbol is then incorporated into the burst, and in the same manner as erroneous clue symbols translated into erasure values for appropriate target symbols.
• the above decisions may be amended according to decoding policy, that may further be controlled by other parameters.
• Figure 3 symbolizes a product code format. Words are horizontal and vertical, and parity is hatched.
• Figure 4 symbolizes a so-called Long Distance Code with special burst detection in the upper few words that have more parity.
• the invention presents a so-called Picket Code that may be constructed as a combination of the principles of Figures 3 and 4. Always, writing is sequential along the arrows shown in Figures 3, 4.
• a particular feature is that in the case of substrate incident reading the upper transmissive layer is as thin as 100 micron.
• the channel bits have a size of some 0.14 micron, so that a data byte at channel rate of 2/3 will have a length of only 1.7 microns.
• the beam diameter at the top surface has a diameter of some 125 microns.
• a caddy or envelope for the disc will reduce the probability of large bursts.
• non- conforming particles of less than 50 microns may cause short faults
• the inventors have inter alia used a fault model wherein such faults through error propagation may lead to bursts of 200 microns, corresponding to some 120 Bytes.
• the inventors have used an error model with fixed size bursts of 120B that start randomly with a probability per byte of 2.6*10 "5 , or on the average one burst per 32kB block.
• the invention has been pushed by developments in optical disc storage, but other configurations such as multitrack tape, and other technologies such as magnetic and magneto-optical would also benefit from the improved approach described herein.
• Figure 5 shows a picket code and burst indicator subcode.
• a picket code consists of two subcodes A and B.
• the burst indicator subcode (BIS) contains the clue words. By format, it is a very deeply interleaved long distance code that allows to localize the positions of the multiple burst errors.
• the error patterns so found are processed to obtain erasure information for the target words that are configured in this embodiment as a product subcode (PS) .
• PS product subcode
• the product subcode will correct combinations of multiple bursts and random errors, through using erasure flags obtained from the burst indicator subcode.
• PS product subcode
• each sync block consists of 4 groups of 37 B
• each group of 37 B contains 1 B of deeply interleaved Burst Indicator Subcode and further 36 B of Product Subcode.
• rows are read sequentially from the disc, starting with the preceding sync pattern.
• Each row contains 4 B of the BIS shown in hatched manner and numbered consecutively, and separated by 36 other bytes. Sixteen rows form one sector and 256 rows form one sync block.
• Figure 6 shows exclusively a burst indicator subcode format of the same 64 numbered bytes per sector of Figure 5, and is constructed as follows:
• BIS may indicate at least 16 bursts of 592 B ( ⁇ 1 mm.) each; • BIS contains 32 B data per sector, 4 columns of the BIS, and in particular 16 B DVD header, 5 B parity on the header to allow fast address readout and 11 B user data.
• Figure 7 shows a picket code and its product subcode that is built from the target words.
• the Bytes of the Product Subcode are numbered in the order as they are read from the disc, whilst ignoring the BIS bytes.
• Figure 8 shows various further aspects of the of this embodiment of the product subcode.
• the product subcode is a [256, 228, 29]*[144, 143,2] Product Code of Reed-Solomon codes.
• Figure 9 shows an alternative format to Figure 8, leaving out the horizontal Reed-Solomon code altogether.
• the horizontal block size is 36 bytes (one quarter of Figure 7), and uses a [256,224,33] Reed-Solomon code.
• Each sector has 2368 Bytes and no dummy Bytes are necessary.
• the code in the first column is formed in two steps. From each sector, the 16 header Bytes are encoded in a [20, 16,5] code first to allow fast address retrieving. The resulting 20 Bytes plus a further 32 user bytes per sector form data bytes and are collectively encoded further.
• the data symbols of one 2K sector may lie in only one physical sector, as follows.
• Each column of the [256,224,33] code contains 8 parity symbols per 2k sector. Further, each [256,208,49] code has 12 parity symbols per 2K sector and 4 parity symbols of the [20,16,5] code to get a [256,208,49] code with 48 redundant bytes.
• Figure 10 shows this interleaving in detail.
• '*' represents the header Bytes
• ' ⁇ ' the parities of the [20,16] code
• '•' the 32 "further” data bytes

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Physics & Mathematics (AREA)
• Probability & Statistics with Applications (AREA)
• Signal Processing (AREA)
• Quality & Reliability (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Error Detection And Correction (AREA)
• Signal Processing For Digital Recording And Reproducing (AREA)
• Techniques For Improving Reliability Of Storages (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Priority Applications (1)

Applications Claiming Priority (4)

Publications (1)

Family

ID=8229142

Family Applications (1)

Country Status (18)

Families Citing this family (7)

Family Cites Families (6)

• 1998
  • 1998-12-21 JP JP53470499A patent/JP2001515641A/ja active Pending
  • 1998-12-21 TR TR1999/02089T patent/TR199902089T1/xx unknown
  • 1998-12-21 ID IDW990931A patent/ID24253A/id unknown
  • 1998-12-21 RU RU99120705/09A patent/RU2224358C2/ru active
  • 1998-12-21 EP EP98959092A patent/EP0965173A1/en not_active Withdrawn
  • 1998-12-21 WO PCT/IB1998/002090 patent/WO1999034271A2/en active IP Right Grant
  • 1998-12-21 HU HU0100551A patent/HU223894B1/hu active IP Right Grant
  • 1998-12-21 IL IL13162798A patent/IL131627A/xx not_active IP Right Cessation
  • 1998-12-21 BR BRPI9807633-7A patent/BR9807633B1/pt not_active IP Right Cessation
  • 1998-12-21 CA CA002282305A patent/CA2282305C/en not_active Expired - Lifetime
  • 1998-12-21 AU AU15011/99A patent/AU766901B2/en not_active Expired
  • 1998-12-21 CZ CZ0305599A patent/CZ301101B6/cs not_active IP Right Cessation
  • 1998-12-21 KR KR1019997007934A patent/KR100583360B1/ko active IP Right Grant
  • 1998-12-21 CN CN98804606A patent/CN1126271C/zh not_active Expired - Lifetime
  • 1998-12-28 MY MYPI98005903A patent/MY126409A/en unknown
  • 1998-12-28 ZA ZA9811897A patent/ZA9811897B/xx unknown
  • 1998-12-29 AR ARP980106706A patent/AR014200A1/es active IP Right Grant
• 1999
  • 1999-01-28 TW TW088101299A patent/TW425773B/zh not_active IP Right Cessation

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events