On decoding algorithms for construction πA lattices

This paper revisits the Construction π
_A
lattices recently proposed by Huang and Narayanan. This lattice construction is a generalization of the famous Construction A to the multilevel coding setting which preserves most of the structures of Construction A. Decoding algorithms of the Construction π
_A
lattices are then studied. Two low complexity decoders are proposed to take advantage of the additional structure of the Construction π
_A
lattices.