摘要 |
A method for acquiring a Gold code, obtained as a sum of a first M-sequence (x) and a second M-sequence (yi), the first M-sequence being generated by a first generator polynomial (gx) and the second M-sequence being generated by a second generator polynomial (gy), the weight of the first generator polynomial being lower than the weight of the second generator polynomial, the acquiring method involving a first step of message passing decoding according to a first bipartite graph the edges of which are determined by the coefficients of the first generator polynomial, a decimation step using a predetermined decimation factor, and a second step of message passing decoding according to a second bipartite graph the edges of which are determined by a third generator polynomial having a minimum weight generating a third M-sequence having the same length as that of the second M-sequence. |