2022
DOI: 10.1109/tcomm.2022.3156074
|View full text |Cite
|
Sign up to set email alerts
|

Belief Propagation Based Joint Detection and Decoding for Resistive Random Access Memories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…In addition, the GA has also achieved good results in polar code constructions [46][47][48][49]. In [46], the authors proposed a GA-based framework to construct polar codes using the BER as the fitness function of the GA, thereby reducing the size of the SCL list and the number of iterations.…”
Section: Ga Based Decoding Algortithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, the GA has also achieved good results in polar code constructions [46][47][48][49]. In [46], the authors proposed a GA-based framework to construct polar codes using the BER as the fitness function of the GA, thereby reducing the size of the SCL list and the number of iterations.…”
Section: Ga Based Decoding Algortithmsmentioning
confidence: 99%
“…In [47], the authors proposed a scheme for constructing polar codes based on a hash table update population, which reduced the computational complexity of repeated candidates. Aiming at the joint detector and decoder over the resistive random-access memory (ReRAM) channel model, effective polar codes were constructed using the GA in [48].…”
Section: Ga Based Decoding Algortithmsmentioning
confidence: 99%