【摘要】：錢搜索是與非型閃速(NAND flash)存儲(chǔ)器中BCH譯碼器的重要組成部分,并行錢搜索延遲較小并可高速運(yùn)行,但過高的復(fù)雜度制約了其的應(yīng)用。為了降低并行錢搜索的復(fù)雜度,提出一種并行錢搜索的改進(jìn)和優(yōu)化方法。首先對(duì)傳統(tǒng)并行錢搜索以及有關(guān)文獻(xiàn)進(jìn)行了分析和研究;然后對(duì)公共子表達(dá)式的搜索范圍進(jìn)行了擴(kuò)展,并合并了相關(guān)計(jì)算;最后對(duì)迭代匹配算法進(jìn)行了改進(jìn),提出一種基于二維搜索的改進(jìn)迭代匹配算法。實(shí)驗(yàn)結(jié)果表明,本文方法取得了較好的優(yōu)化效果,有效地降低了并行錢搜索的復(fù)雜度;在對(duì)BCH(2 047,1 926,11)的32bit并行錢搜索優(yōu)化后,與傳統(tǒng)并行錢搜索以及有關(guān)文獻(xiàn)的兩種并行錢搜索相比,本文方法的優(yōu)化率分別達(dá)到了85.4%、38.7%和29.2%,并可以更好地適應(yīng)不同并行度和不同糾錯(cuò)能力的并行錢搜索結(jié)構(gòu)。
[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.
【作者單位】： 江西理工大學(xué)信息工程學(xué)院;
【基金】：國(guó)家自然科學(xué)基金(11247032)資助項(xiàng)目
【分類號(hào)】：TP333

【相似文獻(xiàn)】

相關(guān)期刊論文 前1條

1 程彪;楊波;;高速BCH編碼譯碼器的設(shè)計(jì)[J];濟(jì)南大學(xué)學(xué)報(bào)(自然科學(xué)版);2012年01期

，

本文編號(hào)：2322813