Skip to main content
. 2019 Dec 4;19(24):5337. doi: 10.3390/s19245337
Algorithm 1 FDPS-Carrier-By-Carrier
  • 1:

    Let U be the set of schedulable modules;  

  • 2:

    Let M[i][j] be the metric of H2Hj module at RBi;  

  • 3:

    Let A[m] be RB-to-module assignment status;  

  • 4:

    for RB c = 1 to m do  

  • 5:

        pick the best module i∈U with largest value Mi,c;  

  • 6:

        Assign RBc to module i (i.e. A[c]←i);  

  • 7:

        Let I be RBs already assigned to module i;  

  • 8:

        if I = ⌀ then  

  • 9:

            U=U−A[c−1]  

  • 10:

        end if;  

  • 11:

    end for.