On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"
classification
💻 cs.IT
math.IT
keywords
algorithmblockcodesdecodinglikelihoodmaximumorthogonalspace-time
read the original abstract
The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.