Clockless time-to-digital converter
Technologies are provided for time-to-digital conversion without reliance on a clocking signal. The technologies include a clockless TDC apparatus that can map continuous pulse-widths to binary bits represented via an iterative chaotic map (e.g., tent map, Bernoulli shift map, or similar). The clockless TDC apparatus can convert separated pulses to a single asynchronous digital pulse that turns on when a sensor detects a first pulse and turns off when the sensor detects a second pulse. The asynchronous digital pulse can be iteratively stretched and folded in time according to the chaotic map. The clockless TDC can generate a binary sequence that represents symbolic dynamics of the chaotic map. The process can be implemented by using an iterative time delay component until a precision of the binary output is either satisfied or overwhelmed by noise or other structural fluctuations of the TDC apparatus.
1. A method comprising:
receiving a first pulse having a first pulse width;
generating a second pulse having a second pulse width, wherein the second pulse width is based on a reference time interval of a first signal processor and based on the first pulse width;
generating a third pulse having a third pulse width, wherein the third pulse width is based on a reference time interval of a second signal processor and based on the second pulse width, wherein the reference time interval of the second signal processor and the reference time interval of the first signal processor are substantially equivalent;
determining, based on the second pulse width, a first bit; and
determining, based on the third pulse width, a second bit.
2. The method of claim 1 , wherein the first signal processor and the second signal processor are arranged in a sequential order.
3. The method of claim 1 , further comprising:
determining, based on the first bit and the second bit, a binary number.
4. The method of claim 3 , wherein the binary number comprises the first bit and the second bit and wherein the first bit is more significant than the second bit.
5. The method of claim 3 , further comprising:
determining, based on the binary number, a quantity of time associated with the first pulse width.
6. A method comprising:
receiving a first pulse having a first pulse width;
generating a second pulse having a second pulse width, wherein the second pulse width is based on a propagation delay of a first signal processor and based on the first pulse width;
generating a third pulse having a third pulse width, wherein the third pulse width is based on a propagation delay of a second signal processor and based on the second pulse width, wherein the propagation delay of the second signal processor and the propagation delay of the first signal processor are substantially equivalent;
determining, based on the second pulse width, a first bit; and
determining, based on the third pulse width, a second bit.
7. The method of claim 6 , wherein the first signal processor and the second signal processor are arranged in a sequential order.
8. The method of claim 6 , further comprising:
determining, based on the first bit and the second bit, a binary number.
9. The method of claim 8 , wherein the binary number comprises the first bit and the second bit and wherein the first bit is more significant than the second bit.
10. The method of claim 8 , further comprising:
determining, based on the binary number, a quantity of time associated with the first pulse width.
11. The method of claim 6 , wherein determining the first bit comprises:
comparing a predetermined time interval with the second pulse width.
12. A method comprising:
receiving a first pulse having a first pulse width;
generating, based on a propagation delay of a component and based on the first pulse width, a second pulse having a second pulse width;
generating, based on the propagation delay of the component and based on the second pulse width, a third pulse having a third pulse width;
determining, based on the second pulse width, a first bit; and
determining, based on the third pulse width, a second bit.
13. The method of claim 12 , further comprising:
determining, based on the first bit and the second bit, a binary number.
14. The method of claim 13 , wherein the binary number comprises the first bit and the second bit and wherein the first bit is more significant than the second bit.
15. The method of claim 13 , further comprising:
determining, based on the binary number, a quantity of time associated with the first pulse width.
16. The method of claim 12 , wherein the first pulse width is based on a fourth pulse and a fifth pulse and wherein a leading edge of the first pulse corresponds to a leading edge of the fourth pulse and a trailing edge of the first pulse corresponds to a leading edge of the second pulse.
17. The method of claim 12 , further comprising:
mapping the second pulse width and the third pulse width to a region of a chaotic map.
18. The method of claim 17 , wherein the chaotic map is a tent map or a Bernoulli shift map.
19. The method of claim 12 , wherein determining the first bit comprises:
comparing a predetermined time interval with the second pulse width.
20. The method of claim 12 , wherein generating the second pulse comprises:
folding the first pulse to shorten the first pulse width; and
stretching the first pulse to lengthen the first pulse width.