Use of The Error Vector Magnitude for low-complex bit loading in Orthogonal Frequency Division Multiplexing

摘要

This paper deals with the adaptive bit loading of Orthogonal Frequency Division Multiplexing. The use of Error Vector Magnitude in greedy algorithm as well as in the particle swarm optimization is discussed. The results are evaluated using the MATLAB simulation. The use of Error Vector Magnitude can avoid the use of complex bit error rate calculation or channel state information measurements.