CAJ | 학술논문

现有存储器内建自修复方法要么遍历式地址比较效率低，要么并行地址比较功耗高，都不适用于大故障数存储器．对此，本文提出一种高效的存储器内建自修复方法，该方法对占故障主体的单元故障地址以哈希表形式进行存储，以利用哈希表的快速搜索特性提升地址比较效率．本文方法修复后的存储器在1个时钟周期内即可完成地址比较，修复后存储器性能不受任何影响，与目前广泛采用的基于CAM的方法处于同一水平，但功耗方面却具有明显优势．计算机模拟实验表明，对于512×512×8 bits的存储器在同等冗余开销的情况下本文方法修复率相对于ESP方法平均提高了32.25％．
현유존저기내건자수복방법요요편력식지지비교효솔저，요요병행지지비교공모고，도불괄용우대고장수존저기．대차，본문제출일충고효적존저기내건자수복방법，해방법대점고장주체적단원고장지지이합희표형식진행존저，이이용합희표적쾌속수색특성제승지지비교효솔．본문방법수복후적존저기재1개시종주기내즉가완성지지비교，수복후존저기성능불수임하영향，여목전엄범채용적기우CAM적방법처우동일수평，단공모방면각구유명현우세．계산궤모의실험표명，대우512×512×8 bits적존저기재동등용여개소적정황하본문방법수복솔상대우ESP방법평균제고료32.25％．
Existing built-in self-repair (BISR) methods are either inefficient using traversal address compare or high power consumption using parallel address compare .Neither is suitable for memories with large fault quantity .In order to solve this issue ,an efficient memory BISR method based on hash table is proposed .In the proposed method cell fault addresses which contribute the main part of memory faults were stored in the form of a hash table .With quick search feature of hash table the proposed method im-proves address compare efficiency radically .Under work mode address compare process can be finished within 1 clock cycle ,and this will ensure repaired memory against additional performance penalty .The proposed method achieves the same address compare efficiency to CAM based method with much lower power consumption .Experimental results show that for 512 × 512 × 8 bits memo-ry the proposed method achieves 32.25% repair rate increment on average to ESP method with the same redundancy overhead .