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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lin, S., Kasami, T., Fujiwara, T., Fossorier, M. (1998). Parallel Decomposition and Low-Weight Subtrellises. In: Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes. The Springer International Series in Engineering and Computer Science, vol 443. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5745-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5745-6_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7632-3
Online ISBN: 978-1-4615-5745-6
eBook Packages: Springer Book Archive