5
USING BIT-EDGE EQUALIZATION IN HIGH- SPEED BACKPLANE DATA TRANSMISSION Lei Zhang and Tadeusz Kwasniewski Electronics Department Carleton University Ottawa, ON, Canada [email protected] Abstract— This paper presents an improved bit-edge equalization (BEE) method for mitigating intersymbol interference (ISI) in high-speed backplane applications. Using a least-mean-square (LMS) adaptive algorithm as a receiver (RX) error convergence engine, the proposed BEE method is based on equalizing only the edges of data bits with an adjustment of LMS error derivation points, which in turn changes the error information and affects filter coefficients for pulse amplitude modulation. As a result, the received channel far-end 3-level bit-edge eye diagrams can be optimized. This proposed BEE method employs a conventional symbol-spaced FIR (SSF) filter as transmitter (TX) pre-emphasis for bit-edge equalization. With TX data pre-coding, the received channel far-end 3-level signal to 2-level binary decoding only depends on the current received bit. No error propagation occurs. In this work, the proposed BEE method is compared with the conventional bit-center equalization (BCE) method and the duobinary signaling method. A typical Tyco 34-inch FR4 backplane channel is used as the comparison benchmark. A Matlab script based link simulation tool is used to evaluate the link performance. The simulation results demonstrate that the proposed BEE method is the most effective method for mitigation ISI in relatively high-loss channels. Keywords-bandlimited communication; discrete time filters; intersymbol interference (ISI); jitter; least mean square methods (LMS), pulse amplitude modulation (PAM) I. INTRODUCTION In multi-gigabit chip-to-chip and backplane serial data transmission systems, data rates are limited not by the operating speeds of the circuits in the transceivers but by the bandwidth of the transmission media. Channel impairments such as amplitude attenuation and group-delay distortion cause intersymbol interference (ISI), which is a major factor limiting the maximum transmission length and data rate. Therefore, high-speed data transmission over a band-limited channel needs channel equalization to compensate for the channel frequency-dependent loss, and/or advanced signal processing techniques to compress data spectrum. Recently, 4-level pulse amplitude modulation (PAM-4) and duobinary signal processing techniques have been reported [1]-[4]. PAM-4 reduces the effective symbol rate by a factor of 2 and, thus, lowers the bandwidth requirements of the channel. However, with PAM-4, the signal-to-noise ratio (SNR) is sacrificed in exchange for a narrower bandwidth. In addition, all level transitions in PAM-4 result in large jitter, which is a limiting factor for its application. Duobinary signal processing is another alternative approach to compress the data spectrum by changing the uncorrelated 2-level signal into a correlated 3- level signal. Currently, the duobinary signal processing technique has gained more interest from researchers [3]-[4]. In parallel with the use of advanced signal processing techniques to compress data spectrum, the use of a discrete- time symbol-spaced FIR (SSF) filter for pre-emphasis at the transmit side and/or decision feedback equalization (DFE) at the receive side have been widely used to compensate for the channel frequency-dependent loss [5], [6]. However, conventional SSF and DFE only look at bit centers as the optimal sampling points to generate error correction matrices. Such sampling approach is based on the assumption that the received data eyes are symmetric and peaked at bit centers. But at a high data rate, severe channel group delay distortion is a major factor of jitter, which is another ISI contributor in addition to amplitude attenuation. As a result, the received data eyes are no longer peaked at bit centers, and the eye diagrams are no longer symmetric, as illustrated in Figs. 1 and 2. On the other hand, an FIR filter based on amplitude modulation not only changes pulse amplitudes, but also changes the slopes of the pulse rising and falling edges. Therefore, even though zero forcing received data bit centers is effective in correcting ISI at the sampling points, more jitter could be injected on the transition edges if the data eyes are not symmetric, which results in a reduction in the timing margin. Recent I/O standards such as IEEE 802.3ap have suggested the possibility of equalizing the data transition edges [7]. Previous publications [8]-[11] have shown that edge equalization reduces ISI at bit edges. However, in those previous publications, researchers again took the centers of the bit time periods as the optimal bit center sampling points, and 0.5 unit interval (UI) away from the centers of the bit time periods as the optimal bit edge sampling points. This sampling approach is not true at a high data rate when the received data eyes are no longer peaked at bit centers, and the eye diagrams are no longer symmetric. Thus, neither the bit center equalization nor the bit edge equalization is optimal. The bit-edge equalization (BEE) method proposed in [12] is based on equalizing only the edges of data bits by adjusting the least-mean-square (LMS) error derivation points. In [12], the basic equalization concept of the proposed BEE was presented, and the link performance by using the proposed BEE was Authorized licensed use limited to: Carleton University. Downloaded on June 2, 2009 at 11:11 from IEEE Xplore. Restrictions apply.

