Abstract
This letter introduces and analyzes a new distributed dynamic subchannel allocation algorithm for multiple access networks. The proposed algorithm is based on general order selection, and exhibits low complexity and low processing delay. The exact and asymptotic closed-form expressions for the average error probability are derived, and it is shown that there is a significant system performance advantage over the conventional uniform allocation approach. Numerical studies also show that the performance of our new algorithm can be close to that of the highly complex optimal search method.
Original language | English |
---|---|
Pages (from-to) | 761-763 |
Number of pages | 3 |
Journal | IEEE Communications Letters |
Volume | 12 |
Issue number | 10 |
DOIs | |
Publication status | Published - 2008 |
Externally published | Yes |
Keywords
- Channel allocation
- Diversity
- Fading channels
- General order selection