JPH10320931A - Apparatus and method for reproducing information - Google Patents

Abstract

PROBLEM TO BE SOLVED: To evaluate quality of a reproduction signal with the use of an amplitude reference value in Viterbi decoding. SOLUTION: A Viterbi decoder 130 forms state data representing a maximum likelihood state transition on the basis of a reproduction signal value from an A/D converter 12, and generates decoding data from the state data. An amplitude reference value recognized from the state transition is supplied to a quality index generator 102. The reproduction signal value is held in a DMU (data memory unit) 101, and supplied in synchronization with an output of the amplitude reference value from the Viterbi decoder 130 to the quality index generator 102. A difference between the amplitude reference value and reproduction signal value is operated. Differences generated in a predetermined period are totalized. When the reproduction signal has good quality, the reproduction signal value agrees with the amplitude reference value, making the difference zero. Therefore, a value obtained by the totalization is used as an index for evaluating quality of the reproduction signal.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to an information reproducing apparatus and a reproducing method applicable to a reproducing apparatus for reproducing data from a disk-shaped recording medium and performing Viterbi decoding.

[0002]

2. Description of the Related Art In an information reproducing apparatus such as a magneto-optical disk apparatus, to evaluate the quality of a reproduced signal read from a disk (signal deterioration due to noise, waveform distortion caused by inappropriate recording conditions, etc.). A method of actually writing data from a host computer to a test area of a disk, reading the data, comparing write data with read data, and measuring an error rate has been used. Further, in order to evaluate the reproduced signal in terms of an analog waveform, a measuring device for evaluating the waveform was separately required.

[0003]

As described above, a large-scale system (apparatus) is required to evaluate the quality of a reproduced signal.
Requires a recording and playback device (disk drive)
There was a problem that the quality could not be evaluated inside the factory.

Accordingly, an object of the present invention is to provide an information reproducing apparatus and a reproducing method which can easily and quantitatively evaluate the quality of a reproduced signal inside a recording / reproducing apparatus.

[0005]

The present invention is used in a disk reproducing apparatus using a Viterbi decoding method. The Viterbi decoding method is a decoding method capable of reducing a bit error rate when decoding a reproduced signal including white noise. The outline of the Viterbi decoding method is as follows. A plurality of states are specified in advance in accordance with the recording method for the recording medium, and a calculation process performed at a timing according to the read clock based on a reproduction signal reproduced from the recording medium causes a maximum likelihood at each time according to the read clock. Select a state transition. Then, corresponding to the result of such selection, the decoded data as a series of decoded data values of '1' or '0' is generated. The calculation process based on the reproduced signal is performed with reference to an amplitude reference value determined by the type of the Viterbi decoding method. If the reproduced signal is an ideal one that is not affected by amplitude fluctuation or the like, the amplitude reference value may be a value that is theoretically determined from the type of Viterbi decoding method.

Therefore, if the amplitude reference value obtained from the state transition of Viterbi decoding matches the actual value of the reproduced signal at that time, it can be estimated that the reproduced signal is ideal.
On the other hand, if they do not match, it can be estimated that the reproduced signal is not ideal.

That is, the present invention relates to a Viterbi decoding means which uses a method for generating state data representing a state transition itself in an information reproducing apparatus for decoding a reproduced signal reproduced from a recording medium by a Viterbi decoding method. And a difference between an amplitude reference value corresponding to a state transition recognized from the state data and a reproduction signal value generated by A / D converting the reproduction signal, and calculating the reproduction signal based on the difference. And a quality index generating means for generating an index indicating the quality of the information. Further, the present invention is a reproducing method for reproducing information as described above.

As described above, the difference between the amplitude reference value recognized from the state transition of the Viterbi decoding and the actual value of the reproduced signal represents the quality of the reproduced signal. Therefore,
The quality of the reproduced signal can be evaluated based on this difference. The signal system can be adjusted using the result of the evaluation.

[0009]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS In order to facilitate understanding of the present invention, an example of a recording / reproducing apparatus having a reproducing system for performing a Viterbi decoding method will be described below. The outline of the 4-value 4-state Viterbi decoding method will be described in the order of the configuration and operation of the Viterbi decoder that realizes the 4-value 4-state Viterbi decoding method, and the Viterbi decoding method other than the 4-value 4-state Viterbi decoding method.

[Overview of Disc Recording / Reproducing Apparatus] An example of a recording / reproducing apparatus having a reproducing system for performing a Viterbi decoding method will be described below. FIG. 1 is a block diagram showing an overall configuration of an example of a magneto-optical disk device having a reproducing system that performs a Viterbi decoding method. At the time of recording, the controller 2 receives user data to be recorded according to a command from the host computer 1, performs encoding based on the user data as information words, and performs RLL (1,
7) Generate a code. This codeword is used as recording data in a laser power control unit (hereinafter referred to as LPC).
4 is supplied. In addition to such processing, the controller 2 performs operations such as decoding processing described later, control of each mode such as recording, reproduction, and erasing, and communication with the host computer 1.

The LPC 4 performs recording by controlling the laser power of the optical pickup 7 to form a pit row having a magnetic polarity on the magneto-optical disk 6 in accordance with the supplied recording data. At the time of this recording, the magnetic head 5 applies a bias magnetic field to the magneto-optical disk 6. Actually, mark edge recording as described later is performed according to a precode output generated as described later based on the recording data.

As will be described later, the recording position, that is, the pit formation position is controlled by means (not shown) for positioning the magnetic head 5, the optical pickup 7, and the like. For this reason, even during the recording operation, when the optical pickup 7 passes through the address section and the like, the same operation as the reproducing operation described later is performed.

A method for associating each pit formed as described above with each bit in a precode output generated as described later based on recording data will be described with reference to FIG. A recording method in which a pit is formed for, for example, "1" and no pit is formed for "0" in the precode output is called a mark position recording method.
On the other hand, a recording method in which the inversion of the polarity at the boundary of each bit in the precode output expressed by the edge of each pit corresponds to, for example, “1” is called a mark edge recording method. During playback, the boundaries of each bit in the playback signal are
It is recognized in accordance with a read clock DCK generated as described later.

Next, the configuration and operation of the reproducing system will be described. The optical pickup 7 irradiates the magneto-optical disk 6 with laser light, receives reflected light generated thereby,
Generate a playback signal. The reproduction signal is composed of a sum signal R ₊ , a difference signal R _−, and a focus error signal and a tracking error signal (not shown). The sum signal R ₊ is supplied to the changeover switch 10 after the gain is adjusted by the amplifier 8. Also, the difference signal R
_- the gain adjustment and the like are supplied to a switch 10 switching after being made by the amplifier 9. Further, the focus error signal is supplied to a means (not shown) for eliminating the focus error. On the other hand, the tracking error signal is
It is supplied to a servo system and the like (not shown) and used in those operations.

The changeover switch 10 is supplied with a changeover signal S as described later. Changeover switch 10, in accordance with the switching signal S, as follows, the sum signal R ₊ or difference signals R _- supplying to the filter unit 11. That is, in a sector format of the magneto-optical disk 6 described later, the sum signal R ₊ is supplied to the filter unit 11 during a period in which a reproduction signal reproduced from a portion formed by embossing is supplied to the changeover switch 10. I do.
Further, during a period in which a reproduction signal reproduced from a portion recorded magneto-optically is supplied to the changeover switch 10, the difference signal R ₋ is supplied to the filter unit 11.

The switching signal S is generated, for example, as follows. That is, first, a signal reproduced from a predetermined pattern defined in the sector format is detected from the reproduced signal. As such a predetermined pattern, for example, a sector mark SM described later is used. Then, the switching signal S is generated at a predetermined time point recognized by a method such as counting read clocks, which will be described later, based on the time point at which the detection is performed.

The filter unit 11 includes a low-pass filter for performing noise cut and a waveform equalizer for performing waveform equalization. As will be described later, the waveform equalization characteristics used in the waveform equalization process at this time are adapted to the Viterbi decoding method performed by the Viterbi decoder 13. The A / D converter 12 supplied with the output of the filter unit 11 samples the reproduced signal value z [k] according to a read clock DCK supplied as described later. Viterbi decoder 1
3 generates decoded data by the Viterbi decoding method based on the reproduced signal value z [k]. Such decrypted data is
This is the maximum likelihood decoding sequence for the recording data recorded as described above. Therefore, if there is no decoding error,
The decrypted data matches the recorded data.

The decoded data is supplied to the controller 2. As described above, the recording data is a codeword generated from user data by encoding such as channel encoding. Therefore, if the decoding error rate is sufficiently low, the decoded data can be regarded as recording data as a codeword. The controller 2 reproduces user data and the like by performing decoding processing corresponding to the above-described encoding such as channel encoding on the decoded data.

The output of the filter unit 11 is also supplied to a PLL unit 14. The PLL unit 14 generates a read clock DCK based on the supplied signal. The read clock DCK is supplied to the controller 2, the A / D converter 1
2. It is supplied to the Viterbi decoder 13 and the like. The operations of the controller 2, the A / D converter 12, and the Viterbi decoder 13 are performed at timing according to the read clock DCK. Further, the read clock DCK is supplied to a timing generator (not shown). The timing generator
For example, it generates a signal for controlling operation timing of the apparatus such as switching between recording / reproduction operations.

[Outline of Format of Recording Medium]
The outline of the track format and the sector format of the magneto-optical disk 6 will be described. FIG. 3 shows an example of the track format. Opening 6 in the center of the disc
a, a reflection zone 6b, a control track PEP (Phase Encoded Part) zone 6c,
Transition zone 6d, inner control truck SFP
(Standard Formatted Part) 6e and an inner manufacturing zone 6f are provided. Further, an outer manufacturing zone 6g, an outer SFP zone 6h, and a lead-out zone 6i are provided on the outermost peripheral side. The area between the inner area and the outer area is a user zone 6j usable for recording / reproducing data.

The PEP 6c is provided with phase information. SF
P6e and 6h provide medium information (sensitivity, reflectance, etc.) and system information (track number, etc.). further,
The inner manufacturing zone 6f and the outer manufacturing zone 6g are areas for a test light. At the time of calibration, test writing of data is performed using these zones 6f and 6g.

