Huffman coded sphere shaping with short length and reduced complexity

A novel probabilistic shaping architecture is proposed which approximates the optimal sphere-bound while utilizing a Huffman tree and binary mapping/demapping based on look-up-tables. A 100 symbol long DM sequence achieves within 0.2 dB of the infinite length asymptote, and is implemented with a LUT of 100 kbit.