activity
20082016
most citedBasis construction for range estimation by phase unwrapping

21 citations · 73 across the 7 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2016★ 9 cited

Selecting wavelengths for least squares range estimation

Assad Akhlaq, Robby McKilliam, Ramanan Subramanian +1

We consider the problem of estimating the distance, or range, between two locations by measuring the phase of multiple sinusoidal signals transmitted between the locations. Traditi…

cs.IT2012★ 2 cited

Finding short vectors in a lattice of Voronoi's first kind

Robby McKilliam, Alex Grant

We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.

cs.IT2011

On the error performance of the lattices

Robby McKilliam, Ramanan Subramanian, Emanuele Viterbo +1

We consider the root lattice and derive explicit formulae for the moments of its Voronoi cell. We then show that these formulae enable accurate prediction of the error probab…

cs.IT2009★ 21 cited

Linear-time nearest point algorithms for Coxeter lattices

Robby G. McKilliam, Warren D. Smith, I. Vaughan L. Clarkson

The Coxeter lattices, which we denote , are a family of lattices containing many of the important lattices in low dimensions. This includes , , and their d…

cs.IT2008★ 17 cited

An Algorithm to Compute the Nearest Point in the Lattice

Robby G. McKilliam, I. Vaughan L. Clarkson, Barry G. Quinn

The lattice is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest…