| Thread Links | Date Links | ||||
|---|---|---|---|---|---|
| Thread Prev | Thread Next | Thread Index | Date Prev | Date Next | Date Index |
|
Hi,
I will be presenting Adaptive Local Search in 802.3 COM ad hoc on 24th June 2026.
Local Search was authored by Adee and improved by Adam 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.
Local Search is not called out by the Standard and hence a bit hesitant though it makes run time manageable with a negligible impact on the value of COM compared to Exhaustive Search.
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-COM list, click the following link: https://listserv.ieee.org/cgi-bin/wa?SUBED1=STDS-802-3-COM&A=1 |
Attachment:
dsilva_COM_01_260623.pdf
Description: dsilva_COM_01_260623.pdf