Computer Science – Information Theory
Scientific paper
2006-11-20
Computer Science
Information Theory
5 pages, minor revisions, to be presented at the 2007 IEEE Int'l Symposium on Information Theory
Scientific paper
Generalized Tanner graphs have been implicitly studied by a number of authors under the rubric of generalized parity-check matrices. This work considers the conditioning of binary hidden variables in such models in order to break all cycles and thus derive optimal soft-in soft-out (SISO) decoding algorithms. Conditionally cycle-free generalized Tanner graphs are shown to imply optimal SISO decoding algorithms for the first order Reed-Muller codes and their duals - the extended Hamming codes - which are substantially less complex than conventional bit-level trellis decoding. The study of low-complexity optimal SISO decoding algorithms for the family of extended Hamming codes is practically motivated. Specifically, it is shown that exended Hamming codes offer an attractive alternative to high-rate convolutional codes in terms of both performance and complexity for use in very high-rate, very low-floor, serially concatenated coding schemes.
Chugg Keith M.
Halford Thomas R.
No associations
LandOfFree
Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-120567