Abstract
A turbo-like iterative decoding scheme for analogue product codes is described. It is proved that the iterative decoding method is an iterative projection in Euclidean space and converges to the least-squares solution. Using this geometric point of view, any block analogue codes can be decoded by a similar iterative method. The described procedure may serve as a step towards a more intuitive understanding of turbo decoding.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call