This paper revisits the Construction pi(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 pi(A) lattices are then studied. Two low complexity decoders are proposed to take advantage of the additional structure of the Construction pi(A) lattices.
|Title of host publication||2015 22ND INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT)|
|Number of pages||5|
|State||Published - 2015|
|Event||22nd International Conference on Telecommunications (ICT) - Sydney, Australia|
Duration: 27 Apr 2015 → 29 Apr 2015
|Conference||22nd International Conference on Telecommunications (ICT)|
|Period||27/04/15 → 29/04/15|