Swapping Algorithms for Combinatorial Optimization of QAM Constellation Labels

A class of algorithms for finding high-performing symbol labellings for QAM constellations is discussed. These algorithms use label swaps as a basic operation, ensuring feasibility of the solution space. We investigate the impact of greediness in local neighbor selection on the computational efficiency of hill climbing algorithms and the quality of their final solutions in comparison with simulated annealing techniques.