Parallel Decomposition and Low-Weight Subtrellises
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.
KeywordsParity Check Matrix Code Trellis Weight Profile Linear Block Code Parallel Decomposition
Unable to display preview. Download preview PDF.