TURBOCODING 2003, 3rd International Symposium on Turbo Codes and Related Topics, 1-5 September 2003, Brest, France
We consider LDPC codes with Belief Propagation decoding algorithm for packetized data transmission over block-fading channels. We propose a simple method to reduce the average decoder complexity detecting if successful decoding can be achieved with high probability. We evaluate the average complexity of the proposed algorithm and compare it to that of a conventional decoder in the context of a type II Hybrid-ARQ protocol.
Type:
Conference
City:
Brest
Date:
2003-09-01
Department:
Communication systems
Eurecom Ref:
1174
See also:
