Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/32051
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wang, H | - |
dc.contributor.author | Fang, J | - |
dc.contributor.author | Li, H | - |
dc.contributor.author | Leus, G | - |
dc.contributor.author | Zhu, R | - |
dc.contributor.author | Gan, L | - |
dc.date.accessioned | 2025-09-26T17:41:03Z | - |
dc.date.available | 2025-09-26T17:41:03Z | - |
dc.date.issued | 2025-07-23 | - |
dc.identifier | ORCiD: Hongwei Wang https://orcid.org/0000-0002-3385-7284 | - |
dc.identifier | ORCiD: Ruixiang Zhu https://orcid.org/0009-0006-7298-1401 | - |
dc.identifier | ORCiD: Lu Gan https://orcid.org/0000-0003-1056-7660 | - |
dc.identifier | Article number: 110205 | - |
dc.identifier.citation | Wang, H. et al. (2026) 'Line spectral estimation with unlimited sensing', Signal Processing, 238, 110205, pp. 1 - 15. doi: 10.1016/j.sigpro.2025.110205. | en_US |
dc.identifier.issn | 0165-1684 | - |
dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/32051 | - |
dc.description | Data availability: Data will be made available on request. | en_US |
dc.description.abstract | In the paper, we consider the line spectral estimation problem in an unlimited sensing framework (USF), where a modulo analog-to-digital converter (ADC) is employed to fold the input signal back into a bounded interval before quantization. Such an operation is mathematically equivalent to taking the modulo of the input signal with respect to the interval. To overcome the noise sensitivity of higher-order difference-based methods, we explore the properties of the first-order difference of modulo samples, and develop two line spectral estimation algorithms based on the first-order difference, which are robust against noise. Specifically, we show that, with a high probability, the first-order difference of the original samples is equivalent to that of the modulo samples. By utilizing this property, line spectral estimation is solved via a robust sparse signal recovery approach. The second algorithms is built on our finding that, with a sufficiently high sampling rate, the first-order difference of the original samples can be decomposed as a sum of the first-order difference of the modulo samples and a sequence whose elements are confined to three possible values. This decomposition enables us to formulate the line spectral estimation problem as a mixed integer linear program that can be efficiently solved. Simulation results show that both proposed methods are robust against noise and achieve a significant performance improvement over the higher-order difference-based method. methods. | en_US |
dc.description.sponsorship | This research was supported by the National Natural Science Foundation of China under Grants No. 62103083. The work of H. Li was supported in part by the National Science Foundation under Grants No. CCF-2316865, ECCS-2212940, and ECCS-2332534. | en_US |
dc.format.extent | 1 - 15 | - |
dc.format.medium | Print-Electronic | - |
dc.language.iso | en_US | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.subject | unlimited sensing | en_US |
dc.subject | line spectral estimation | en_US |
dc.subject | modulo samples | en_US |
dc.title | Line spectral estimation with unlimited sensing | en_US |
dc.type | Article | en_US |
dc.date.dateAccepted | 2025-07-11 | - |
dc.identifier.doi | https://doi.org/10.1016/j.sigpro.2025.110205 | - |
dc.relation.isPartOf | Signal Processing | - |
pubs.publication-status | Published | - |
pubs.volume | 238 | - |
dc.identifier.eissn | 1872-7557 | - |
dc.rights.license | https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.en | - |
dcterms.dateAccepted | 2025-07-11 | - |
dc.rights.holder | Elsevier B.V. | - |
Appears in Collections: | Dept of Electronic and Electrical Engineering Embargoed Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Copyright © 2025 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/ (see: https://www.elsevier.com/about/policies/sharing ). | 1.12 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License