Bounds on information combining for the accumulator of repeat-accumulate codes without Gaussian assumption

Information combining is applied to an accumulator to obtain bounds on the extrinsic information transfer (EXIT) functions without relying on Gaussian or other approximations for the distribution of the a-priori messages.

[1]  Johannes B. Huber,et al.  Bounds on information combining , 2005, IEEE Transactions on Information Theory.

[2]  J. Huber,et al.  Bounds on information combining for parity-check equations , 2004, International Zurich Seminar on Communications, 2004.

[3]  Shlomo Shamai,et al.  Extremes of information combining , 2005, IEEE Transactions on Information Theory.