Time — Question 10

Section 1-5 · Physics pages 110–111

Question 10 A short interval hidden inside a wrapping counter A free-running counter cycles through integers 0 to 65 535, then returns to zero. It increments at an exactly calibrated rate f = 1 000 200 s−1. Start and stop channels capture its value as 65000 and 4464, respectively. 65 000 65 535 0 4464 Start capture Stop capture wrap Counter-value sequence for a possible single wrap. Horizontal spacing is schematic; additional complete wraps are not excluded by the two captured values alone. The following model information is supplied: • An initial independent bound says the elapsed time between captures is positive and less than 100 ms. • A later, stronger bound reduces that limit to 20 ms. • The start channel captures 2.0 µs after its physical event; the stop channel captures 8.0 µs after its physical event. Both delays are exact. • For an unwrapped integer count difference N, the true capture interval lies in the conservative bound [(N −1)/f, (N + 1)/f]. This represents unresolved fractional ticks at the two captures; there are no other errors. Use 1 ms = 10−3 s and 1 µs = 10−6 s. (a) Find every unwrapped count difference compatible with the first time bound. Explain why the smallest nonnegative modular difference is not automatically the unique answer. (b) Use the stronger bound to select N. Find the central estimate of the physical event interval, correcting for both the calibrated tick rate and the unequal channel delays. (c) Find the full allowed event-interval bound. Assess a firmware report of exactly 5.000 ms obtained using a nominal 106 ticks per second and ignoring channel delays and fractional ticks.
Show solutionHide solution
Question 10 - Solution A short interval hidden inside a wrapping counter 65 000 65 535 0 4464 Start capture Stop capture wrap (a) Enumerate the possible additional cycles. The smallest nonnegative modular difference is 4464−65000+65536 = 5000 counts. Every candidate is N = 5000 + 65536k, k = 0, 1, 2, . . . . For the less-than-100-ms bound, N = 5000 or 70536 are possible: their central capture intervals are approximately 4.999 ms and 70.522 ms. The next candidate, 136072, gives about 136.045 ms and is excluded even allowing one tick at each interval endpoint as specified. A small modular difference does not reveal how many full counter cycles elapsed. (b) Resolve rollover before correcting the event interval. The less-than-20-ms bound selects N = 5000. The central capture interval is ∆tcap,0 = 5000 1 000 200 s ≈4.999000200 ms. The stop capture is delayed 6 microseconds more than the start capture. Thus capture time exceeds physical event time by that amount: ∆tevent,0 = 5000 f −6.0 µs ≈4.993000200 ms . (c) Retain the unresolved fractional ticks. ∆tfirmware −∆tevent,max = 5.000 ms −4.994 ms = 6.000 µs > 0. The exact model interval is ∆tevent ∈ [4999 f −6.0 µs, 5001 f −6.0 µs ] . Its endpoints are approximately 4.992000400 ms and 4.994000000 ms; the exact expressions define the bound. The half-width is 1/f ≈0.999800 µs. The firmware’s 5.000 ms lies outside this allowed interval. It ignores the calibrated rate, omits the unequal-latency correction, and treats integer capture values as exact event times. Rollover arithmetic alone repairs none of those three errors.

Question 10

A short interval hidden inside a wrapping counter

A free-running counter cycles through integers 0 to 6553565\,535, then returns to zero. It increments at an exactly calibrated rate f=1000200s−1f=1\,000\,200\ \mathrm{s^{-1}}. Start and stop channels capture its value as 65000 and 4464, respectively.

Diagram shown in the original SVG worksheet.

The following model information is supplied:

  • An initial independent bound says the elapsed time between captures is positive and less than 100ms100\ \mathrm{ms}.

  • A later, stronger bound reduces that limit to 20ms20\ \mathrm{ms}.

  • The start channel captures 2.0μs2.0\ \mu\mathrm{s} after its physical event; the stop channel captures 8.0μs8.0\ \mu\mathrm{s} after its physical event. Both delays are exact.

  • For an unwrapped integer count difference NN, the true capture interval lies in the conservative bound [(N−1)/f,(N+1)/f][(N-1)/f,(N+1)/f]. This represents unresolved fractional ticks at the two captures; there are no other errors.

Use 1ms=10−3s1\ \mathrm{ms}=10^{-3}\ \mathrm{s} and 1μs=10−6s1\ \mu\mathrm{s}=10^{-6}\ \mathrm{s}.

  1. Find every unwrapped count difference compatible with the first time bound. Explain why the smallest nonnegative modular difference is not automatically the unique answer.

  2. Use the stronger bound to select NN. Find the central estimate of the physical event interval, correcting for both the calibrated tick rate and the unequal channel delays.

  3. Find the full allowed event-interval bound. Assess a firmware report of exactly 5.000ms5.000\ \mathrm{ms} obtained using a nominal 10610^6 ticks per second and ignoring channel delays and fractional ticks.

Question 10 - Solution

A short interval hidden inside a wrapping counter

Diagram shown in the original SVG worksheet.

(a) Enumerate the possible additional cycles.

The smallest nonnegative modular difference is 4464−65000+65536=50004464-65000+65536=5000 counts. Every candidate is N=5000+65536k,k=0,1,2,….N=5000+65536k,\qquad k=0,1,2,\ldots. For the less-than-100-ms bound, N=5000 or 70536\boxed{N=5000\text{ or }70536} are possible: their central capture intervals are approximately 4.999 ms and 70.522 ms. The next candidate, 136072, gives about 136.045 ms and is excluded even allowing one tick at each interval endpoint as specified. A small modular difference does not reveal how many full counter cycles elapsed.

(b) Resolve rollover before correcting the event interval.

The less-than-20-ms bound selects N=5000N=5000. The central capture interval is Δtcap,0=50001000200s≈4.999000200ms.\Delta t_{{\mathrm{cap}},0}=\frac{5000}{1\,000\,200}\ \mathrm{s} \approx4.999000200\ \mathrm{ms}. The stop capture is delayed 6 microseconds more than the start capture. Thus capture time exceeds physical event time by that amount: Δtevent,0=5000f−6.0μs≈4.993000200ms.\boxed{\Delta t_{{\mathrm{event}},0}=\frac{5000}{f}-6.0\ \mu\mathrm{s} \approx4.993000200\ \mathrm{ms}}.

(c) Retain the unresolved fractional ticks.

Δtfirmware−Δtevent,max=5.000ms−4.994ms=6.000μs>0.\Delta t_{\mathrm{firmware}}-\Delta t_{{\mathrm{event}},\max}=5.000\ \mathrm{ms}-4.994\ \mathrm{ms}=6.000\ \mu\mathrm s>0.

The exact model interval is Δtevent∈[4999f−6.0μs,5001f−6.0μs].\boxed{\Delta t_{\mathrm{event}}\in \left[\frac{4999}{f}-6.0\ \mu\mathrm{s},\frac{5001}{f}-6.0\ \mu\mathrm{s}\right]}. Its endpoints are approximately 4.992000400ms4.992000400\ \mathrm{ms} and 4.994000000ms4.994000000\ \mathrm{ms}; the exact expressions define the bound. The half-width is 1/f≈0.999800μs1/f\approx0.999800\ \mu\mathrm{s}.

The firmware’s 5.000 ms lies outside this allowed interval. It ignores the calibrated rate, omits the unequal-latency correction, and treats integer capture values as exact event times. Rollover arithmetic alone repairs none of those three errors.