Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  GPA
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The Orthogonal Frequency Division Multiplexing (OFDM) transmission is the optimum version of the multicarrier transmission scheme, which has the capability to achieve high data rate. The key issue of OFDMsystem is the allocation of bits and power over a number of subcarriers. In this paper, a new power allocation algorithm based on subcarrier gain is proposed to maximize the bit rate. For OFDM systems, the Subcarrier Gain Based Power Allocation (SGPA) algorithm is addressed and compared with the standard Greedy Power Allocation (GPA). The authors demonstrate by analysis and simulation that the proposed algorithm reduces the computational complexity and achieves a near optimal performance in maximizing the bit rate over a number of subcarrier.
EN
Multi-User Orthogonal Frequency Division Multiplexing (MU-OFDM) is an efficient technique for achieving high downlink capacity in high-speed communication systems. A key issue in MU-OFDM is the allocation of the OFDM subcarriers and power to users sharing the channel. In this paper a proportional rate-adaptive resource allocation algorithm for MU-OFDM is presented. Subcarrier and power allocation are carried out sequentially to reduce the complexity. The low complexity proportional subcarriers allocation is followed by Greedy Power Allocation (GPA) to solve the rate-adaptive resource allocation problem with proportional rate constraints for MU-OFDM systems. It improves the work of Wong et al. in this area by introducing an optimal GPA that achieves approximate rate proportionality, while maximizing the total sum-rate capacity of MU-OFDM. It is shown through simulation that the proposed GPA algorithm performs better than the algorithm of Wong et al., by achieving higher total capacities with the same computational complexity, especially, at larger number of users and roughly satisfying user rate proportionality.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.