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

Parallelised max-Log-Map model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…All these 2m+1yks, however, share only four values that are symmetrical [6] because every term in (2) is also a function of (Xk5, xkf) pair with possible four combinations being (+ 1, + 1).…”
Section: Applying Distributive Lawmentioning
confidence: 99%
See 1 more Smart Citation
“…All these 2m+1yks, however, share only four values that are symmetrical [6] because every term in (2) is also a function of (Xk5, xkf) pair with possible four combinations being (+ 1, + 1).…”
Section: Applying Distributive Lawmentioning
confidence: 99%
“…A large number of identical simple operations (i.e., addcompare-select) are repeated in sequence for the processing of huge data volume, implying that the algorithm is highly parallelisable [6]. The decoder structure can be simplified because the algorithm is signal-to-noise ratio (SNR) independent [7] [8].…”
Section: Introductionmentioning
confidence: 99%