USING BIT-EDGE EQUALIZATION IN HIGH- SPEED BACKPLANE …tak/publications/04685108.pdf · USING BIT-EDGE EQUALIZATION IN HIGH-SPEED BACKPLANE DATA TRANSMISSION Lei Zhang and Tadeusz

  • Upload
    others

  • View
    5

  • Download
    0

Embed Size (px)

Citation preview

Page 1: USING BIT-EDGE EQUALIZATION IN HIGH- SPEED BACKPLANE …tak/publications/04685108.pdf · USING BIT-EDGE EQUALIZATION IN HIGH-SPEED BACKPLANE DATA TRANSMISSION Lei Zhang and Tadeusz

USING BIT-EDGE EQUALIZATION IN HIGH-SPEED BACKPLANE DATA TRANSMISSION

Lei Zhang and Tadeusz Kwasniewski Electronics Department

Carleton University Ottawa, ON, Canada

[email protected]

Abstract— This paper presents an improved bit-edge equalization (BEE) method for mitigating intersymbol interference (ISI) in high-speed backplane applications. Using a least-mean-square (LMS) adaptive algorithm as a receiver (RX) error convergence engine, the proposed BEE method is based on equalizing only the edges of data bits with an adjustment of LMS error derivation points, which in turn changes the error information and affects filter coefficients for pulse amplitude modulation. As a result, the received channel far-end 3-level bit-edge eye diagrams can be optimized. This proposed BEE method employs a conventional symbol-spaced FIR (SSF) filter as transmitter (TX) pre-emphasis for bit-edge equalization. With TX data pre-coding, the received channel far-end 3-level signal to 2-level binary decoding only depends on the current received bit. No error propagation occurs. In this work, the proposed BEE method is compared with the conventional bit-center equalization (BCE) method and the duobinary signaling method. A typical Tyco 34-inch FR4 backplane channel is used as the comparison benchmark. A Matlab script based link simulation tool is used to evaluate the link performance. The simulation results demonstrate that the proposed BEE method is the most effective method for mitigation ISI in relatively high-loss channels.

Keywords-bandlimited communication; discrete time filters; intersymbol interference (ISI); jitter; least mean square methods (LMS), pulse amplitude modulation (PAM)

I. INTRODUCTION In multi-gigabit chip-to-chip and backplane serial data

transmission systems, data rates are limited not by the operating speeds of the circuits in the transceivers but by the bandwidth of the transmission media. Channel impairments such as amplitude attenuation and group-delay distortion cause intersymbol interference (ISI), which is a major factor limiting the maximum transmission length and data rate. Therefore, high-speed data transmission over a band-limited channel needs channel equalization to compensate for the channel frequency-dependent loss, and/or advanced signal processing techniques to compress data spectrum. Recently, 4-level pulse amplitude modulation (PAM-4) and duobinary signal processing techniques have been reported [1]-[4]. PAM-4 reduces the effective symbol rate by a factor of 2 and, thus, lowers the bandwidth requirements of the channel. However, with PAM-4, the signal-to-noise ratio (SNR) is sacrificed in exchange for a narrower bandwidth. In addition, all level transitions in PAM-4 result in large jitter, which is a limiting

factor for its application. Duobinary signal processing is another alternative approach to compress the data spectrum by changing the uncorrelated 2-level signal into a correlated 3-level signal. Currently, the duobinary signal processing technique has gained more interest from researchers [3]-[4].

In parallel with the use of advanced signal processing techniques to compress data spectrum, the use of a discrete-time symbol-spaced FIR (SSF) filter for pre-emphasis at the transmit side and/or decision feedback equalization (DFE) at the receive side have been widely used to compensate for the channel frequency-dependent loss [5], [6]. However, conventional SSF and DFE only look at bit centers as the optimal sampling points to generate error correction matrices. Such sampling approach is based on the assumption that the received data eyes are symmetric and peaked at bit centers. But at a high data rate, severe channel group delay distortion is a major factor of jitter, which is another ISI contributor in addition to amplitude attenuation. As a result, the received data eyes are no longer peaked at bit centers, and the eye diagrams are no longer symmetric, as illustrated in Figs. 1 and 2. On the other hand, an FIR filter based on amplitude modulation not only changes pulse amplitudes, but also changes the slopes of the pulse rising and falling edges. Therefore, even though zero forcing received data bit centers is effective in correcting ISI at the sampling points, more jitter could be injected on the transition edges if the data eyes are not symmetric, which results in a reduction in the timing margin.

