On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"
Information Theory
2009-08-08 v4 math.IT
Abstract
The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
Cite
@article{arxiv.0906.1538,
title = {On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"},
author = {Ender Ayanoglu},
journal= {arXiv preprint arXiv:0906.1538},
year = {2009}
}