System and method for decreasing decoder complexity
View Patent ↗A device including a minimal trellis decoder is disclosed. The device can receive an encoded codeword, which the minimal trellis decoder efficiently decodes. In a specific implementation, the device can include a Bluetooth receiver that, in operation, receives an encoded codeword from a Bluetooth transmitter, which is decoded by the minimal trellis decoder.
1. A system comprising:
a Bluetooth transmitter;
a Bluetooth receiver, wherein, in operation, the Bluetooth receiver receives an encoded codeword from the Bluetooth transmitter;
a minimal trellis decoder, coupled to the Bluetooth receiver, for efficiently decoding the encoded codeword and removing parity bits to yield data bits associated with the codeword.
2. The system of claim 1 , further comprising a minimal trellis, embodied in the minimal trellis decoder, including initial stages, intermediate stages, and final stages.
3. The system of claim 2 , wherein the intermediate stages of the minimal trellis decoder include a median stage.
4. The system of claim 3 wherein a node of the median stage includes one input branch and two output branches or two input branches and one output branch.
5. The system of claim 2 , wherein the final stages of the minimal trellis decoder include a staggered final stage.
6. The system of claim 5 wherein a node of the staggered final stage includes two input branches and two output branches.
7. The system of claim 2 , further comprising a mapping engine configured to map bits of a codeword decodable using a traditional trellis to bits efficiently decodable using the minimal trellis.
8. A device comprising:
a minimal trellis decoder, wherein a minimal trellis embodied in a computer readable medium on the decoder includes initial stages, intermediate stages, and final stages, and wherein the intermediate stages include a median stage and the final stages include a staggered final stage;
a mapping engine stored in a computer readable medium, wherein, in operation, the mapping engine maps n bits of a codeword decodable using a traditional trellis to n bits efficiently decodable using the minimal trellis, and wherein the mapping engine includes a function π([r 1 ,r 2 ,r 3 ,r 4 ,r 5 ,r 6 ,r 7 ,r 8 ,r 9 ,r 10 ,r 11 ,r 12 ,r 13 ,r 14 ,r 15 ])=[r 1 ,r 7 ,r 9 ,r 3 ,r 10 ,r 6 ,r 11 ,r 4 ,r 5 ,r 8 ,r 14 ,r 15 ,r 12 ,r 13 ,r 2 ], implemented in a computer-readable medium, wherein n=15, and the values of the arrays represent n bits of the codeword.
9. The device of claim 8 comprising: a computer readable medium containing an implementation of a Viterbi or other trellis search algorithm on the minimal trellis for the decoder to use in decoding the codeword.
10. The device of claim 8 further comprising a Bluetooth signal receiver coupled to the minimal trellis decoder.
11. The device of claim 8 wherein a node of the median stage includes one input branch and two output branches or two input branches and one output branch.
12. The device of claim 8 wherein a node of the staggered final stage includes two input branches and two output branches.
13. The device of claim 8 wherein the minimal trellis includes a minimal trellis expression of a shortened Hamming (15, 10) code.
14. The device of claim 8 , wherein the codeword is a shortened Hamming code codeword.
15. A device comprising:
a minimal trellis decoder, wherein a minimal trellis embodied in a computer readable medium on the decoder includes initial stages, intermediate stages, and final stages, and wherein the intermediate stages include a median stage and the final stages include a staggered final stage;
a mapping engine stored in a computer readable medium, wherein, in operation, the mapping engine maps bits of a codeword decodable using a traditional trellis to bits efficiently decodable using the minimal trellis;
a Bluetooth signal receiver coupled to the minimal trellis decoder.
16. The device of claim 15 comprising: a computer readable medium containing an implementation of a Viterbi or other trellis search algorithm on the minimal trellis for the decoder to use in decoding the codeword.
17. The device of claim 15 wherein a node of the median stage includes one input branch and two output branches or two input branches and one output branch.
18. The device of claim 15 wherein a node of the staggered final stage includes two input branches and two output branches.
19. The device of claim 15 wherein the minimal trellis includes a minimal trellis expression of a shortened Hamming (15, 10) code.
20. The device of claim 15 , wherein the codeword is a shortened Hamming code codeword.