Rate-reliability-complexity tradeoff for ML and lattice decoding of full-rate codes

@article{Singh2013RatereliabilitycomplexityTF,
  title={Rate-reliability-complexity tradeoff for ML and lattice decoding of full-rate codes},
  author={Arun Kumar Singh and Petros Elia and Joakim Jald{\'e}n},
  journal={2013 IEEE International Symposium on Information Theory},
  year={2013},
  pages={1267-1271}
}
Recent work in [1]-[3] quantified, in the form of a complexity exponent, the computational resources required for ML and lattice sphere decoding to achieve a certain diversity-multiplexing performance. For a specific family of layered lattice designs, and a specific set of decoding orderings, this complexity was shown to be an exponential function in the… CONTINUE READING