Recent I/O standards such as IEEE 802.3ap have suggested the possibility of equalizing the data transition edges [7]. Previous publications [8]-[11] have shown that edge equalization reduces ISI at bit edges. However, in those previous publications, researchers again took the centers of the bit time periods as the optimal bit center sampling points, and 0.5 unit interval (UI) away from the centers of the bit time periods as the optimal bit edge sampling points. This sampling approach is not true at a high data rate when the received data eyes are no longer peaked at bit centers, and the eye diagrams are no longer symmetric. Thus, neither the bit center equalization nor the bit edge equalization is optimal.

The bit-edge equalization (BEE) method proposed in [12] is based on equalizing only the edges of data bits by adjusting the least-mean-square (LMS) error derivation points. In [12], the basic equalization concept of the proposed BEE was presented, and the link performance by using the proposed BEE was

Authorized licensed use limited to: Carleton University. Downloaded on June 2, 2009 at 11:11 from IEEE Xplore. Restrictions apply.

Page 2: USING BIT-EDGE EQUALIZATION IN HIGH- SPEED BACKPLANE …tak/publications/04685108.pdf · USING BIT-EDGE EQUALIZATION IN HIGH-SPEED BACKPLANE DATA TRANSMISSION Lei Zhang and Tadeusz

demonstrated. This paper expands upon the previous work in [12] by providing a detailed analytical comparisons of the proposed BEE transceiver architecture with the conventional bit-center equalization (BCE) and duobinary transceiver architectures.

II. BACKPLANE CHANNEL CHARACTERISTICS In this research, a typical Tyco 34’’ (30’’ trace and 2x2”

connector) FR4 backplane channel is used as the working subject, and a Matlab script based on [13] is used as the link simulation tool. Fig. 1 shows the channel amplitude attenuation and group delay distortion characteristics at high frequencies. The group delay distortion reflects the phase dispersion, which is also a major ISI contributor in addition to amplitude attenuation. Fig. 2 shows the channel far end eye diagrams with and without group-delay distortion. The eye diagrams in Fig. 2 demonstrate that group-delay distortion further degrades the far-end eye opening, and the bit-center (BC) and bit-edge (BE) eyes become asymmetrical.

III. THE PROPOSED BIT-EDGE EQUALIZATION METHOD Edge equalization can be used to minimize ISI at zero

crossing transition edges. Based on different error derivation approaches, edge equalization falls into two categories: amplitude-optimized and phase-optimized. The amplitude-optimized edge equalization performs equalization by looking at the amplitudes of data that occur at the bit edges of a data signal and seeks to drive those associated error terms to zero [4], [8]-[9]. Phase-optimized edge equalization is a different way of thinking channel equalization by compensating for phase delay instead of amplitude attenuation. The difficulty in phase-optimized edge equalization is that the reference zero crossing points will shift in time with different data patterns and transmission rates. Therefore, complicated algorithms are required to achieve phase equalization [10], [11].

Using a least-mean-square (LMS) adaptive algorithm as an

error convergence engine, the proposed bit-edge equalization (BEE) method aims to optimize the bit-edge amplitudes by equalizing only the edges of data bits with an adjustment of the LMS error derivation points. This proposed BEE is applied at transmitter (TX) side, and consists of four basic processes: TX pre-coding, defining the desired bit-edge data from the pre-coded data, decoding the received 3-level signal to 2-level binary signal, and optimizing equalization with adjustment of the LMS error derivation points.

A. A Comparison of the Proposed BEE with Conventional Duobinary Signaling

Fig. 3 shows a conceptual illustration of the proposed BEE transceiver with comparisons to the conventional BCE and duobinary transceivers. Unlike the conventional BCE and duobinary signaling methods where the equalizations are done for bit-centers, the proposed BEE method is based on equalizing only the edges of data bits by adjusting LMS error derivation points. This proposed BEE method utilizes a TX pre-coding and decoding scheme that is similar to the differential encoder/decoder for a duobinary partial response channel. However, in the conventional duobinary signaling method, the differential sequence { }ka is first converted into a duobinary sequence { }kc before being transmitted, where

