An area-efficient BCH codec with echelon scheduling for NAND flash applications

Chi Heng Yang, Yi Hsun Chen, Hsie-Chia Chang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

This paper presents an area-efficient BCH codec with echelon scheduling for NAND flash memory systems. In our proposed design, instead of the common inversionless Berlekamp-Massey algorithm, the BM algorithm using a low-complexity 2-stage composite field divider is applied in the key equation solver. Moreover, by making use of the fact that the degree of error locator polynomial increases at most by 1 in each iteration, an echelon scheduling architecture with 6 finite field multipliers is presented. After implemented in UMC 1P9M 90 nm process, the proposed codec can achieve 385 MHz and 3.08 Gbit/s throughput with 147.8K gate-count from post-layout simulation results.

Original languageEnglish
Title of host publication2013 IEEE International Conference on Communications, ICC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4332-4336
Number of pages5
ISBN (Print)9781467331227
DOIs
StatePublished - 2013
Event2013 IEEE International Conference on Communications, ICC 2013 - Budapest, Hungary
Duration: 9 Jun 201313 Jun 2013

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607

Conference

Conference2013 IEEE International Conference on Communications, ICC 2013
Country/TerritoryHungary
CityBudapest
Period9/06/1313/06/13

Fingerprint

Dive into the research topics of 'An area-efficient BCH codec with echelon scheduling for NAND flash applications'. Together they form a unique fingerprint.

Cite this