Cathy Ye Liu

A 1.0625

A 14.025 Gb/s multi-media transceiver employs on-die Rx AC coupling with baseline wander correction and equalizes up to 26 dB insertion loss at 14.025 Gb/s with a linear equalizer, 10-tap DFE, and 4-tap Tx FIR filter in SST driver. The proposed techniques enable direct feedback for 1st-tap ISI cancellation, and positions of four DFE taps to be adapted over the range of 7 to 38 UI. The prototype is realized in 40 nm CMOS, consumes 410 mW at worst case, and has passed 16GFC compliance tests at 14.025 Gb/s.

\sim

This paper presents a two-stage turbo-coding scheme for Reed-Solomon (RS) codes through binary decomposition and self-concatenation. In this scheme, the binary image of an RS code over GF(2/sup m/) is first decomposed into a set of binary component codes with relatively small trellis complexities. Then the RS code is formatted as a self-concatenated code with itself as the outer code and the binary component codes as the inner codes in a turbo-coding arrangement. In decoding, the inner codes are decoded with turbo decoding and the outer code is decoded with either an algebraic decoding algorithm or a reliability-based decoding algorithm. The outer and inner decoders interact during each decoding iteration. For RS codes of lengths up to 255, the proposed two-stage coding scheme is practically implementable and provides a significant coding gain over conventional algebraic and reliability-based decoding algorithms.

14.025 Gb/s Multi-Media Transceiver With Full-Rate Source-Series-Terminated Transmit Driver and Floating-Tap Decision-Feedback Equalizer in 40 nm CMOS

It has long been a challenge to coding theorists to devise an effective and practical soft-decision decoding algorithm for Reed-Solomon (RS) codes. Many attempts have been made and several MLD algorithms have been devised. Unfortunately, these algorithms can only be applied to very short codes, or codes with very small number of parity symbols. Several algebraic soft-decision algorithms based on reliability measures of received symbols have also been proposed. However, these algorithms either provide very small improvement over the pure algebraic decoding algorithms over the practical range of SNR or their decoding complexity grows exponentially with minimum distance of the code. This paper presents a two-stage scheme for turbo decoding RS codes through binary decomposition and self concatenation. This decoding scheme achieves an impressive error performance with a significant reduction in decoding complexity compared to previously proposed MLD algorithms, and can be applied to decode reasonably long RS codes.