Efficient one-pass chase soft-decision BCH decoder for multi-level cell NAND flash memory

BCH codes are adopted in multi-level cell NAND flash memory to increase the storage reliability. Compared with hard-decision decoding of BCH codes, the soft-decision Chase algorithm can achieve significant coding gain by carrying out decoding trials on 2 η test vectors. To reduce the complexity of t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS) s. 1 - 4
Hlavní autoři: Xinmiao Zhang, Jiangli Zhu, Yingquan Wu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.08.2011
Témata:
Computer architecture
Decoding
Logic gates
ISBN:9781612848563, 1612848567
ISSN:1548-3746
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:BCH codes are adopted in multi-level cell NAND flash memory to increase the storage reliability. Compared with hard-decision decoding of BCH codes, the soft-decision Chase algorithm can achieve significant coding gain by carrying out decoding trials on 2 η test vectors. To reduce the complexity of the Chase decoding, a one-pass scheme can be employed to derive the error locators of all test vectors in one run. In this paper, a novel technique is first proposed to reduce the latency and simplify the computation scheduling of the one-pass Chase decoding. Then efficient architectures are developed for the modified one-pass decoding. The hardware complexity of the proposed decoder with η = 4 is analyzed for a (4200, 4096) BCH code. Compared to other soft-decision BCH decoding algorithms, it can achieve much better performance-complexity tradeoff.
ISBN:9781612848563
1612848567
ISSN:1548-3746
DOI:10.1109/MWSCAS.2011.6026354