Waveform synthesis using list-decoding of codes over the real alphabet

This talk extends the theory of list-decoders to derive bounds on the maximum number of survivor paths required for waveform synthesis using noisy codeword decoding of convolutional codes over the real alphabet. This technique gives a noise shaping far superior to that of the conventional ΣΔ. The talk also proposes an algorithm for designing short list-decoder friendly encoders/filters.