Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Annals of Telecommunications

Time-invariant and switch-type hybrid iterative decoding of low-density parity-check codes

Pirouz Zarrinkhat, Amir H. Banihashemi, Hua Xiao

Published Feb 1, 2005• 10 citations
Publisher
DOI
10.1007/bf03219809

Related papers

Majority-based and hybrid iterative decoding of low-density parity-check codes

Pirouz Zarrinkhat

•Jan 1, 2005•0 citations

Regular and Irregular Low Density Parity Check Codes for Iterative Decoding based on Cycle-invariant Difference Sets

Olgica Milenković, Kiran Prakash, Bane V. Vasic

•Oct 1, 2003•0 citations

Hybrid Hard-Decision Iterative Decoding of Regular Low-Density Parity-Check Codes

Pirouz Zarrinkhat, Amir H. Banihashemi

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/sub TI/) algorithms, and using density evolution show that for regular low-density parity-check (LDPC) codes and binary message-passing algorithms, H/sub TI/ algorithms perform remarkably better than their constituent algorithms. We also show that compared to "switch-type" hybrid (H/sub ST/) algorithms, such as Gallager's algorithm B, where a comparable improvement is obtained by switching between different iterative decoding algorithms, H/sub TI/ algorithms are far less sensitive to channel conditions and thus can be practically more attractive.

IEEE Communications Letters•Apr 1, 2004•12 citations

Hybrid (Multistage) Decoding of Low-density Parity-check Codes

Amir H. Banihashemi, A. Nouh, Pirouz Zarrinkhat

•Oct 2, 2002•0 citations

Hybrid hard-decision iterative decoding of regular low-density parity-check codes

Pirouz Zarrinkhat, Amir H. Banihashemi

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

International Conference on Communications•Jan 1, 2004•5 citations

Improvement of decoding algorithms for low-density parity-check codes

Junho Cho

•Jan 1, 2010•0 citations
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/sub TI/) algorithms, and using density evolution show that for regular low-density parity-check (LDPC) codes and binary message-passing algorithms, H/sub TI/ algorithms perform remarkably better than their constituent algorithms. We also show that compared to "switch-type" hybrid (H/sub ST/) algorithms, such as Gallager's algorithm B, where a comparable improvement is obtained by switching between different iterative decoding algorithms, H/sub TI/ algorithms are far less sensitive to channel conditions and thus can be practically more attractive.
Hybrid decoding is to combine different iterative decoding algorithms with the aim of improving error performance or decoding complexity. In this work, we introduce "time-invariant" hybrid (HTI) algorithms, and show that for regular low-density parity-check codes and binary message-passing algorithms, HTIalgorithms perform remarkably better than their constituent algorithms. We also show that compared to "switch-type" hybrid algorithms, such as Gallager's algorithm B, where a comparable improvement is obtained by switching between different iterative decoding algorithms, HTIalgorithms are far less sensitive to channel conditions and thus can be practically more attractive.