( ) 2/1−+= kkk aac . On the other hand, the proposed BEE method transmits { }ka through the FIR filter and channel directly, and seeks to drive the received bit-edge data at the channel’s far-end to equal to the desired bit-edge data sequence { }kx . { }kx is defined by

⎩⎨⎧

≠=±

=−

1

1 if 0 if 1

kk

kkk aa

aax (1)

With TX pre-coding, the received 3-level BEE signal to 2-level binary decoding depends only on the current received bit. No error propagation occurs. The BEE signal decoding is defined by

⎩⎨⎧

±==

=1 if 0

0 if 1

k

kk x

xb (2)

The proposed BEE eliminates the need for a “delay and add” duobinary filter that has a Z-transform of 11 −+ z as in the conventional duobinary transceiver [3], and is more compatible with the conventional BCE transceiver.

Ampl

itude

At

tenu

atio

n (d

B)

Frequency (Hz) Frequency (Hz)(a) (b)

107 108 109 1010

6.0

6.2

6.4

6.66.8

X10-9

107 108 109 1010

-100-80-60-40-20

0

Gro

up D

elay

(s)

Figure 1. Tyco 34-inch FR4 backplane channel frequency response (a) Amplitude attenuation (b) Group delay distortion

Figure 2. Tyco 34-inch FR4 channel far-end eye diagrams at 3.125Gbps data

rate (a) With group delay distortion (b) Without group delay distortion

Delay T

Input binary

sequence { bk }

{ dk-1}

{ dk} Pulse amplitude modulator

BC

EB

EE,

duob

inar

y

{ ak} TX Pre-emphasis{0,1} {-1,1} {0,1}

Delay T

∑+

+

{ ak} FIR filter

{ ck}

{-1,0,1}

HNyquist(f)H(z) = 1+z-1

FIR filter

{ ak}

duobinaryBEE

FIR filter

{ ak}

BC

E

Sample at t=kT-nd

Ud [k] ADCDout

CKin

CKs

Proposed BEE

Conventional duobinary

Conventional BCEnd =0

Ud [k]

{-1,1}

Ud[k] adaptive to {ck}

nd =0

{-1,0,1}Ud [k]

Ud[k] adaptive to {xk}

{-1,0,1}Ud [k]

{ ak-1}

Ud[k] adaptive to {ak}

Precoding

nd 0.5UI±≈

Figure 3. A conceptual illustration of the proposed BEE transceiver with comparisons to the conventional BCE and duobinary transceivers

Authorized licensed use limited to: Carleton University. Downloaded on June 2, 2009 at 11:11 from IEEE Xplore. Restrictions apply.

Page 3: USING BIT-EDGE EQUALIZATION IN HIGH- SPEED BACKPLANE …tak/publications/04685108.pdf · USING BIT-EDGE EQUALIZATION IN HIGH-SPEED BACKPLANE DATA TRANSMISSION Lei Zhang and Tadeusz

B. Optimizing the Bit-Edge Equalizer There are two basic processes involved in the receiver (RX)

decision feedback adaptive filtering method: a filtering process and an adaptive process. The filtering process consists of computations of the output of a transversal filter produced by a set of tap inputs, and generates an estimation error by comparing this output to a desired response. The adaptive process performs automatic adjustments of the tap coefficients in accordance with the estimation error. Fig. 4 illustrates the adaptive filtering process used in the Matlab simulation.

In Fig. 4, [ ]ku is the distorted data at the channel’s far-end. dn is a data delay relative to the bit center (BC) as shown in

Fig. 2. [ ]kud is the delayed version of [ ]ku . T is the delay operator, where T is equal to one symbol period for an SSF filter. The output of the SSF filter is given by:

[ ] [ ] [ ] ,1

0∑

=

−=N

ndn nkukcky (3)

where k is the k th bit of the data sequence, N is the number of taps, and nc are the tap coefficients. nc are updated using an error convergence algorithm. For LMS criterion:

[ ] [ ] [ ] ,1 kdnn ekukckc μ+=+ (4) where μ is the step size, [ ] [ ]dd nkuku −= , and [ ]ke is the error between the desired data [ ]kx and the actual filter output [ ]ky ,

[ ] [ ] [ ]kykxke −= . As the error is minimized, the tap coefficients are driven to their optimal values.

