An Analysis of the Sum-Product Decoding of Analog Compound Codes
Fangning Hu, Werner Henkel · 2007
We investigate the sum-product decoding on graphs of analog compound codes and show that the iterative decoding can be completely analyzed by tracing the mean vector at each iteration. A novel geometric analysis is proposed to visualize the iterative decoding process in the Euclidean space. Based on this geometric analysis, we propose to decompose the analog compound codes into several orthogonal constituent code spaces to achieve the fastest convergence speed. Simulations are given to verify our conclusions.