0
$\begingroup$

I have a stationary signal from a train of Gaussian pulses. My sampling window is too wide (cannot be reduced). In the example 1 ms. So it is not possible to clearly distinguish one pulse from another.

The advantage is that I can resample the signal several times by moving sampling start with a delay. For example, I sample the signal 5 times, moving 0.2 ms in each one.

I need to build an inverse model that given the sampled signals (the 5 signals below), original signal can be reconstructed.

Is there any algorithm that solves this inverse problem?

sample problem

$\endgroup$
  • $\begingroup$ Maybe you can model the arrival of the pulses as a known process such as a poisson arrival process. Then, if you utilize different sampling patterns, you have a set of observations. Finally, you can utilize an estimation methos such as maximum likelyhood estimation in order to estimate the arrival rate of the previously modeled arrival process. Now that you have a model of the process and a set of observations, you can find the train of pulses that maximizes the consistency between the observations and the arrival process model. $\endgroup$ – strahd Feb 5 at 20:53
0
$\begingroup$

The reconstruction can be done by commutating through each output resulting is a 5 kSps representation of the signal after having been passed through a 5 sample moving-average filter (5 tap FIR with unity gain coefficients). Thus any frequency content above 2.5 KHz will be aliased into the 0 to 2.5 KHz first Nyquist zone, and the overall result will be low pass filtered. Such a moving average filter would have its first null at 1 KHz. By reducing the time delay (and creating proportionally more outputs to commutate) the equivalent sampling rate of the resulting signal can be increased to reduce the aliasing but the first null of the resulting frequency response will always be at 1 KHz (the frequency response will approach a Sinc function as the time delay is reduced).

This is clear by observing the equivalent block diagram of the process below:

Functional Diagram of Process

On each cycle of the 5 kSps clock, the input is fed into each 5 sample moving average filter ($MAF5$) with each filter input delayed by one sample. Once each filter has received 5 samples, the output is decimated by 5, thus providing a new sum over 5 samples, every 5 samples. Each decimated output is offset by one sample. Thus it is clear that each of these outputs is simply the output of the first $MAF5$ after each sample of the 5 kSps clock, as shown in the diagram below.

Equivalent Diagram

The magnitude of the frequency response for this process is shown in the figure below:

Frequency Response

The process will result in distortion from both the aliasing from frequency content above the 2.5 KHz Nyquist Frequency and the frequency response of the 5 sample moving average filter. As stated in the introduction, reducing the delay and increasing the number of outputs will increase the effective sampling rate, thus reducing aliasing distortion, but the first null of the frequency response of the equivalent moving average filter will remain unchanged.

|improve this answer|||||
$\endgroup$
  • $\begingroup$ Thanks. It opened my focus. What is not clear to me is why should I commutate the outputs? This generates the MAF filter with the first null in 1 KHz. $\endgroup$ – Crandel Feb 6 at 15:08
  • $\begingroup$ What generates the null at 1KHz is the 1 ms aperture. If you commutate the outputs then you get access to every output sample from the equivalent MAF, appropriately indexed. Any one output is the decimated version of the same thing at the 1 KSps rate (meaning changes/updates won't occur more frequently regardless of how often you sample each output). So commutating the outputs gets you ALL the information that is available. $\endgroup$ – Dan Boschen Feb 6 at 16:51

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.