Reliable Bistatic Ranging With Unreliable Communication Payloads
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.
Rosa: We're looking at the paper: "Reliable Bistatic Ranging With Unreliable Communication Payloads".
Dev: Here's the gist of the paper. Reliable ranging using communication data signals that cannot be reliably recovered is addressed by developing a pilot-initialized expectation-maximization (EM) estimator that refines the channel impulse response (CIR) using posterior symbol moments, which establishes asymptotic unbiasedness and an accumulation gain of O(1/M) for estimation error at each delay bin The Challenge in Bistatic Ranging The paper tackles the key challenge in bistatic integrated sensing and communications (ISAC): how to achieve reliable ranging using communication data signals that cannot be reliably recovered In modern communication systems, data payloads typically occupy far more time-frequency resources than pilots, offering substantially more observations to improve sensing accuracy Exploiting them requires recovering the transmitted symbols to form sensing references However, propagation and reflection losses can severely weaken target echoes The sensing receiver may therefore be unable to recover data transmitted at a high rate selected for communication users Limitations of Hard-Decision Processing The authors first show that, at low signal-to-noise ratios (SNRs), using hard symbol decisions as sensing references can introduce a persistent bias in the estimated channel impulse response (CIR) This bias produces an error floor and spurious peaks in the power delay profile (PDP) that persist even after coherent accumulation over a large number of observations The effect on sensing can be seen from the expected PDP In particular, at a non-target delay bin, where gk = 0, this reduces to bk2 + Var(gbk) The EM Estimator Framework To address these challenges, the authors develop an EM-based technique for bistatic ranging with unreliable communication payloads The algorithm treats the payload symbols as latent variables in the standard incomplete-data maximum-likelihood formulation At each iteration, the E-step computes their posterior moments conditioned on the current CIR estimate, and the M-step updates the L-tap CIR using these soft statistics The main contributions are summarized as follows: 1.
Rosa: We characterize the limitations of hard-decision-based bistatic sensing 2.
Dev: We develop a pilot-initialized EM Rx for bistatic ranging with unreliable payloads 3.
Rosa: We establish the local convergence and asymptotic unbiasedness of the proposed Rx Asymptotic Performance Gains The authors establish that the EM method converges to the local maximum-likelihood (ML) solution for a sufficiently large number of OFDM data symbols The converged estimator is asymptotically unbiased, where the CIR estimation mean-square error (MSE) at each delay bin decays as O(1/M) by accumulating M data symbols This demonstrates that estimation error can vanish through sufficient accumulation even while symbol recovery remains highly unreliable Theorem 2 shows that the MSE at each delay bin decreases as asymptotically as 1/M Validation and Conclusion Numerical results further validate the effectiveness of the EM-based bistatic ranging method, demonstrating substantial suppression of spurious range peaks and improved target detection probabilities compared with pilot-only and hard-decision-based sensing The persistent hard-decision-based PDP floor is consistent with a systematic decision-induced bias that is not removed by increasing the number of payload observations The paper concludes that exploiting posterior soft information mitigates decision errors and improves the detection–falsealarm tradeoff APPENDIX A PROOF OF PROPOSITION 1 Taking the conditional expectation of (14) gives E h gb hb0 i − g = σ2 σ2 + Mσ2 p (gb0 − g) + Mσ2 p σ2 + Mσ2 p F H L E h ym ⊙ xb∗ m hb0 i − h The vector in parentheses is ξ defined in (16) denoting the conditional mean error contributed by one harddetected payload symbol on subcarrier n Moreover, lim M→∞ b hb0 = F H L ξ ≠ 0 APPENDIX B PROOF OF LEMMA 1 The proof first establishes local regularity of the likelihood, then shows that the population EM map is locally contractive The true channel is a fixed point of the population EM map APPENDIX C PROOF OF PROPOSITION 2 By (50) and the uniform strong law, sup u∈Θ l o,M(u) − l o(u) = o(1), a.s., where the pilot contribution to l o,M is O(M−1) Since g ∈ Θ, the preceding inequality shows that no point satisfying∥u − g∥ ≥ ϵ can maximize l o,M over Θ Hence, almost surely for all sufficiently large M, gb ML M −→ g, a.s.
Title and authors: Rosa: So we're looking at this paper called "Reliable Bistatic Ranging With Unreliable Communication Payloads." It tackles that big problem in integrated sensing and communications where you can't reliably decode the communication data signals.
Dev: Right, it addresses how to get reliable ranging even when the communication data itself is unreliable. It focuses on using those extra observations from the payload symbols to fix what we know about the channel response, or CIR.
Rosa: Exactly. The authors point out that in modern systems, you have way more data in those payloads than you do in pilots, but recovering those symbols is hard because of losses and reflections weakening the target echoes at the sensing receiver.
Dev: And they show that using hard symbol decisions for sensing references at low signal-to-noise ratios introduces a persistent bias in that channel impulse response. This bias creates an error floor and these spurious peaks in the power delay profile that just don't go away even if you accumulate a lot of data later on.
Taro: That persistence of those errors is something I worry about when we think about real-world failure modes. If we can't shake that bias after accumulating observations, how much confidence do we actually have in the resulting range estimate?
Rosa: Well, the core contribution here is they develop a pilot-initialized expectation maximization estimator. This estimator refines the channel impulse response using posterior symbol moments at each step.
Dev: They frame it as treating those payload symbols as latent variables in a standard maximum likelihood formulation. So, in each iteration of their algorithm, the E-step computes the posterior moments based on what they currently think the channel is like.
Taro: But what's the actual mechanism there? How does this soft information from those unreliable symbols help us fix a problem caused by hard decisions?
Rosa: The M-step then uses those soft statistics—those posterior moments—to update the tap structure of the channel impulse response. It’s a way to use that rich, albeit uncertain, data to push the estimate closer to what it should be.
Dev: The paper claims this leads to two main things: first, they characterize these limitations of hard-decision based bistatic sensing. Second, they develop this pilot-initialized expectation maximization receiver for bistatic ranging with unreliable payloads.
Title and authors: Taro: And what about the performance guarantee? I saw something about asymptotic unbiasedness in their results. Does that mean eventually, if we let the number of payload symbols grow, the estimate gets closer to the true channel?
Rosa: That’s what they show. They prove strong consistency of this estimator and conditional asymptotic unbiasedness for the converged output. This means that as you accumulate more and more payload observations, the estimation bias vanishes.
Dev: And they quantify that vanishing error by saying the CIR estimation mean-square error at each delay bin decays at a rate of one over M, where M is the number of payload OFDM symbols accumulated. That’s an accumulation gain of one over M for those errors.
Taro: So, it means even if symbol recovery remains highly unreliable, just by accumulating enough data—say a large number of payload symbols—the estimation error itself gets smaller at that rate. That's a pretty strong claim given how much uncertainty is involved with the payloads.
Rosa: It really shows that exploiting this posterior soft information mitigates those decision errors and actually improves the detection-false alarm tradeoff when you compare it to just using pilots or hard decisions.
Dev: And they validate this numerically by showing substantial suppression of those spurious range peaks compared to pilot-only or hard-decision based sensing methods. They also confirm that that persistent power delay profile floor we talked about is consistent with a systematic decision-induced bias that simply isn't removed by increasing the number of payload observations.
Taro: So, even with all this accumulation, they still have to deal with some fundamental bias introduced by the initial hard decisions, which doesn't disappear just because you add more symbols. That’s a crucial caveat for practical deployment.
Rosa: Exactly. It highlights that we need a better way to handle that initial uncertainty before we rely solely on massive data accumulation to fix everything down the line.
Dev: So, to wrap up, this paper on "Reliable Bistatic Ranging With Unreliable Communication Payloads" proposes an EM estimator that uses posterior moments from the payload symbols to refine the channel estimate iteratively. This method achieves asymptotic unbiasedness and an error reduction rate of one over M for the channel estimation mean-square error at each delay bin.
Title and authors: Taro: For me, what this means is that we can get a more reliable range estimate in integrated sensing when we have those heavy communication payloads, even if we can't perfectly decode the data symbols themselves right away. It pushes us toward using soft information more effectively.
Rosa: And for me, it means we don't have to rely solely on perfect symbol recovery to get a decent range estimate, which is a big deal when propagation losses are already making the echoes weak.
Dev: I see how this impacts the real-time loops—it suggests that instead of immediately giving up if the payload decoding fails, we can use that partial information to keep refining our sensing loop until we hit that accumulation limit.
Taro: So, the limitation they admit is that this works best when you have a sufficient number of payload observations M, and it doesn't magically fix the fundamental problem of unreliable symbol recovery itself.
Rosa: And for me, I think the implication is that as communication systems get denser with payloads, this kind of data-aided sensing refinement becomes much more important for maintaining accurate ranging.
Dev: So, to summarize this paper on "Reliable Bistatic Ranging With Unreliable Communication Payloads," they introduce an EM estimator that uses posterior symbol moments from the payload symbols to refine the channel estimate iteratively, achieving asymptotic unbiasedness and an error reduction rate of one over M for the channel estimation mean-square error at each delay bin.
Taro: This paper shows that even with unreliable data recovery, just by accumulating enough data, you can reduce the estimation error at a rate of one over M.
Rosa: So, to wrap up this discussion on "Reliable Bistatic Ranging With Unreliable Communication Payloads," it shows that exploiting this posterior soft information mitigates those decision errors and improves the detection-false alarm tradeoff when you compare it to just using pilots or hard decisions.
Dev: It’s a method that helps us keep the range estimate stable even when the communication link is struggling.
Taro: For me, it shows that we can get a more reliable range estimate in integrated sensing when we have those heavy communication payloads, even if we can't perfectly decode the data symbols themselves right away.
Rosa: And for me, it means we don't have to rely solely on perfect symbol recovery to get a decent range estimate, which is a big deal when propagation losses are already making the echoes weak.
The paper's summary: Rosa: So, this paper is about getting reliable ranging when you can't actually read the communication data signals because of losses or reflections in bistatic sensing systems.
Dev: Right, it focuses on using those extra payload symbols to fix what we know about the channel response, which they call the CIR.
Rosa: The main takeaway is that they developed this expectation maximization estimator that uses posterior symbol moments to refine the channel estimate step by step.
Dev: They show that this approach leads to asymptotic unbiasedness and an error reduction rate of one over M for each delay bin, where M is the number of payload symbols you accumulate.
Rosa: So, even if you can't perfectly decode the symbols right away, if you just keep adding more observations, the estimation error itself gets smaller at that rate.
Dev: That’s what they mean by it vanishing through sufficient accumulation. It means the system stays accurate even when symbol recovery is poor.
Rosa: They also address that problem of persistent bias in the power delay profile caused by using hard decisions, which they claim this method suppresses compared to just using hard symbols or pilots alone.
Dev: The results show substantial suppression of those spurious range peaks, which is better for target detection probabilities overall. It means less noise in the sense data.
Rosa: What this changes for us is that we don't have to wait for perfect symbol recovery before we can get a decent range estimate in integrated sensing scenarios.
Dev: It suggests that exploiting that soft information from the payloads mitigates decision errors and actually improves the detection false alarm tradeoff when you compare it to traditional methods.
Rosa: But there's still a catch, though, because they admit that this works best with a sufficiently large number of payload observations M.
Dev: Exactly. The method doesn't magically fix the fundamental problem of unreliable symbol recovery itself; it just manages the estimation error better after you accumulate enough data points.
Rosa: So, for us working on field robots or any system where the environment is unpredictable, this tells us that we can keep refining our sensing loop until we hit that accumulation limit to get a more stable range.
Dev: It's a method that helps keep the range estimate stable even when the communication link is struggling. What I want to look at next is how this contrasts with other estimation techniques, especially those dealing with very noisy environments.
The paper's improvements: Rosa: So, we're talking about how this paper suggests improvements to that original idea of using those unreliable communication payloads for bistatic ranging.
Dev: It’s about taking the basic EM estimator and making it more robust when dealing with the real mess of imperfect symbol recovery.
Rosa: They suggest focusing on a pilot-initialized setup, which means you get a better starting point before you even start using those heavy payload data points.
Dev: That initialization helps because it grounds the estimation process, making the subsequent refinement steps more stable and less likely to wander off into garbage.
Rosa: They're also pushing for an iterative refinement where the E-step uses posterior moments conditioned on a current channel estimate, and then the M-step updates the channel based on those soft statistics.
Dev: The implication there is that this structured update process is what prevents those hard decision biases from sticking around in the power delay profile. It cleans up that floor we talked about earlier.
Rosa: So, it's not just about adding more data; it’s about *how* you use the data you already have to iteratively correct your thinking of what the channel is doing.
Dev: That iterative correction is key for real-time loops because it gives us a path toward a better safety case—a way to know when the estimate is trustworthy enough to make a decision.
Rosa: And they emphasize that by using these soft statistics, you get better detection false alarm tradeoffs, which means we can find targets more reliably even when the communication link is noisy.
Dev: The paper essentially says that if we treat the payload data as soft information instead of hard decisions, the system gets a lot more resilient to those real-world signal degradations.
Rosa: It shifts the focus from just "can I decode this symbol?" to "what information can I extract from this noisy observation, even if it's not a perfect symbol?"
Dev: That’s the big shift for controls engineers—it suggests that relying on the underlying statistical moments rather than just binary decisions is a viable way to maintain loop performance under uncertainty.
Rosa: But they also warn us about the accumulation limit we touched on before, meaning this refinement only works as long as you have enough data points M to stabilize that error decay rate of one over M.
Dev: So, the improvement isn't magic; it’s a controlled statistical process that guarantees better performance *given* you have enough observations to let the accumulation work its magic.
Rosa: It means for field testing, we need to be careful about how long we run the system before we hit that M limit and start seeing performance plateau.
Dev: Exactly. The safety case for this method is that it provides a quantifiable error decay rate even when symbol recovery is poor, which is much better than just hoping the raw sensing data gets clean enough on its own.
Conclusion: Tom: So we're wrapping up this look at "Reliable Bistatic Ranging With Unreliable Communication Payloads." Essentially, this paper proposes an expectation maximization estimator that uses posterior symbol moments from unreliable data to get a better channel estimate for ranging.
Rosa: Right, so the big picture is getting reliable ranging even when the communication data itself isn't perfectly recoverable.
Dev: They showed that by treating those payload symbols as latent variables and using their soft statistics in an iterative way, you can achieve asymptotic unbiasedness for the channel estimation at each delay bin.
Rosa: That means if you keep accumulating those symbols, the estimate eventually settles down to the true channel response without a persistent bias floor.
Dev: The practical implication is that this method helps us maintain sensing accuracy even when symbol recovery remains highly unreliable in a real-world scenario. It’s about robustness through accumulation.
Taro: I wonder if this works well outside the lab environment, Rosa, and how long it takes to get those M symbols to make the difference.
Rosa: That's a fair question, Taro. The paper doesn't give us specific field deployment numbers for how long it lasts in harsh conditions or exactly what M is needed for practical scenarios.
Dev: I agree with Rosa, we need more data on the latency and loop rate implications of this EM process. If the loop needs to run fast, we have to know if this estimation step adds too much delay.
Taro: From an autonomy standpoint, if the world misbehaves—say, unexpected reflections pop up—how gracefully does this estimator recover its estimate? Does it just stay biased until M gets really huge?
Rosa: The authors flag that the method’s performance is highly dependent on having a sufficient number of observations M to reach that asymptotic limit. It doesn't guarantee instant correction when things go totally wrong.
Dev: So, the safety case for this relies on predicting how long we can keep accumulating symbols before we hit the accuracy floor, which is a necessary caveat for real-time control systems.
Taro: It’s less about instantaneous recovery and more about achieving a stable estimate once you have enough data to trust it. It’s a convergence problem, not an immediate fix for every single bad reflection.
Rosa: So, to wrap up this discussion on "Reliable Bistatic Ranging With Unreliable Communication Payloads," the paper shows that exploiting this posterior soft information mitigates decision errors and improves the detection false alarm tradeoff compared to using just pilots or hard decisions.
Dev: It’s a method that helps keep the range estimate stable even when the communication link is struggling, provided you have enough data accumulation M.
Taro: For me, it shows that we can get a more reliable range estimate in integrated sensing when we have those heavy communication payloads, even if we can't perfectly decode the data symbols themselves right away.
Rosa: And for me, it means we don't have to rely solely on perfect symbol recovery to get a decent range estimate, which is a big deal when propagation losses are already making the echoes weak.
Dev: It’s a method that helps us keep the range estimate stable even when the communication link is struggling. But we still need more research into how this performs under extreme noise conditions outside of clean simulation.
Fangping Yu, Fan Liu, Yifeng Xiong, Jie Yang, Lei Xie, Shi Jin
Southeast University
eess.SP
Submitted: 2026-11-05
Updated: 2026-11-05
Comments: 13 pages, 7 figures, submitted to IEEE for possible publication
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 92/100
The gist: Reliable ranging using communication data signals that cannot be reliably recovered is addressed by developing a pilot-initialized expectation-maximization (EM) estimator that refines the channel…
Key concepts
- Bistatic Ranging
- This involves determining the distance to a target using signals received by two separate sensors. The challenge is making this ranging reliable when the communication data used for reference cannot be perfectly recovered due to signal losses.
- Expectation-Maximization (EM) Estimator
- This is an iterative algorithm used to estimate unknown parameters, like the channel impulse response (CIR). It treats the unrecoverable communication symbols as 'latent variables' and refines the CIR estimate in each step by using statistical moments of those symbols.
- Power Delay Profile (PDP) Bias
- Hard-decision processing introduces a persistent error floor and spurious peaks in the PDP, especially at non-target delay bins. The EM approach mitigates this bias by using soft statistics from the payload, leading to cleaner range estimates.
Terminology
Summary
Reliable ranging using communication data signals that cannot be reliably recovered is addressed by developing a pilot-initialized expectation-maximization (EM) estimator that refines the channel impulse response (CIR) using posterior symbol moments, which establishes asymptotic unbiasedness and an accumulation gain of O(1/M) for estimation error at each delay bin
The Challenge in Bistatic Ranging
The paper tackles the key challenge in bistatic integrated sensing and communications (ISAC): how to achieve reliable ranging using communication data signals that cannot be reliably recovered In modern communication systems, data payloads typically occupy far more time-frequency resources than pilots, offering substantially more observations to improve sensing accuracy Exploiting them requires recovering the transmitted symbols to form sensing references However, propagation and reflection losses can severely weaken target echoes The sensing receiver may therefore be unable to recover data transmitted at a high rate selected for communication users
Limitations of Hard-Decision Processing
The authors first show that, at low signal-to-noise ratios (SNRs), using hard symbol decisions as sensing references can introduce a persistent bias in the estimated channel impulse response (CIR) This bias produces an error floor and spurious peaks in the power delay profile (PDP) that persist even after coherent accumulation over a large number of observations The effect on sensing can be seen from the expected PDP In particular, at a non-target delay bin, where gk = 0, this reduces to bk2 + Var(gbk)
The EM Estimator Framework
To address these challenges, the authors develop an EM-based technique for bistatic ranging with unreliable communication payloads The algorithm treats the payload symbols as latent variables in the standard incomplete-data maximum-likelihood formulation At each iteration, the E-step computes their posterior moments conditioned on the current CIR estimate, and the M-step updates the L-tap CIR using these soft statistics The main contributions are summarized as follows:
-
We characterize the limitations of hard-decision-based bistatic sensing
-
We develop a pilot-initialized EM Rx for bistatic ranging with unreliable payloads
-
We establish the local convergence and asymptotic unbiasedness of the proposed Rx
Asymptotic Performance Gains
The authors establish that the EM method converges to the local maximum-likelihood (ML) solution for a sufficiently large number of OFDM data symbols The converged estimator is asymptotically unbiased, where the CIR estimation mean-square error (MSE) at each delay bin decays as O(1/M) by accumulating M data symbols This demonstrates that estimation error can vanish through sufficient accumulation even while symbol recovery remains highly unreliable Theorem 2 shows that the MSE at each delay bin decreases as asymptotically as 1/M
Validation and Conclusion
Numerical results further validate the effectiveness of the EM-based bistatic ranging method, demonstrating substantial suppression of spurious range peaks and improved target detection probabilities compared with pilot-only and hard-decision-based sensing The persistent hard-decision-based PDP floor is consistent with a systematic decision-induced bias that is not removed by increasing the number of payload observations The paper concludes that exploiting posterior soft information mitigates decision errors and improves the detection–falsealarm tradeoff
APPENDIX A
PROOF OF PROPOSITION 1
Taking the conditional expectation of (14) gives E h gb hb0 i − g = σ2 σ2 + Mσ2 p (gb0 − g) + Mσ2 p σ2 + Mσ2 p F H L E h ym ⊙ xb∗ m hb0 i − h The vector in parentheses is ξ defined in (16) denoting the conditional mean error contributed by one harddetected payload symbol on subcarrier n Moreover, lim M→∞ b hb0 = F H L ξ ≠ 0
APPENDIX B
PROOF OF LEMMA 1
The proof first establishes local regularity of the likelihood, then shows that the population EM map is locally contractive The true channel is a fixed point of the population EM map
APPENDIX C
PROOF OF PROPOSITION 2
By (50) and the uniform strong law, sup u∈Θ l o,M(u) − l o(u) = o(1), a.s., where the pilot contribution to l o,M is O(M−1) Since g ∈ Θ, the preceding inequality shows that no point satisfying∥u − g∥ ≥ ϵ can maximize l o,M over Θ Hence, almost surely for all sufficiently large M, gb ML M −→ g, a. p. 9s.
APPENDIX D
PROOF OF THEOREM 1
Condition on the initialization event E By Lemma 1, gb (∞) M agrees almost surely with gb ML M for all sufficiently large M
APPENDIX E
PROOF OF THEOREM 2
The proof compares the converged EM estimator with the local MLE Substituting (120) proves (37) The paper is supported by references [1] through [35]
REFERENCES
[1] Z. Wei et al., “Integrated sensing and communication signals toward 5G-A and 6G: A survey,” IEEE Internet Things J. p. 0, vol. 10, no. 13, pp. 11068–11092, 2023
[2] F. Liu, Y. Cui, C. Masouros, J. Xu, T. X. Han, Y. C Eldar, and S Buzzi “Integrated sensing and communications: Toward dual-functional wireless networks for 6G and beyond” IEEE J Sel Areas Commun. p. 0, vol 40 no 6 pp 1728–1767 Jun 2022
[3] B Paul, A R Chiriyath, and D W Bliss “Survey of RF communications and sensing convergence research” IEEE Access vol 5 pp 252–270 2017
[4] J A Zhang, F Liu, C Masouros, R W Heath Jr, Z Feng L Zheng, and A Petropulu “An overview of signal processing techniques for joint communication and radar sensing” IEEE J Sel Topics Signal Process. vol 15 no 6 pp 1295–1315 Nov 2021
[5] F Liu, C Masouros, A P Petropulu, H Griffiths, and L Hanzo “Joint radar and communication design: Applications state-of-the-art and the road ahead” IEEE Trans Commun. vol 68 no 6 pp 3834–3862 2020
[6] S Lu et al. “Integrated sensing and communications: Recent advances and ten open challenges” IEEE Internet Things J. p. 0, vol 11 no 11 pp 19094–19120 2024
[7] F Liu, L Zheng, Y Cui, C Masouros, A P Petropulu, H Griffiths, and Y C Eldar “Seventy years of radar and communications: The road from separation to integration” IEEE Signal Process. Mag. vol 40 no 5 pp 106–121 2023
[8] W Zhou, R Zhang, G Chen, and W Wu “Integrated sensing and communication waveform design: A survey” IEEE Open J Commun Soc. vol 3 pp 1930–1949 2022
[9] S P Chepuri, N Shlezinger, F Liu, G C Alexandropoulos, S Buzzi, and Y C Eldar “Integrated sensing and communications with reconfigurable intelligent surfaces: From signal modeling to processing” IEEE Signal Process. Mag. vol 40 no 6 pp 41–62 2023
[10] C Sturm, T Zwick, and W Wiesbeck “An OFDM system concept for joint radar and communications operations” in Proc IEEE 69th Veh Technol. Conf (VTC Spring) Barcelona Spain 2009 pp 1–5
[11] C Sturm and W Wiesbeck “Waveform design and signal processing aspects for fusion of wireless communications and radar sensing” Proc IEEE vol 99 no 7 pp 1236–1259 Jul 2011
[12] M Braun “OFDM radar algorithms in mobile communication networks” Ph.D dissertation Karlsruhe Institute of Technology Karlsruhe Germany 2014
[13] Y Liu, G Liao, Y Chen, J Xu, and Y Yin “Super-resolution range and velocity estimations with OFDM integrated radar and communications waveform” IEEE Trans Veh Technol. vol 69 no 10 pp 11659–11672 2020
[14] Y Liu, G Liao, Z Yang, and J Xu “Design of integrated radar and communication system based on MIMO-OFDM waveform” J Syst Eng Electron. vol 28 no 4 pp 669–680 2017
[15] F Liu, Y Xiong, S Lu, S Li, W Yuan, C Masouros, S Jin, and G Caire “Uncovering the iceberg in the sea: Fundamentals of pulse shaping and modulation design for random ISAC signals” IEEE Trans Signal Process. vol 73 pp 2511–2526 2025
[16] S Lu, F Liu, F Dong, Y Xiong, J Xu, Y-F Liu, and S Jin “Random ISAC signals deserve dedicated precoding” IEEE Trans Signal Process. vol 72 pp 3453–3469 2024
[17] D Brunner et al. “Bistatic OFDM-based ISAC with over-the-air synchronization: System concept and performance analysis” IEEE Trans Microw. p. 2 Theory Techn. vol 73 no 5 pp 3016–3029 May 2025
[18] M Henninger, L Giroto, A Elkelesh, and S Mandelli “Hybrid resource allocation scheme for bistatic ISAC with data channels” 2026 arXiv:2601.11110
[19] M F Keskin, S Mura, M Mizmizi, D Tagliaferri, and H Wymeersch “Bridging the gap via data-aided sensing: Can bistatic ISAC converge to genie performance?” in Proc IEEE Radar Conf (RadarConf25) 2025 pp 514–519
[20] M F Keskin, S Mura, M Mizmizi, D Tagliaferri, F Liu, and H Wymeersch “Bistatic ISAC under data payload uncertainty” 2026 arXiv:2610.05527
[21] T Riihonen and K E Kolodziej “Full-duplex ISAC” in Integrated Sensing and Communications F Liu C Masouros, and Y C Eldar Eds Singapore Springer 2023 pp 537–565
[22] A Tang, X Wang, and J A Zhang “Interference management for full-duplex ISAC in B5G/6G networks: Architectures challenges and solutions” IEEE Commun Mag. vol 62 no 9 pp 20–26 2024
[23] Z Zhang, X Chai, K Long, A V Vasilakos, and L Hanzo “Full duplex techniques for 5G networks: Self-interference cancellation protocol design and relay selection” IEEE Commun Mag. vol 53 no 5 pp 128–137 2015
[24] J Zhou, T H Chuang, T Dinc, and H Krishnaswamy “Integrated wideband self-interference cancellation in the RF domain for FDD and full-duplex wireless” IEEE J Solid State Circuits vol 50 no 12 pp 3015–3031 2015
[25] M Chung, M S Sim, J Kim, D K Kim, and C-B Chae “Prototyping real-time full duplex radios” IEEE Commun Mag. vol 53 no 9 pp 56–63 2015
[26] L G de Oliveira et al. “Bistatic OFDM-based joint radarcommunication: Synchronization data communication and sensing” in Proc 20th Eur Radar Conf (EuRAD) Berlin Germany 2023 pp 359–362
[27] I Valiulahi, C Masouros, and A P Petropulu “ISAC super-resolution receiver via lifted atomic norm minimization” IEEE Trans Commun. vol 74 pp 5184–5198 2026
[28] L Xie, F Liu, S Song, and S Jin “Bistatic target detection by exploiting both deterministic pilots and unknown random data payloads” IEEE Trans Wireless Commun. 2026 early access
[29] M Hatami, N T Nguyen, and M Juntti “Beamforming and filter design for bistatic ISAC under known and unknown transmit symbols” to appear in Proc IEEE Int Workshop Signal Process Artif Intell Wireless Commun SPAWC 2026
[30] A P Dempster, N M Laird, and D B Rubin “Maximum likelihood from incomplete data via the EM algorithm” J Roy Stat Soc Ser B vol 39 no 1 pp 1–38 1977
[31] T K Moon “The expectation-maximization algorithm” IEEE Signal Process. Mag. vol 13 no 6 pp 47–60 Nov 1996
[32] A Ladaycia, A Belouchrani, K Abed-Meraim, and A Mokraoui “Semi-blind MIMO-OFDM channel estimation using expectation maximisation like techniques” IET Commun. vol 13 no 20 pp 3452–3462 2019
[33] R A Redner and H F Walker “Mixture densities maximum likelihood and the EM algorithm” SIAM Rev. vol 26 no 2 pp 195–239 Apr 1984
[34] X Ma, H Kobayashi, and S C Schwartz “EM-based channel estimation algorithms for OFDM” EURASIP J Appl Signal Process. vol 2004 no 10 pp 1460–1477 2004
[35] S Balakrishnan, M J Wainwright, and B Yu “Statistical guarantees for the EM algorithm: From population to sample-based analysis” Ann Statist. vol 45 no 1 pp 77–120 Feb 2017
--- Page 1 ---
Reliable Bistatic Ranging With Unreliable Communication Payloads
Fangping Yu, Fan Liu, Senior Member, IEEE, Yifeng Xiong, Member, IEEE, Jie Yang, Member, IEEE Jie Yang M is with the National Mobile Communications Research Laboratory F. Yu is with the School of Information Science and Engineering Southeast University Nanjing 210096 China e-mail yu fangping@seu. p. 0edu.cn F Liu is with the National Mobile Communications Research Laboratory Southeast University Nanjing 210096 China e-mail fan. p. 0liu@seu.edu.cn J Yang and S Jin are with the National Mobile Communications Research Laboratory and the Frontiers Science Center for Mobile Information Communication and Security Southeast University Nanjing 210096 China e-mail yangjie@seu. p. 0edu.cn; jinshi@seu. p. 0edu.cn Y Xiong is with the Department of Communication Engineering Beijing University of Posts and Telecommunications Beijing 100876 China e-mail yifengxiong@bupt. p. 0edu.cn L Xie is with the School of Cyber Science and Engineering Southeast University Nanjing 210096 China e-mail leixie@seu. p. 0edu.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Reliability of ranging under unreliable communication payloads: The improved system can achieve reliable bistatic ranging even when communication data signals cannot be reliably recovered by using a pilot-initialized expectation maximization EM estimator that iteratively refines the channel impulse response using posterior symbol moments.
-
Mitigation of persistent bias in power delay profile: The system will eliminate the
error floor and spurious peaks in the power delay profile (PDP) that persist even after coherent accumulation over a large number of observations
caused by hard-decision processing, leading to substantially higher target detection probabilities compared to pilot-only or hard-decision-based methods. -
Asymptotic performance scaling: The system will demonstrate that estimation error can vanish through sufficient accumulation, as the
CIR estimation mean-square error (MSE) at each delay bin decays as O(1/M) by accumulating M data symbols,
which maintains sensing accuracy even when symbol recovery remains highly unreliable.
Sources
Related papers
- Open-H-RF: A Large-Scale Ultrasound Raw Channel Dataset Initiative
- Scalable Attention for 5G NR Channel Estimation
- Low-Altitude Wireless Networks: A Comprehensive Survey
- Sensing-Assisted OFDM with Index Modulation: A Waveform for Optical Wireless Integrated Communication and Localisation
- Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM
- A Foundation Model for Large-Scale Wireless Network Planning, Operation and Optimization