In the user zone of the magneto-optical disk 6, user data is recorded in units of recording / reproducing sectors. An example of a sector format used in the magneto-optical disk 6 will be described with reference to FIG. FIG.
As shown in A, one sector includes a header, ALPC, gap, VFO ₃ , sync,
It is divided into data fields and buffer areas. The numbers given in FIG. 4 represent the number of bytes. Encoded data such as block encoding is recorded on the magneto-optical disk 6. For example, 8 bits are converted into 12 channel bits and recorded.

As an example of this sector format, a format having a user data amount of 1024 bytes and a format having a user data amount of 512 bytes are prepared. In the format in which the user data amount is 1024 bytes, the number of bytes in the data field is 670 bytes.
Bytes. In the format in which the amount of user data is 512 bytes, the number of bytes in the data field is one.
278 bytes. In these two sector formats, the preformatted header of 63 bytes and the 18 bytes of the ALPC and gap area are the same.

FIG. 4B shows a 63-byte header in an enlarged manner. The header is a sector mark SM (8 bytes), VF
O field VFO ₁ (26 bytes), address mark AM (1 byte), ID field ID ₁ (5 bytes), VFO field VFO ₂ (16 bytes), address mark AM (1 byte), ID field ID
₂ (5 bytes) and postamble PA (1 byte) are arranged in order.

FIG. 4C shows an enlarged 18 byte ALPC and gap area. 18 bytes are a gap field (5 bytes), a flag field (5 bytes),
It consists of a gap field (2 bytes) and ALPC (6 bytes).

Next, these fields will be described. The sector mark SM is a mark for identifying the start of a sector, and has a pattern formed by embossing that does not occur in the RLL (1, 7) code.
The VFO field is the VFO (V
ariable Frequency Oscillator) (or VCO) intended to synchronize the, VFO _1, VFO ₂ and VF
Consists of O ₃ . VFO ₁ and VFO ₂ are formed by embossing. The VFO ₃ is written magneto-optically when a recording operation is performed on the sector. VFO ₁ , VFO ₂ and VFO ₃ each have a pattern (2T pattern) in which channel bits “0” and “1” appear alternately. Therefore, if the time corresponding to the time length of one channel bit is T, a reproduced signal whose level is inverted every 2T is obtained when the VFO field is reproduced.

The address mark AM is used to provide byte synchronization to the device for the subsequent ID field and has an embossed pattern that does not occur in the RLL (1,7) code. The ID field includes a sector address, that is, information of a track number and a sector number, and a CRC for error detection for the information.
Has bytes. The ID field consists of 5 bytes. The ID ₁ and ID _2, the same address information is recorded in duplicate. The postamble PA has a pattern (2T) in which channel bits “0” and “1” appear alternately.
Pattern). ID ₁ , ID ₂ and postamble PA are also formed by embossing. Thus, the header area is a preformatted area in which pits are formed by embossing.

FIG. 4C shows the ALPC and the gap area in an enlarged manner. No pit is formed in the gap. The first gap field (5 bytes) is the first field after the preformatted header, which ensures that the device will have time to process after reading the header. The second gap field (2 bytes) is for allowing a displacement of the position of VFO ₃ later.

In the ALPC and gap area, a 5-byte flag field is recorded. In the flag field, a continuous 2T pattern is recorded when sector data is recorded. ALPC (Auto Laser Power Cont
The (rol) field is provided for testing the laser power at the time of recording. Sync field (4 bytes)
Is provided for the device to obtain byte synchronization for the subsequent data field and has a predetermined bit pattern.

The data field is provided for recording user data. The above-mentioned 670-byte data field includes 512-byte user data and 14 bytes.
It consists of 4 bytes of parity for error detection and correction, 12 bytes of sector write flag, and 2 bytes (FF). In the case of a 1278-byte data field, the data field includes 1024-byte user data, 242-byte parity for error detection and correction, and a 12-byte sector write flag. The buffer field at the end of the sector is used as a tolerance for electrical or mechanical errors.

In the above example of the sector format, the header area is an area in which pits are formed by embossing. The ALPC and gap areas are not used during reproduction. further,
The VFO ₃ , the sync field and the data field are magneto-optically recorded data areas.

[Summary of 4-level 4-state Viterbi decoding method] The Viterbi decoding method performed by the Viterbi decoder 13 will be described below. As described above, the user data is
It is converted into a codeword as recording data by various encoding methods. An appropriate encoding method is adopted according to the characteristics of the recording medium and the recording / reproducing method. In the magneto-optical disk drive, in the block coding, Ru
In many cases, an RLL (Run Length Limited) coding method for limiting the n Length, that is, the number of '0's between' 1 'and' 1 'is used. Conventionally, several RLL coding methods have been used. Generally, an m / n block code in which the number of '0's between' 1 'and' 1 'is at least d and at most k is RLL
(D, k; m, n) code.

For example, in a 2/3 block code,
A block coding method in which the number of '0's between 1' and '1' is at least one and at most seven is RLL (1,7; 2,3)
Sign. Generally, the RLL (1, 7; 2, 3) code is R
Since it is often referred to as an LL (1, 7) code, the RLL (1, 7; 2, 3) code will be simply referred to as an RLL (1, 7) code in the following description. .

A Viterbi decoding method can be used to decode a reproduction signal reproduced from data recorded by a combination of such an RLL encoding method and the above-described mark edge recording method.

Such an RLL encoding method can meet the conditions required for the encoding method from the two viewpoints of improving the recording density and ensuring the stability of the reproducing operation. First, as described above, the mark edge recording method associates '1' in the precode output generated as described later based on the recording data with the inversion of the polarity represented by the edge of each pit. '1'
As the number of '0's between' 1 'and' 1 'is increased, the number of bits recorded per pit can be increased. Therefore, the recording density can be increased.

On the other hand, the read clock DCK necessary for adjusting the operation timing of the reproduction system is generated by the PLL section 14 based on the reproduction signal as described above. For this reason, in the recorded data, a value between '1' and '1'
When the number of 0's is increased, the operation of the PLL unit becomes unstable during the reproducing operation, so that the entire reproducing operation becomes unstable.

Considering these two conditions, '1' and '
The number of '0's between 1's must be set within a reasonable range, not too high or too low. The RLL encoding method is effective for setting the number of '0' in the recording data.

By the way, as shown in FIG.
In the combination of the LL (1, 7) encoding method and the mark edge recording method, at least one '0' is inserted between '1' and '1' in precode output generated based on recording data. Since it is included, the minimum inversion width is 2. When such an encoding method in which the minimum inversion width is 2 is used, as a method for decoding recorded data from a reproduced signal affected by intersymbol interference and noise, as described below,
A quaternary 4-state Viterbi decoding method can be applied.

As described above, the waveform equalization processing is performed on the reproduced signal by the filter unit 11. Such a waveform equalization process performed as a preceding stage of the Viterbi decoding method includes:
A partial response method that actively uses intersymbol interference is used. The waveform equalization characteristics used at this time are:
From the partial response characteristics generally represented by (1 + D) ⁿ , the linear recording density and MTF of the recording / reproducing system
(Modulation TransferFunction). Waveform equalization processing using PR (1, 2, 1) for data recorded by a combination of the above-described RLL (1, 7) encoding method and mark edge recording method requires 4
This is the preceding stage of the 4-state Viterbi decoding method.

On the other hand, in the mark edge recording method,
Prior to actual recording on a magneto-optical disk medium, etc.,
Precoding based on the recording data encoded by the above-described RLL encoding or the like is performed. The recording data sequence at each time point k is a [k], and the precode output based on this is b
When [k] is set, precoding is performed as follows.

B [k] = mod 2 {a [k] + b [k−1]} (1) Such a precode output b [k] is actually recorded on a magneto-optical disk medium or the like. On the other hand, the waveform equalization characteristic PR (1,
The waveform equalization processing in (2, 1) will be described. However, in the following description, the waveform equalization characteristic is PR (B, 2A, B) without normalizing the signal amplitude. The value of the reproduced signal when noise is not considered is denoted as c [k]. In addition, the actual playback signal containing noise (ie,
The reproduced signal reproduced from the recording medium) is denoted by z [k].

PR (B, 2A, B) is such that the contribution of the amplitude at time k to the value of the reproduced signal at a certain time k is 2A times the amplitude value, and furthermore, at the preceding and following time k-1 and k + 1. The contribution of the amplitude is B times the amplitude of the signal at each point in time. Accordingly, the maximum value of the value of the reproduction signal is a case where a pulse is detected at any of the time points k-1, k, and k + 1. In such a case, the maximum value of the reproduction signal is as follows.

B + 2A + B = 2A + 2B The minimum value of the value of the reproduced signal is 0. However, in the actual handling, the DC component A +
The following is obtained by subtracting B.

C [k] = B × b [k−2] + 2A × b [k−1] + B × b [k] −AB (2) Therefore, the reproduced signal c [k when noise is not considered. ]
Takes any value among A + B, A, -A, and -AB. Generally, one of the methods for indicating the property of a reproduced signal
For example, a pattern obtained by superimposing a large number of reproduction signals in units of five time points is called an eye pattern. FIG. 6 shows an example of an eye pattern of an actual reproduced signal z [k] subjected to waveform equalization processing under PR (B, 2A, B) in a magneto-optical disk drive to which the present invention can be applied. . From FIG. 6, the reproduced signal z [k] at each time point
Has a variation due to noise, but is approximately A +
It can be confirmed that any one of B, A, -A, and -AB is obtained. As described later, A + B, A, -A, -AB
Is used as an identification point.

An outline of a Viterbi decoding method for decoding a reproduced signal having undergone the above-described waveform equalization processing is as follows. All possible states are identified based on the step encoding method and the recording method for the recording medium. With each state at a certain point as a starting point, all state transitions that can occur at the next point in time, and the recording data a [k] and the value c [k] of the reproduction signal at the time of each state transition are specified. A representation of all states and state transitions specified as a result of the step and the state and [recorded data value a [k] / reproduced signal value c [k]] at the time of each state transition. Is called a state transition diagram. As will be described later, a state transition diagram in the 4-value 4-state Viterbi decoding method is as shown in FIG. Then, to perform a decoding operation based on this state transition diagram,
The Viterbi decoder 13 is configured.

Further, as described above, on the premise of the state transition diagram, the maximum likelihood state transition based on the reproduction signal z [k] reproduced from the recording medium at each time point k is selected. However, as described above, z [k] is waveform-equalized in a stage before being supplied to the Viterbi decoder 13. Each time such a maximum likelihood state transition is selected, the value of the recording data a [k] described in the state transition diagram is set as a decoded value in accordance with the selected state transition. Decoded data a '[k] as the maximum likelihood decoded value sequence for the data can be obtained. However, the configuration for obtaining the maximum likelihood decoded value sequence from the decoded data values at each time point k is based on the PMU 23 in the Viterbi decoder 13 described later.
It is. Therefore, as described above, the decoded data sequence a ′
[K] is a record data sequence a when there is no decoding error.
[K]. The above steps are described in detail below.

The above steps will be described. First, as a state used here, a state at a certain time point k is defined as follows using a precode output before the time point k. That is, n = b [k], m =
The state when b [k-1] and 1 = b [k-2] is defined as Snml. With such a definition, it is considered that there are 2 ³ = 8 states, but as described above, the states that can actually occur are limited based on the encoding method and the like. RLL
Recording data sequence a encoded as a (1,7) code
In [k], at least one '0' is included between '1' and '1', so that two or more '1's do not continue.
Based on such conditions imposed on the recording data string a [k], certain conditions are imposed on the precode output b [k], and the resulting states are restricted.

Such a limitation will be specifically described. As described above, in a recording data sequence generated by RLL (1, 7) encoding, there cannot be one in which two or more '1's are continuous, that is, the following.

A [k] = 1, a [k−1] = 1, a [k−2] = 1 (3) a [k] = 1, a [k−1] = 1, a [k− 2] = 0 (4) a [k] = 0, a [k−1] = 1, a [k−2] = 1 (5) Based on such conditions imposed on the recording data sequence, Examining the conditions imposed on b [k] according to the equation (1), it can be seen that the two states S010 and S101 cannot occur. Therefore, there are 2 ³ −2 = 6 possible states.

Next, the steps will be described. In order to obtain a state that can occur at the next time point j + 1 from the state at a certain time point j as a starting point, it is necessary to separately examine the case where the value a [j + 1] of the recording data at the time point j + 1 is 1 and 0. There is.

Here, the state S000 will be described as an example. According to the above equation (1), S000, that is, n = b
[J] = 0, l = b [j-1] = 0, m = b [j-2]
The recording data pre-coded as = 0 is the following 2
Individuals can be considered.

A [j] = 0, a [j−1] = 0, a [j−2] = 1 (6) a [j] = 0, a [j−1] = 0, a [j− 2] = 0 (7) [when a [j + 1] = 1] At this time, according to equation (1),
b [j + 1] is calculated as follows.

B [j + 1] = mod2 {a [j + 1] + b [j]} = mod2 {1 + 0} = 1 (8) Therefore, the value of the reproduced signal c [j] is calculated according to the above equation (2). Is calculated as follows.

C [j + 1] = {B × b [j + 1] + 2A × b [j] + B × b [j−1]} − AB = {B × 1 + 2A × 0 + B × 0} −AB = − A (9) Also, for the state Snlm at the next time point j + 1, n =
b [j + 1], 1 = b [j], and m = b [j-1]. Then, as described above, b [j + 1] = 1, b
Since [j] = 0 and b [j-1] = 0, the next time point j
The state at +1 is S100. Therefore, a [j
+1] = 1, it can be specified that a transition of S000 → S100 occurs.

[When a [j + 1] = 0] At this time, b [j + 1] is calculated as follows according to the equation (1).

B [j + 1] = mod2 {a [j + 1] + b [j]} = mod2 {0 + 0} = 0 (10) Therefore, the value of the reproduced signal c [j + 1] is calculated according to the above equation (2). Is calculated as follows.

C [j + 1] = {B × b [j + 1] + 2A × b [j] + B × b [j−1]} − AB = {B × 0 + 2A × 0 + B × 0} −AB = − AB (11) Further, regarding the state Snlm at the next time point j + 1,
n = b [j + 1], 1 = b [j], and m = b [j-1]. Then, as described above, b [j + 1] = 0, b
Since [j] = 0 and b [j-1] = 0, the state at the next time point is S000. Therefore, a [j + 1]
If = 0, it can be specified that a transition of S000 → S000 occurs.

Thus, S000 at time j
, The state transitions that can occur at the next time point j + 1 starting from them and the correspondence between the recording data value a [j + 1] and the reproduction signal value c [j + 1] when such state transitions occur Can be requested.

As described above, for each state, the correspondence between the state transition that can occur starting from the state, the value of the recording data and the value of the reproduction signal at the time when each state transition occurs is obtained, and the correspondence is shown in the form of FIG. FIG. 7 shows the result. Time points j and j + 1 described above are not special time points. Therefore, the correspondence between the possible state transitions obtained as described above and the values of the recording data and the values of the reproduction signals accompanying them can be applied at any time. Therefore, FIG.
In, the value of the recording data accompanying the state transition occurring at an arbitrary time point k is denoted as a [k], and the value of the reproduced signal is denoted as c [k].

In FIG. 7, the state transition is represented by an arrow. In addition, the sign given to each arrow indicates [record data value a [k] / reproduction signal value c [k]]. State S
While there are two types of state transitions starting from 000, S001, S111, and S110, only one transition can occur starting from states S011 and S100.

Further, in FIG. 7, S000 and S001
Takes a value of c [k] =-A for a [k] = 1, and transits to S100. On the other hand, a
For [k] = 0, a value of c [k] =-AB is taken, and the process transits to S000. Also, S111 and S1
10 is also the same for the same value of a [k + 1].
It takes the value of [k + 1] and transitions to the same state. Therefore, S000 and S001 can be collectively expressed as S0, and S111 and S110 can be collectively expressed as S2. Further, S011 is set to S3, and S100 is set to S3.
FIG. 8 shows an arrangement that is expressed as 1.

As described above, FIG. 8 is a state transition diagram used in the 4-value 4-state Viterbi decoding method. In FIG. 8,
The four states S0 to S3 and the reproduced signal c [k + 1]
Are shown as -AB, -A, A, and A + B. There are two types of state transition starting from the states S0 and S2, whereas only one state transition starting from the states S1 and S3.

On the other hand, a trellis diagram as shown in FIG. 9 is used as a format for expressing a state transition along time. FIG. 9 shows a transition between two time points, but a transition between a larger number of time points may be shown. As the time elapses, a state in which the image sequentially transits to the right time point is expressed. Therefore, a horizontal arrow represents a transition to the same state, for example, S0 → S0, and a diagonal arrow represents, for example, S1 → S2.
And so on.

The steps of the above-described Viterbi decoding method, that is, a method of selecting the maximum likelihood state transition from the actual reproduced signal z [k] including noise, based on the state transition diagram shown in FIG. 8, will be described below. .

In order to select the maximum likelihood state transition, first, for the state at a certain time point k, the sum of the likelihoods of the state transitions between a plurality of time points passed in the process of reaching the state is calculated. It is necessary to select the maximum likelihood decoded sequence by comparing the calculated sums of likelihoods. Such a sum of likelihoods is called a path metric.

In order to calculate a path metric, it is first necessary to calculate the likelihood of a state transition between adjacent time points. Such calculation of the likelihood is performed as follows based on the value of the reproduced signal z [k] with reference to the above state transition diagram. First, as a general explanation, the time k-
Consider the case where the state is Sa in state No. 1. At this time, when the reproduction signal z [k] is input to the Viterbi decoder 31, the likelihood that a state transition to the state Sb occurs is calculated according to the following equation. However, the state Sa and the state Sb are any of the four states described in the state transition diagram of FIG.

(Z [k] −c (Sa, Sb)) ² (12) In the above equation, c (Sa, Sb) is the state transition from the state Sa to the state Sb in the state transition diagram of FIG. This is the value of the described reproduction signal. That is, in FIG. 8 described above, for example, for the state transition S0 → S1, the value is calculated as −A. Therefore, equation (12) is the Euclidean distance between the value of the actual reproduced signal z [k] including noise and the value of the reproduced signal c (Sa, Sb) calculated without considering noise. The path metric at a certain point in time is defined as the sum of likelihoods of state transition between such adjacent points up to that point.

Now, consider the case where the state is Sa at the time point k. In this case, at time k-1, the state S
If the state that can transition to a is Sp, the path metric L
(Sa, k) is calculated by the following equation using the path metric at the time point k-1.

L (Sa, k) = L (Sp, k−1) + (z [k] −c (Sp, Sa)) ² (13) That is, when the state Sp is reached at the time point k−1 The path metric L (Sp, k−1) and the likelihood (z (z) of the state transition Sp → Sa occurring between the time points k−1 and k)
[K] −c (Sp, Sa)) ² and the path metric L (Sa, k) is calculated. The likelihood of the latest state transition such as (z [k] -c (Sp, Sa)) ² is called a branch metric. However, the branch metric here is a branch metric calculation circuit (BMC) 2 in the Viterbi decoder 13 described later.
A branch metric calculated by 0, ie
The branch metric corresponding to the standardized metric is
Note that they are different.

When the state Sa is at the time point k, there may be a plurality of states that can transition to the state Sa at the time point k-1. In FIG. 8, states S0 and S2 are such cases. That is, if the state S0 is at time k, the state S
There are two states that can transition to 0: S0 and S3. Further, when the state is the state S2 at the time point k, the time point k−1
The states that can transition to the state S2 in are two of S1 and S2.
Individual. As a general explanation, at time k, state S
If the state is a and the two states that can transition to the state Sa at the time point k−1 are Sp and Sq, the path metric L (Sa, k) is calculated as in the following equation.

L (Sa, k) = min ｛L (Sp, k−1) + (z [k] −c (Sp, Sa)) ² , L (Sq, k−1) + (z [k] −c (Sq, Sa)) ² ｝ (14) That is, at time k−1, the state Sp is in effect, and Sp →
The sum of the likelihoods is calculated for each of the case where the state Sa is reached by the state transition Sa and the case where the state Sq is reached at the time k-1 and the state Sq is reached by the state transition Sq → Sa. Then, the respective calculated values are compared, and the smaller value is set as the path metric L (Sa, k) for the state Sa at the time point k.

The calculation of such a path metric is shown in FIG.
Is specifically applied to the above-described quaternary and four states by using, the respective states S0, S1, S2 and S3 at time k
Path metrics L (0, k), L (1,
k), L (2, k) and L (3, k) are at time k−1
Path metric L for each state S0 to S3 in
It can be calculated as follows using (0, k-1) to L (3, k-1).

L (0, k) = min {L (0, k−1) + (z [k] + A + B) ² , L (3, k−1) + (z [k] + A) ² } (15 ) L (1, k) = L (0, k−1) + (z [k] + A) ² (16) L (2, k) = min ｛L (2, k−1) + (z [k ] -AB) ² L (1, k-1) + (z [k] -A) ² 17 (17) L (3, k) = L (2, k-1) + (z [k] −A) ² (18) As described above, the path metric values calculated in this way are compared, and the maximum likelihood state transition may be selected. By the way, in order to select the maximum likelihood state transition, it suffices if the value of the path metric can be compared without calculating the value of the path metric itself. Therefore, in the actual four-value four-state Viterbi decoding method, by using a normalized path metric as defined below instead of the path metric, calculation based on z [k] at each time point k can be easily performed. It is made to do.

M (i, k) = [L (i, k) −z [k] ² − (A + B) ² ] / 2 / (A + B) (19) Equation (19) is applied to each of S0 to S3. When applied, the specific normalized path metric does not include the square calculation as follows. For this reason, addition, comparison,
Calculation in the selection circuit (ACS) 21 can be facilitated.

M (0, k) = min {m (0, k−1) + z [k], m (3, k−1) + α × z [k] −β} (20) m (1, k ) = M (0, k−1) + α × z [k] −β (21) m (2, k) = min ｛m (2, k−1) −z [k], m (1, k−) 1) −α × z [k] −β} (22) m (3, k) = m (2, k−1) + α × z [k] −β (23) However, Expressions (20) to (23) Α and β in the parentheses are as follows.

Α = A / (A + B) (24) β = B × (B + 2 × A) / 2 / (A + B) (25) State transition in the 4-value 4-state Viterbi decoding method based on such a normalized path metric FIG. 10 shows the condition (1). Since there are two expressions for selecting one from two of the four normalized path metrics, there are 2 × 2 = 4 conditions.

[Overview of 4-Valued 4-State Viterbi Decoder] A Viterbi decoder 1 that realizes the 4-valued 4-state Viterbi decoding method described above.
3 will be described below. FIG. 11 shows a Viterbi decoder 13.
1 shows the entire configuration. The Viterbi decoder 13 includes a branch metric calculation circuit (hereinafter, referred to as BMC) 20, an addition, comparison, and selection circuit (hereinafter, referred to as ACS) 2
1, a compression and latch circuit 22 and a path memory unit (hereinafter referred to as PMU) 23. The read clock DCK described above is applied to each of these components.
The operation timing of the entire Viterbi decoder 13 is adjusted by supplying (hereinafter, simply referred to as a clock) in the following description. Hereinafter, each component will be described.

The BMC 20 receives the reproduced signal z
Based on [k], branch metric values BM0, BM1, BM2 and B corresponding to the normalized path metric
Calculate M3. BM0 to BM3 are calculated by the above equation (20).
The following are required to calculate the normalized path metric of (23).

BM0 = z (k) (26) BM1 = α × z [k] −β (27) BM2 = −z (k) (28) BM3 = −α × z [k] −β (29) Α and β required for the calculation are reference values calculated by the BMC 20 according to the above equations (24) and (25). Such a calculation is detected by a method such as envelope detection based on the reproduced signal z [k], for example.
Based on the values of the discrimination points -AB, -A, A, and A + B.

The values of BM0 to BM3 are supplied to the ACS 21. On the other hand, the ACS 21 is supplied with the values of the normalized path metric one clock before (however, those subjected to compression as described later) M0, M1, M2, and M3 from the compression and latch circuit 22 described later. . Then, M0 to M3 and BM0 to BM3 are added, and the latest standardized path metric value L is added as described later.
Calculate 0, L1, L2 and L3. Since M0 to M3 are compressed, it is possible to avoid overflow when calculating L0 to L3.

Further, the ACS 21 selects the maximum likelihood state transition based on the latest standardized path metric values L0 to L3, as described later, and stores it in the path memory 23 in accordance with the selection result. The supplied selection signals SEL0 and SEL2 are set to “High” or “Low”.

The ACS 21 supplies L0 to L3 to the compression and latch circuit 22. The compression and latch circuit 22 latches the supplied L0 to L3 after compressing them. Thereafter, the normalized path metric M0 one clock before
To the ACS 21 as .about.M3.

As a compression method at this time, for example, as shown below, the latest standardized path metrics L0 to L3
Therefore, a method of uniformly subtracting one of them, for example, L0, is used.

M0 = L0-L0 (30) M1 = L1-L0 (31) M2 = L2-L0 (32) M3 = L3-L0 (33) As a result, M0 always takes a value of 0. However, in the following description, it is denoted as M0 as it is in order to maintain the generality. The difference between the values of M0 to M3 calculated by the equations (30) to (33) is equal to the difference between the values of L0 to L3. As described above, in the selection of the maximum likelihood state transition, only the value difference between the normalized path metrics becomes a problem. Therefore, such a compression method is effective as a method of compressing the value of the normalized path metric without affecting the selection result of the maximum likelihood state transition and preventing overflow. Thus, the ACS 21 and the compression and latch circuit 22 form a loop related to the calculation of the normalized path metric.

The above-mentioned ACS 21 will be described in more detail with reference to FIG. The ACS 21 includes six adders 51, 52, 53, 54, 56, 58 and two comparators 55, 57. On the other hand, as described above, A
CS 21 is supplied with compressed standardized path metric values M0 to M3 one clock before and branch metric values BM0 to BM3 corresponding to the standardized path metric.

M0 and BM0 are supplied to the adder 51. The adder 51 adds these to calculate L00 as follows.

L00 = M0 + BM0 (34) As described above, M0 is in the state S0 at the time point k-1.
Is a compressed standardized path metric corresponding to the sum of the state transitions that have passed. Also, BM
0 is a value calculated according to the above-described equation (26) based on the reproduced signal z [k] input at the time point k, that is, the value of z [k] itself. Therefore, equation (34)
Is obtained by calculating the value of m (0, k-1) + z [k] in the above equation (20) under the effect of the above-described compression. That is, the state S0 at the time point k-1
This is a calculated value corresponding to the case where the state transition S0 finally arrives at the time point k by the state transition S0 → S0.

On the other hand, M3 and BM1 are added to the adder 52.
Is supplied. The adder 51 adds these to calculate the following L30.

L30 = M3 + BM1 (35) As described above, M3 is in the state S3 at the time point k-1.
, Is a compressed standardized path metric corresponding to the sum of the state transitions that have passed. Also, B
M1 is calculated based on the reproduced signal z [k] input at the time point k in accordance with the above equation (27), that is, α × z [k] −β. Therefore, the value of equation (35) is calculated by the above equation (2) under the action of compression as described above.
0) in m (3, k-1) + α × z [k] −β. That is, this is a calculated value corresponding to the case where the state is S3 at the time point k−1 and finally reaches the state transition S0 by the state transition S3 → S0 at the time point k.

The above-mentioned L00 and L30 correspond to the comparator 55
Supplied to The comparator 55 compares the values of L00 and L30, and determines the smaller one as the latest standardized path metric L0.
Then, the polarity of the selection signal SEL0 is switched according to the selection result as described above. Such a configuration corresponds to the fact that the minimum value is selected in equation (20). That is, when L00 <L30 (in this case, S0 → S0 is selected), L00 is output as L0, and SEL0 is set to, for example, 'Low'. If L30 <L00 (in this case, S3 → S0 is selected), L30 is output as L0, and S30 is output.
EL0 is set to, for example, 'High'. SEL0 is supplied to the A-type path memory 24 corresponding to the state S0, as described later.

As described above, the adders 51 and 52 and the comparator 55 are the most likely state transitions at the time point k from S0 → S0 and S3 → S0 in accordance with the above equation (20). Is performed. Then, it outputs the latest standardized path metric L0 and the selection signal SEL0 according to the selection result.

The adder 56 has M0 and BM1.
Is supplied. The adder 51 adds these to calculate the following L1.

L1 = M0 + BM1 (36) As described above, M0 is in the state S0 at the time point k-1.
Is a compressed standardized path metric corresponding to the sum of the state transitions that have passed. Also, BM
1 is a value calculated according to the above equation (27) based on the reproduced signal z [k] input at the time point k, that is, α × z [k] −β. Therefore, the value of equation (36) is calculated by the above equation (2) under the action of compression as described above.
The value of the right side m (0, k-1) + α × z [k] −β of 1) is calculated. That is, the calculated value corresponds to the case where the state S0 is at the time point k−1 and the state transition S1 is finally reached by the state transition S0 → S1 at the time point k. In response to the expression (21) not selecting a value, the output of the adder 56 is used as it is as the latest standardized path metric L1.

The adder 53 is supplied with M2 and BM2. The adder 53 adds these to calculate the following L22.

L22 = M2 + BM2 (37) As described above, M2 is in the state S2 at the time point k-1.
Is a compressed standardized path metric corresponding to the sum of the state transitions that have passed. Also, BM
0 is a value calculated according to the above equation (28) based on the reproduced signal z [k] inputted at the time point k, that is, -z [k]. Therefore, the value of Expression (37) is a value obtained by calculating the value of m (2, k-1) -z [k] in Expression (22) under the effect of the compression described above. . That is, the calculated value corresponds to the case where the state S2 is at the time point k−1 and the state transition S2 is finally reached by the state transition S2 → S2 at the time point k.

On the other hand, the adder 54 has M1 and BM3
Is supplied. The adder 53 adds these values to calculate L12 as described below.

L12 = M1 + BM3 (38) As described above, M1 is in the state S1 at the time point k-1.
Is a compressed standardized path metric corresponding to the sum of the state transitions that have passed. Also, BM
Numeral 3 is a value calculated according to the above equation (29) based on the reproduced signal z [k] input at the time point k, that is, -α × z [k] -β. Therefore, equation (38)
Is a value obtained by calculating the value of m (1, k−1) −α × z [k] −β in the above equation (22) under the effect of the above-described compression. That is, the calculated value corresponds to the case where the state S1 is at the time point k−1 and the state transition S2 is finally reached by the state transition S1 → S2 at the time point k.

The above-mentioned L22 and L12 are connected to the comparator 57.
Supplied to The comparator 57 compares the values of L22 and L12, and determines the smaller one as the latest standardized path metric L2.
At the same time, the polarity of the selection signal SEL2 is switched according to the selection result as described above. Such a configuration corresponds to the fact that the minimum value is selected in equation (22). That is, when L22 <L12 (in this case, S2 → S2 is selected), L22 is output as L2, and SEL2 is set to, for example, 'Low'. When L12 <L22 (in this case, S1 → S2 is selected), L12 is output as L2, and S12 is output.
EL2 is set to, for example, 'High'. SEL2 is supplied to the A-type path memory 26 corresponding to the state S2 as described later.

As described above, the adders 53 and 54 and the comparator 57 correspond to the above-mentioned equation (22) to determine the maximum likelihood state transition at the time point k from S1 → S2 and S2 → S2. Select Then, it outputs the latest standardized path metric L2 and the selection signal SEL2 according to the selection result.

The adder 58 includes M2 and BM3
Is supplied. The adder 58 adds these to calculate the following L3.

L3 = M2 + BM3 (39) As described above, M2 is in the state S2 at the time point k-1.
Is a compressed standardized path metric corresponding to the sum of the state transitions that have passed. Also, BM
Numeral 3 is a value calculated according to the above equation (29) based on the reproduced signal z [k] input at the time point k, that is, -α × z [k] -β. Therefore, the value of equation (39) is calculated by the above equation (2) under the action of compression as described above.
The value of the right side m (2, k-1) + α × z [k] −β of 3) is calculated. That is, the calculated value corresponds to the case where the state S0 is at the time point k−1 and the state transition S3 is finally reached by the state transition S2 → S3 at the time point k. In response to the expression (23) not selecting a value, the output of the adder 58 is used as it is as the latest standardized path metric L3.

As described above, the path memory unit (hereinafter referred to as PMU) 23 operates in accordance with SEL0 and SEL2 output from the ACS 21, thereby decoding the recording data a [k] as the maximum likelihood decoding sequence. Data a '[k] is generated. PMU23
In order to cope with the state transition between the four states shown in FIG. 8, it is composed of two A-type path memories and two B-type path memories.

The A-type path memory has two transitions (ie, a transition from itself and a transition from another state) as transitions to the state, and uses the state as a starting point. The configuration is such that it corresponds to a state having two transitions (ie, a transition leading to itself and a transition leading to another single state). Therefore, the A-type path memory corresponds to S0 and S2 among the four states shown in FIG.

On the other hand, the B-type path memory is configured to cope with a state in which there is only one transition to the state and only one transition starting from the state. Therefore, the B-type path memory corresponds to S1 and S3 among the four states shown in FIG.

In order for these two A-type path memories and two B-type path memories to perform operations in accordance with the state transition diagram shown in FIG. 8, the PMU 23 transfers the decoded data as shown in FIG. It is configured to be. That is, the A-type path memory 24 corresponds to S0, and the A-type path memory 26 corresponds to S2. Also, the B-type path memory 25
Corresponds to S1, and the B-type path memory 27 corresponds to S3. With this configuration, state transitions that can occur starting from S0 are S0 → S0 and S0 → S1, and
S2 → S2 and S2
This corresponds to 2 → S3. In addition, the state transition that can occur with S1 as the starting point is only S1 → S2, and the state transition that can occur with S3 as the starting point is only S3 → S0.

FIG. 13 shows a detailed configuration of the A-type path memory 24. The A-type path memory 24 includes a number of flip-flops and selectors corresponding to the path memory length,
They are connected alternately. FIG. 13 shows a configuration corresponding to a decoded data length of 14 bits. That is,
Those having fourteen selectors 31 ₁ to 31 ₁₄ and 15 flip-flops 30 ₀ - 30 _14. Each of the selectors 31 _{1 to} 31 ₁₄ receives two pieces of data, and selectively supplies one of them to a subsequent stage. Further, since the clock is supplied to the flip-flop 30 ₀ - 30 _14, the operation timing of the entire A type path memory 24 is combined.

As described above with reference to FIG. 8, the transitions to the state S0 are S0 → S0, that is, transitions inherited from itself, and S3 → S0. As a configuration corresponding to such a situation, each selector includes data supplied from the preceding flip-flop, that is, decoded data corresponding to S0 → S0, and B-type path memory 27 corresponding to state S3.
, Ie, decoded data PM3 corresponding to S3 → S0. Further, each selector has A
SEL0 is supplied from CS21. And SEL0
, One of the two supplied decoded data is supplied to the subsequent flip-flop. Further, the decoded data supplied to the subsequent flip-flop in this manner is also stored in the B-type path memory 25 corresponding to the state S1 in the PM.
Supplied as 0.

[0108] That is, for example, the selector 31 _14, the data supplied from the preceding flip-flops 30 _13, B
14-bit P supplied from the pattern path memory 27
And the data in the 14th bit position of M3. Then, the data selected as follows from these two data, and supplies the subsequent flip-flop 30 _14. As described above, SEL0 sets 'L' in accordance with the selection result.
ow 'or' High '. SEL0 When, for example, 'Low' is adapted to data from the preceding flip-flop 30 ₁₃ is selected. If SEL0 is, for example, 'Hig
At the time of h ', the data at the 14th bit position of PM3 is selected. The selected data is supplied to the subsequent flip-flops 30 _14, also 1 PM0
The data at the fourth bit position is supplied to the B-type path memory 25 corresponding to the state S1.

Another selector 31 in the A-type path memory 24
Also in _{1-31 13,} depending on the polarity of the SEL0, similar operations are performed. Therefore, when SEL0 is, for example, "Low", the A-type path memory 24 as a whole performs a serial shift in the A-type path memory 24 in which each flip-flop inherits the data of the flip-flop located at the preceding stage. . Further, when SEL0 is, for example, “High”, a parallel load that inherits the 14-bit decoded data PM3 supplied from the B-type path memory 27 is performed. In any case, the inherited decoded data is stored in the B-type path memory 2.
5 is supplied as 14-bit decoded data PM0.

[0110] In addition, the flip-flop 30 ₀ on the first stage, always in synchronization with the clock '0' is input. This operation is a state transition S0 → S0 and S0 leading to S0.
In any of 2 → S0, as shown in FIG. 8, the decoded data is “0”, so that the latest decoded data always corresponds to “0”.

As described above, the configuration itself of the A-type path memory 26 corresponding to S2 is the same as that of the A-type path memory 2.
4 is exactly the same. However, the selection signal input from the ACS 21 is SEL2. Further, as shown in FIG. 8, transitions to the state S2 include S2 → S2, that is, transitions inherited from the self, and S1 → S2. Therefore, the PM1 is stored in the B-type path memory 25 corresponding to the state S1.
Supplied. Further, in response to the state that can occur starting from the state S2 being S2, ie, itself, and S3, the PM2 is stored in the B-type path memory 27 corresponding to the state S3.
Supply.

The A-type path memory 26 corresponding to S2
In this case, '0' is always input to the flip-flop serving as the first processing stage in synchronization with the clock. This operation is performed when the decoded data is “0” as shown in FIG. 8 in any of the state transitions S2 → S2 and S1 → S0 leading to S2.
Therefore, the latest decoded data corresponds to always being '0'.

On the other hand, the detailed configuration of the B-type path memory 25 is shown in FIG. The B-type path memory 25 has a number of flip-flops connected to the path memory length. FIG. 14 shows a configuration corresponding to a decoded data length of 14 bits. That is, it has 15 flip-flops 32 _{0 to} 32 ₁₄ . By supplying a clock to the flip-flops 32 _{0 to} 32 ₁₄ , the operation timing of the entire B-type path memory 25 is adjusted.

Each of the flip-flops 32 _{1 to} 32 ₁₄ has
14-bit decoded data is supplied as PM0 from the A-type path memory 24 corresponding to the state S0. For example, the first bit of PM0 is supplied to the flip-flop 32 ₁ . Each of the flip-flops 32 _{1 to} 32 ₁₄ holds the supplied value for one clock. Then, it outputs it to the A-type path memory 26 corresponding to the state S2 as 14-bit decoded data PM1. For example, flip-flop 3
2 ₁ outputs the second bit of PM1.

Another selector 32 in the B-type path memory 25
Also in _{1-32 13,} similar operation is performed. Therefore, the entire B-type path memory 25 receives the 14-bit decoded data PM supplied from the A-type path memory 24.
0, and supplies 14-bit decoded data PM1 to the A-type path memory 26.

[0116] In addition, the flip-flop 32 _0, always in synchronization with the clock '1' is input. Such actions are:
As shown in FIG. 8, when the latest state transition is S0 → S1, this corresponds to that the decoded data is “1”.

As described above, the configuration of the B-type path memory 27 corresponding to the state S3 is completely the same as that of the B-type path memory 25. However, as shown in FIG. 8, since the transition to the state S3 is from S2 to S3, PM2 is supplied from the A-type path memory 26 corresponding to the state S2. Further, in response to the state that can occur starting from the state S3 being S0, the A-type path memory 24 corresponding to the state S0
To supply PM3. B type path memory 2
Also in 7, the flip-flop as the first processing stage is always supplied with "1" in synchronization with the clock. As shown in FIG. 8, the latest state transition is S2 →
The case of S3 corresponds to the fact that the decoded data is '1'.

