闪存BCH译码器并行钱搜索的研究与改进

发布时间：2018-11-10 15:21

【摘要】：钱搜索是与非型闪速(NAND flash)存储器中BCH译码器的重要组成部分,并行钱搜索延迟较小并可高速运行,但过高的复杂度制约了其的应用。为了降低并行钱搜索的复杂度,提出一种并行钱搜索的改进和优化方法。首先对传统并行钱搜索以及有关文献进行了分析和研究;然后对公共子表达式的搜索范围进行了扩展,并合并了相关计算;最后对迭代匹配算法进行了改进,提出一种基于二维搜索的改进迭代匹配算法。实验结果表明,本文方法取得了较好的优化效果,有效地降低了并行钱搜索的复杂度;在对BCH(2 047,1 926,11)的32bit并行钱搜索优化后,与传统并行钱搜索以及有关文献的两种并行钱搜索相比,本文方法的优化率分别达到了85.4%、38.7%和29.2%,并可以更好地适应不同并行度和不同纠错能力的并行钱搜索结构。
[Abstract]:Money search is an important part of BCH decoder in parallel flash (NAND flash) memory. The parallel money search has small delay and can run at high speed, but its application is restricted by its high complexity. In order to reduce the complexity of parallel money search, an improved and optimized method for parallel money search is proposed. Firstly, the traditional parallel money search and related literature are analyzed and studied, then the search range of common subexpressions is extended, and the relevant calculations are combined. Finally, an improved iterative matching algorithm based on two-dimensional search is proposed. The experimental results show that the proposed method achieves good optimization effect and reduces the complexity of parallel money search effectively. After optimizing the 32bit parallel money search of BCH (2 047 / 1 92611), compared with the traditional parallel money search and the two parallel money searches in related literature, the optimization rate of this method is 85.4% and 29.2%, respectively. The parallel money search structure with different parallelism and error correction ability can be better adapted.
【作者单位】：江西理工大学信息工程学院;
【基金】：国家自然科学基金(11247032)资助项目
【分类号】：TP333

【相似文献】