OFDMA_Part31 - So the first stage of[32]s algorithm...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
31 So the first stage of [32]’s algorithm determines the number of subcarriers for each user. The BABS algorithm is unfair to the lowest rate user because the step in Box (3) may cause the allocation scheme to completely ignore the lowest rate user in an attempt to make the total number of allocated subcarriers less than N . Nevertheless, BABS is optimal for flat-fading channels and has a computational complexity of O ( KN ). After knowing the number of subcarriers for each user, the second stage of [32]’s algorithm allocates specific subcarriers to each user. In this stage, the author introduces two main algorithms. The first algorithm is Rate-Craving Greedy (RCG) and is shown in Figure 14. This algorithm aims to maximize the total transmission rate. The first step of this algorithm is finding the transmission rate for user k on subcarrier n [ r k ( n )] whose formula is shown in Box (1) of Figure 14. In the next step, N subcarriers are distributed into K sets {C 1 … C k }, where #C
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Ask a homework question - tutors are online