摘要
数组元素下标到对应的存储单元地址的生成是存储器高级综合系统中研究的关键技术 .基于普通逻辑运算的多维数组地址生成算法虽然具有一定的实用性 ,但该算法的地址转换并非最简 ,尤其对 2 n+1附近的数组下标基值所得电路通常比较复杂 .该文在韩曙等人的基础上 ,对地址转换逻辑进行了深入研究 ,提出了顺序低端组匹配算法 ,使得地址生成电路更加简化 ,从而算法更具有通用性 ,可更有效地应用于存储器高级综合 .
This paper studies the address conversion logic deeply, especially the matching between PRI and PRA (Primary Residual Address), provides the mathematical matching relationship and the implementing circuit as well as the complete address generation algorithm. We first analyze the mathematical property of matching between PRI and PRA and partition it further into two sections: one section can be implemented with simple and deterministic circuit and the remaining section is implemented with stochastic logic. For the former, we propose a new matching method named sequence low-end group matching and provide the matching relationship and range of the index and address it covers. With such matching method, the remaining matching, named matching between Secondary Residual Index (SRI) and Secondary Residual Address (SRA), which is implemented with stochastic logic, can be greatly reduced in most cases. Based on the above matching method, we propose an algorithm named sequence low-end group matching to generate address generation circuit. In most cases the generating circuit is simpler due to the reduction to the number of stochastic logic. Compared with algorithm in [6], the new algorithm is more universal and its result is more optimal. Therefore it can be applied to the high-level synthesis of memory more effectively.
出处
《计算机学报》
EI
CSCD
北大核心
2001年第12期1310-1317,共8页
Chinese Journal of Computers
基金
国家自然科学基金 ( 6 99730 0 7)资助
