Skip to main content
. 2021 Mar 30;21(7):2382. doi: 10.3390/s21072382
Algorithm 1 Subcarrier allocation method for a given α
  • 1:

    Nblk←1α

  • 2:

    Ncount,mt←0 for mt=1,…Mt

  • 3:

    nblk←0

  • 4:

    Ωi,mt←0 for i=0,…,Nc−1, mt=1,…Mt

  • 5:

    do

  • 6:

        nblk←nblk+1

  • 7:

        Hblk=H1:Mt,(1:αNc)+αNc(nblk−1)

  • 8:

        do

  • 9:

             m^t,i^←argmaxmt,iHblk[mt,i]

  • 10:

            if Ncount,m^t<αNcMt then

  • 11:

               n^c←i+Nc(nblk−1)

  • 12:

               n^c∈N¯m^t, Ncount,m^t←Ncount,m^t+1

  • 13:

               Ωn^c,m^t←1

  • 14:

             end if

  • 15:

            Hblk[m^t,i^]←0

  • 16:

        while Ncount,mt<αNcMt for any mt

  • 17:

    while nblk<Nblk