Using the proposed BEE method, dn is adjusted around UI5.0± away from the bit center where 0=dn . Therefore,

when comparing the received sampling data to the desired bit-edge data { }kx , the error information is modified. This modified error information in turn updates the tap coefficients and optimizes the filter output.

In determining the optimal sampling phase for BEE, dn is iteratively adjusted based on the peak of the iteratively computed equalized pulse response. Theoretically, when the equalized pulse response is symmetric, dn is optimized. However, such an optimization criteria of dn needs intolerably large iteration times. Moreover, in real implementation, the resolution of phase interpolation is constrained by the hardware. Therefore, in this work, the iteration points are limited to 16 per symbol period. Once the optimal BEE coefficients are obtained, a conventional SSF filter can be used as TX pre-emphasis for bit-edge equalization.

IV. SIMULATION RESULTS AND DISCUSSIONS For the purpose of demonstration, the Tyco 34-inch FR4

backplane [13] was used as the transmission channel. A normalized 1Vpp PRBS 1211 − data sequence was transmitted at 10Gbps through the backplane channel. A conventional 5-post-tap SSF filter was applied as transmitter pre-emphasis. Simulations have been performed using the proposed BEE method, the symbol-spaced BCE method, and the conventional duobinary signaling method [3], respectively. A Matlab script based on [13] has been generated and used to obtain the optimal filter tap coefficients. These equalization methods being compared are all based on pulse amplitude modulation.

A. The Effect of Sampling Points on Optimal Eye Opening

Fig. 5 shows the eye diagrams of the received data at the channel’s far-end using the proposed BEE method with adjustments of dn . In Fig. 5(a), UI5.0=dn . The SSF filter samples at ideal bit edges. In Fig. 5(b)-(d), the data sequence is evenly left shifted by 16

1 unit interval (UI) for each step, and in Fig. 5(e)-(g), the data sequence is evenly right shifted by 16

1 unit interval (UI) for each step. Fig. 6 shows the convergence of the error square accordingly. It is interesting to note that when time shifting a data sequence out of the bit-edge time margin, the bit-edge eyes are closed while the bit-center eyes are opened as shown in Fig. 5(c) and (d), which results in big convergence errors as shown in Fig. 6(c) and (d).

Fig. 5 illustrates that when UI167=dn , the channel far-end

bit-edge eye opening is optimized. Further increasing dn could enlarge the bit-edge eye width with a significant reduction in percentage of the bit-edge eye height. This shifting of

dn verifies that at a high data rate, the optimal bit-center sampling points are shifted from the centers of bit time periods,

(b)

(e)(g)

(a)

(c ) (d)

Left Shift Right Shift

(f)

Figure 5. Channel far-end eye diagrams using the proposed bit-edge equalization with dn adjustment

(a) UI16/8=dn (b) UI16/7=dn (c) UI16/6=dn (d) UI16/5=dn

(e) UI16/9=dn (f) UI16/10=dn (g) UI16/11=dn

conventional SSFmodified SSF

Figure 4. LMS adaptive filtering with modified SSF

Authorized licensed use limited to: Carleton University. Downloaded on June 2, 2009 at 11:11 from IEEE Xplore. Restrictions apply.

Page 4: USING BIT-EDGE EQUALIZATION IN HIGH- SPEED BACKPLANE …tak/publications/04685108.pdf · USING BIT-EDGE EQUALIZATION IN HIGH-SPEED BACKPLANE DATA TRANSMISSION Lei Zhang and Tadeusz

(a) (b)

(d)(c)

Figure 8. Data spectrum using the proposed bit-edge equalization with UI16/7=dn (a) Original data spectrum (b) Pre-coded binary data

spectrum (c) Channel near-end data spectrum with pre-emphasis (d) Channel far-end data spectrum

and the optimal bit-edge sampling points are no longer at UI5.0± away from the centers of bit time periods.

Fig. 7 illustrates a comparison of the channel’s far-end eye diagrams using the proposed BEE method with optimal dn , and the conventional BCE and duobinary methods, accordingly.

B. A Comparison of Data Spectrum and Eye Opening Figs. 8-10 are the corresponding data spectrum using the

