Interleaved trellis coded modulation and decoder optimizations for 10 Gigabit ethernet over copper

Yongru Gu, Keshab K. Parhi

Research output: Contribution to journalArticlepeer-review


There were several modulation and coding proposals for 10GBASE-T (10 Gigabit Ethernet over copper) systems. One of these is based on a 10-level pulse amplitude modulation (PAM-10) combined with a 4D (four-dimensional) 8-state trellis code similar to the one in 1000BASE-T (1000 Megabit Ethernet over copper). The trellis code can be used in a conventional manner as in 1000BASE-T, but the corresponding decoder with a long critical path needs to operate at 833 MHz. It is difficult to meet the critical path requirements of such a decoder. To solve the problem, two interleaved trellis coded modulation schemes are proposed in this paper. The inherent decoding speed requirements can be relaxed by factors of 4 and 2, respectively. Due to intersymbol interference (ISI), the branch metric units in the decoders corresponding to the two interleaved modulation schemes are much more complicated than those in the conventional decoder. Thus this paper also considers the problem of complexity reduction of the decoders for the two proposed interleaved modulation schemes, and presents two novel complexity reduction schemes. Simulation results show that the error-rate performances of the two proposed interleaved schemes are quite close to that of the conventional scheme. It is also shown that the performance loss due to complexity reduction is negligible.

Original languageEnglish (US)
Pages (from-to)211-221
Number of pages11
JournalJournal of VLSI Signal Processing Systems for Signal, Image, and Video Technology
Issue number3
StatePublished - Mar 1 2006


  • 10 Gigabit ethernet
  • Complexity reduction
  • High speed
  • Interleaving
  • Trellis coded modulation

Fingerprint Dive into the research topics of 'Interleaved trellis coded modulation and decoder optimizations for 10 Gigabit ethernet over copper'. Together they form a unique fingerprint.

Cite this