Computational Complexity of Decoding Orthogonal Space-Time Block Codes

Ender Ayanoglu, Erik G. Larsson, Eleftherios Karipidis. Computational Complexity of Decoding Orthogonal Space-Time Block Codes. IEEE Transactions on Communications, 59(4):936-941, 2011. [doi]

@article{AyanogluLK11,
  title = {Computational Complexity of Decoding Orthogonal Space-Time Block Codes},
  author = {Ender Ayanoglu and Erik G. Larsson and Eleftherios Karipidis},
  year = {2011},
  doi = {10.1109/TCOMM.2011.012711.090613},
  url = {http://dx.doi.org/10.1109/TCOMM.2011.012711.090613},
  researchr = {https://researchr.org/publication/AyanogluLK11},
  cites = {0},
  citedby = {0},
  journal = {IEEE Transactions on Communications},
  volume = {59},
  number = {4},
  pages = {936-941},
}