A method of decoding a signal embodying a progressive construction of a decoding tree, computer program product and corresponding signal

The invention relates to a method of decoding a received signal, implementing a gradual construction of a shaft decodage.Selon the invention, the construction uses at least one iteration (52, 53) of the following steps: - selecting at least one son node of a current node belonging to a selection range - storing in a first son nodes of the stack - in removing the first stack of the current node, - selecting in the first stack of new current node; and- if the new current node is a leaf node, storing the path between the root node and the leaf node in a second cell; - otherwise, return to the step of selecting a node for the new current son node; and the method comprises a step of determining an estimate of the signal, taking into account the (in) path (s) stored (s) in the second stack.

[1]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

[2]  Georgios B. Giannakis,et al.  Sphere decoding algorithms with improved radius search , 2005, IEEE Trans. Commun..

[3]  Giuseppe Caire,et al.  A unified framework for tree search decoding: rediscovering the sequential decoder , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..