Sciweavers

Share
ADT
2005

Bounds on mutual information for simple codes using information combining

12 years 1 months ago
Bounds on mutual information for simple codes using information combining
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.
Ingmar Land, Simon Huettinger, Peter A. Hoeher, Jo
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2005
Where ADT
Authors Ingmar Land, Simon Huettinger, Peter A. Hoeher, Johannes B. Huber
Comments (0)
books