| 摘要 |
PROBLEM TO BE SOLVED: To decrease a sequence detector pad pattern length in partial response maximum lekelihood recording and reproducing channels by selecting the most probable path to a state bringing about the most probable estimation of the final user data bit of a user data field pattern. SOLUTION: The path distances are determined at four states and four trelis depths, i.e., levels, between the established states at five bit clock intervals k to k-4 from the oldest to the latest and are traced back from the respective states. The path distance to determine the finest state and the finest path is the total sum of the average squares of the errors on the prescribed path. A Viterbi detector updates the four state distances during respective clock cycles and selects one among these as a raw remaining path. This path indicates the path of the smallest path distance attaining the prescribed state and the state distance indicates the distance associated with this path. The respective path distances are the distances obtained by adding the state distances to branch distances.
|
