1 Feb
2012
1 Feb
'12
11:44 a.m.
On Feb 1, 2012, at 2:26 PM, Fred Cisin wrote:
Or, in short, "Yes, but the TLAs carry important semantics". :-)
- Dave
> Isn't
MFM just a special case of GCR?
On Wed, 1 Feb 2012, Christian Corti wrote:
In that case, GCR is a RLL code in the sense of
limiting the run length of
successive zeroes.
MFM being a "special case" (one of many possible instances) of GCR, and
MFM being a "special case" (one of many possible instances) of RLL,
does NOT NECESSARILY imply logically that GCR and RLL are the same.
(Want a Venn diagram how that could work as an intersection of the two?)
The relationship between GCR and RLL is going to depend on how you define
GCR (and, to a lesser extent, RLL). Both limit the number of consecutive
0 bits. However, GCR generally is table driven, based on only using
bit patterns that can be written without adding any clock pulses, while
RLL manipulates added clock bits placed between the existing bits to
achieve the goal. Our definitions could be used to
differentiate the two, OR to demonstrate the equality.