| US 7,583,456 B1 | ||
| Method and apparatus to limit DC-level in coded data | ||
| Mats Oberg, Cupertino, Calif. (US); and Pantas Sutardja, Los Gatos, Calif. (US) | ||
| Assigned to Marvell International Ltd., Hamilton (Bermuda) | ||
| Filed on Jan. 28, 2008, as Appl. No. 12/20,999. | ||
| Application 12/020999 is a continuation of application No. 10/752817, filed on Jan. 06, 2004, granted, now 7,330,320. | ||
| Claims priority of provisional application 60/478869, filed on Jun. 16, 2003. | ||
| Claims priority of provisional application 60/485216, filed on Jul. 07, 2003. | ||
| This patent is subject to a terminal disclaimer. | ||
| Int. Cl. G11B 5/02 (2006.01) | ||
| U.S. Cl. 360—25 [360/39; 360/45; 360/53; 341/58] | 19 Claims |
| 1. A method comprising:
receiving a first data stream, the first data stream including one or more patterns associated with a predetermined level
of DC wander;
scrambling the first data stream with at least one of a plurality of scrambler seeds;
determining if the predetermined level meets a minimum baseline;
scrambling the first data stream with another one of the scrambler seeds to form a second data stream if it is determined
that the predetermined level does not meet the minimum baseline, and
determining whether there is at least one scrambler seed remaining in the plurality of scrambler seeds that has not been used
previously for scrambling the first data stream,
if there are no scrambler seeds that have not been used previously for scrambling a data stream, scrambling the first data
stream with at least one of a plurality of scrambler seeds includes:
selecting a scrambler seed among the plurality of scrambler seeds that yields a minimal baseline; and
scrambling the first data stream using the selected scrambler seed.
|