Skip to main content
. 2021 Jan 2;21(1):250. doi: 10.3390/s21010250
Algorithm 2 Preamble sequence reception scheme
  • Require: 

     

  The received preamble sequence in the gNB y(n);

  The length of the sub-preamble Li;

  The length of the GI Lg;

  The length of the empty sequence L0;

  The sets of the local sub-preamble sequences Si;

  • Ensure: 

     

   The received shared sub-preamble sequence ys(ns);

   The received dedicated sub-preamble sequence yd(nd);

  •  1:

      Intercept the first Ls elements of y(n) as ys(ns);

  •  2:

      Divide the residual sequence in the middle and obtain two sequences with the equal length Ld+Lg, i.e., y˜d,candidate1(nd) and y˜d,candidate2(nd);

  •  3:

      Remove the GI from y˜d,candidate1(nd) to obtain yd,candidate1(nd);

  •  4:

      Output yd(nd)=yd,candidate1(nd) for μ=1;

  •  5:

      Remove the GI from y˜d,candidate2(nd) to obtain yd,candidate2(nd);

  •  6:

      Output yd(nd)=yd,candidate2(nd) for μ=2;