A Novel Search-Based Compute-in-Memory Minimum Values Generation Scheme for Low-Complexity LDPC Min-Sum Decoding

The generation of the minimum values (the first two minima and the index of the minimum) of numerous variable-to-check messages (V2CM) is the major bottleneck in efficient min-sum decoding of low-density parity-check (LDPC) codes. This brief proposed a novel search-based compute-in-memory (CIM) base...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on circuits and systems. II, Express briefs Ročník 71; číslo 7; s. 3498 - 3502
Hlavní autori:	Guo, Zhipeng, Zhang, Deming, Zhang, Kaili, Song, Mingyang, Zhang, Yue, Zeng, Lang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.07.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Associative memory Circuits Complexity compute-in-memory Costs Decoding Delays Error correcting codes Logic gates Low-density parity-check min-sum algorithm minimum values generation Partial discharges Search methods Search problems Transistors
ISSN:	1549-7747, 1558-3791
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!