Loading...
Please wait, while we are loading the content...
Similar Documents
Bounds on Mutual Information for Simple Codes Using Information Combining
| Content Provider | CiteSeerX |
|---|---|
| Author | Ingmar, L. Huettinger, Simon Hoeher, Peter A. Huber, Johannes |
| Abstract | Abstract — For coded transmission over a memoryless channel, two kinds of mutual information are considered: the mutual information between a code symbol and its noisy observation and the overall mutual information between encoder input and decoder output. The overall mutual information is interpreted as a combination of the mutual informations associated with the individual code symbols. Thus, exploiting code constraints in the decoding procedure is interpreted as combining mutual informations. For single parity check codes and repetition codes, we present bounds on the overall mutual information, which are based only on the mutual informations associated with the individual code symbols. Using these mutual information bounds, we compute bounds on extrinsic information transfer (EXIT) functions and bounds on information processing characteristics (IPC) for these codes. Index Terms — Mutual information, information combining, extrinsic information, concatenated codes, iterative decoding, extrinsic information transfer (EXIT) chart, information processing characteristic (IPC). I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Mutual Information Overall Mutual Information Simple Code Using Information Combining Extrinsic Information Transfer Individual Code Symbol Information Processing Characteristic Extrinsic Information Decoder Output Single Parity Check Code Code Constraint Code Symbol Encoder Input Repetition Code Decoding Procedure Index Term Mutual Information Mutual Information Bound Memoryless Channel Coded Transmission Information Combining Iterative Decoding Noisy Observation |
| Content Type | Text |
