On the construction of real number trellis codes

This paper studies the optimization of real number trellis codes without using the decomposition into a binary convolutional encoder and a mapper that transforms binary codewords into modulated signals. A simulated annealing algorithm is used to find the best labeling of a geometrically uniform trellis code on the real field.<
>