Résumé: Hybrid decoding means to combine different iterative decoding algorithms with the aim of improving error performance or decoding complexity. In this work, we introduce "time-invariant" hybrid (H<subscript>T<subscript>I) algorithms, and using density evolution show that for regular low-density parity-check (LDPC) codes and binary message-passing algorithms, H<subscript>T<subscript>I algorithms perform remarkably better than their constituent algorithms. We also show that compared to "switch-type" hybrid (H<subscript>S<subscript>T) algorithms, such as Gallager's algorithm B, where a comparable improvement is obtained by switching between different iterative decoding algorithms, H<subscript>T<subscript>I algorithms are far less sensitive to channel conditions and thus can be practically more attractive.

Langue: Anglais