As described above, each of the four path memories in the PMU 23 generates decoded data. The four pieces of decoded data generated in this way match each other if an accurate Viterbi decoding operation is always performed. By the way, in the actual Viterbi decoding operation, 4
A mismatch may occur in the pieces of decoded data. Such inconsistency is caused by an inaccurate Viterbi decoding operation due to factors such as an error in detecting the above-described identification points A and B due to the influence of noise included in the reproduced signal. .

In general, the probability of occurrence of such a mismatch can be reduced by setting the number of processing stages of the path memory to be sufficiently large in accordance with the quality of the reproduced signal. That is, when the quality of the reproduction signal such as C / N is good, the probability of occurrence of mismatch between decoded data is small even if the number of processing stages of the path memory is relatively small. On the contrary,
When the quality of the reproduced signal is not good, it is necessary to increase the number of processing stages of the path memory in order to reduce the probability of occurrence of the above-described mismatch. In the case where the number of processing stages of the path memory is relatively small with respect to the quality of the reproduced signal and the probability of occurrence of mismatch between decoded data cannot be sufficiently reduced, a method such as a majority decision is used from the four decoded data Thus, a configuration (not shown) for selecting a more accurate one is provided at the subsequent stage of the four path memories in the PMU 23.

[Viterbi decoding method other than 4-value 4-state Viterbi decoding method] In the 4-value 4-state Viterbi decoding method described above, the waveform equalization characteristic used in the filter unit 11 is PR.
(1, 2, 1) and RLL is used as recording data.
Used when the (1,7) code is adopted. For example, a recording linear density of 0.40 μm, a laser wavelength of 685 nm,
When NA = 0.55, the waveform equalization characteristic is set to PR (1,
2, 1), it is optimal to use a 4-value 4-state Viterbi decoding method. On the other hand, other types of Viterbi decoding methods may be used depending on the waveform equalization characteristics or the encoding method for generating the recording data.

For example, when the waveform equalization characteristic is PR (1, 1) and an RLL (1, 7) code is used as recording data, a ternary 4-state Viterbi decoding method is used. Further, the waveform equalization characteristic is PR (1, 3, 3, 1)
In the case where the RLL (1, 7) code is used as the recording data, a 7-value 6-state Viterbi decoding method is used. Among such Viterbi decoding methods, a waveform equalization characteristic that is one of the elements for selecting which method to use is preferably one that has a high degree of compatibility with intersymbol interference on a reproduced signal. Therefore, as described above, it is optimized in consideration of the linear recording density and the MTF.

Further, the deviation of the waveform equalization characteristic from the theoretical value,
Also, the value of the discrimination point may be different from the theory due to amplitude fluctuation of the reproduction signal, asymmetric distortion, and the like. In consideration of such a case, the Viterbi decoding method may be modified and used. For example, in the 4-value 4-state Viterbi decoding method, considering that it is difficult to accurately set the waveform equalization characteristics to PR (1, 2, 1), assuming six identification points as described later. The 6-value 4-state Viterbi decoding method described above may be used.

The present invention can be applied to an example of the above-described magneto-optical disk device. That is, the present invention calculates the error between the amplitude reference value corresponding to the state transition selected by the operation of the Viterbi decoder and the reproduction signal value from the A / D converter 12, and calculates this error for a predetermined period, for example, 1
A quality index generation circuit for integrating the periods of the sectors and evaluating the quality of the reproduction signal system based on the integrated value is provided. Here, the amplitude reference value is a value obtained theoretically or a value obtained by calibration.

In order to recognize the amplitude reference value based on the state transition selected by the operation of the Viterbi decoder, the state transition itself is expressed instead of the decoded data as a series of decoded data values corresponding to the state transition. Data is needed. Therefore, in the Viterbi decoder according to an embodiment of the present invention described below, the state data value representing the state itself is used instead of the decoded data value, and the state representing the selected state transition itself is used. It is adapted to generate data. For this reason, instead of the path memory unit PMU in the above-described example of the magneto-optical disk device, a status memory unit (hereinafter referred to as SM) that generates a series of state data values as described later is used.
U) is used.

For example, when there are four states such as a four-level four-state Viterbi decoding method, these four states can be expressed by two bits. Therefore, such two-bit data is used as a state data value. Can be. Thus, S0, S1, S2, and S3 in FIG. 8 can be expressed using 2-bit state data values, 00, 01, 11, and 10, respectively. Therefore, in the following description, S in FIG.
0, S1, S2, and S3 are S00, S01, and S1, respectively.
1, and S10.

Further, in the following description, the waveform equalization characteristic is obtained by replacing P (B, 2A, B) with P
It is assumed that R (α, β, γ). Such a premise is taken into consideration that in an actual magneto-optical disk device or the like, it is difficult to obtain an ideal partial response characteristic, and the waveform equalization characteristic is often asymmetric.

The reasons why it is difficult to obtain the ideal partial response characteristics include the limitation of the operation accuracy of the waveform equalizer and the asymmetry (waveform asymmetry) due to the excessive or excessive laser power at the time of recording. And a phase error of a read clock used when the A / D converter performs sampling from the reproduced signal.

Assuming the same as in the case of the above-described four-value four-state Viterbi decoding method, RLL (1,7) coding or the like is performed so that RLmin = 2, and partial response characteristics during reproduction are performed. Is PR (α, β, γ), it can be seen that there are six values and four states. That is,
2 ³ -2 = 6 ｛b [j−1], b [j], b other than the two states excluded by the condition that RLmin = 2
For each set of [j + 1]}, the value of the discrimination point, that is, the reproduced signal value c [j + 1] after waveform equalization in an ideal case without noise takes a different value.

The values of the six discrimination points are denoted by cpqr. Here, p, q, and r are b [j−
1], b [j] and b [j + 1]. Therefore, the branch metric as defined is as follows. Here, since RLmin = 2, it should be noted that c010 and c101 do not exist. FIG. 15 shows the relationship between the value of each identification point and the state transition. The following description is made on the premise of 6 values and 4 states according to the state transition diagram of FIG.

The branch metrics calculated corresponding to the six state transitions in FIG. 15 are described as follows. First, a 2-bit state data value representing the state before the transition and the state after the transition are written and arranged to form a sequence of four numbers. Next, a branch metric that can occur during one read clock is expressed as a sequence of three numbers by making the two numbers (ie, the second and third numbers) closer to the center into one number. . For example, state transition S11 →
The branch metric associated with S10 is denoted by bm110. In this way, the branch metrics corresponding to the six types of state transition in FIG. 15 can be represented as shown in FIG.

Further, the branch metric defined as the Euclidean distance between the actual reproduced signal value z [k] sampled by the A / D converter operating according to the read clock and the value of each discrimination point is calculated as follows. Is done.

Bm000 = (z [k] −c000) ² (40) bm001 = (z [k] −c001) ² (41) bm011 = (z [k] −c011) ² (42) bm111 = (z [ k] −c111) ² (43) bm110 = (z [k] −c110) ² (44) bm100 = (z [k] −c100) ² (45) When the branch metric is calculated in this way, The value of the identification point is used as it is as the amplitude reference value. When the normalized path metric is used for the purpose of avoiding the square calculation, etc., the branch metric corresponding to the normalized path metric is different from those according to the equations (40) to (45). In such a case, the value of each identification point cannot be used as it is as the amplitude reference value, but the present invention can be applied.

Using the value of such a branch metric, the path metric mij of the state Sij at the time point k is obtained.
[K] is calculated as follows. These equations correspond to the above-mentioned (15) to (1) in the 4-value 4-state Viterbi decoding method.
8).

M10 [k] = m11 [k-1] + bm110 (46) m11 [k] = min {m11 [k-1] + bm111, m01 [k-1] + bm011} (47) m01 [k] = m00 [K-1] + bm001 (48) m00 [k] = min {m00 [k-1] + bm000, m10 [k-1] + bm100} (49) Referring to FIG. 17, an embodiment of the present invention will be described. The overall configuration will be described. In one embodiment of the present invention, the present invention is applied to a magneto-optical disk drive.
The same components as those in the example of the magneto-optical disk device described above with reference to FIG. The servo system and the like (not shown) are the same as those of the above-described magneto-optical disk device. Note that WDATA is recording data, WGATE is a recording control signal that is active during a recording operation, and RGAT is a reproduction control signal that is active during a reproducing operation. These data and control signals are transmitted from the controller 2 to the LPC 4
Supplied to

The recording system is the same as in the above-described example of the magneto-optical disk device. However, a signal for controlling the laser power supplied from the device control unit (hereinafter, referred to as a CPU) 103 to the LPC 4 is illustrated. CPU10
Reference numeral 3 has a function of controlling operation parameters and the like of components in a recording system and a reproducing system.

The reproduction system will be described. The configuration and operation from the optical pickup 7 to the A / D converter 12 are the same as those of the above-described magneto-optical disk device. However, A /
The output of the D converter 12 is supplied to a Viterbi decoder 130 and also to a data memory unit (hereinafter referred to as DMU) 101. Read clock D
The PLL 14 that generates CK is the same as the above-described example of the magneto-optical disk device.

The Viterbi decoder 130 is provided for the A / D converter 12
Based on the reproduction signal value z [k] supplied from, the most likely state transition is selected as described later, and state data expressing the selected state transition itself is generated. Then, an amplitude reference value (for example, a theoretical value) determined based on the state transition indicated by the state data is used as the quality index generator 102.
Supplied to In addition, based on the state data, decoded data is generated as described later,
To supply.

On the other hand, the DMU 101 is a unit for storing the sequentially supplied reproduction signal value z [k] for a predetermined time. From the Viterbi decoder 130 to the DMU 101,
The status for the selected status is reported and DMU 101
Are supplied to the quality index generator 102 in synchronization with the output of the amplitude reference value from the Viterbi decoder 130. The quality index generator 102 calculates a difference between the amplitude reference value and the reproduced signal value, integrates the difference by a predetermined number, and generates an index indicating superiority or inferior signal quality.

