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

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 8; no. 4; pp. 250 - 252
Main Authors: Zarrinkhat, P., Banihashemi, A.H.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.04.2004
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Applied sciences
Broadband communication
Coding, codes
Convergence
Error probability
Exact sciences and technology
Information, signal and communications theory
Iterative algorithms
Iterative decoding
Parity check codes
Partitioning algorithms
Signal and communications theory
Switches
Telecommunications and information theory
Wireless sensor networks
Performance evaluation
hybrid decoding
iterative coding schemes
low-density parity-check (LDPC) codes
Iterative method
message-passing decoding algorithms
Decoding
Density evolution
Algorithm
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2004.827438