1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.IT2009
On "A Novel Maximum Likelihood Decoding Algorithm for Orthogonal Space-Time Block Codes"
Ender Ayanoglu
The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.
cs.IT2007★ 1 cited
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
Luay Azzam, Ender Ayanoglu
Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The complexity…