US20020166096A1 - Error correction method in full response read channels - Google Patents

Error correction method in full response read channels Download PDF

Info

Publication number
US20020166096A1
US20020166096A1 US09984745 US98474501A US2002166096A1 US 20020166096 A1 US20020166096 A1 US 20020166096A1 US 09984745 US09984745 US 09984745 US 98474501 A US98474501 A US 98474501A US 2002166096 A1 US2002166096 A1 US 2002166096A1
Authority
US
Grant status
Application
Patent type
Prior art keywords
method
matrices
channel bits
branch
channel
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.)
Granted
Application number
US09984745
Other versions
US6904559B2 (en )
Inventor
Jia-Horng Shieh
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.)
MediaTek Inc
Original Assignee
ALi Corp
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

Links

Images

Classifications

    • HELECTRICITY
    • H03BASIC ELECTRONIC 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/63Joint error correction and other techniques
    • H03M13/6343Error control coding in combination with techniques for partial response channels, e.g. recording
    • HELECTRICITY
    • H03BASIC ELECTRONIC 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/3961Arrangements of methods for branch or transition metric calculation
    • HELECTRICITY
    • H03BASIC ELECTRONIC 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • HELECTRICITY
    • H03BASIC ELECTRONIC 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/65Purpose and implementation aspects
    • H03M13/6502Reduction of hardware complexity or efficient processing

Abstract

The present invention provides an error correction method that is used in full response read channels. This method includes the steps of: obtaining a read signal from a storage medium and converting the read signal into channel bits that are recorded in the storage medium, such as a DVD disk, in the NRZI format; and using the Viterbi detector to determine whether bit state transitions in the channel bits occur within a predetermined run-lengths of the RLL codes. If transitions occur within the predetermined run-lengths, then the values of the bits with state transitions are corrected.

