Zobrazeno 1 - 10
of 83
pro vyhledávání: '"McKilliam, Robby"'
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. Traditional estimators developed for optical interferometry include the beat
Externí odkaz:
http://arxiv.org/abs/1602.01906
We show that for those lattices of Voronoi's first kind with known obtuse superbasis, a closest lattice point can be computed in $O(n^4)$ operations where $n$ is the dimension of the lattice. To achieve this a series of relevant lattice vectors that
Externí odkaz:
http://arxiv.org/abs/1405.7014
We consider least squares estimators of carrier phase and amplitude from a noisy communications signal that contains both pilot signals, known to the receiver, and data signals, unknown to the receiver. We focus on signaling constellations that have
Externí odkaz:
http://arxiv.org/abs/1301.1760
Autor:
McKilliam, Robby G., Quinn, Barry G., Clarkson, I. Vaughan L., Moran, Bill, Vellambi, Badri N.
Estimating the coefficients of a noisy polynomial phase signal is important in fields including radar, biology and radio communications. One approach attempts to perform polynomial regression on the phase of the signal. This is complicated by the fac
Externí odkaz:
http://arxiv.org/abs/1211.0374
Autor:
McKilliam, Robby, Grant, Alex
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.
Comment: submitted to the 2012 International Symposium on Information T
Comment: submitted to the 2012 International Symposium on Information T
Externí odkaz:
http://arxiv.org/abs/1201.5154
We consider the root lattice $A_n$ and derive explicit formulae for the moments of its Voronoi cell. We then show that these formulae enable accurate prediction of the error probability of lattice codes constructed from $A_n$.
Comment: submitted
Comment: submitted
Externí odkaz:
http://arxiv.org/abs/1111.6334
The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices containing many of the important lattices in low dimensions. This includes $A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider the problem of finding
Externí odkaz:
http://arxiv.org/abs/0903.0673
Publikováno v:
IEEE Transactions on Information Theory, Vol. 54, No. 9, pp 4378-4381, Sept. 2008
The lattice $A_n^*$ is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest lattice point in $A_n^*$ that requires $O(n\log{n})$ arithmetic operat
Externí odkaz:
http://arxiv.org/abs/0801.1364
Publikováno v:
In Acta Astronautica October 2018 151:318-323
