2 citations · 2 across the 1 of their papers we have counts for
1 paper
Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu
We propose Dijkstra's algorithm with bounded list size after QR decomposition for decreasing the computational complexity of near maximum-likelihood (ML) detection of signals over…