Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ronny Hadani

dblp:42/6665 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2017
0009-0005-6929-1269ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3Computer networks · 1 · 1 first-authorSecurity and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Physical-layer communications · 82% Wireless sensing and localization · 18%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel estimation
0.212013
Delay-Doppler Channel Estimation in Almost Linear Complexity · IEEE Trans. Inf. Theory 2013
Physical-layer communications › channel modeling
delay-doppler domain
0.212013
Delay-Doppler Channel Estimation in Almost Linear Complexity · IEEE Trans. Inf. Theory 2013
Physical-layer communications › signal processing for communications › correlation techniques
autocorrelation
0.112008
The Finite Harmonic Oscillator and Its Applications to Sequences, Communication, and Radar · IEEE Trans. Inf. Theory 2008
Wireless sensing and localization
radar
0.112008
The Finite Harmonic Oscillator and Its Applications to Sequences, Communication, and Radar · IEEE Trans. Inf. Theory 2008
Physical-layer communications › signal design
sequence design
0.112008
The Finite Harmonic Oscillator and Its Applications to Sequences, Communication, and Radar · IEEE Trans. Inf. Theory 2008
Coding theory › sequences
sequence design
0.112008
The Finite Harmonic Oscillator and Its Applications to Sequences, Communication, and Radar · IEEE Trans. Inf. Theory 2008
Physical-layer communications › signal detection
matched filter
0.012013
Delay-Doppler Channel Estimation in Almost Linear Complexity · IEEE Trans. Inf. Theory 2013
Wireless sensing and localization
radar signal processing
0.012013
Delay-Doppler Channel Estimation in Almost Linear Complexity · IEEE Trans. Inf. Theory 2013
Physical-layer communications
signal processing for communications
0.012013
Delay-Doppler Channel Estimation in Almost Linear Complexity · IEEE Trans. Inf. Theory 2013

Methods — techniques the papers use, named apart from their topics

group representation theory · 0.2flag method · 0.2finite field theory · 0.2discrete fourier transform · 0.2
YearPublicationVenuePosition
2017 Orthogonal Time Frequency Space Modulation
abstract
A new two-dimensional modulation technique called Orthogonal Time Frequency Space (OTFS) modulation designed in the delay-Doppler domain is introduced. Through this design, which exploits full diversity over time and frequency, OTFS coupled with equalization converts the fading, time-varying wireless channel experienced by modulated signals such as OFDM into a time-independent channel with a complex channel gain that is roughly constant for all symbols. Thus, transmitter adaptation is not needed. This extraction of the full channel diversity allows OTFS to greatly simplify system operation and significantly improves performance, particular in systems with high Doppler, short packets, and large antenna arrays. Simulation results indicate at least several dB of block error rate performance improvement for OTFS over OFDM in all of these settings. In addition these results show that even at very high Dopplers (500 Km/h), OTFS approaches channel capacity through linear scaling of throughput with the MIMO order, whereas the performance of OFDM under typical design parameters breaks down completely.
Ronny Hadani, Shlomo Rakib, Michail Tsatsanis, Anton Monk, Andrea J. Goldsmith, Andreas F. Molisch, A. Robert Calderbank
WCNC1
2013 Delay-Doppler Channel Estimation in Almost Linear Complexity
abstract
A fundamental task in wireless communication is channel estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, i.e., a signal undergoes only delay and Doppler shifts, a widely used method to compute the delay-Doppler parameters is the matched filter algorithm. It uses a pseudo-random sequence of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computational complexity is O(N2logN). In this paper we introduce a novel approach of designing sequences that allow faster channel estimation. Using group representation techniques we construct sequences, which enable us to introduce a new algorithm, called the flag method, that significantly improves the matched filter algorithm. The flag method finds m delay-Doppler parameters in O(mNlogN) operations. We discuss applications of the flag method to GPS, and radar systems.
Alexander Fish, Shamgar Gurevich, Ronny Hadani, Akbar M. Sayeed, Oded Schwartz
IEEE Trans. Inf. Theory3
2012 Delay-Doppler channel estimation with almost linear complexity: To Solomon Golomb for the occasion of his 80 birthday mazel tov
abstract
A fundamental task in wireless communication is channel estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, a widely used method is the matched filter algorithm. It uses a pseudo-random waveform of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computational complexity is O(N2log(N)). In this paper we introduce a novel approach of designing waveforms that allow faster channel estimation. Using group representation techniques we construct waveforms, which enable us to introduce a new algorithm, called the flag method, that significantly improves the matched filter algorithm. The flag method finds the channel parameters in O(m · N log(N)) operations, for channel of sparsity of order m. We discuss applications of the flag method to GPS, and radar system as well.
Alexander Fish, Akbar M. Sayeed, Shamgar Gurevich, Ronny Hadani, Oded Schwartz
ISIT4
2011 Viewing Angle Classification of Cryo-Electron Microscopy Images Using Eigenvectors
abstract
The cryo-electron microscopy (cryo-EM) reconstruction problem is to find the three-dimensional structure of a macromolecule given noisy versions of its two-dimensional projection images at unknown random directions. We introduce a new algorithm for identifying noisy cryo-EM images of nearby viewing angles. This identification is an important first step in three-dimensional structure determination of macromolecules from cryo-EM, because once identified, these images can be rotationally aligned and averaged to produce "class averages" of better quality. The main advantage of our algorithm is its extreme robustness to noise. The algorithm is also very efficient in terms of running time and memory requirements, because it is based on the computation of the top few eigenvectors of a specially designed sparse Hermitian matrix. These advantages are demonstrated in numerous numerical experiments.
Amit Singer, Zhizhen Zhao 0001, Yoel Shkolnisky, Ronny Hadani
SIAM J. Imaging Sci.4
2008 Group Representation Design of Digital Signals and Sequences
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
SETA2
2008 The Finite Harmonic Oscillator and Its Applications to Sequences, Communication, and Radar
abstract
A novel system, called the oscillator system, consisting of order of p3functions (signals) on the finite field Fp, with p an odd prime, is described and studied. The new functions are proved to satisfy good autocorrelation, cross-correlation, and low peak-to- average power ratio properties. Moreover, the oscillator system is closed under the operation of discrete Fourier transform. Applications of the oscillator system for discrete radar and digital communication theory are explained. Finally, an explicit algorithm to construct the oscillator system is presented.
Shamgar Gurevich, Ronny Hadani, Nir A. Sochen
IEEE Trans. Inf. Theory2