Abstract

The use of adaptive equalizers at the front end of receivers is becoming a necessity as the data rates increase without channel improvements. Adaptive equalizers can be implemented using data-aided or non-data-aided schemes, with the latter requiring less area and power. Previous non-data-aided adaptive schemes implement an asynchronous analog algorithm where the power spectrum of the received signal is checked for balance around a threshold frequency. Similarly, proposes a digital adaptive algorithm which is based on the detection of specific 5-bit patterns. In all three works, however, adaptation is provided only for equalizers with a single coefficient, which are suitable for well-behaved channels. In contrast, this paper presents a digital adaptive engine for an equalizer with two coefficients: one adjusting the equalizer gain at the Nyquist frequency (f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sub> ) and one at f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</sub> /2. Furthermore, the proposed engine is asynchronous; it can function when driven by a blind clock at the receiver. This is useful as it allows the adaptation process to start even when the CDR has not yet achieved lock. This also avoids a deadlock situation where the CDR and equalizer require simultaneous access to the equalized data and the recovered clock. Our measured results of the proposed adaptive equalizer in 65nm CMOS confirm that the adaptation converges to within 2.6% of the optimal vertical eye opening in less than 400 μs for two different channels at a data rate of 6 Gb/s with a 25,000 ppm frequency offset.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.