2009
DOI: 10.1049/el:20092323
|View full text |Cite
|
Sign up to set email alerts
|

Simplified sum-product algorithm for decoding LDPC codes with optimal performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 26 publications
(20 citation statements)
references
References 7 publications
0
19
0
Order By: Relevance
“…Similarly in the proposed MMS, the product of the sign bits of incoming messages is computed using XOR operation (S k ) and the minimum is determined using AND operation (M k ). The check node output message (C k ) is obtained simply by concatenating the resultant sign bit and the magnitude bit, as in (8). The message passing between the nodes continues till the parity check is satisfied or maximum iteration is reached.…”
Section: B) Check Ode Operationmentioning
confidence: 99%
See 2 more Smart Citations
“…Similarly in the proposed MMS, the product of the sign bits of incoming messages is computed using XOR operation (S k ) and the minimum is determined using AND operation (M k ). The check node output message (C k ) is obtained simply by concatenating the resultant sign bit and the magnitude bit, as in (8). The message passing between the nodes continues till the parity check is satisfied or maximum iteration is reached.…”
Section: B) Check Ode Operationmentioning
confidence: 99%
“…The performance of a LDPC decoder predominantly depends on the complexity of the underlying algorithm. High complexity algorithms, such as sum-product, can achieve excellent biterror rate (BER) performance [7] but require massive hardware resources for implementation [8]. Achieving a balanced trade-off between the decoding performance (BER and average iterations/throughput) and implementation complexity (hardware resources) of the LDPC decoders is a critical factor for any practical application.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Although the check node operation of SPA is simplified in the min-sum algorithm, it requires higher quantized messages to be passed between the nodes for decoding [10]. In [11], a simplified sum-product algorithm is proposed with a modification in check node operation. However, the implementation of the algorithm is still complex.…”
Section: Overview Of Ldpc Decodingmentioning
confidence: 99%
“…This can be done by approximating the ln (1+e −|λ| ) operations, for which results lie in the interval (0, ln 2]. The following two-piece linear approximation of [46] is often used…”
Section: Corrected Minimum-sum Algorithmmentioning
confidence: 99%