Convergence rates comparison of sum-product decoding of RA codes under different message-passing schedules

In iterative decoding of turbo-like codes, serial schedule generally provides a much faster convergence rate compared with parallel schedule. With the aid of extrinsic information transfer (EXIT) charts, sum-product decoding of repeat accumulate (RA) codes under both message passing schedules is investigated as an example for verifying the above statement.