Improved random redundant iterative HDPC decoding

An iterative algorithm for soft-input soft-output (SISO) decoding of classical algebraic cyclic block codes is presented below. Inspired by other approaches for high performance belief propagation (BP) decoding, this algorithm requires up to 10 times less computational complexity than other methods...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 57; no. 7; pp. 1982 - 1985
Main Authors: Dimnik, I., Be'ery, Y.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.07.2009
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Applied sciences
Back propagation
Belief propagation
Block codes
Coding, codes
Complexity
Computation
Computational complexity
Decoding
Exact sciences and technology
Information, signal and communications theory
Iterative algorithms
Iterative decoding
Iterative methods
Linear programming
Maximum likelihood decoding
message-passing algorithm
Parity check codes
Performance analysis
permutation group
Permutations
Redundant
Signal and communications theory
soft-decision decoding
Telecommunications and information theory
Performance evaluation
Block code
High performance
Cyclic code
Algebraic code
Iterative method
message-passing algorithm
Algorithm
Computational complexity
Iterative decoding
Credal approach
Message passing
Permutation group
Maximum likelihood
soft-decision decoding
Soft decision
Time complexity
ISSN:0090-6778, 1558-0857
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An iterative algorithm for soft-input soft-output (SISO) decoding of classical algebraic cyclic block codes is presented below. Inspired by other approaches for high performance belief propagation (BP) decoding, this algorithm requires up to 10 times less computational complexity than other methods that achieve similar performance. By utilizing multiple BP decoders, and using random permutation taken from the permutation group of the code, this algorithm reaches near maximum likelihood performance. A computational complexity comparison of the proposed algorithm versus other methods is presented as well. This includes complexity versus performance analysis, allowing one to trade between the former and the latter, according to ones needs.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2009.07.070621