The BCJR trellis and trellis decoders for some BCH codes

Citation
Xa. Wang et Sb. Wicker, The BCJR trellis and trellis decoders for some BCH codes, APPL ALG EN, 9(6), 1999, pp. 521-546
Citations number
27
Categorie Soggetti
Engineering Mathematics
Journal title
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING
ISSN journal
09381279 → ACNP
Volume
9
Issue
6
Year of publication
1999
Pages
521 - 546
Database
ISI
SICI code
0938-1279(199907)9:6<521:TBTATD>2.0.ZU;2-P
Abstract
This paper provides an overview of trellis descriptions for block codes. Th e design and implementation of efficient trellis decoders for the (32, 26) and the (32, 21) BCH codes is then considered in some detail. Minimum edge and vertex counts for the (32, 26) code are derived, and then generalized f or arbitrary extended Hamming codes. A subcode analysis technique is used t o tighten the lower bound on edge complexity for the (32, 21) code. A trell is is then found that satisfies the optimized lower bound with equality.