Advertisement

Parallel Decomposition and Low-Weight Subtrellises

  • Shu Lin
  • Tadao Kasami
  • Toru Fujiwara
  • Marc Fossorier
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 443)

Abstract

A minimal code trellis has the least overall state and branch complexity but is, in general, densely connected. For long codes with large dimensions, it is very difficult to implement any trellis-based MLD algorithm based on a full code trellis on IC (integrated circuit) chip(s) for hardware implementation. To overcome this implementation difficulty, one possible approach is to decompose the minimal trellis diagram of a code into parallel and structurally identical subtrellises of smaller dimensions without cross connections between them so that each subtrellis with reasonable complexity can be put on a single IC chip of reasonable size. This approach is called parallel decomposition.

Keywords

Parity Check Matrix Code Trellis Weight Profile Linear Block Code Parallel Decomposition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Shu Lin
    • 1
  • Tadao Kasami
    • 2
  • Toru Fujiwara
    • 3
  • Marc Fossorier
    • 1
  1. 1.University of Hawaii at ManoaHawaiiUSA
  2. 2.Nara Institute of Science and TechnologyNaraJapan
  3. 3.Osaka UniversityOsakaJapan

Personalised recommendations