This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: S 1 = c 1 h 1 ; namely, • ‚ and • 1 ‚ , corresponding to c 1 = 0 and c 1 = 1 , respectively. At stage 2, there are four possible states derived from S 2 = c 1 h 1 + c 2 h 2 ; and so on. The resulting trellis is given in Figure 1.1. 2 Chapter 1. BCJR Trellis Figure 1.1 BCJR trellis for example code (from [1]). REFERENCES [1] L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory , pp. 284287, Mar. 1974. [2] R. McEliece, “On the BCJR trellis for linear block codes,” IEEE Trans. Inf. Theory , pp. 10721092, July1996....
View
Full
Document
This note was uploaded on 10/10/2009 for the course ECE 637 taught by Professor Staff during the Spring '08 term at Arizona.
 Spring '08
 STAFF

Click to edit the document details