The integrated value generated by the quality index generator 102,
That is, the CPU 103 reads the quality index data.
The CPU 103 calculates an optimum laser power based on the quality index data, and a laser power control signal is supplied from the CPU 103 to the LPC 4. In addition to the laser power, factors that affect the quality of the reproduced signal, for example, the gains of the amplifiers 8 and 9 and the characteristics of the filter unit 11 may be controlled.

The Viterbi decoder 130 will be described in more detail with reference to FIG. The Viterbi decoder 130 has a BM
C132, ACS133, SMU134 and merge block 135. Then, a read clock DCK (hereinafter, referred to as a clock) is supplied from the PLL 14 to each of these components, and the operation timing is adjusted.

The BMC 132 calculates the values of the branch metrics bm000 to bm111 based on the reproduced signal value z [k] and according to the equations (40) to (45) under the above-mentioned six amplitude reference values c000 to c111. , And supplies the calculated branch metric value to the ACS 133.

The ACS 133 calculates the value of the path metric according to the above-described equations (46) to (49) based on the value of the supplied branch metric, and selects the most likely state transition by comparing the calculated values. I do. Then, the selection signals SEL00 and SEL11 are supplied to the SMU 134.

Next, the SMU 134 will be described. The PMU 23 in the above-described example of the magneto-optical disk device performs processing in units of 1-bit decoded data values, whereas the SMU 134 performs processing in units of 2-bit state data values. is there. By this processing, state data is generated as a series of state data values sm [k + n].

[0144] As shown in FIG.
A type status memories 150 and 151 and two B type status memories 152 and 153 are provided. Further, select signals SEL00 and SEL1
1, connected to signal lines for transferring clocks and status data to and from other status memories. A-type status memories 150 and 151 correspond to states S00 and S11, respectively. The B-type status memories 152 and 153 store the statuses S01 and S1, respectively.
Corresponds to 10. The connection between these four status memories is in accordance with the state transition diagram of FIG.

Further, the A-type status memory 150 corresponding to the state S00 will be described in more detail with reference to FIG. The A-type status memory 150 has n processing stages. That is, n selectors 201 _0.
201 _n-1 and n registers 202 ₀ ... 202
_n-1 are connected alternately. Each selector 201 _{0 0}
The select signal SEL00 is supplied to 201 _n-1 . Further, as described above, each selector has S10
Is supplied as SMin consisting of n bits, inherited from the B-type status memory 153 corresponding to. As described above, the status data inherited by the B-type status memory 152 corresponding to S01 is output to each register as SMout including n-1 status data values. In addition, each of the registers 202 _{0 to} 202 _0
A clock is supplied to _n-1 .

The operation of each selector will be described. FIG.
As shown in FIG. 5, the state one clock before, which can transition to S00, is one of S00 and S10. When the state one clock before is S00, a transition that inherits itself is performed. Therefore, the first-stage selector 201
_{To "0"} , "00" is input as the latest state data value in the state data generated by the serial shift. In addition, the selector 201 ₀ has B as a parallel load.
The latest state data value SMin [1] in the state data supplied from the type status memory 153 is supplied. The selector 201 ₀ supplies one of these two state data values to the register 202 ₀ at the subsequent stage according to the above-mentioned selection signal SEL00.

Further, each of the selectors 201 ₁ to 201 ₁ to
201 _n-1 receives one state data value supplied from the B-type status memory 153 corresponding to S10 as a parallel load, and one state data value supplied from the preceding register as a serial shift. Then, the selection signal SEL00 is selected from these two state data values.
, The state data value determined to be the maximum likelihood is supplied to the subsequent register. Selectors 201 _{0 to} 201 _n-1
All follow the same selection signal SEL00.
The state data as the series of the maximum likelihood state data values selected by 33 is inherited.

Further, each of the registers 202 _{0 to} 202 _n-1
Updates the held state data value by capturing the supplied state data value according to the clock as described above. Further, as described above, the output of each register is supplied to the status memory corresponding to a state to which a transition can be made after one clock. That is, since the transition can be made to S00 itself, it is supplied to the subsequent selector as a serial shift. The data is supplied as a parallel load to the B-type status memory 152 corresponding to S01. The state data value VM00 is output from the register 202 _{n-1 at the} last stage. By outputting state data value VM00 according to the clock, state data is generated as a whole.

The A-type status memory 151 corresponding to the state S11 has the same configuration as the A-type status memory 150. However, state data is supplied from the B-type status memory 152 corresponding to S01 as a parallel load corresponding to the state transition S01 → S11 in FIG. Further, the state data is supplied to the B-type status memory 153 corresponding to S10 as a parallel load corresponding to the state transition S11 → S10 in FIG.

Referring to FIG. 21, B-type status memory 152 corresponding to state S01 will be described in more detail. The B-type status memory corresponds to a state in which it does not inherit itself in FIG. 15 and only one state can transition after one clock. For this reason,
No serial shift is performed, and no selector is provided. Therefore, the n registers 212 ₀ , 212 ₁ ,
.. 212 _n-1 are provided, and a clock is supplied to each register to adjust the operation timing.

Each of the registers 212 ₀ , 212 ₁ ,..., 2
To 12 _n−1 , state data inherited from the A-type status memory 150 corresponding to S00 is supplied as SMin including n−1 state data values. However, the register 212 ₀ on the first processing stage, always in synchronization with the clock '00' is inputted. In this operation, as shown in FIG. 15, the latest state transition that can transit to S01 is always S
It corresponds to 00. Each register 212 _0-
212 _n-1 updates the held state data value by capturing the supplied state data value according to the clock. The output of each register made according to the clock is a state S1 that can transition after one clock as state data SMout composed of n-1 state data values.
1 is supplied to the A-type status memory 151 corresponding to “1”. From the final stage register 212 _n−1 , the state data value V
M01 is output. By outputting the state data value VM01 in accordance with the clock, the state data is generated as a whole.

The B-type status memory 153 corresponding to the state S10 has the same configuration as the B-type status memory 152. However, state data is supplied from the A-type status memory 151 corresponding to S11 as a parallel load corresponding to the state transition S11 → S10 in FIG. Further, the state data is supplied to the A-type status memory 150 corresponding to S00 as a parallel load corresponding to the state transition S10 → S00 in FIG. In addition, the register that is the first processing stage always contains '11' in synchronization with the clock.
Is entered. This operation is performed as shown in FIG.
This corresponds to that the state one clock before, which can transition to 10, is S11.

By the way, in the Viterbi decoding method, the state data values VM00, V00 generated by each status memory are used.
M11, VM01 and VM10 match each other if the memory length n of the status memory is made sufficiently large. In such a case, any of the state data values generated by the four status memories may be output to the subsequent stage as sm [k + n]. The memory length n is determined in consideration of the C / N of the reproduced signal, frequency characteristics, and the like.

Next, the merge block 135 will be described. The merge block 135 is implemented by means such as a ROM in FIG.
2 is stored. Then, by referring to the decoding matrix, decoded data based on the state data is generated and supplied to the controller 2. From the state transition diagram of FIG. 15, it can be seen that the decoded data values correspond to two consecutive state data values. That is, the state data value sm [k + n] generated corresponding to the reproduction signal value z [k] and the state data value generated corresponding to the reproduction signal value z [k-1] one clock before the same. Based on sm [k + n-1], the decoded data value at time point k + n can be determined.

For example, if sm [k + n] is '01' and sm
When [k + n-1] is '00', it can be seen from FIG. 15 that '1' corresponds to the decoded data value. Such a correspondence is summarized in the decoding matrix table of FIG.

FIG. 23 shows an example of the merge block 135. The state selection circuit indicated by 250 in FIG. 23 refers to a 2-bit signal MS supplied from the ACS 133 for each clock, and refers to VM00, VM11, VM01, and VM1.
The most appropriate one is selected from 0, and the selected state data value is output as VM. The signal MS is a 2-bit signal indicating which of S00, S11, S01, and S10 the path metric value is minimized at each time. The signal MS is generated by, for example, the ACS 135 or the like. In this way, the probability that the most correct state data value is selected can be increased.

The VM selected as described above is supplied to the register 251 and the decoding matrix section 252. The register 251 supplies the supplied VM to the decoding matrix unit 252 with a delay of one clock. In the following description, the output of the register 251 is described as VMD. Accordingly, the state data value VM and the state data value VMD one clock before that are supplied to the decoding matrix unit 252. The decoding matrix unit 252 stores the decoding matrix table shown in FIG. 22 in a unit such as a ROM, and refers to the decoding matrix table,
And outputting a decoded data value based on the VMD and the VM.

On the other hand, the mismatch detecting circuit 253 can be constituted by using, for example, an exclusive OR circuit. VM00, VM11, VM01, and VM10 are supplied to the mismatch detection circuit 253, and a mismatch between these four state data values is detected. The detection result is a mismatch detection signal N
Output as M. The non-coincidence detection signal NM is enabled or activated unless all four state data values match. Such a mismatch detection signal can be used for evaluating the quality of the decoded data and the reproduced signal. That is, it is possible to control the decoding means for decoding the user data or the like from the decoded data based on the mismatch detection signal, or the operating conditions of the reproduction system.
The mismatch detection circuit 253 may be provided anywhere as long as it can supply four state data values.
It does not necessarily have to be provided in the merge block 135.

The configuration of the merge block 135 as described above is provided for a case where a mismatch occurs between the state data values due to poor signal quality of the reproduced signal or the like. Therefore, when the signal quality of the reproduced signal is good, the probability of occurrence of a mismatch between the state data values is sufficiently small, and when there is no need to deal with the mismatch between the state data values, the merge block 135 uses the register 251 and the decoding unit. What is necessary is just to have the matrix part 252.

