|
|||||
|
|
Bounds on mutual information for simple codes using information combining |
|
| Authors: | Ingmar Land Simon Huettinger Peter A Hoeher Johannes Huber |
| Affiliation: | 1. Information and Coding Theory Lab, Faculty of Engineering, University of Kiel, Kaiserstrasse 2, D-24143, Kiel, Germany 3. Institute for Information Transmission, University Erlangen-Nürnberg, Cauerstra?e 7/LIT, D-91058, Erlangen, Germany 5. Information and Coding Theory Lab, Faculty of Engineering, University of Kiel, Kaiserstrasse 2, D-24143, Kiel, Germany 6. Institute for Information Transmission, University Erlangen-Nürnberg, Cauerstra?e 7/LIT, D-91058, Erlangen, Germany |
| 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |