Radius adaptive sphere decoding with probabilistic noise constraint
AssigneeQUALCOMM Incorporated
InventorsByonghyo Shim, Insung Kang
Life of this patent
Estimating the term…
Abstract
Method and apparatus for decoding code words received over a communication channel are disclosed. A radius-adaptive sphere decoding methodology reduces the number of operations in sphere-constrained search. Imposing probabilistic noise constraint on top of sphere constraint, particularly at an early stage, provides a more stringent necessary condition. Hence, many branches that are unlikely to be selected are removed in the early stage of sphere search. The trade-off between computational complexity and performance can be controlled by adjusting the pruning probability.
Claims41
A method of decoding data exchanged in a communication system, the method comprising:
- receiving one or more code words in a data transmission;
- determining a pruning probability for at least one code word;
- enumerating lattice points inside a sphere of a determined radius wherein the lattice points are comprised in one or more layers having probabilities greater than the determined pruning probability;
- determining a nearest lattice point to the received code word;
- and
- outputting data associated with the nearest lattice point as the received code word.
An apparatus for decoding data within a communication system comprising:
- a receiving module that receives one or more code words in a data transmission;
- and
- a processing module that decodes at least a code word from the received transmission by enumerating lattice points inside a sphere of a determined radius wherein the lattice points are comprised in one or more layers having probabilities greater than a particular pruning probability value.
A processor readable medium comprising instructions for:
- receiving one or more code words in a data transmission;
- generating a pruning probability for at least one code word;
- enumerating all lattice points inside a sphere of a determined radius wherein the lattice points are comprised in one or more layers having probabilities greater than the generated pruning probability;
- determining a nearest lattice point to the received code word;
- and
- outputting data associated with the nearest lattice point as the received code word.
An apparatus for decoding data transmitted within a communication system comprising:
- means for receiving that receives one or more code words in a data transmission;
- means for processing that decodes at least a code word from the received transmission by enumerating lattice points inside a sphere of a determined radius wherein the lattice points are comprised in one or more layers having probabilities greater than a particular pruning probability value.
Dependencies are inferred from the claim text.