Description

    REFERENCE TO RELATED APPLICATION
  • This application claims the benefit of priority under 35U.S.C.§119(a) of Taiwan Patent Application No. 090107694, titled “Error Correction Method in Full Response Read Channels”, filed on Mar. 30, 2001. [0001]
  • BACKGROUND OF THE INVENTION
  • 1. Field of the Invention [0002]
  • The invention generally relates to a signal processing method in read channels, and in particular to an error correction method in full response read channels. [0003]
  • 2. Description of the Related Art [0004]
  • Optical storage systems sometimes use analog peak detection to perform data processing. However, when the recording density of the storage medium increases, the analog peak detection becomes less reliable. This is because ISI (Inter-Symbol Interference) occurs among sequential bits when the bandwidth of the read channel is lower than the bandwidth of the transmitted signals. Serious ISI results in timing jitters. Therefore, as the recording density increases, ISI causes serious timing jitters that make phase locking more difficult. [0005]
  • Information codes can be recorded on disks in various formats, such as NRZ (Non-Return-to-Zero) and NRZI (Non-Return-to-Zero-Inverse). The recording format of DVD disks is the NRZI format. In CD/DVD storage systems, there are usually two different structures in read channels in the prior art. They are the PRML (Partial Response Maximum Likelihood) channel and the full response channel. Although the PRML channel can increase the recording density, this method requires perfect equalization of the channel signals so that the shape of the channel signals matches a predetermined PR (Partial Response) target waveform. Furthermore, ISI can not be removed in the PRML channel. The channel signals are equalized to provide a target pulse waveform, and the target pulse waveform has default values at specific sampling points. The ISI on the target pulse waveform is controlled into an expected form and is combined into a pulsed detection method. Such a method determines the occurrence of signal pulses. [0006]
  • In addition, the PRML channel requires ML (Maximum Likelihood) detection to restore correct data from sampled signals in each pulse cycle. The ML detection is usually implemented by a Viterbi detector. The Viterbi detector is a device using the Viterbi algorithm invented by Andrew Viterbi in 1967. Using the Viterbi detector in a PRML channel is well known by those who are skilled in the art. In the PRML channel, reproduced signals of a disk are processed by a PR equalizer and a Viterbi detector. [0007]
  • With reference to FIG. 1, it shows a block diagram of the Viterbi detector. The Viterbi detector primarily includes a Branch Matrices Computing Circuit [0008] 10, an Add/Compare/Select Circuit 11, and a Path Memory Unit 12. The Branch Matrices Computing Circuit 10 receives and computes an equalizer output signal J from an equalizer (not shown) in an optical storage system with at least one non-zero equalization target value, such as four equalization target values {0, 0.25, 0.75, 1}, to generate branch matrices B0001, B0002, B0011, B0111, B1001, B1101, B1111, and B1112. The branch matrices at each time are B0001=B0002=(0-J)2, B0011=B1001=(0.25-J)2, B0111=B1101=(0.75-J)2 B1111=B1112=(1.0-J)2, respectively. Therefore, the Branch Matrices Computing Circuit 10 comprises four subtractors, four multipliers, and four buffers. The subtractors are used to compute J-0, J-0.25, J-0.75, and J-1. And the multipliers are employed to compute the squares. Then, the computed results are stored in the buffers. The branch matrices represent the similarity between the equalization output signals processed by the equalizer and the ideal equalized signals. Moreover, the Add/Compare/Select Circuit 11 uses the branch matrices B0001, B0002, B0011, B0111, B1001, B1101, B1111, and B1112 to perform addition, comparison, and selection. Then, the Add/Compare/Select Circuit 11 generates path control signals H000 and H111. Further, the Path Memory Unit 12 is controlled by the path control signals H000 and H111 to output detector signals.
  • Since the Branch Matrices Computing Circuit [0009] 10 and Add/Compare/Select Circuit 11 of the Viterbi detector in the PRML channel involve floating operations, the hardware circuit design has to take the number of bits into account for floating numbers. This directly complicates the design of the subtractors, multipliers, adders, and comparators and increases the required area of the VLSI.
  • In a full response read channel [0010] 20 as shown in FIG. 2, reproduced signals obtained from a recording medium 6 by a light signal reading system (not shown) are sent to an equalizer 1. Then the signals are sent through a data slicer 2, a PLL (Phase Lock Loop) 3, and a sampler 4 to produce NRZI signals to EFM Plus Demodulator 7. Sometimes, errors in the NRZI signals can be readily checked by the RLL (Run Length Limited) codes. The RLL codes have two constraints d and k, which define the minimum and maximum run-lengths of continuous 1 and 0 in the data stream. In particular, d constraint is used to control high frequency contents of the data stream while k constraint is used to control low frequency contents. Therefore, the RLL codes eliminate a lot of transitions in data transmissions. Signals in full response read channels can be restored without interference. That is, the signal processing in a full response read channel is not influenced by ISI at all.
  • FIG. 3 shows an example of reproduced signals that contain errors. It shows the relations among data codes, recorded data waveforms, corresponding optical disk pits, ideal reproduced signals, ideal NRZI, actually reproduced signals, and actual NRZI. In the actual NRZI signals, errors occurring at points a and c can be readily detected because the signals at points a and c violate the RLL codes. [0011]
  • Generally, there are two types of errors that occur in data transmission, storage, and restoration. The first type is random error. It occurs in a single bit when the bit is replaced with the corresponding value. The second type is burst error. It occurs in a continuous series of bits. The length and frequency of the burst error may be random or regular. In either type, the occurrence of errors is usually determined according to the storage medium or channel being used. Thus, it is hard to list all conditions that violate the RLL codes if one uses a table to implement error corrections. [0012]
  • The EFM Plus Demodulation requires that no transitions, i.e. pit-to-land or land-to-pit transitions, occur between 2 and 10 bits of interval. These limits of continuous run-lengths are usually expressed as RLL constraints (d,k)=(2,10). If the RLL codes are utilized, some errors in NRZI signals can be corrected before performing the EFM Plus Demodulation to effectively improve system efficiency. [0013]
  • SUMMARY OF THE INVENTION
  • One purpose of the present invention is to perform error corrections by implementing the Viterbi algorithm in full response read channels that do not have ISI. In particular, the invention applies to all full response read channels encoded with RLL codes. [0014]
  • Another purpose of the invention is to use an error correction circuit implemented by the Viterbi algorithm instead of a table, which can not list all situations that violate the RLL codes. [0015]
  • Therefore, the invention utilizes a Viterbi detector to implement an Error Correction Circuit with RLL codes and to correct NRZI errors in full response read channels such as the CD/DVD systems. The invention discloses an error correction method, which applies the Viterbi algorithm to full response read channels. The invention corrects random errors in NRZI signals with RLL constraint d=2. [0016]
  • Due to the CD/DVD RLL constraint d=2, possible states of the Viterbi detector are decreased from eight to six because two of them are not allowed by the RLL constraints. In full response read channels, the channel bit of NRZI signals can only be 0 or 1. Therefore, by using the Viterbi detector to implement Error Correction Circuit with RLL codes, the simplification of the reference amplitude greatly reduces the complexity of the Branch Matrices Computing Circuit and the Add/Compare/Select Circuit than the Viterbi detector in PRML systems. Consequently, the implementation of the invention by a VLSI is more favorable.[0017]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The present invention will become more fully understood from the detailed description given hereinafter illustration only, and thus are not limitative of the present invention, and wherein: [0018]
  • FIG. 1 is a block diagram of the Viterbi detector; [0019]
  • FIG. 2 is a block diagram of the read channel in an optical storage system; [0020]
  • FIG. 3 is a schematic view of reproduced signals containing errors, showing the relations among data codes, recorded data waveforms, corresponding optical disk pits, ideal reproduced signals, ideal NRZI, actually reproduced signals and actual NRZI; [0021]
  • FIG. 4 shows a block diagram of a preferred embodiment of the invention; [0022]
  • FIG. 5 is a state diagram of the preferred embodiment, where RLL constraint d=2; [0023]
  • FIG. 6 is a Trellis diagram of FIG. 5; [0024]
  • FIG. 7 shows the Branch Matrices Computing Circuit in the preferred embodiment; [0025]
  • FIG. 8 shows the Add/Compare/Select Circuit in the preferred embodiment; and [0026]
  • FIG. 9 shows the path memory unit in the preferred embodiment.[0027]
  • DETAILED DESCRIPTION OF THE INVENTION
  • In read channels, reproduced NRZI signals from a DVD disk vary from 3T to 11T and errors may occur at any place. It is very difficult to list all conditions that violate RLL codes by using a table. Therefore, to design an NRZI error correction circuit, the invention applies the Viterbi algorithm in PRML systems to full response read channels. [0028]
  • With reference to FIG. 4, the invention adds an Error Correction Circuit with RLL codes [0029] 5 between a sampler 4 and an EFM Plus Demodulator 7 to correct errors in the NRZI signals. In one embodiment of the invention, the error correction circuit corrects random errors in the NRZI signals according to the RLL constraint d=2. Thus, if the input signals in the full response read channels are completely unstructured, there are 8 possible channel states; namely S000, S0001, S0010, S011, S100, S101, S110, and S111. Two states S010 and S101 are not allowed in the full response read channels with RLL constraint d=2. Thus, there are only six possible channel states in the full response read channels.
  • As shown in FIG. 5, when the reference amplitude is zero (0), under the RLL codes with constraint d=2, state S000 is kept invariant, state S100 transits to state S000, state S110 transits to state S100, and state S111 transits to state S110. On the other hand, when the reference amplitude is one (1), state S111 is kept invariant, state S0111 transits to state S111, state S0001 transits to state S011, and state S000 transits to state S001. [0030]
  • FIG. 6 is a Tellis diagram of FIG. 5, the state at time t is transited to the next state at time t+1 according to a reference amplitude (0 or 1). [0031]
  • The following paragraphs further explain the preferred embodiment, which uses a Viterbi detector to implement Error Correction Circuit with RLL codes. [0032]
  • A. Branch Matrices Computating Circuit [0033]
  • In the preferred embodiment of the invention, the values of the NRZI signals are either 0 or 1 only. Therefore, the design of the Branch Matrices Computing Circuit [0034] 10 in full response read channels is relatively simpler than the one in PRML systems. At each time, the branch matrices are:
  • B001=B0002=B1001=B1101=NRZI
  • B0011=B0111=B1111=B1112=not NRZI  (1)
  • Subsequently, as shown in FIG. 7, the Branch Matrices Computing Circuit [0035] 10 can be implemented by an inverter 101 instead of subtractors and multipliers. And the branch matrices B0001, B0002, B0011, B00111, B1001, B1101, B1111, and B1112 are either 0 or 1.
  • B. Add/Compare/Select Circuit [0036]
  • Please refer to FIG. 8, the initialization of path matrices P000, P001, P011, P100, P110, and P111 used in the Add/Compare/Select Circuit [0037] 11 is P000=P001=P011=P100=P110=P111=0. The branch matrices B0001, B0002, B0011, B0111, B1001, B1101, B1111, and B1112 generated from the Branch Matrices Computing Circuit 10 according to Equation (1) are used to generate the path matrices. The Add/Compare/Select Circuit 11 compares P000(t)+B0001(t) with P100(t)+B0002(t) and compares P011(t)+B1111(t) with P111(t)+B1112(t), then determines the output value of path control signals H000(t) and H111(t) as follows: H000 ( t ) = { 0 1 when P000 ( t ) + B000 1 ( t ) when P100 ( t ) + B000 2 ( t ) = min { P000 ( t ) + B000 1 ( t ) , P100 ( t ) + B000 2 ( t ) } H111 ( t ) = { 0 1 when P011 ( t ) + B111 1 ( t ) when P111 ( t ) + B111 2 ( t ) = min { P011 ( t ) + B111 1 ( t ) , P111 ( t ) + B111 2 ( t ) }
    Figure US20020166096A1-20021107-M00001
  • The Add/Compare/Select Circuit [0038] 11 then outputs the path control signals H000 and H111 to the Path Memory Unit 12 and refreshes the six path matrices P000(t+1), P001(t+1), P011(t+1), P100(t+1), P110(t+1), and P111(t+1). They are computed in the following way:
  • P000(t+1)=min {P000(t)+B0001(t),P100(t)+B0002(t)};
  • P001(t+1)=P000(t)+B0011(t);
  • P011(t+1)=P001(t)+B0111(t);
  • P100(t+1)=P110(t)+B1001(t);
  • P110(t+1)=P111(t)+B1101(t); and
  • P111(t+1)=min {P011(t)+B1111(t),P111(t)+B1112(t)}.
  • In particular, due to the decrease in the number of channel bits, the adder [0039] 111, the comparator 112 and the selector 113 in the Add/Compare/Select Circuit 11 are less complicated and occupy smaller areas.
  • C. Path Memory Unit [0040]
  • As shown in FIG. 9, the Path Memory Unit [0041] 12 includes n detection sequence switches 21 1˜21 n and (n−1) delay elements 22 1˜22 n−1 among adjacent detection sequence switches, respectively. The output of each delay element after a unit of delay time becomes the input of the next detection sequence switch. The path control signals H000 and H111 from the Add/Compare/Select Circuit 11 are inputted to each of the detection sequence switches 21 1˜21 n. The detection sequence switches are switched according to the Trellis diagram shown in FIG. 7.
  • According to the preferred embodiment of the invention, using a Viterbi detector to implement an Error Correction Circuit with RLL constraint d=2 in full response read channels can reduce random errors in the NRZI signals. According to experimental results, the Viterbi detector can reduce errors by about 15%. [0042]
  • In addition, the invention applies the Viterbi detector to full response read channels that are not affected by ISI at all. The input values of the Branch Matrices Computing Circuit and the Add/Compare/Select Circuit are either 0 or 1, greatly reducing the complexity in circuit designs and the number of necessary channel bits. The invention can be applied to not only CD/DVD systems but also all full response read channels with RLL codes. [0043]
  • The invention being thus described, it will be obvious that the same may be varied in many ways. Such variations are not to be regarded as a departure from the spirit and scope of the invention, and all such modifications as would be obvious to one skilled in the art are intended to be included within the scope of the following claims. [0044]

Claims (19)

    What is claimed is:
  1. 1. An error correction method used in full response read channels, which comprises the steps of:
    obtaining a read signal from a storage medium and converting the read signal into channel bits in an NRZI (Non-Return-to-Zero-Inverse) format; and
    utilizing a Viterbi detector to determine whether any state transition of the channel bit occurs within a predetermined run-lengths of the RLL codes.
  2. 2. The method of claim 1, wherein the state transition refers to a transition from logic “H” to logic “L”.
  3. 3. The method of claim 1, wherein the state transition refers to a transition from logic “L” to logic “H”.
  4. 4. The method of claim 1, wherein the predetermined run-lengths are (d+1) bits whose states are in the logic “H” without transitions.
  5. 5. The method of claim 4, wherein d=2.
  6. 6. The method of claim 1, wherein the channel bits are selected from 0 and 1.
  7. 7. The method of claim 1, wherein the Viterbi detector includes a Branch Matrices Computing Circuit.
  8. 8. The method of claim 7, wherein the branch matrices are selected from 0 and 1.
  9. 9. The method of claim 7, wherein the Branch Matrices Computing Circuit is implemented by an inverter.
  10. 10. The method of claim 7, wherein each of the channel bits and the branch matrices are represented by one bit.
  11. 11. An error correction method used in full response read channels, which comprises the steps of:
    obtaining a read signal from a storage medium and converting the read signal into channel bits; and
    utilizing the Viterbi detector to determine whether any state transition of the channel bits occurs within a predetermined run-lengths of the RLL codes;
  12. 12. The method of claim 11, wherein the predetermined run-lengths are (d+1) bits whose states are kept logically invariant.
  13. 13. The method of claim 12, wherein d=2.
  14. 14. The method of claim 11, wherein the channel bits are selected from 0 and 1.
  15. 15. The method of claim 11, wherein the Viterbi detector includes a Branch Matrices Computing Circuit.
  16. 16. The method of claim 15, wherein the branch matrices generated from the Branch Matrices Computing Circuit are selected from 0 and 1.
  17. 17. The method of claim 15, wherein the Branch Matrices Computing Circuit is implemented by an inverter.
  18. 18. The method of claim 11, wherein the channel bits are in the NRZI format.
  19. 19. The method of claim 16, wherein each of the branch matrices is represented by one bit.
US09984745 2001-03-30 2001-10-31 Error correction method in full response read channels Active 2023-01-29 US6904559B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
TW090107694 2001-03-30
TW90107694 2001-03-30

Publications (2)

Publication Number Publication Date
US20020166096A1 true true US20020166096A1 (en) 2002-11-07
US6904559B2 US6904559B2 (en) 2005-06-07

Family

ID=21677821

Family Applications (1)

Application Number Title Priority Date Filing Date
US09984745 Active 2023-01-29 US6904559B2 (en) 2001-03-30 2001-10-31 Error correction method in full response read channels

Country Status (2)

Country Link
US (1) US6904559B2 (en)
JP (1) JP2002298518A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080273435A1 (en) * 2007-03-22 2008-11-06 Microsoft Corporation Optical dna
US20090158044A1 (en) * 2007-03-22 2009-06-18 One Microsoft Way Optical dna based on non-deterministic errors
US20100214894A1 (en) * 2009-02-20 2010-08-26 Microsoft Corporation Optical Medium with Added Descriptor to Reduce Counterfeiting
US20110002209A1 (en) * 2009-07-03 2011-01-06 Microsoft Corporation Optical medium with added descriptor to reduce counterfeiting
US9195810B2 (en) 2010-12-28 2015-11-24 Microsoft Technology Licensing, Llc Identifying factorable code

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6999532B2 (en) * 2000-12-22 2006-02-14 Media Tek Inc. Decoding circuit and method of Viterbi decoder
US20030165208A1 (en) * 2002-03-04 2003-09-04 Andrew Carter Non-linear decision feedback phase locked loop filter
US7164371B2 (en) * 2004-07-30 2007-01-16 Hitachi Global Storage Technologies Netherlands B.V. Method and apparatus for data coding for high density recording channels exhibiting low frequency contents
KR100694125B1 (en) * 2005-06-10 2007-03-12 삼성전자주식회사 Frequency detector in Phase Locked Loop circuit and frequency error detecting method
JP4501960B2 (en) 2007-05-15 2010-07-14 日本電気株式会社 Viterbi detector, and the information reproducing apparatus

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5331665A (en) * 1991-05-08 1994-07-19 Alcatel N.V. Decoder device for decoding convolutionally encoded message
US5563864A (en) * 1993-12-24 1996-10-08 Seiko Epson Corporation Information recording and reproducing apparatus
US5771127A (en) * 1996-07-29 1998-06-23 Cirrus Logic, Inc. Sampled amplitude read channel employing interpolated timing recovery and a remod/demod sequence detector
US5859601A (en) * 1996-04-05 1999-01-12 Regents Of The University Of Minnesota Method and apparatus for implementing maximum transition run codes
US5949357A (en) * 1997-01-13 1999-09-07 Quantum Corporation Time-varying maximum-transition-run codes for data channels
US6052248A (en) * 1998-01-30 2000-04-18 Cirrus Logic, Inc. Parity channel code for enhancing the operation of a remod/demod sequence detector in a d=1 sampled amplitude read channel
US6148043A (en) * 1996-11-19 2000-11-14 Sony Corporation Viterbi decoder and viterbi decoding method

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5331665A (en) * 1991-05-08 1994-07-19 Alcatel N.V. Decoder device for decoding convolutionally encoded message
US5563864A (en) * 1993-12-24 1996-10-08 Seiko Epson Corporation Information recording and reproducing apparatus
US5859601A (en) * 1996-04-05 1999-01-12 Regents Of The University Of Minnesota Method and apparatus for implementing maximum transition run codes
US5771127A (en) * 1996-07-29 1998-06-23 Cirrus Logic, Inc. Sampled amplitude read channel employing interpolated timing recovery and a remod/demod sequence detector
US6148043A (en) * 1996-11-19 2000-11-14 Sony Corporation Viterbi decoder and viterbi decoding method
US5949357A (en) * 1997-01-13 1999-09-07 Quantum Corporation Time-varying maximum-transition-run codes for data channels
US6052248A (en) * 1998-01-30 2000-04-18 Cirrus Logic, Inc. Parity channel code for enhancing the operation of a remod/demod sequence detector in a d=1 sampled amplitude read channel

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080273435A1 (en) * 2007-03-22 2008-11-06 Microsoft Corporation Optical dna
US20090158044A1 (en) * 2007-03-22 2009-06-18 One Microsoft Way Optical dna based on non-deterministic errors
US8788848B2 (en) 2007-03-22 2014-07-22 Microsoft Corporation Optical DNA
US8837721B2 (en) * 2007-03-22 2014-09-16 Microsoft Corporation Optical DNA based on non-deterministic errors
US20100214894A1 (en) * 2009-02-20 2010-08-26 Microsoft Corporation Optical Medium with Added Descriptor to Reduce Counterfeiting
US20110002209A1 (en) * 2009-07-03 2011-01-06 Microsoft Corporation Optical medium with added descriptor to reduce counterfeiting
US9135948B2 (en) 2009-07-03 2015-09-15 Microsoft Technology Licensing, Llc Optical medium with added descriptor to reduce counterfeiting
US9195810B2 (en) 2010-12-28 2015-11-24 Microsoft Technology Licensing, Llc Identifying factorable code

Also Published As

Publication number Publication date Type
JP2002298518A (en) 2002-10-11 application
US6904559B2 (en) 2005-06-07 grant

Similar Documents

Publication Publication Date Title
US6028728A (en) Sampled amplitude read/write channel employing a sub-baud rate write clock
US5822143A (en) Decision feedback equalization implementation of partial-response signaling in a magnetic recording channel
US6061395A (en) Waveform equalizer
US6023386A (en) Fault tolerant sync mark detector for synchronizing a time varying sequence detector in a sampled amplitude read channel
US5430744A (en) Method and means for detecting partial response waveforms using a modified dynamic programming heuristic
Moon et al. Performance comparison of detection methods in magnetic recording
US6111835A (en) PRML decoder for processing different channel codes with reduced hardware
US6115198A (en) PR4 sampled amplitude read channel for detecting user data and embedded servo data
US5671252A (en) Sampled data read channel utilizing charge-coupled devices
US5796358A (en) Methods and structure for combined analog and digital automatic gain control in sampled-data receivers
US4945538A (en) Method and apparatus for processing sample values in a coded signal processing channel
US6834035B1 (en) Digital reproduced signal processing device
US5961658A (en) PR4 equalization and an EPR4 remod/demod sequence detector in a sampled amplitude read channel
US6052248A (en) Parity channel code for enhancing the operation of a remod/demod sequence detector in a d=1 sampled amplitude read channel
US5588011A (en) Tuned viterbi detector and equalizer system
US7558177B2 (en) Optical disc playback apparatus
US5987634A (en) Channel quality circuit in a sampled amplitude read channel
US5926490A (en) Sampled amplitude read channel employing a remod/demod sequence detector guided by an error syndrome
US4566044A (en) Direction-constrained ternary codes using peak and polarity detection
US6697311B1 (en) Method and apparatus for modulating and demodulating data
US20120236428A1 (en) Systems and Methods for Sync Mark Detection
US5638065A (en) Maximum-likelihood symbol detection for RLL-coded data
US5619539A (en) Data detection methods and apparatus for a direct access storage device
US6891483B2 (en) Encoding apparatus and method, recording medium and program
US6732328B1 (en) Two stage detector having viterbi detector matched to a channel and post processor matched to a channel code

Legal Events

Date Code Title Description
AS Assignment

Owner name: ACER LABORATORIES, INC., TAIWAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SHIEH, JIA HORNG;REEL/FRAME:012292/0987

Effective date: 20011025

AS Assignment

Owner name: ALI CORPORATION, TAIWAN

Free format text: CHANGE OF NAME;ASSIGNOR:ACER LABORATORIES INCORPORATION;REEL/FRAME:014523/0512

Effective date: 20020507

AS Assignment

Owner name: MEDIATEK INCORPORATION, TAIWAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ALI CORPORATION;REEL/FRAME:015692/0328

Effective date: 20050201

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12