Ronny Hadani
Computing the Matched Filter in Linear Time.
Thu, 12/22/2011 - 15:01 — SomNambulAuthors: Shamgar Gurevich, Ronny Hadani, Alexander Fish, Oded Schwartz, Akbar Sayeed
Subjects: Information Theory
AbstractA fundamental problem in wireless communication is the time-frequency shift
(TFS) problem: Find the time-frequency shift of a signal in a noisy
environment. The shift is the result of time asynchronization of a sender with
a receiver, and of non-zero speed of a sender with respect to a receiver. A
classical solution of a discrete analog of the TFS problem is called the
matched filter algorithm. It uses a pseudo-random waveform S(t) of the length
p, and its arithmetic complexity is O(p^{2} \cdot log (p)), using fast Fourier
transform.- Read more
- 18 comments
- login or register to post comments
Representation theoretic patterns in three dimensional Cryo-Electron Microscopy I - The intrinsic reconstitution algorithm.
Mon, 10/19/2009 - 13:48 — SomNambulAuthors: Ronny Hadani, Amit Singer
Subjects: Representation Theory
AbstractIn this paper, we describe and study a mathematical framework for
cryo-elecron microscopy. The main result, is a a proof of the admissability
(correctness) and the numerical stability of the intrinsic reconstitution
algorithm which was introduced by Singer and Shkolnisky in [7]. In addition, we
explain how the various numerical observations reported in that work, follow
from basic representation theoretic principles.Representation theoretic patterns in three dimensional Cryo-Electron Microscopy I - The intrinsic reconstitution algorithm.
Mon, 10/19/2009 - 13:48 — SomNambulAuthors: Ronny Hadani, Amit Singer
Subjects: Representation Theory
AbstractIn this paper, we describe and study a mathematical framework for
cryo-elecron microscopy. The main result, is a a proof of the admissability
(correctness) and the numerical stability of the intrinsic reconstitution
algorithm which was introduced by Singer and Shkolnisky in [7]. In addition, we
explain how the various numerical observations reported in that work, follow
from basic representation theoretic principles.Quantization of symplectic vector spaces over finite fields.
Fri, 08/21/2009 - 19:51 — SomNambulAuthors: Shamgar Gurevich, Ronny Hadani
Subjects: Representation Theory
AbstractIn this paper, we construct a quantization functor, associating a complex
vector space H(V) to a finite dimensional symplectic vector space V over a
finite field of odd characteristic. As a result, we obtain a canonical model
for the Weil representation of the symplectic group Sp(V). The main new
technical result is a proof of a stronger form of the Stone-von Neumann
property for the Heisenberg group.Quantization of symplectic vector spaces over finite fields.
Fri, 08/21/2009 - 19:51 — SomNambulAuthors: Shamgar Gurevich, Ronny Hadani
Subjects: Representation Theory
AbstractIn this paper, we construct a quantization functor, associating a complex
vector space H(V) to a finite dimensional symplectic vector space V over a
finite field of odd characteristic. As a result, we obtain a canonical model
for the Weil representation of the symplectic group Sp(V). The main new
technical result is a proof of a stronger form of the Stone-von Neumann
property for the Heisenberg group.
User login
