2010
DOI: 10.1109/joe.2010.2060810
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient, Time-of-Flight-Based Underwater Acoustic Ranging System for Small Robotic Fish

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 23 publications
(13 citation statements)
references
References 35 publications
0
13
0
Order By: Relevance
“…Consequently, the signal processing approach is not amenable to online implementation. To address this problem, we will use a sliding discrete Fourier transform (SDFT) [46,47] to update the signal amplitude as new data samples come in. This will not only allow us to perform source localization in real time, but will also enable the tracking of a moving dipole source, where the received signal amplitude is time-varying.…”
Section: Discussionmentioning
confidence: 99%
“…Consequently, the signal processing approach is not amenable to online implementation. To address this problem, we will use a sliding discrete Fourier transform (SDFT) [46,47] to update the signal amplitude as new data samples come in. This will not only allow us to perform source localization in real time, but will also enable the tracking of a moving dipole source, where the received signal amplitude is time-varying.…”
Section: Discussionmentioning
confidence: 99%
“…The proof that Q A 1 (Y,Ĝ) + μ sin(ζ) cos(θ) > M 1 when (ρ 1 , ζ) ∈ DE for large enough K 1 is analogous, because for all such points, we have h 1 (ρ 1 ) ≥ h 1 (ρ * 1 +ζ/μ + K 1 ) > 0 when K 1 is large enough, ζ ≤ 0, and nonpositivity of the term in curly braces in (33), and because lim s→+∞ h 1 (s) = +∞. This proves (C1).…”
Section: Adaptive Controlmentioning
confidence: 93%
“…when ρ * 1 > 0 is small enough and μ > 0 is large enough, using the nonnegativity of the term in curly braces in (33) along AB, the fact that 0 < cos(ζ) ≤ cos(ζ) ≤ 1 on H 1 (ρ * 1 ,ζ, K 1 )× H 2 (ρ * 2 ,θ, K 2 ), and the fact that lim s→0 + h 1 (s) = −∞ to use h 1 (ρ * 1 + ζ/μ ) to cancel the effects of the other terms in (33). The proof that Q A 1 (Y,Ĝ) + μ sin(ζ) cos(θ) > M 1 when (ρ 1 , ζ) ∈ DE for large enough K 1 is analogous, because for all such points, we have h 1 (ρ 1 ) ≥ h 1 (ρ * 1 +ζ/μ + K 1 ) > 0 when K 1 is large enough, ζ ≤ 0, and nonpositivity of the term in curly braces in (33), and because lim s→+∞ h 1 (s) = +∞.…”
Section: Adaptive Controlmentioning
confidence: 99%
“…Following [19] a SDFT is applied to the digitally sampled data in real time. The SDFT presents the advantage of being computationally efficient when interested in a specific bin and not the full frequency spectrum of the Discrete Fourier Transform (DFT).…”
Section: Signal Detection and Delay Estimationmentioning
confidence: 99%