11. Sobre a Implementação de Retículos:
Um Algoritmo de Decodificação/demapeamento Combinados
Lattices are efficient Coded Modulation schemes. The practical implementation
of bounded lattices
deals with a mapping of binary strings into lattice points, decoding noisy
vectors into a lattice point
and demapping it into binary sequences. We introduce a combined demapping-decoding
algorithm for
lattices obtained from any generalized code formula. The process is simplified
by decoding a
noisy vector directly into a binary stream. The aim is to exploit attractive
configurations from
the practical point of view. The algorithm performance is evaluated by simulation:
It is maximum likelihood for lattices from construction A, and it is bounded
distance in any other case.