Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Bit vs. Symbol Interleaving for Parallel Concatenated Trellis Coded Modulation
 
conference paper

Bit vs. Symbol Interleaving for Parallel Concatenated Trellis Coded Modulation

Fragouli, C.  
•
Wesel, R.D.
2001
GLOBECOM'01. IEEE Global Telecommunications Conference
IEEE Global Telecommunications Conference (GlobeCom 2001)

This paper compares bit versus symbol interleaving for parallel-concatenated trellis-coded turbo codes, employing the turbo encoder structure proposed in Benedetto et al., (1996). To compare systems optimized with the same techniques, the paper extends the turbo-encoder design procedure proposed in Fragouli et al. (2001), to bit-interleaved systems. We discuss a method to jointly design the multiple required interleavers for the bit-interleaved system, and a procedure to select constituent encoders that can take advantage of the interleaver structure to achieve a low error floor. Simulation results for the designed bit-interleaved system show better performance than bit-interleaved performance reported in the literature. The symbol-interleaved system though achieves an earlier convergence, especially with an increased number of decoder iterations, but at the cost of a slightly higher error floor.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

turbo_4.pdf

Access type

openaccess

Size

91.06 KB

Format

Adobe PDF

Checksum (MD5)

2a80d4e1660d2760da637973414aeee6

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés