# Patent

## Title
Reproduced signal equalizing method for optical information media and optical information reproducing/recording apparatus

## Abstract

Reproduced signals are equalized by the least square technique by using a predetermined number of data samples binarized by a Viterbi decoder. Even when data written on an optical disk is unknown, the data can be equalized in a stable manner and can be reproduced at a low error rate without instability factors such as divergence due to interference.

## Background
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a method for equalizing reproduced signals obtained by irradiating laser light to an optical information recording medium and relates to an optical information reproducing apparatus having a function for equalizing reproduced signals. In particular, the present invention relates to a reproduced signal equalizing method for optical information media and an optical information reproducing/recording apparatus for reproduced signals having a partial response waveform as a target waveform for equalization. Furthermore, the present invention relates to evaluating and adjusting methods for evaluating the quality of reproduced signals by using reproduced signals equalized by the equalizing method and for adjusting writing conditions based on the evaluation result.
2. Description of the Related Art
Generally, in reproducing information recorded in high density, a data signal recorded at a predetermined position on a recording medium is influenced by data signals recorded before and after the data signal. Then, inter-code interference may occur in which a reproduced signal varies from the waveform intended when the reproduced signal is written. As a result, an error may easily occur while decoding the signal, which is a problem.
In order to solve the problem, equalization is performed which can reduce the inter-code interference as much as possible in a conventional optical disk apparatus such as a digital versatile disk (DVD). However, when the data recorded in much higher density is equalized by this method, a noise component may be emphasized. Thus, the improvement in detection performance may be limited under a certain level.
A data detecting method called Partial Response Maximum Likelihood (PRML) is known as a reproducing method which can further increase the density by using a conventional equalizing method. In PRML, reproduced signals are equalized to a predetermined partial response (may be abbreviated as PR, hereinafter) waveform having inter-code interference. The influence of the inter-code interference is considered based on an algorithm called Viterbi decoding to perform data identification. Some kinds of inter-code interference regulated in partial responses equalize waveforms having inter-code interference to acceptable waveforms. Thus, the noise increase due to equalization can be suppressed. Since the influence by the inter-code interference is considered by Viterbi decoding, a higher recording density can be achieved.
A time length (time T in clock unit in FIG. 3) in bit rate having a non-zero (0) value in a partial response waveform is generally called constraint length. FIG. 3 shows a partial response waveform having constraint length as a waveform example. A longer constraint length means a reproduced waveform having higher inter-code interference. When data is recorded in high density, the signals to be actually read have high inter-code interference. Therefore, a partial response waveform having a longer constraint length is selected. As a result, due to the linear superimposition (superimposition computing) of partial response waveforms, reproduced signals can be obtained which are close to the actual reproduced signals. When the actual reproduced waveform is less different from the waveform represented by the superimposition computing of the partial response waveform, the noise amplification due to equalization can be suppressed.
However, in the conventional reproduced signal equalizing method, waveforms may not be equalized to a waveform sufficiently close to a target waveform. In other words, when waveforms cannot be equalized to a predetermined partial response waveform, a higher error rate occurs in a Viterbi detector during the decoding. Therefore, binary discrimination of information becomes harder, and the error rate is deteriorated, which is another problem.
This is due to changes in reproduced signals. In order to equalize reproduced signals to a partial response waveform, a finite impulse response (FIR) filter is used which generally includes about 5 to 20 taps. A change in tap coefficient of the filter changes the equalized signal. Here, equalization can be performed by using a predetermined and fixed tap coefficient. However, the reproduced signals even with the same recording density depend on the beam diameter of an optical head for reproducing, the inclination of an optical information medium and/or the like.
A technology called adaptive equalization is known as one technique for changing the tap coefficient in accordance with the change in reproduced signals. In adaptive equalization, a properly predetermined tap coefficient is used as an initial value. Then, the tap coefficient is changed gradually such that the difference between an equalized waveform and a target waveform based on the initial value can be the smallest in the shortest time. By performing convergence calculations with different tap coefficients, the most suitable tap coefficient is obtained. Advantageously, equalization can be performed even when data recorded in information is not known in this technique. However, equalization is susceptible to noise, for example, and the convergence calculations do not converge but diverge, which is a problem. Especially, when the recording density is high and when the signal quality of reproduced signals is low, the problem becomes more significant.
SUMMARY OF THE INVENTION
In order to solve the problems, it is an object of the invention to provide an equalizing method for equalizing reproduced signals of optical information recorded at high density to a partial response waveform in a stable manner even with variations in the reproducing condition such as the tilt and the beam diameter and even under the influence of interference such as noise.
Also, in order to solve the problems, it is another object of the invention to provide a method for equalizing reproduced signals obtained by irradiating laser light to an optical information medium such that the waveforms are close to a waveform having a predetermined characteristic.
According to one aspect of the invention, there is provided a reproduced signal equalizing method including the steps of sampling reproduced signals in a predetermined cycle, calculating an equalization coefficient for producing a smallest difference between a target waveform and an equalized waveform by the least square technique by using a predetermined number or more of sampled waveform data, and equalizing reproduced signals by using the calculated equalization coefficient.
The number of the sampled waveform data is desirably 3000 or more. The reproduced signal equalizing method may further include the steps of inputting the reproduced signals sampled in the predetermined cycle to a Viterbi decoder, and defining a target waveform as a waveform resulting from equalization of the reproduced signals based on binarized data demodulated by the Viterbi decoder and the partial response waveforms. In particular, a partial response value (1,2,2,2,1) is desirably used as the target partial response waveform.
According to another aspect of the invention, there is provided an optical information reproducing apparatus having a function for equalizing reproduced signals by using the reproduced signal equalizing method.
According to another aspect of the invention, there is provided a signal quality evaluating method, including the steps of equalizing reproduced signals by using the reproduced signal equalizing method, and evaluating quality of the reproduced signals from the equalized reproduced signals and binary identification data.
According to another aspect of the invention, there is provided a writing condition adjusting method, wherein a writing condition is adjusted based on an evaluation result of the signal quality evaluation method.
Hence, even when information recorded on an optical disk is unknown, the reproduced signals can be equalized precisely to a predetermined partial response waveform without instability factors such as divergence. Furthermore, information recorded at high density can be reproduced at a lower error rate.
Therefore, the invention can be used for reproducing/recording applications for obtaining reproduced signals in high quality from a recording medium having a very high recording density.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram showing a form of a functional configuration of an optical information reproducing apparatus, especially, an equalizer according to the invention:
FIG. 2 is a diagram showing a form of a functional configuration of an optical information reproducing apparatus according to the invention;
FIG. 3 is a diagram illustrating a partial response waveform;
FIG. 4 is a diagram showing a relationship between the number of reproduced signal samples and final error rates with respect to a phase change optical disk;
FIG. 5 is a diagram showing a relationship between the number of reproduced signal samples and final error rates with respect to a reproduction-only optical disk;
FIG. 6 is a diagram showing a relationship between the number of reproduced signal samples and final error rates in a case where the defocusing is changed;
FIG. 7 is a diagram illustrating a form of a functional configuration of an optical information reproducing apparatus according to Example 4 of the invention; and
FIG. 8 is a diagram illustrating a form of a functional construction of an optical information reproducing/recording apparatus according to Example 5 of the invention.