The above-mentioned Viterbi decoder 130 generates state data representing the maximum likelihood state transition itself. Assuming that the state data at the timing [k + n-1] according to the clock and the state data at the timing [k + n] are:
In response to these changes in the state data, the reproduced signal value cx
xx (x: 0 or 1) is as shown in FIG.
For example, sm [k + n-1] = 01, and sm [k +
n] = 11, the state transition S01 from FIG.
→ It turns out that S11 occurs. FIG. 15 also shows that the reproduced signal value corresponding to the state transition is c011. This reproduced signal value matches the theoretical amplitude reference value used in the Viterbi decoder 130 if there is no error. Therefore, in the above description, cxxx was described as the amplitude reference value.

The reproduction signal value (cxxx) is sequentially supplied from the DMU 101 to the quality index generator 102 in FIG. On the other hand, the theoretical amplitude reference value acxxx recognized from the state transition is supplied from the Viterbi decoder 130 to the quality index generator 102. The Viterbi decoder 13 supplies the reproduced signal value and the amplitude reference value in synchronization with each other.
From 0, a state transition is reported to the DMU 101. The quality index generator 102 calculates a difference (that is, an error) between these two values, and integrates the difference.

FIG. 25 is a diagram for specifically explaining the operation of the quality index generator 102. In FIG. In FIG. 25, the playback R
An example of the F signal is shown. In addition, time t-3, t-2, t-1,
.., t, t + 1,... are sample times defined by the read clock DCK. Further, the theoretical amplitude reference value acxxx used in the Viterbi decoder 130 and supplied to the quality index generator 102 is indicated by a broken line in FIG. In the example of FIG. 25, the state is [S00 → S0
0 → S01 → S11 → S11 → S10 → S00 → S0
0].

The quality index generator 102 calculates the following differences e [t-3], e [t-2], e [t-1], e [t],
Is generated.

E [t-3] = ac000-c000, e [t-2] = ac001-
c001, e [t-1] = ac011-c011 ..., e [t + 3] =
ac000-c000 In FIG. 25, these differences are indicated by bold lines, and are indicated by reference numerals in the order of time.

The quality index generator 102 integrates a predetermined number of these differences. The predetermined number means the number of samples included in a predetermined period. For example, integration is performed for each sector. In this case, it is also possible to evaluate the signal quality only in an area where magneto-optical recording is performed other than the embossed area of one sector. The integration result indicates that the quality index generator 102
It is provided to the PU 103. Two methods are possible as a method of integration.

One of them is a method of integrating the square of the difference. That is, when the quality index is expressed as CQ, CQ = e [t−3] ² + e [t−2] ² + e [t−1] ² + e [t] ²
+ E [t + 1] ² + e [t + 2] ² + e [t + 3] ² When the number of difference data increases, the integrated value also increases cumulatively, so that the integrated value is averaged as necessary.

Another method is to integrate the absolute value of the difference. That is, when the quality index is expressed as CQ, CQ = | e [t-3] | + | e [t-2] | + | e [t-1] | + | e [t] |
+ | E [t + 1] | + | e [t + 2] | + | e [t + 3] | When the sum of absolute values is used, there is an advantage that a circuit for square calculation can be omitted. Also in this method, the integrated value may be averaged as necessary. Further, an integration method other than the sum of squares and the sum of absolute values, for example, an index CQ reflecting the polarity may be generated.

The CPU 103 takes in the generated quality index CQ and generates a control signal for the LPC 4. Since a large index CQ means that the quality of the reproduced signal is poor, the index CQ is improved by changing the laser power. As described above, in addition to controlling the laser power, the gain of the amplifier, the frequency characteristic of the filter unit, and the like may be controlled based on the index. In the above description, the difference between the theoretical amplitude reference value obtained by simulation or the like and the actual reproduction signal value determined from Viterbi decoding is obtained, but instead of the theoretical amplitude reference value, An amplitude reference value determined by calibration may be used.

Normally, in the calibration, the quality of the reproduction signal and the like vary depending on the characteristics of the recording medium such as the processing accuracy, and the recording / reproducing conditions such as the fluctuation of the power of the recording laser beam and the ambient temperature. This is for optimizing the parameters of the reproduction system to cope with the possibility. The calibration is performed in the controller 2 immediately after power-on or when the recording medium is replaced.

As an example, predetermined data is recorded with a predetermined laser power in a test area (for example, the above-described inner manufacturing zone 6f) defined on the magneto-optical disk 6. The data recorded in the test area is reproduced, and Viterbi decoding is performed by using a reproduction system parameter such as a laser power of an initial value. Then, as described above, an index of signal quality is generated. The laser power is changed to improve this index. Then, the same processing is repeated until the index becomes the best.

In the above-described embodiment of the present invention, the present invention is applied to a magneto-optical disk drive that performs a 6-value 4-state Viterbi decoding method. On the other hand, a magneto-optical disk device that performs another type of Viterbi decoding method such as the above-described four-value four-state Viterbi decoding method, three-value four-state Viterbi decoding method, and seven-value six-state Viterbi decoding method, The present invention can be applied.

The present invention can be applied to an information reproducing apparatus that can use a Viterbi decoding method to decode read data from a reproduction signal reproduced from data recorded on a recording medium. That is, in addition to the magneto-optical disk (MO), for example, the phase-change disk P
The present invention can be applied to optical disk devices such as rewritable disks such as D and CD-E (CD-Erasable), write-once disks such as CD-R, and read-only disks such as CD-ROM.

Further, the present invention is not limited to this embodiment, and various applications and modifications can be considered without departing from the gist of the present invention.

[0174]

As described above, according to the present invention, the signal quality is evaluated based on the amplitude reference value used in the Viterbi decoding method and the reproduced signal value, so that a simple and quantitative evaluation can be performed. Further, the present invention has an advantage that it is not necessary to supply test data from the outside to the disk reproducing apparatus, and the quality can be evaluated inside the reproducing apparatus (drive).

[Brief description of the drawings]

FIG. 1 is a block diagram showing an entire configuration of an example of a magneto-optical disk drive to which the present invention can be applied.

FIG. 2 is a schematic diagram for explaining a mark position recording method and a mark edge recording method.

FIG. 3 is a schematic diagram for explaining an example of a track format of a magneto-optical disk.

FIG. 4 is a schematic diagram for explaining an example of a sector format of a magneto-optical disk.

FIG. 5 is a schematic diagram showing that the minimum magnetization reversal width is 2 in the RLL (1, 7) encoding method.

FIG. 6 shows a reproduction signal reproduced from data recorded by a combination of an RLL (1, 7) code and a mark edge recording method, with a partial response characteristic PR (1, 2, 2).
FIG. 6 is a schematic diagram for explaining an eye pattern when waveform equalization is performed under 1).

FIG. 7 is a schematic diagram for explaining a process of creating a state transition diagram of the 4-value 4-state Viterbi decoding method.

FIG. 8 is a schematic diagram illustrating an example of a state transition diagram of a 4-value 4-state Viterbi decoding method.

FIG. 9 is a schematic diagram illustrating an example of a trellis diagram in the 4-level 4-state Viterbi decoding method.

FIG. 10 is a schematic diagram showing conditions of state transition based on a standardized metric in a four-value four-state Viterbi decoding method.

FIG. 11 is a block diagram illustrating an overall configuration of a Viterbi decoder that performs 4-level 4-state Viterbi decoding.

FIG. 12 is a block diagram showing a configuration of a part of the Viterbi decoder in detail.

FIG. 13 is a block diagram showing the configuration of another part of the Viterbi decoder in detail.

FIG. 14 is a block diagram showing the configuration of still another portion of the Viterbi decoder in detail.

FIG. 15 is a schematic diagram illustrating an example of a state transition diagram of a 4-level 4-state Viterbi decoding method using a notation different from that in FIG. 9;

FIG. 16 is a schematic diagram for explaining a method of describing a branch metric.

FIG. 17 is a block diagram showing an overall configuration of an embodiment of the present invention.

FIG. 18 is a block diagram illustrating an example of a Viterbi decoder according to an embodiment of the present invention.

FIG. 19 is an SMU used in an embodiment of the present invention.
It is a block diagram showing an example of composition of (status memory unit).

FIG. 20 is a block diagram for describing a partial configuration of an SMU.

FIG. 21 is a block diagram for describing another partial configuration of the SMU.

FIG. 22 is a schematic diagram illustrating an example of a table that is referred to when decoded data is generated in a merge block.

FIG. 23 is a block diagram illustrating an example of a configuration of a merge block used in an embodiment of the present invention;

FIG. 24 is a schematic diagram for explaining a relationship between state data of a Viterbi decoder and a reproduced signal value.

FIG. 25 is a schematic diagram used for describing a process of generating a quality index according to an embodiment of the present invention.

[Explanation of symbols]

2 ... controller, 12 ... A / D converter, 13
0 ... Viterbi decoder, 132 ... Branch metric calculation circuit (BMC), 133 ... Addition, comparison, selection circuit (ACS), 134 ... Status memory unit (SMU), 135 ...・ Merge block, 101 ・
..Data memory unit (DMU), 102 ... quality index generator, 103 ... device control unit (CPU)

Claims (5)

[Claims] 1. An information reproducing apparatus for decoding a reproduction signal reproduced from a recording medium by a Viterbi decoding method, comprising: a Viterbi decoding means using a method for generating state data representing a state transition itself; The difference between the amplitude reference value corresponding to the state transition recognized from the data and the reproduced signal value generated by A / D conversion of the reproduced signal is calculated, and the quality of the reproduced signal is determined based on the difference. An information reproducing apparatus, comprising: a quality index generation unit configured to generate an index representing the index. 2. The information reproducing apparatus according to claim 1, wherein the index is a value obtained by integrating a predetermined number of squares of the difference. 3. The information reproducing apparatus according to claim 1, wherein the index is a value obtained by integrating a predetermined number of absolute values of the difference. 4. The information reproducing apparatus according to claim 2, wherein the predetermined number is the number of samples in one sector. 5. An information reproducing method for decoding a reproduction signal reproduced from a recording medium by a Viterbi decoding method, comprising: a step of Viterbi decoding for generating state data representing a state transition itself; A difference between an amplitude reference value corresponding to the obtained state transition and a reproduction signal value generated by A / D conversion of the reproduction signal is calculated, and an index indicating the quality of the reproduction signal based on the difference is calculated. Generating an information reproduction method.