Trellis coding of analog memoryless sources with respect to the squared-error distortion criterion is investigated via simulation. Sources treated are the Gaussian, uniform, Laplacian, and Gaussian mixture models, and the encoding algorithms studied are the Viterbi and

algorithms. Performance versus complexity trade-offs are presented for these source models, and practical aspects of finite encoder memory and unknown source statistics are examined.