proposed BEE method, as well as the conventional BCE and duobinary signal processing methods, respectively. By TX pre-emphasizing, the DC and low frequency contents of the data spectrum are reduced while the high frequency contents are emphasized as shown in Figs. 8(c), 9(a), and 10(c). Due to its low-pass characteristics, the backplane channel band limits the transmitted data spectrum, and results in the narrower and attenuated received data spectrum at the channel’s far-end as shown in Figs. 8(d), 9(b), and 10(d). Comparing Figs. 8-10, it can be seen that, with pre-coding and TX pre-emphasis, the channel’s near-end data spectrum using the proposed BEE method has the most DC and low frequency content compared to those using either the BCE or the duobinary signaling method. Therefore, at the channel’s far-end, the received data spectrum using the proposed BEE method is least attenuated by the channel, and the largest signal-to-noise ratio (SNR) is expected. Table I lists the optimal eye width and eye height by

applying these different methods.

C. A Comparison of Channel Frequency Response and Filter Tap Values

Fig. 11 shows the channel frequency response with TX pre-

(a) (b)Figure 9. Data spectrum using symbol-spaced bit-center equalization (a) Channel near-end data spectrum with pre-emphasis (b) Channel far-end

data spectrum

Left Shift Right Shift

(c)

(a)

(e)(f)(g)

(d)(b)

Figure 6. Convergence of error square in the bit-edge equalization with dn adjustment

(a) UI16/8=dn (b) UI16/7=dn (c) UI16/6=dn (d) UI16/5=dn

(e) UI16/9=dn (f) UI16/10=dn (g) UI16/11=dn

(a) (b)

(d)(c)

Figure 10. Duobinary signaling data spectrum (a) Original data spectrum (b) Pre-coded duobinary data spectrum (c) Channel near-end data spectrum with pre-emphasis (d) Channel far-end data spectrum

(a) (b) (c)

BC

BCBE BC

BE

BE

BC

BCBE

Figure 7. A comparison of channel far-end eye diagrams at 10Gbps (a) Using conventional BCE, dn = 0 (b) Using proposed BEE, dn = 7/16UI

(c) Using conventional duobinary, dn = 0

Authorized licensed use limited to: Carleton University. Downloaded on June 2, 2009 at 11:11 from IEEE Xplore. Restrictions apply.

Page 5: USING BIT-EDGE EQUALIZATION IN HIGH- SPEED BACKPLANE …tak/publications/04685108.pdf · USING BIT-EDGE EQUALIZATION IN HIGH-SPEED BACKPLANE DATA TRANSMISSION Lei Zhang and Tadeusz

emphasis using the described methods. The plots in Fig. 11 demonstrate that using the proposed BEE method needs the least high-frequency boost, which can also be represented by the filter tap coefficients as shown in Fig. 12. The normalized tap values are also listed in Table I. Since the proposed bit-edge equalization needs the least high-frequency boost, it allows the use of the smallest sum of absolute tap values. Therefore, when applied to the TX pre-emphasis FIR filter, the proposed BEE is the least peak-power constrained, which is extremely important in low-voltage CMOS implementation.

V. CONCLUSIONS An improved BEE method based on equalizing only the

edges of data bits with adjustment of LMS error derivation points has been presented. In this work, a typical Tyco 34-inch FR4 backplane channel was used as the comparison benchmark. With TX pre-coding, a 5-post-tap conventional SSF filter was applied as TX pre-emphasis for bit-edge equalization. The simulation results verify that at a 10Gbps data rate, due to the sever channel group delay distortion, the received data eyes are no longer peaked at bit centers and the eye diagrams are no longer symmetric, which results in the optimal bit-center and bit-edge sampling points being shifted. With TX pre-coding and pre-emphasis, the channel near-end data spectrum using the proposed BEE has the most DC and low frequency content compared to those using either the bit-center equalization or the conventional duobinary signaling method. At the channel’s far-end, the received data spectrum using the proposed BEE is least attenuated by the channel and needs the least high-frequency boost. Therefore, the proposed BEE is expected to have the largest SNR if the peak power remains the same. In addition, since the proposed BEE needs the least high-frequency boost, which implies a minimal amplification of crosstalk, the proposed BEE method is expected to be more immune to crosstalk than the conventional BCE and duobinary methods.

The simulation results also demonstrate that using the proposed BEE method, the channel far-end bit-edge eye height is enlarged by approximately 57.1% with an 8.4% reduction in eye width compared to the bit-center eye when using the conventional BCE method. In addition, the bit-edge eye height

using the proposed BEE method is enlarged by approximately 76% with an 11.2% reduction in eye width compared to the eye height and width when using the duobinary signaling method. Hence, the proposed BEE method is more suitable for relatively high-loss channels, whereas the duobinary signaling method might be a candidate when channel group delay distortion is a main concern.

