Systems and methods for constructing high-rate constrained codes

• US 8,049,648 B2
• Filed: 05/03/2010
• Issued: 11/01/2011
• Est. Priority Date: 07/22/2005
• Status: Active Grant

• Current Assignee: Marvell Asia Pte Limited (Marvell Technology Group Limited)
• Original Assignee: Marvell International Limited (Marvell Technology Group Limited)
• Inventors: Chaichanavong, Panu
• Primary Examiner(s): Nguyen; Linh
• Application Number:
  US12/772,891
• Publication Number:
  US 20100231425A1
• Time in Patent Office: 547 Days
• Field of Search: 341/58, 341/59, 341/65, 341/67, 341/90, 341/94
• US Class Current: 341/58
• CPC Class Codes: H03M 5/145 Conversion to or from block codes or representations thereof

Abstract

A high-rate constrained code is provided to encode/decode channel data. A transformer translates binary channel data into an arbitrary alphabet size. The transformer selects an indicator word and makes forbidden prefix substitutions in the data to be transformed. A finite-state encoder imposes some user-defined constraint on the transformed data before the data is transferred to the channel. The high-rate constrained coding technique may be used to produce high-rate DC-limited and run-length-limited codes. The high-rate code can be used in tandem with error-correcting codes.

Claims

1. A high-rate constrained encoder for encoding a communications signal, the encoder comprising:

a data transformer configured to convert a binary data sequence into a transformed data sequence of an alphabet size that is selected from any one of a plurality of consecutive integer values; and

a finite-state encoder of an arbitrary rate constrained code configured to encode the transformed data sequence by imposing at least one constraint on the transformed data sequence and outputting the encoded transformed data sequence.

2. The high-rate constrained encoder of claim 1 wherein the data transformer comprises a substitution block to replace prohibited words in the transformed data sequence.

3. The high-rate constrained encoder of claim 2 wherein the substitution block comprises a mapping table generator that maps each prohibited word to a unique suffix.

4. The high-rate constrained encoder of claim 2 wherein the data transformer further comprises a forbidden set generator to generate words prohibited in the transformed data sequence.

5. The high-rate constrained encoder of claim 1 wherein the data transformer comprises an indicator selector to select at least one indicator that is not a prefix of any forbidden word in the transformed data sequence and that is a prefix of at most a fixed number of words in the binary data sequence.

6. The high-rate constrained encoder of claim 1 wherein the finite-state encoder is selected from the group consisting of a modulation encoder, a look-ahead encoder, and a block-decodable encoder.

7. The high-rate constrained encoder of claim 1 wherein the at least one constraint is selected from the group consisting of a DC constraint, a digital sum constraint, a run-length constraint, an interleaved run-length constraint, and a transition constraint.

8. The high-rate constrained encoder of claim 1 wherein the transformed data sequence is selected from the group consisting of a channel transmission signal, and a perpendicular recording signal.

9. The high-rate constrained encoder of claim 1 further comprising an error-correcting encoder for calculating parity information of the transformed data sequence.

10. A method for encoding a communications signal, the method comprising:

converting a binary data sequence into a transformed data sequence of an alphabet size that is selected from any one of a plurality of consecutive integer values;

encoding the transformed data sequence by imposing at least one constraint on the transformed data sequence; and

outputting the encoded transformed data sequence.

11. The method of claim 10 wherein a selected indicator is appended to the transformed data sequence.

12. The method of claim 10 further comprising replacing words not allowed in the transformed data sequence.

13. The method of claim 12 wherein replacing words not allowed in the transformed data sequence comprises mapping each word not allowed to a unique suffix.

14. The method of claim 12 further comprising generating words not allowed in the transformed data sequence.

15. The method of claim 10 further comprising selecting at least one word that appears as a prefix of at most a fixed number of words in the binary data sequence.

16. The method of claim 10 wherein constraining the transformed data sequence comprises imposing a constraint selected from the group consisting of a DC constraint, a run-length constraint, and a transition constraint.

17. The method of claim 10 further comprising transmitting the transformed data sequence over a channel.

18. The method of claim 10 further comprising recording the transformed data sequence on a non-transitory medium.

19. The method of claim 10 further comprising calculating parity information of the transformed data sequence.

20. The method of claim 10 further comprising interleaving the parity information into the transformed data sequence.