I recently needed to understand some detailed timing error detectors for a modem.
I have the books and have implemented a TED before but this algorithm (Gardner's) was new to me to I turned to my current favourite LLM (Chat-GPT v5.1) to explain the algorithm and it saved me hours of reading books. ![]()
If you are stuck understanding an algorithm then I highly recommend this approach as it gives a detailed text based introduction and generates and runs Python code to demonstrate it.
For example: "explain the FFT algorithm" it has provided a great introduction and written a complete FFT function and then compared the results to Numpy. ![]()
In my case, it took 3 attempts to get the code for the TED to compile (it's a complex algorithm) but Chat-GPT automatically detected the errors and kept going until the code ran successfully. ![]()