A generalization of enumerative sphere shaping is proposed, which allows efficient implementations of approximate minimum-cost distribution matching. This is made feasible by quantizing the trellis used to enumerate the code words. The quantization controls the storage complexity of the distribution matcher, while its computational complexity is largely independent of the quantization given the rate. Numerical results demonstrate near-optimal performance.
Book / Congress title:
IEEE International Symposium on Information Theory (ISIT)