Amir Weiss
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Amir Weiss has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Arie Yeredor
School of Electrical Engineering, Tel-Aviv University, Israel
14 shared publicationsMartin Haardt
Communications Research Laboratory, Ilmenau University of Technology, P.O. Box 100565, Ilmenau, D-98684, Germany
9 shared publications- Gregory W. Wornell
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA, USA
8 shared publications Sher Ali Cheema
Communications Research Laboratory, Ilmenau University of Technology
8 shared publications- Arie Yeredor
Tel Aviv University
5 shared publications - Andrew C. Singer
Stony Brook University Stony Brook NY USA
4 shared publications
Latest Publications
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 1566-1570
On the Suboptimality of Rate–Distortion-Optimal Compression: Fundamental Accuracy Limits for Distributed Localization
We derive fundamental accuracy limits for distributed localization when a fusion center has access only to independently rate–distortion (RD)-optimally compressed versions of multi-sensor observations, under a line-of-sight propagation model with a Gaussian wideband waveform. Using the Gaussian RD test-channel model together with a Whittle spectral Fisher-information characterization, we obtain an explicit frequency-domain Cramér–Rao lower bound. A two-band, two-level specialization yields closed-form expressions and reveals a rate-induced regime change: RD-optimal compression under a squared-error distortion measure can eliminate localization-informative spectral content. A simple band-selective scheme can outperform RD compression by orders of magnitude at the same rate, motivating localization-aware compression for networked sensing and integrated sensing and communication systems.
- 26 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 33 (10709908) , 1566-1570
On the Suboptimality of Rate–Distortion-Optimal Compression: Fundamental Accuracy Limits for Distributed Localization
We derive fundamental accuracy limits for distributed localization when a fusion center has access only to independently rate–distortion (RD)-optimally compressed versions of multi-sensor observations, under a line-of-sight propagation model with a Gaussian wideband waveform. Using the Gaussian RD test-channel model together with a Whittle spectral Fisher-information characterization, we obtain an explicit frequency-domain Cramér–Rao lower bound. A two-band, two-level specialization yields closed-form expressions and reveals a rate-induced regime change: RD-optimal compression under a squared-error distortion measure can eliminate localization-informative spectral content. A simple band-selective scheme can outperform RD compression by orders of magnitude at the same rate, motivating localization-aware compression for networked sensing and integrated sensing and communication systems.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 2417-2432
Joint Data Compression and Time-Delay Estimation for Distributed Systems via Extremum Encoding
Motivated by the ubiquity of mobile devices and their potential capabilities as distributed systems (e.g., for localization), we consider a time-delay estimation (TDE) problem in which there are two non-colocated sensors and communication constraints between them. When the communication bandwidth is particularly limited, there is a need for compression techniques that are specifically tailored for the TDE application. For the discrete-time version of this problem, we propose such a joint compression-estimation strategy based on what we term “extremum encoding”, whereby the (time-) index of the maximum of the observed signal in a finite observation window is sent from one sensor to another. Subsequent joint processing of the encoded message with the locally observed, time-delayed, noisy signal gives rise to our proposed time-delay “maximum-index”-based estimator. We analyze the performance of the proposed scheme in the asymptotic regime of large message size and delay spread, but with their ratio fixed. We derive the error probability exponent for this estimator, and its consistency. We validate the analysis via simulations, and further demonstrate the performance gains over traditional alternatives.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 2417-2432
Joint Data Compression and Time-Delay Estimation for Distributed Systems via Extremum Encoding
Motivated by the ubiquity of mobile devices and their potential capabilities as distributed systems (e.g., for localization), we consider a time-delay estimation (TDE) problem in which there are two non-colocated sensors and communication constraints between them. When the communication bandwidth is particularly limited, there is a need for compression techniques that are specifically tailored for the TDE application. For the discrete-time version of this problem, we propose such a joint compression-estimation strategy based on what we term “extremum encoding”, whereby the (time-) index of the maximum of the observed signal in a finite observation window is sent from one sensor to another. Subsequent joint processing of the encoded message with the locally observed, time-delayed, noisy signal gives rise to our proposed time-delay “maximum-index”-based estimator. We analyze the performance of the proposed scheme in the asymptotic regime of large message size and delay spread, but with their ratio fixed. We derive the error probability exponent for this estimator, and its consistency. We validate the analysis via simulations, and further demonstrate the performance gains over traditional alternatives.
- Open Access
Extremum Encoding for Joint Baseband Signal Compression and Time-Delay Estimation for Distributed Systems
The ubiquitous time-delay estimation (TDE) problem becomes nontrivial when sensors are non-co-located and communication between them is limited. Building on the recently proposed "extremum encoding" compression-estimation scheme, we address the critical extension to complex-valued signals, suitable for radio-frequency (RF) baseband processing. This extension introduces new challenges, e.g., due to unknown phase of the signal of interest and random phase of the noise, rendering a naïve application of the original scheme inapplicable and irrelevant. In the face of these challenges, we propose a judiciously adapted, though natural, extension of the scheme, paving its way to RF applications. While our extension leads to a different statistical analysis, including extremes of non-Gaussian distributions, we show that, ultimately, its asymptotic behavior is akin to the original scheme. We derive an exponentially tight upper bound on its error probability, corroborate our results via simulation experiments, and demonstrate the superior performance compared to two benchmark approaches.
Open AccessExtremum Encoding for Joint Baseband Signal Compression and Time-Delay Estimation for Distributed Systems
The ubiquitous time-delay estimation (TDE) problem becomes nontrivial when sensors are non-co-located and communication between them is limited. Building on the recently proposed "extremum encoding" compression-estimation scheme, we address the critical extension to complex-valued signals, suitable for radio-frequency (RF) baseband processing. This extension introduces new challenges, e.g., due to unknown phase of the signal of interest and random phase of the noise, rendering a naïve application of the original scheme inapplicable and irrelevant. In the face of these challenges, we propose a judiciously adapted, though natural, extension of the scheme, paving its way to RF applications. While our extension leads to a different statistical analysis, including extremes of non-Gaussian distributions, we show that, ultimately, its asymptotic behavior is akin to the original scheme. We derive an exponentially tight upper bound on its error probability, corroborate our results via simulation experiments, and demonstrate the superior performance compared to two benchmark approaches.
- Open Access
Achieving Robustness in Blind Modulo Analog-to-Digital Conversion
The need to digitize signals with intricate spectral characteristics often challenges traditional analog-to-digital converters (ADCs). The recently proposed modulo-ADC architecture offers a promising alternative by leveraging inherent features of the input signals. This approach can dramatically reduce the number of bits required for the conversion while maintaining the desired fidelity. However, the core algorithm of this architecture, which utilizes a prediction filter, functions properly only when the respective prediction error is bounded. In practice, this assumption may not always hold, leading to considerable instability and performance degradation. To address this limitation, we propose an enhanced modulo-unfolding solution without this assumption. We develop a reliable detector to successfully unfold the signals, yielding a robust solution. Consequently, the reinforced system maintains proper operation in scenarios where the original approach fails, while also reducing the quantization noise. We present simulation results that demonstrate the superior performance of our approach in a representative setting.
Open AccessAchieving Robustness in Blind Modulo Analog-to-Digital Conversion
The need to digitize signals with intricate spectral characteristics often challenges traditional analog-to-digital converters (ADCs). The recently proposed modulo-ADC architecture offers a promising alternative by leveraging inherent features of the input signals. This approach can dramatically reduce the number of bits required for the conversion while maintaining the desired fidelity. However, the core algorithm of this architecture, which utilizes a prediction filter, functions properly only when the respective prediction error is bounded. In practice, this assumption may not always hold, leading to considerable instability and performance degradation. To address this limitation, we propose an enhanced modulo-unfolding solution without this assumption. We develop a reliable detector to successfully unfold the signals, yielding a robust solution. Consequently, the reinforced system maintains proper operation in scenarios where the original approach fails, while also reducing the quantization noise. We present simulation results that demonstrate the superior performance of our approach in a representative setting.
- 1 July 2024
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 156 (1) , 65-80
A deep learning method for reflective boundary estimation
Environment estimation is a challenging task in reverberant settings such as the underwater and indoor acoustic domains. The locations of reflective boundaries, for example, can be estimated using acoustic echoes and leveraged for subsequent, more accurate localization and mapping. Current boundary estimation methods are constrained to high signal-to-noise ratios or are customized to specific environments. Existing methods also often require a correct assignment of echoes to boundaries, which is difficult if spurious echoes are detected. To evade these limitations, a convolutional neural network (NN) method is developed for robust two-dimensional boundary estimation, given known emitter and receiver locations. A Hough transform-inspired algorithm is leveraged to transform echo times of arrival into images, which are amenable to multi-resolution regression by NNs. The same architecture is trained on transform images of different resolutions to obtain diverse NNs, deployed sequentially for increasingly refined boundary estimation. A correct echo labeling solution is not required, and the method is robust to reverberation. The proposed method is tested in simulation and for real data from a water tank, where it outperforms state-of-the-art alternatives. These results are encouraging for the future development of data-driven three-dimensional environment estimation with high practical value in underwater acoustic detection and tracking.
- 1 July 2024
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 156 (1) , 65-80
A deep learning method for reflective boundary estimation
Environment estimation is a challenging task in reverberant settings such as the underwater and indoor acoustic domains. The locations of reflective boundaries, for example, can be estimated using acoustic echoes and leveraged for subsequent, more accurate localization and mapping. Current boundary estimation methods are constrained to high signal-to-noise ratios or are customized to specific environments. Existing methods also often require a correct assignment of echoes to boundaries, which is difficult if spurious echoes are detected. To evade these limitations, a convolutional neural network (NN) method is developed for robust two-dimensional boundary estimation, given known emitter and receiver locations. A Hough transform-inspired algorithm is leveraged to transform echo times of arrival into images, which are amenable to multi-resolution regression by NNs. The same architecture is trained on transform images of different resolutions to obtain diverse NNs, deployed sequentially for increasingly refined boundary estimation. A correct echo labeling solution is not required, and the method is robust to reverberation. The proposed method is tested in simulation and for real data from a water tank, where it outperforms state-of-the-art alternatives. These results are encouraging for the future development of data-driven three-dimensional environment estimation with high practical value in underwater acoustic detection and tracking.
- Open Access
- 1 March 2023
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 153 (3_suppleme) , A177
On data-driven underwater acoustic direct localization: Design considerations of a deep neural network-based solution
High reverberation, depth-dependent speed of sound and intricate environmental structures are a few of the challenges that make the development of reliable underwater acoustic localization (UAL) methods hard. Since the nontrivial physics of underwater acoustics and the inherent random effects amount to a highly complex statistical model of the measured data, it is natural to consider deep neural networks (NNs) as a central tool in the development of UAL methods. Indeed, recent studies have shown that some properly designed NNs can lead to unprecedented localization capabilities and enhanced accuracy. However, out of the already myriad available possibilities, it is not immediately clear how to choose a proper NN architecture—input structure, layer types, training procedure, loss function(s), etc.—that will lead to successful operation. In this talk, we will present an analytically informed architecture that can learn (for now, in simulations) to localize in complex underwater environments. We will also provide analytical arguments that can explain the robustness of such architectures to certain types of propagation/environment model mismatches. The operation of the discussed architecture will be demonstrated via simulation results in a rich, reverberant channel. The results suggest that deep NNs could become a viable solution to the UAL problem.
- 1 March 2023
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 153 (3_suppleme) , A177
Open AccessOn data-driven underwater acoustic direct localization: Design considerations of a deep neural network-based solution
High reverberation, depth-dependent speed of sound and intricate environmental structures are a few of the challenges that make the development of reliable underwater acoustic localization (UAL) methods hard. Since the nontrivial physics of underwater acoustics and the inherent random effects amount to a highly complex statistical model of the measured data, it is natural to consider deep neural networks (NNs) as a central tool in the development of UAL methods. Indeed, recent studies have shown that some properly designed NNs can lead to unprecedented localization capabilities and enhanced accuracy. However, out of the already myriad available possibilities, it is not immediately clear how to choose a proper NN architecture—input structure, layer types, training procedure, loss function(s), etc.—that will lead to successful operation. In this talk, we will present an analytically informed architecture that can learn (for now, in simulations) to localize in complex underwater environments. We will also provide analytical arguments that can explain the robustness of such architectures to certain types of propagation/environment model mismatches. The operation of the discussed architecture will be demonstrated via simulation results in a rich, reverberant channel. The results suggest that deep NNs could become a viable solution to the UAL problem.
- Open Access
- 1 January 2023
- Published by Acoustical Society of America (ASA) in Proceedings of Meetings on Acoustics
- Vol. 51 (1) , 022002
A gradient-based optimization approach for underwater acoustic source localization
In underwater acoustic localization via matched-field-processing, given a propagation model and a suitable environmental parameterization, one searches for the
- 1 January 2023
- Published by Acoustical Society of America (ASA) in Proceedings of Meetings on Acoustics
- Vol. 51 (1) , 022002
Open AccessA gradient-based optimization approach for underwater acoustic source localization
In underwater acoustic localization via matched-field-processing, given a propagation model and a suitable environmental parameterization, one searches for the
- Open Access
- 1 January 2023
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 153 (1) , 665-677
An architecture for passive joint localization and structure learning in reverberant environments
Passive localization and tracking of a mobile emitter, and joint learning of its reverberant three-dimensional (3D) acoustic environment, where critical structural features are unknown, is a key open problem. Unaccounted-for occluders are potentially present, so that the emitter can lose line-of-sight to the receivers, and can only be observed through its reflected raypaths. The locations of reflective boundaries must therefore be jointly estimated with the emitter's position. A multistage global optimization and tracking architecture is developed to solve this problem with a relatively unconstrained model. Each stage of this architecture establishes domain knowledge such as synchronization and initial environment estimation, which are inputs for the following stages of more refined algorithms. This approach is generalizable to different physical scales and modalities and improves on methods that do not exploit the motion of the emitter. In one stage of this architecture, particle swarm optimization is used to simultaneously estimate the environment and the emitter location. In another stage, a Hough transform-inspired boundary localization algorithm is extended to 3D settings, to establish an initial estimate of the environment. The performance of this holistic approach is analyzed and its reliability is demonstrated in a reverberant watertank testbed, which models the shallow-water underwater acoustic setting.
- 1 January 2023
- Published by Acoustical Society of America (ASA) in The Journal of the Acoustical Society of America
- Vol. 153 (1) , 665-677
Open AccessAn architecture for passive joint localization and structure learning in reverberant environments
Passive localization and tracking of a mobile emitter, and joint learning of its reverberant three-dimensional (3D) acoustic environment, where critical structural features are unknown, is a key open problem. Unaccounted-for occluders are potentially present, so that the emitter can lose line-of-sight to the receivers, and can only be observed through its reflected raypaths. The locations of reflective boundaries must therefore be jointly estimated with the emitter's position. A multistage global optimization and tracking architecture is developed to solve this problem with a relatively unconstrained model. Each stage of this architecture establishes domain knowledge such as synchronization and initial environment estimation, which are inputs for the following stages of more refined algorithms. This approach is generalizable to different physical scales and modalities and improves on methods that do not exploit the motion of the emitter. In one stage of this architecture, particle swarm optimization is used to simultaneously estimate the environment and the emitter location. In another stage, a Hough transform-inspired boundary localization algorithm is extended to 3D settings, to establish an initial estimate of the environment. The performance of this holistic approach is analyzed and its reliability is demonstrated in a reverberant watertank testbed, which models the shallow-water underwater acoustic setting.
- Open Access
- 4 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2296-2302
Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals
We study the potential of data-driven deep learning methods for separation of two communication signals from an observation of their mixture. In particular, we assume knowledge on the generation process of one of the signals, dubbed signal of interest (SOI), and no knowledge on the generation process of the second signal, referred to as interference. This form of the single-channel source separation problem is also referred to as interference rejection. We show that capturing high-resolution temporal structures (nonstationarities), which enables accurate synchronization to both the SOI and the interference, leads to substantial performance gains. With this key insight, we propose a domain-informed neural network (NN) design that is able to improve upon both “off-the-shelf” NNs and classical detection and interference rejection methods, as demonstrated in our simulations. Our findings highlight the key role communication-specific domain knowledge plays in the development of data-driven approaches that hold the promise of unprecedented gains.
- 4 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2296-2302
Open AccessData-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals
We study the potential of data-driven deep learning methods for separation of two communication signals from an observation of their mixture. In particular, we assume knowledge on the generation process of one of the signals, dubbed signal of interest (SOI), and no knowledge on the generation process of the second signal, referred to as interference. This form of the single-channel source separation problem is also referred to as interference rejection. We show that capturing high-resolution temporal structures (nonstationarities), which enables accurate synchronization to both the SOI and the interference, leads to substantial performance gains. With this key insight, we propose a domain-informed neural network (NN) design that is able to improve upon both “off-the-shelf” NNs and classical detection and interference rejection methods, as demonstrated in our simulations. Our findings highlight the key role communication-specific domain knowledge plays in the development of data-driven approaches that hold the promise of unprecedented gains.