Method for enhancing acoustic communications in enclosed spaces using dispersion compensation
AssigneeThe Charles Stark Draper Laboratory, Inc.
InventorStanley R. Shanfield
Life of this patent
Estimating the term…
Abstract
A method for extending the range of acoustic data communication within a fluid enclosed in a pipe, such as in a production petroleum well. The method includes providing an acoustic transmitter and receiver in the pipe separated by a distance d. The transmitter converts the ith data bit into a propagating waveform in the pipe. The propagating waveform is received by the receiver after traversing the distance d. The received propagating waveform for the given data bit is then compensated for dispersion using an adaptive process to find the best statistical fit between the dispersed signal and the known signal shape.
Claims6
A method for extending the range of acoustic data communication within a fluid enclosed in a pipe, comprising:
- a. providing the pipe enclosing the fluid, a transmitter and a receiver, the transmitter and the receiver separated by a given distance;
- b. modulating a given data bit for transmission;
- c. converting the given data bit to an injected, acoustic waveform;
- d. propagating the injected waveform via the enclosed fluid;
- e. receiving the propagating waveform after traversing the given distance;
- f. compensating the received propagating waveform for the given data bit for dispersion including:
- i. computing the injected waveform for a selected propagation time T according to:
- ℑ−1(e−iω(t+T)ℑ(pi(t)))
- ii. convolving the computed injected waveform for the selected propagation time T with the received propagating waveform according to:
- Ci=(∫τ1τ2[∫θ1θ1Δtf1(t)*ft(τ−t)dt]2dτ)1/2
- iii. comparing Ci to previous values of Ci if any for the data bit and determining if Ci is maximized by the selected propagation time T using a statistical optimization algorithm;
- iv. when Ci is not maximized, adjusting the selected propagation time T using the statistical optimization algorithm and repeating steps i-iii;
- and
- v. when Ci is maximized, using Ci to determine the value of the data bit;
- and
- g. repeating steps a through f for a next data bit.
Dependencies are inferred from the claim text.