초록 ▼

A method of searching for candidate codewords for a telecommunications system may comprise receiving a constellation point, comparing the received point with points within a Dorsch decoding process using an optimal pattern, and terminating the search when a codeword is found residing within a specif

A method of searching for candidate codewords for a telecommunications system may comprise receiving a constellation point, comparing the received point with points within a Dorsch decoding process using an optimal pattern, and terminating the search when a codeword is found residing within a specified distance of the received point.

대표청구항 ▼

1. A method of searching for candidate codewords for a telecommunications system, the method comprising: receiving, by a network of decoders, a received vector comprised of a plurality of received bit positions;comparing, by one or more of the decoders, distances between the received vector and more

1. A method of searching for candidate codewords for a telecommunications system, the method comprising: receiving, by a network of decoders, a received vector comprised of a plurality of received bit positions;comparing, by one or more of the decoders, distances between the received vector and more than one of a plurality of candidate codewords within a Dorsch decoding process using an optimal candidate codeword generation pattern; andterminating the search when a codeword is found by the one or more decoders that resides within a specified distance of the received vector. 2. The method of claim 1, wherein the codeword that is found within the specified distance of the received vector is a best match codeword. 3. The method of claim 2, further comprising releasing, by the one or more decoders, the best match codeword to an output buffer. 4. The method of claim 3, further comprising releasing a plurality of best match codewords by the output buffer to a receiver based on an order in which the best match codewords are received by the output buffer. 5. The method of claim 4, wherein the order of probability of comparison runs from a higher probability of finding the matching codeword to a lower probability of finding the matching codeword at each of the candidate codewords. 6. The method of claim 1, further comprising simultaneously comparing a plurality of received vectors by a plurality of decoders within the Dorsch decoding process using the optimal pattern. 7. The method of claim 1, further comprising recording, by the one or more decoders, a unique identifier for the received vector. 8. The method of claim 7, further comprising identifying an order of received vectors based on the unique identifier recorded by the one or more decoders. 9. The method of claim 1, further comprising tabulating an order of receipt for a plurality of received vectors using an ordering unit. 10. The method of claim 1, wherein the received vector is compared with candidate codewords based on an order of probability of finding a matching codeword at each of the candidate codewords. 11. A system for searching for candidate codewords within a telecommunications system, the system comprising: a network of decoders configured to receive a received vector comprised of a plurality of received bit positions; wherein one or more of the decoders is configured to compare distances between the received vector and more than one of a plurality of candidate codewords within a Dorsch decoding process using an optimal candidate codeword generation pattern and terminate the search when a codeword is found by the one or more decoders that resides within a specified distance of the received vector. 12. The system of claim 11, wherein the codeword that is found within the specified distance of the received vector is a best match codeword. 13. The system of claim 12, further comprising an output buffer configured to receive the best match codeword from the one or more of the decoders. 14. The system of claim 13, wherein the output buffer is further configured to release a plurality of best match codewords to a receiver based on an order in which the best match codewords are received by the output buffer. 15. The system of claim 14, wherein the order of probability of comparison runs from a higher probability of finding the matching codeword to a lower probability of finding the matching codeword at each of the candidate codewords. 16. The system of claim 11, further comprising a plurality of decoders that is configured to simultaneously compare a plurality of received vectors within the Dorsch decoding process using the optimal pattern. 17. The system of claim 11, wherein the one or more of the decoders is further configured to record a unique identifier for the received vector. 18. The system of claim 17, wherein the one or more of the decoders is further configured to identify an order of received vectors based on the unique identifier recorded by the one or more decoders. 19. The system of claim 11, further comprising an ordering unit configured to tabulate an order of receipt for a plurality of received vectors. 20. The system of claim 11, wherein the received vector is compared with candidate codewords based on an order of probability of finding a matching codeword at each of the candidate codewords.