I will be presenting Adaptive Local Search at the 802.3 Joint Ad Hoc meeting on 24 June 2026, with a detailed technical presentation at the 802.3 COM Ad Hoc meeting on 23 June 2026.
Local Search was authored by Adee Ran and improved by Adam Gregory in making it modular for n-tap TXFFE, I have introduced Adaptive Local Search which calculates unweighted Manhattan, weighted Manhattan and weighted Euclidean distances between the current and
best candidate.
At the present, with TXFFE sweep being enabled the number of equalization search space combinations is 9.227043 Million which takes around 4 days with Exhaustive Search and around 10 hours with the existing local search.
In a case, the proposed Adaptive Local Search prunes the equalization search space of 9.227043 Million combinations down to 11,907 combinations in reducing run time to 7.10 minutes which earlier took hours while giving negligible difference in the value of
COM.
Attached are the preliminary slides, will share the revised slides on Monday as a few runs are ongoing.
I believe the Local Search approach will benefit the industry by making runtime more manageable. As a pruning/ search routine, it can be incorporated into simulation tools or used during early-stage laboratory validation to identify optimal equalization settings
from millions of possible equalization search space combinations in just a few minutes, significantly reducing analysis time while maintaining accuracy.
Feel free to use this email thread in asking questions.
Regards,
Hansel D'Silva
Standards Development Engineer- Amphenol
To unsubscribe from the STDS-802-3-B400G-OPTX list, click the following link: https://listserv.ieee.org/cgi-bin/wa?SUBED1=STDS-802-3-B400G-OPTX&A=1