Algorithm Finding GMI-Optimal Binary Labelings for BICM

An algorithm is presented which finds a GMI-maximizing binary labeling for a given constellation. For 16-ary constellations, the algorithm is five orders of magnitude faster than a brute force search and, therefore, computationally tractable.