Multi-Level MTR Code for Magnetic Recording Channel

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Error correction in data transfer systems, particularly in magnetic hard disk drives, is hindered by noise and distortion factors, leading to performance degradation and reduced throughput due to the limitations of existing maximum transition run modulation codes.

Innovation Solution

A system is developed using a multi-level run-length limited finite state machine to model a magnetic recording channel as a partial response channel, optimizing the Markov source to construct a maximum transition run modulation code with a limited transition run length and multi-level periodic structure, thereby improving error correction capabilities.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If existing maximum transition run modulation codes are used, then the system can operate with simpler error correction, but the channel mutual information rate is limited and error correction performance degrades due to noise and distortion

Engineering Contradiction:
Improveerror correction performanceVSAvoidmodulation code structure
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The finite state machine is segmented into multiple levels, where each level handles specific transition run constraints. This multi-level structure divides the complex error correction task into manageable segments, improving reliability without overwhelming complexity

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transitions from traditional single-level MTR codes to multi-level MTR codes, adding a dimensional aspect to the code structure. This dimensional enhancement allows the system to achieve higher mutual information rates and better error correction performance

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Reliability

If the transition run length is limited to improve error correction, then the code rate decreases and throughput is reduced

Engineering Contradiction:
Improveerror-free receptionVSAvoidcode rate
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The multi-level finite state machine dynamically adjusts transition constraints across different levels. By allowing more flexible transitions in certain levels while maintaining strict constraints in others, the system achieves better error correction without excessively limiting the code rate

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of transition run length from a single fixed value to a multi-level structure with different run length constraints at each level. This parameter transformation enables the system to optimize both reliability and code rate simultaneously

Inventive Principle:
Principle #35Parameter changes

3Reliability

If multi-level periodic structure is implemented to suppress long transition runs, then error correction performance improves, but the device complexity increases

Engineering Contradiction:
Improvesuppression of long transition runsVSAvoidfinite state machine structure
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The multi-level finite state machine employs periodic structures where states repeat at regular intervals. This periodicity naturally suppresses long transition runs by forcing transitions to reset at predictable intervals, improving reliability through structured repetition

Inventive Principle:
Principle #19Periodic action

Solution Approach 2:

The finite state machine levels are nested within each other, with lower levels providing basic transition control and higher levels adding additional constraints. This nested structure achieves comprehensive error suppression while organizing complexity in a hierarchical manner

Inventive Principle:
Principle #7Nested doll (Nesting)

Data Source

PatentUS8854755B2Multi-level run-length limited finite state machine for magnetic recording channel
Publication Date: 2014.10.07 AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LTD
  • US8854755B2 patent drawing
  • US8854755B2 patent drawing
  • US8854755B2 patent drawing

AI summary

A system is described for constructing maximum transition run modulation code based upon a multi-level run-length limited finite state machine. A processor is configured to receive information from a hard disk drive via a read channel and recover data from the hard disk drive using maximum transition run modulation code. A memory has computer executable instructions configured for execution by the processor to model a magnetic recording channel as a partial response channel, model a source of information to the magnetic recording channel to provide an optimized Markov source, and construct a maximum transition run modulation code to mimic the optimized Markov source based upon a finite state machine having a limited transition run length and a multi-level periodic structure.