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.
Authors
- Domaniç Lavery (ORCID: https://orcid.org/0000-0003-4494-4786)
- Alex Alvarado (ORCID: https://orcid.org/0000-0002-2172-3051)
Institutions
- Infinera (United States) (US)
- Infineon Technologies (Canada) (CA)
- Eindhoven University of Technology (NL)
Publication Details
- Published
- 2025-06-29
- DOI
- https://doi.org/10.23919/oecc/psc62146.2025.11109328
- Primary Topic
- Digital Image Processing Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Royal Academy of Engineering
- University College London
- European Commission
- Engineering and Physical Sciences Research Council