System and method for reviving catastrophic codes
View Patent ↗A system and method of the present invention revives a catastrophic code used for channel coding data. A data receiving circuit receives a digital input data sequence to be coded with a code having a distance spectrum containing an infinite component that corresponds to a finite hamming weight such that the code may cause catastrophic error propagation. The circuit is operative for periodically inserting known symbols into the digital input data sequence. An encoder, such as a convolutional encoder, is operatively connected to the data receiving circuit and encodes the digital input data sequence.
1. A system for reviving a code used for channel coding data in data communications systems comprising:
a data receiving circuit for receiving a digital input data sequence to be coded with a code having a distance spectrum containing an infinite component that corresponds to a finite hamming weight such that the code may cause catastrophic error propagation, said circuit being operative for periodically inserting known symbols into the digital input data sequence; and
an encoder operatively connected to said data receiving circuit for encoding the digital input data sequence with the code.
2. A system according to claim 1 , wherein the known symbols that are inserted comprise zeros.
3. A system according to claim 1 , wherein said encoder comprises a convolutional encoder.
4. A system according to claim 1 , wherein said encoder is operative for trellis encoding the expanded digital input data sequence to produce a channel coded data stream such that the number of connections between trellis nodes in a trellis are reduced.
5. A system according to claim 4 , wherein the trellis corresponds to a memory length m, and the known symbols are inserted after each m symbol within the input data sequence.
6. A method of reviving a code used for channel coding data in a data communications systems comprising the steps of:
receiving a digital input data sequence to be coded with a code having a distance spectrum containing an infinite component that corresponds to a finite hamming weight such that the code may cause catastrophic error propagation;
periodically inserting known symbols into the digital input data sequence; and
encoding the digital input data sequence with the code.
7. A method according to claim 6 , wherein the step of inserting known symbols comprises the step of inserting zeros into the digital input data sequence.
8. A method according to claim 7 , and further comprising the step of inserting a zero after each of two information bits within the digital input data sequence.
9. A method according to claim 7 , and further comprising the step of inserting a zero after each of four information bits within the digital input data sequence.
10. A method according to claim 6 , wherein the code for encoding the digital input data sequence comprises a convolutional code.
11. A method according to claim 10 , wherein the convolutional code comprises a time varying convolutional code.
12. A method according to claim 10 , wherein the convolutional code comprises a time invariant convolutional code such that a corresponding state diagram contains a circuit in which a nonzero input sequence corresponds to an all-zero output sequence.
13. A method according to claim 6 , and further comprising the step of trellis encoding the digital input data sequence after inserting the known symbols to produce a channel coded data stream.
14. A method according to claim 13 , wherein the topology of the trellis corresponds to a memory length m, and further comprising the step of inserting a known symbol after each m symbol within the digital input data sequence.
15. A method of reviving a code used for channel coding data in a data communications systems comprising the steps of:
receiving a digital input data sequence to be coded with a code having a distance spectrum containing an infinite component that corresponds to a finite hamming weight such that the code may cause catastrophic error propagation;
periodically inserting known symbols into the digital input data sequence; and
trellis encoding the digital input data sequence after inserting the known symbols to produce a channel coded data stream such that the number of connections between trellis nodes in a trellis are reduced.
16. A method according to claim 15 , wherein the topology of the trellis corresponds to a memory length m, and further comprising the step of inserting a known symbol after each m symbol within the digital input data sequence.
17. A method according to claim 15 , and further comprising the step of applying code words that are one-to-one mappings of distinct paths on a trellis to binary sequences.
18. A method according to claim 15 , wherein the step of inserting known symbols comprises the step of inserting zeros into the digital input data sequence.
19. A method according to claim 15 , and further comprising the step of inserting a zero after each of two information bits within the digital input data sequence.
20. A method according to claim 15 , and further comprising the step of inserting a zero after each of four information bits within the digital input data sequence.
21. A method according to claim 15 , wherein the code for encoding the digital input data sequence comprises a convolutional code.
22. A method according to claim 21 , wherein the code comprises a time varying convolutional code.
23. A method according to claim 21 , wherein the code comprises a time invariant convolutional code such that a corresponding state diagram contains a circuit in which a nonzero input sequence corresponds to an all-zero output sequence.