Pseudo Random Sequence
The Pseudo Random Sequence generation algorithm in NR is same as the one in LTE as shown below. The usage of the sequence is also almost same as in LTE. Only minor difference would be the value initialization part.... overall you may think there is almost no difference from LTE.
As shown in the equations above, in both NR and LTE, the sequences are generated using the same polynomial functions:
 The scrambling sequence c(n) is created by the sum of x_{1}(n + N_{c}) and x_{2}(n + N_{c}), modulo 2.
 The first longterm sequence x_{1}(n+31) is updated using the sum of x_{1}(n+3) and x_{1}(n), modulo 2.
 The second longterm sequence x_{2}(n+31) is updated using the sum of x_{2}(n+3), x_{2}(n+2), x_{2}(n+1), and x_{2}(n), modulo 2.
The image text concludes by emphasizing that despite the similarities, there are minor differences in how the sequences are initialized, but overall, they are nearly the same between NR and LTE.
Following is the case showing how pseudo random sequence is being used for PDSCH and PDCCH channel coding process in NR.
 The sequence generation begins with initial conditions for two longterm sequences x_{1} and x_{2}. The initial condition for x_{1} is given for indices 0 to 30, while the initial condition of x_{2} is defined by a given formula.
 The scrambling sequence c(n) is computed using x_{1} and x_{2} sequences, combined with a Gold sequence and modulo 2 arithmetic, where N_{c} is a constant set to 1600.
 For PDSCH scrambling, the initialization sequence c_{init} is calculated using the RNTI (Radio Network Temporary Identifier), a quarter index q, and the scrambling identity n_{ID}. The scrambling identity is either set to a value from 0 to 1023 if configured, or to the physical cell ID N_{IDcell} otherwise.
 For PDCCH scrambling, c_{init} is directly set to the physical cell ID N_{IDcell}.
Reference
[1]

