Pseudo-random sequences are defined by a length-31 Gold sequence. The output sequence c(n) of length M_PN , where n = 0, 1,...,M_PN-1, is defined by
c(n) = (x1(n+Nc) + x2(n+Nc)) mod 2
x1(n+31) = (x1(n+3) + x1(n)) mod 2
x2(n+31) = (x2(n+3) + x2(n+2) + x2(n+1) + x2(n)) mod 2
where Nc = 1600 and the first m-sequence shall be initialized with x1(0) = 1, x1(n) = 0,n=1,2,...,30. The initialization
of the second m-sequence is denoted by cint = summation[x2(i).2^i], i = 0 t0 30 with the value depending
on the application of the sequence.
*/
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Is there any detailed explanation (i.e publication, article) that explains how to generate a length 31 pseudo random sequence?
I found something I can use. Thanks
/*
TS 36.211
7.2 Pseudo-random sequence generation
Pseudo-random sequences are defined by a length-31 Gold sequence. The output sequence c(n) of length M_PN , where n = 0, 1,...,M_PN-1, is defined by
c(n) = (x1(n+Nc) + x2(n+Nc)) mod 2
x1(n+31) = (x1(n+3) + x1(n)) mod 2
x2(n+31) = (x2(n+3) + x2(n+2) + x2(n+1) + x2(n)) mod 2
where Nc = 1600 and the first m-sequence shall be initialized with x1(0) = 1, x1(n) = 0,n=1,2,...,30. The initialization
of the second m-sequence is denoted by cint = summation[x2(i).2^i], i = 0 t0 30 with the value depending
on the application of the sequence.
*/