Methods and apparatus for improving minimum hamming weights of a sequence

• US 7,312,727 B1
• Filed: 04/11/2007
• Issued: 12/25/2007
• Est. Priority Date: 12/04/2002
• Status: Active Grant

• Current Assignee: Marvell Asia Pte Limited (Marvell Technology Group Limited)
• Original Assignee: Marvell International Limited (Marvell Technology Group Limited)
• Inventors: Feng, Weishi, Yu, Zhan
• Primary Examiner(s): NGUYEN, LINH V
• Application Number:
  US11/786,246
• Time in Patent Office: 258 Days
• Field of Search: 341 50-107, 714/739, 714/738, 714/742, 714/268
• US Class Current: 341/58
• CPC Class Codes: G11B 20/10 Digital recording or reproducing
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end

Abstract

A communications channel comprises a seed selector that selectively removes X M-bit symbols of user data from a seed set comprising Y M-bit symbols and that selects a scrambling seed from Y-X symbols remaining in the seed set, where X, Y and M are integers greater than one. A Hamming weight coding device that determines a Hamming weight of symbols of scrambled user data that are generated based on the user data and the selected scrambling seed and that selectively codes the symbols depending upon the determined Hamming weight.

Claims

1. A communications channel comprising:

a seed selector that selectively removes X M-bit symbols of user data from a seed set comprising Y M-bit symbols and that selects a scrambling seed from Y-X symbols remaining in said seed set, where X, Y and M are integers greater than one; and

a Hamming weight coding device that determines a Hamming weight of symbols of scrambled user data that are generated based on said user data and said selected scrambling seed and that selectively codes said symbols depending upon said determined Hamming weight.

2. The communications channel of claim 1 further comprising:

a data buffer that communicates with said seed selector and that stores said user data; and

a scrambling device that communicates with said seed selector and said data buffer and that generates said scrambled user data using said user data and said selected scrambling seed.

3. The communications channel of claim 1 wherein said communications channel is implemented in a data storage system.

4. The communications channel of claim 1 wherein said Hamming weight coding device determines a Hamming weight of adjacent symbols in said scrambled user data.

5. The communications channel of claim 1 wherein said seed selector removes inverses of symbols in said user data from said seed set.

6. The communications channel of claim 4 wherein said Hamming weight coding device selects an unused seed S as a first token and a bit-wise inversion of S as a second token.

7. The communications channel of claim 6 wherein said Hamming weight coding device passes said two adjacent symbols unchanged when said Hamming weight of said two adjacent symbols is greater than or equal to 4.

8. The communications channel of claim 7 wherein when said Hamming weight of said two adjacent symbols is one of (1,1) and (1,2), said Hamming weight coding device replaces a first of said two adjacent symbols with said first token and replaces a second of said two adjacent symbols with a bit indicator of said first of said two adjacent symbols and a mapping of said second of said two adjacent symbols.

9. The communications channel of claim 8 wherein said bit indicator indicates a position of a one bit in said first of said two adjacent symbols.

10. The communications channel of claim 9 wherein said bit indicator includes I bits and said mapping maps M bits of said second of said two adjacent symbols to M-I bits.

11. The communications channel of claim 10 wherein when said Hamming weight of said two adjacent symbols is (2,1), said Hamming weight coding device replaces a first of said two adjacent symbols with said second token and a second of said two adjacent symbols with a bit indicator of said second of said two adjacent symbols and a mapping of said first of said two adjacent symbols.

12. The communications channel of claim 11 wherein said bit indicator indicates a position of a one bit in said first of said two adjacent symbols.

13. The communications channel of claim 11 wherein said bit indicator includes I bits and said mapping maps M bits of said first of said two adjacent symbols to M-I bits.

14. The communications channel of claim 1 wherein said Hamming weight coding device selects a first unused seed A and a second unused seed B, wherein A is not said one'"'"'s complement of B, and determines a token as A XOR B.

15. The communications channel of claim 14 wherein said Hamming weight coding device passes said two adjacent symbols unchanged when said Hamming weight of said two adjacent symbols is greater than or equal to 3.

16. The communications channel of claim 15 wherein when said Hamming weight of said two adjacent symbols is less than 3, said Hamming weight coding device replaces a first of said two adjacent symbols with said first token, replaces a second of said two adjacent symbols with bit indicators for said two adjacent symbols, and fills remaining bit positions with 1'"'"'s.

17. A method comprising:

selectively removing X M-bit symbols of user data from a seed set comprising Y M-bit symbols;

selecting a scrambling seed from Y-X symbols remaining in said seed set, where X, Y and M are integers greater than one;

determining a Hamming weight of symbols in scrambled user data that is generated based said user data and said selected scrambling seed; and

selectively coding said symbols depending upon said determined Hamming weight.

18. The method of claim 17 wherein said communications channel is implemented in a data storage system.

19. The method of claim 17 further comprising determining Hamming weights of adjacent symbols in said scrambled user data.

20. The method of claim 17 further comprising removing inverses of symbols in said user data from said seed set.

21. The method of claim 19 further comprising selecting an unused seed S as a first token and a bit-wise inversion of S as a second token.

22. The method of claim 21 further comprising passing said two adjacent symbols unchanged when said Hamming weight of said two adjacent symbols is greater than or equal to 4.

23. The method of claim 22 further comprising replacing a first of said two adjacent symbols with said first token and replacing a second of said two adjacent symbols with a bit indicator of said first of said two adjacent symbols and a mapping of said second of said two adjacent symbols when said Hamming weights of said two adjacent symbols is one of (1,1) and (1,2).

24. The method of claim 23 further comprising indicating a position of a one bit in said first of said two adjacent symbols.

25. The method of claim 24 wherein said bit indicator includes I bits and said mapping maps M bits of said second of said two adjacent symbols to M-I bits.

26. The method of claim 25 further comprising replacing a first of said two adjacent symbols with said second token and a second of said two adjacent symbols with a bit indicator of said second of said two adjacent symbols and a mapping of said first of said two adjacent symbols when said Hamming weights of said two adjacent symbols is (2,1).

27. The method of claim 26 wherein said bit indicator indicates a position of a one bit in said first of said two adjacent symbols.

28. The method of claim 26 wherein said bit indicator includes I bits and said mapping maps M bits of said first of said two adjacent symbols to M-I bits.

29. The method of claim 17 further comprising selecting a first unused seed A and a second unused seed B, wherein A is not said one'"'"'s complement of B, and determines a token as A XOR B.

30. The method of claim 29 further comprising passing said two adjacent symbols unchanged when said Hamming weight of said two adjacent symbols is greater than or equal to 3.

31. The method of claim 30 further comprising replacing a first of said two adjacent symbols with said first token, replacing a second of said two adjacent symbols with bit indicators for said two adjacent symbols, and filling remaining bit positions with 1'"'"'s when said Hamming weight of said two adjacent symbols is less than 3.