DESCRIPTION OF THE PREFERRFED EMBODIMENTS
In order to achieve the objects, an equalizing method for equalizing reproduced signals to a partial response waveform in a stable manner includes the steps of sampling reproduced signals in a predetermined cycle, calculating an equalization coefficient for producing the smallest difference between a target waveform and an equalized waveform by the least square technique by using a predetermined number or more of sampled waveform data, and equalizing the reproduced signals by using the calculated equalization coefficient.
Now, embodiments according to the present invention will be described with reference to drawings,
FIG. 1 is an explanatory diagram showing a form of a functional configuration of an optical information reproducing apparatus, especially, an equalizer according to the present invention. FIG. 2 is an explanatory diagram showing a form of a configuration example of an optical information reproducing apparatus according to the present invention.
In an optical information reproducing apparatus shown in FIG. 2, signals recorded on an optical information medium, that is, an optical disk (not shown) are read as analog signals through an optical head device (not shown). The analog signals are amplified to analog reproduced signals having a sufficiently large amplitude by an amplifier 11. Then, the analog reproduced signals are digitally converted by an analog/digital (A/D) converter 12. The digitally converted reproduced signals are output as digital reproduced signals yk at bit rate, that is, in clock time by a phase-locked loop (PLL) circuit. Then, the reproduced signals yk are input to an equalizer 13. The reproduced signals yk are equalized to a predetermined PR waveform by the equalizer 13 and are input to a Viterbi decoder 14. The Viterbi decoder 14 binarizes the data by the Viterbi algorithm.
The target waveform of the equalization is “Σak−1*hi” where a partial response waveform at bit rate (that is, in clock time) is “hi” (an index i of which corresponds to a time) and binary data recorded on the optical disk is “ak”. In the equation, a sum about the index “i” depends on the constraint length of the partial response. For example, the sum of “i” may be “1 to 5” for the partial response wavelength with constraint length 5.
According to the present invention, a tap coefficient, “Wi”, of an equalizer having the smallest result of an equation ε=Σ(Σyk−1*Wi=Σak-i*hi)2 is obtained by the least square technique. In other words, “Wi” is calculated by calculating a variation δεfor “wi” about “ε” and solving an equation to be “δε=0”. According to the invention, the problems including divergence do not occur since no convergence calculation is required.
The equation to be “δε=0” is concluded in a following linear equation. The equalization coefficient Wi (corresponding to an element of a determinant W) can be obtained by calculating a determinant “W=C−1D” including the determinant W represented by a tap coefficient to be calculated, a determinant C represented by using a correlation of actually reproduced signals as an element and a determinant D represented by using a correlation between reproduced signals and an equalization target signal as an element. Here, the elements, “C” and “D”, are defined as equations (1) and (2):




  
    
      
        
          
            
              C
              =
              
                [
                
                  
                    
                      
                        c
                        ⁡
                        
                          (
                          0
                          )
                        
                      
                    
                    
                      
                        c
                        ⁡
                        
                          (
                          1
                          )
                        
                      
                    
                    
                      .
                    
                    
                      .
                    
                    
                      
                        c
                        ⁡
                        
                          (
                          
                            N
                            -
                            1
                          
                          )
                        
                      
                    
                  
                  
                    
                      
                        c
                        ⁡
                        
                          (
                          
                            -
                            1
                          
                          )
                        
                      
                    
                    
                      
                        c
                        ⁡
                        
                          (
                          0
                          )
                        
                      
                    
                    
                      .
                    
                    
                      .
                    
                    
                      
                        c
                        ⁡
                        
                          (
                          
                            N
                            -
                            2
                          
                          )
                        
                      
                    
                  
                  
                    
                      .
                    
                    
                      .
                    
                    
                      .
                    
                    
                      .
                    
                    
                      .
                    
                  
                  
                    
                      .
                    
                    
                      .
                    
                    
                      .
                    
                    
                      .
                    
                    
                      .
                    
                  
                  
                    
                      
                        c
                        ⁡
                        
                          (
                          
                            
                              -
                              N
                            
                            +
                            1
                          
                          )
                        
                      
                    
                    
                      
                        c
                        ⁡
                        
                          (
                          
                            =
                            
                              N
                              +
                              2
                            
                          
                          )
                        
                      
                    
                    
                      .
                    
                    
                      .
                    
                    
                      
                        c
                        ⁡
                        
                          (
                          0
                          )
                        
                      
                    
                  
                
                ]
              
            
          
        
        
          
            where
          
        
        
          
            
              
                
                  c
                  ⁡
                  
                    (
                    m
                    )
                  
                
                =
                
                  
                    ∑
                    
                      k
                      -
                      N
                      -
                      m
                    
                    
                      M
                      -
                      m
                    
                  
                  ⁢
                  
                    
                      y
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      y
                      ⁡
                      
                        (
                        
                          k
                          +
                          m
                        
                        )
                      
                    
                  
                
              
              ,
              
                0
                ≧
                m
              
              ,
              
                c
                ⁡
                
                  (
                  
                    -
                    m
                  
                  )
                
              
              ,
              
                0
                <
                m
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




