Results 191 to 200 of about 116,736 (210)

On Lovász’ lattice reduction and the nearest lattice point problem

Combinatorica, 1986
This is the full version of the author's paper announced in Lect. Notes Comput. Sci. 182, 13-20 (1985; Zbl 0569.10015).
László Babai
exaly   +4 more sources

Polynomial-phase estimation, phase unwrapping and the nearest lattice point problem

2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers, 2009
Polynomial-phase signals have attracted significant interest due to their applicability to radar, sonar, geophysics, and radio communication. In this paper we introduce a new technique for estimating the parameters of polynomial phase signals. The parameters are estimated by performing phase unwrapping in a least squares manner.
McKilliam, Robby G., Clarkson, I. Vaughan L., Quinn, Barry G., Moran, Bill   +3 more
exaly   +6 more sources

Frequency estimation, phase unwrapping and the nearest lattice point problem

1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999
In this paper, we examine the relationship between frequency estimation and phase unwrapping and a problem in algorithmic number theory known as the nearest lattice point problem. After briefly reviewing the theory of these three topics, we introduce an interpretation of the maximum likelihood frequency estimation problem as a nearest lattice point ...
I. Vaughan L. Clarkson
exaly   +4 more sources

On Lovász' lattice reduction and the nearest lattice point problem

, 1984
Answering a question of Vera Sos, we show how Lovasz' lattice reduction can be used to find a point of a given lattice, nearest within a factor of cd (c = const.) to a given point in Rd. We prove that each of two straightforward fast heuristic procedures achieves this goal when applied to a lattice given by a Lovasz-reduced basis.
László Babai
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Interactive Nearest Lattice Point Search in a Distributed Setting: Two Dimensions

IEEE Transactions on Communications, 2022
Vinay A Vaishampayan, Maiara F Bollauf
exaly  

Nonstandard continualization of 1D lattice with next-nearest interactions. Low order ODEs and enhanced prediction of the dispersive behavior

Mechanics of Advanced Materials and Structures, 2022
Jose Fernandez-Saez, Ramon Zaera
exaly  

Low order nonstandard continualization of a beam lattice with next-nearest interactions: Enhanced prediction of the dynamic behavior

Mechanics of Advanced Materials and Structures, 2022
Ramon Zaera
exaly  

A practical approach to the 2D incremental nearest-point problem suitable for different point distributions

Pattern Recognition, 2008
Andrej Brodnik, Borut Žalik
exaly  

Clipping algorithms for solving the nearest point problem over reduced convex hulls

Pattern Recognition, 2011
Jose R Dorronsoro
exaly  

An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$

IEEE Transactions on Information Theory, 2008
Robby G Mckilliam, I Vaughan L Clarkson, Barry G Quinn   +2 more
exaly