A Geometric Description of the Iterative Least-Squares Decoding of Analog Block Codes
Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany
Proceedings: TURBO - CODING - 2006
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Hu, Fangning; Henkel, Werner (International University Bremen (IUB), Campus Ring 1, 28759 Bremen, Germany)
Abstract:
This paper outlines that when decoding an arbitrary analog block codes, i.e., a block codes over the complex or real numbers, in an iterative fashion by splitting the H-Matrix in two, leads to a least-squares estimate. Such a Turbo-like algorithm represents iterative projections in Euclidean space. A step size controls the convergence speed. The paper generalized an earlier result based on array codes (product codes) with analog parity-check component codes. The results in here are considered to be an important step towards an intuitive understanding of iterative decoding schemes of conventional Turbo and LDPC codes.