D=[d(0)d(1) . . . d(N−1)]  (2)

where





  
    
      d
      ⁡
      
        (
        i
        )
      
    
    =
    
      
        ∑
        
          k
          -
          N
          -
          i
        
        
          M
          -
          i
        
      
      ⁢
      
        
          y
          ⁡
          
            (
            
              k
              -
              i
            
            )
          
        
        ⁢
        
          
        
        ⁢
        
          z
          ⁡
          
            (
            k
            )
          
        
      
    
  
  ,
  
    0
    ≦
    i
    ≦
    
      N
      -
      1
    
  
  ,
  
    
      z
      ⁡
      
        (
        k
        )
      
    
    =
    
      
        ∑
        j
      
      ⁢
      
        
          a
          
            k
            -
            j
          
        
        ⁢
        
          
            h
            j
          
          .
        
      
    
  




Herein, “N” is the number of taps of a FIR filter for performing a partial response, and “M” is the number of reproduced signal samples used for determining the tap coefficient.

According to the invention, unlike adaptive equalization, information recorded on an optical disk must be known in advance. However, it is difficult to know data previously recorded on an optical disk such as a read-only memory (ROM). The inventors found that even data resulting from the direct binarization of unequalized waveforms by using a Viterbi decoder could be equalized more precisely with a predetermined number of samples.
Before describing examples thereof, a configuration of an equalizer 2 will be described with reference to FIG. 1. Here, the equalizer 2 receives and equalizes the digital reproduced signals yk from an A/D converter 1. Then, the equalizer 2 outputs the result to a Viterbi decoder 3.
The equalizer 2 includes a target waveform generator 4, an equalization coefficient calculator 5, and a finite impulse response (FIR) filter 6. The target waveform generator 4 receives the feedback of provisional identification data bk output from the Viterbi decoder 3 and generates a target waveform from a partial response waveform h; to be equalized. Then, the target waveform generator 4 sends the target waveform to the equalization coefficient calculator 5. The equalization coefficient calculator 5 receives the target waveform and also receives the reproduced signals yk from the A/D converter 1. Then, the equalization coefficient calculator 5 calculates an equalization coefficient and sends the equalization coefficient to the FIR filter 6. The FIR filter 6 changes multiple kinds of taps and adjusts the equalization, as described above.
Next, Examples 1 to 5 of the embodiments will be specifically described with reference to drawings.
EXAMPLE 1
Example 1 according to this embodiment of the invention will be described with reference to FIG. 1.
In Example 1, a phase-change optical disk was used to perform a recording/reproducing evaluation.
The phase-change optical disk was provided on a polycarbonate substrate 0.6 mm thick. The pitch of a guide slot on the substrate was 0.68 μm. Data ak modulated by (1-7) modulation method was written thereon and then was read by using an optical head having a wavelength of 405 nm and an objective lens with an NA of 0.65 under a condition with a linear speed of 5.6 m/s and a clock frequency of 64.6 MHz. The recording density was 0.13 μm/bit. In Example 1, as shown in FIG. 1, equalization by the least square technique used provisional binary data bk obtained by directly inputting unequalized reproduced signals yk for each clock time to the Viterbi decoder 3. In Example 1, the target partial response waveform had a PR value (1,2,2,2,1).
The partial response equalization was performed with the different numbers of samples of the reproduced signal yk to be used for the least square technique. Then, the binary data “ck” and “ak” demodulated by the Viterbi decoder 3 were compared, and the bit error rate was finally calculated. The FIR filter 6 having 9 taps was used for equalization. 106 samples were used for calculating the error rate. However, for example, when the first 100 reproduced signal samples of the 106 samples were used to calculate an equalization coefficient by the least square technique, all of the 106 reproduced signal samples were equalized with the equalization coefficient. Then, the signals were input by the Viterbi decoder 3, and “ck” of the binary data was calculated.
FIG. 4 shows a relationship between the number of samples and the finally obtained bit error rate. As shown in FIG. 4, with 3000 or more samples, information can be read at a lower error rate. Since the error rate stays almost the same with 3000 or more samples, 3000 samples are enough.
Furthermore, the error rate is improved to some extent when the number of samples for calculating the equalizing efficient is increased from 3000. However, the error rate stays the same even when the number of samples is increased to 10000 or more. Therefore, 10000 samples are enough at most.
EXAMPLE 2
Example 2 according to this embodiment of the invention will be described with reference to FIG. 2.
In Example 2, a ROM disk was used to perform a recording/reproducing evaluation.
The ROM disk was provided on a polycarbonate substrate 0.6 mm thick. Known data ak was formed on the substrate. Here, the radial pitch of the pit was 0.4 μm and the pitch in the laser scanning direction was 0.2 μm. Since the (1-7) modulation method was used to form the pit, the linear density was 0.15 μm/bit. By using an optical head having a waveform of 405 nm and an objective lens with a NA of 0.65, a reproducing evaluation was performed at a linear speed of 6.6 m/s. Also in this example, like Example 1 and as shown in FIG. 3, equalization by the least square technique used provisional binary data bk obtained by directly inputting reproduced signals yk in clock time to the Viterbi decoder 3. The FIR filter 6 with 9 taps was used for equalization, and the target partial response waveform was the PR value (1,2,2,2,1).
The partial response equalization was performed with the different numbers of samples of the reproduced signal yk to be used for the least square technique. Then, the binary data “ck” and “ak” demodulated by the Viterbi decoder 3 were compared, and the bit error rate was finally calculated. 106 samples were used for calculating the error rate. However, for example, when the first 100 reproduced signal samples of the 106 samples were used to calculate an equalization coefficient by the least square technique, all of the 106 reproduced signal samples were equalized with the equalization coefficient. Then, the signals were input by the Viterbi decoder 3, and “ck” of the binary data was calculated.
FIG. 5 shows a relationship between the number of samples and the finally obtained bit error rate. Though the recording density in Example 2 is different from that of Example 1, information can be read at a lower error rate with 3000 or more samples like Example 1. Since the error rate stays the same with 3000 or more samples, 3000 samples are enough.
EXAMPLE 3
In Example 1 and Example 2, the provisional binary data bk was calculated by inputting sampled reproduced signals to the Viterbi decoder 3 without equalization of the reproduced signals. However, the provisional binary data may be calculated by inputting signals equalized with a proper predetermined equalization coefficient to the Viterbi decoder 3.
In other words, reproduced signals are filtered (equalized) by using a fixed coefficient as an initial equalization coefficient of an FIR filter. Then, a provisional identification signal bk is generated from the equalized signals by using the Viterbi decoder 3. Next, like Examples 1 and 2, from the provisional identification data and a reproduced signal yk, the target waveform generator 4 and the equalization coefficient calculator 5 calculate an equalization coefficient of the FIR filter. The initial equalization coefficient can be experimentally calculated by using the same optical head and optical disk as those of a real drive product, for example, and can be stored in a predetermined area of a recording medium. The initial equalization coefficient W(iT) (where i=−4, −3, −2, −1, 0, 1, 2, 3, 4) may be:
as Example 1 of the initial equalization coefficient,
W(−4T)=W(4T)=0.0259,
W(−3T)=W(3T)=0.1023,
W(−2T)=W(2T)=0.1276,
W(−T)=W(T)=0.1001, or
W(0T)=0.6974,
and as Example 2 of the initial equalization coefficient,
W(−4T)=W(4T)=0.1634,
W(−3T)=W(3T)=−0.0903,
W(−2T)=W(2T)=−0.2099,
W(−T)=W(T)=0.0968, or
W(0T)=1.0800.
In Example 3, the equalizer 2 having a previously fixed equalization coefficient may be provided between the reproduced signals yk and the Viterbi decoder 3 in FIG. 1. Alternatively, a fixed equalization coefficient to be defined in the FIR filter 6 in FIG. 1 may be supplied from a memory, for example.
The equalization coefficient may be recalculated when the reproducing condition is changed after the equalizationl coefficient is calculated at a certain time. In this case, the equalization coefficient obtained in Examples 1 or 2 or the equalization coefficient obtained by using the initial equalization coefficient in Example 3 is stored in a memory in advance, for example. In order to recalculate the equalization coefficient, the reproduced signal equalized by the stored previous equalization coefficient may be input to the Viterbi decoder 3, and provisional binary discrimination data may be calculated. Thus, a target equalized waveform may be obtained.
By using the same phase-change optical disk and optical head as those of Example 1, previously written information was reproduced with different kinds of defocusing. Under different defocusing conditions, equalization coefficients were calculated, and the reproduced signals were equalized. Then, the error rate was measured. In Example 3, the reproduced signals equalized by using the tap coefficient calculated in Example 1 (which is the same under different defocusing conditions) were input to the Viterbi decoder 3. Then, a target waveform was calculated based on the provisional binary discrimination data, and the final equalization coefficient was obtained. In this example, the number of taps in the FIR filter 6 for equalization is also “9”.
FIG. 6 shows a relationship between the number of samples used for equalization and the error rates under different defocusing conditions. Since the condition, the defocusing amount 0 μm, is substantially the same as that of Example 1, signals can be reproduced at a lower error rate by using the coefficient calculated by the least square technique with a smaller number of samples. The error rate is deteriorated with a very small number of samples such as about 100 samples because, even under the same reproducing condition, the effect of random noise is not completely the same and the error rate may be influenced thereby.
Like Examples 1 and 2, as shown in FIG. 6, signals can be reproduced at a lower error rate with about 3000 samples, when the defocusing amount is ±0.2 μm. The error rate is more deteriorated with the defocusing amount of ±0.2 μm than that with the defocusing amount of 0 μm not because of the precision of the calculation of equalization coefficients but because the reproducing performance itself is deteriorated due to the defocusing.
In the examples above, the number of taps of the FIR filter 6 was “9”, but the fact was found that the equalization errors were almost the same with “7 or more” taps in order to equalize to the PR value (1.2,2,2, 1) of constraint length 5. That is, “7 or more” taps are enough. However, an excessive number of taps may increase the size of calculations by the least square technique or the size of the circuit or may decrease the operational speed. Therefore, about 7 to 15 taps are desirable.
EXAMPLE 4
FIG. 7 is a diagram showing a configuration of an optical-information reproducing/recording apparatus according to Example 4 of the invention. A shown equalizer 22 is the same as the equalizers in Examples 1 to 3. A tap coefficient of the equalizer 22 can be calculated by following the steps in Examples 1 to 3. Subsequently, reproduced signals are equalized by using the tap coefficient, and binary identification data is obtained by a Viterbi decoder 23 from the equalized reproduced signal. Finally, the quality of the reproduced signals is evaluated by a signal evaluator 24 from the equalized reproduced signal and the binary identification data.
EXAMPLE 5
FIG. 8 is a diagram showing a configuration of an optical-information reproducing/recording apparatus according to Example 5 of the invention. In FIG. 8, the equalizer 22 is the same as the equalizer of Examples 1 to 3. An initial set value for generating recorded waveforms is stored in an internal memory of a recorded waveform generator 33. Here, a recorded waveform represents a time variation (the parameters of which are a power and a pulse width) of laser light being irradiated onto an optical disk while writing data, which is generally called recording strategy. The initial set value is recorded on an optical disk 31 in advance. After reproducing the initial set value from the applicable area, the initial set value may be stored in the internal memory.
First of all, the recorded waveform generator 33 generates an initial recorded waveform from binary recorded data based on the initial set value of the recorded waveform. Information is written on the optical disk 31 through the optical head 32 by using the initial recorded waveform. The written information is read out as reproduced signals through the optical head 32 and is converted to digital data by the A/D converter 21. From the reproduced signals, a tap coefficient of the equalizer 22 is obtained by following the steps in Examples 1 to 3. Again, the reproduced signals are read out from the information, and the reproduced signals are equalized by using the tap coefficient. From the equalized reproduced signal, binary identification data is obtained by the Viterbi decoder 23. From the equalized reproduced signal and the binary identification data, a quality evaluation value of the reproduced signals is calculated by the signal evaluator 24. Based on the calculated quality evaluation value, the recorded waveform set value stored in the internal memory of the recorded waveform generator 33 is corrected.
The set value of the recorded waveform can repeatedly be corrected. That is, based on the recorded waveform set value corrected, the recorded waveform is generated from binary recorded data. After that, according to the steps as described above, the quality evaluation value of the reproduced signals is calculated. And based on the calculated quality evaluation value, the recorded waveform set value stored in the internal memory of the recorded waveform generator 33 is corrected.
In the case that the set value of the recorded waveform can repeatedly be corrected, the tap coefficient obtained at the first time may be used for calculation on and after the second. As the result, since the calculation time on and after the second for the tap coefficient is omitted, the correction of the set value of the recorded waveform is performed at high speed.

## Claims

1. A reproduced signal equalizing method for optical information media in which reproduced signals obtained by irradiating laser light to an optical information medium are equalized so as to bring a waveform corresponding to the reproduced signals close to a waveform having predetermined characteristics, the method comprising the steps of:
sampling the reproduced signals in a predetermined cycle;
inputting the reproduced signals sampled in the predetermined cycle to a Viterbi decoder, wherein the reproduced signals sampled in the predetermined cycle are unequalized;
demodulating by the Viterbi decoder the unequalized reproduced signals sampled in the predetermined cycle to generate binarized data;
defining a target waveform as a waveform based on the binarized data demodulated by the Viterbi decoder and a partial response waveform;
calculating an equalization coefficient for producing a smallest difference between the target waveform and the unequalized reproduced signals sampled in the predetermined cycle by a least square technique using a matrix calculation; and
equalizing the unequalized reproduced signals sampled in the predetermined cycle by using the calculated equalization coefficient.

2. The reproduced signal equalizing method according to claim 1, wherein 3000 or more sampled waveforms are used in the matrix calculation.

3. A reproduced signal equalizing apparatus for equalizing reproduced signals obtained from optical information media by bringing a waveform corresponding to the reproduced signals close to a waveform having predetermined characteristics, the reproduced signal equalizing apparatus comprising:
an optical head which reproduces signals by irradiating laser light to an optical information medium;
an analog-to-digital (A/D) converter which samples the reproduced signals in a predetermined cycle;
a Viterbi decoder which demodulates the reproduced signals sampled in the predetermined cycle to generate binarized data, wherein the reproduced signals sampled in the predetermined cycle are unequalized;
a target waveform generator which generates a target waveform based on the binarized data demodulated by the Viterbi decoder and a partial response waveform;
an equalization coefficient calculator which calculates an equalization coefficient by producing a smallest difference between the target waveform and the unequalized reproduced signals sampled in the predetermined cycle using a least square technique, wherein the least square technique includes including a matrix calculation; and
an equalizer which equalizes the unequalized reproduced signals sampled in the predetermined cycle by using the calculated equalization coefficient.