REFERENCES [1] J. L. Zerbe et al., “Equalization and clock recovery for a 2.5-10-Gb/s 2-

PAM/4-PAM backplane transceiver cell,” IEEE J. Solid-State Circuits, vol. 38, no. 12, pp. 2121–2130, Dec. 2003.

[2] J. T. Stonick, G. Y. Wei, J. L. Sonntag, and D. K. Weinlader, “An adaptive PAM-4 5-Gb/s backplane transceiver in 0.25µm CMOS,” IEEE J. Solid-State Circuits, vol. 38, no. 3, pp. 436–443, Mar. 2003.

[3] J. H. Sinsky, M. Duelk, and A. Adamiecki, “High-speed electrical backplane transmission using duobinary signaling,” IEEE Trans. Microw. Theory Tech., vol. 53, no. 1, pp. 152–160, Jan. 2005.

[4] K. Yamaguchi et al., “12Gb/s duobinary signaling with x2 oversampled edge equalization,” in IEEE International Solid-State Circuits Conf., 2005, pp. 70–71.

[5] M. Li, T. Kwasniewski, S. J. Wang, and Y. M. Tao, “A 10Gb/s transmitter with multi-tap FIR pre-emphasis in 0.18µm CMOS technology,” in Design Automation Conf., vol. 2, 2005, pp. 679-682.

[6] J. Chen, M. Li, and T. Kwasniewski, “Decision feedback equalization for high-speed backplane data communications,” IEEE International Symposium on Circuits and Systems, vol. 2, 2005, pp. 1274-1277.

[7] B. Brunn, “Edge-equalized NRZ and duobinary,” presented at the IEEE 802.3ap Task Force, Ottawa, Sept. 27-29, 2004.

[8] B. Brunn and S. Anderson, “Edge-equalization extends performance in multi-gigabit serial linfks,” presented at the DesignCon 2005.

[9] K. J. Wong and C. K. Yang, “A serial link transceiver with transition equalization,” 2006 IEEE Int. Solid-State Circuits Conf.

[10] K. J. Wong, E. H. Chen, and C. K. Yang, “Modified LMS adaptation algorithm for a discrete-time edge equalizer of serial I/O,” in IEEE Asian Solid-State Circuit Conf., 2006, pp. 387-390.

[11] J. F. Buckwalter, M. Meghelli, D. J. Friedman, and A. Hajimiri, “Phase and amplitude pre-emphasis techniques for low-power serial links,” IEEE J. Solid-State Circuits, vol. 41, pp. 1391–1399, 2006.

[12] L. Zhang and T. Kwasniewski, “ISI mitigation using bit-edge equalization in high-speed backplane data transmission,” in IEEE International Conference on Communications, Circuits and Systems, 2008, pp. 663-667.

[13] M. Li, S. Wang, Y. Tao and T. Kwasniewski, “FIR filter optimisation as pre-emphasis of high-speed backplane data transmission,” Electronics Letters, vol. 40, no. 14, pp. 912-913, July 2004.

(a) (b) (c)

Figure 12. A comparison of tap coefficient variation (a) Bit-edge equalized (BEE) FIR (b) Bit-center equalized (BCE) FIR (c) Duobinary FIR

(a) (b) (c)

Figure 11. A comparison of channel frequency response (a) Using bit-edge equalization (b) Using bit-center equalization (c) Using duobinary signaling

TABLE I. A SUMMARY OF SIMULATION RESULTS

Method Proposed BEE

Classic BCE [5][13]

Duobinary [3]

Optimal delay dn UI16/7 0 0

main tap 1 1 1 post tap 1 -0.0898 -0.6903 -0.4458 post tap 2 -0.4807 0.1463 -0.2064 post tap 3 0.2178 -0.1340 0.1316 post tap4 -0.1157 0.1356 -0.0177 N

orm

aliz

ed

tap

valu

es

post tap 5 0.0266 -0.0937 -0.0445 Main tap value 34.45 59.60 50.18

Sum of absolute tap values 66.51 131.11 92.63 Eye width (UI) 0.621 0.678 0.699

far-

end

eye

Eye height (V) 0.132 0.084 0.075

Authorized licensed use limited to: Carleton University. Downloaded on June 2, 2009 at 11:11 from IEEE Xplore. Restrictions apply.