检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]广东石油化工学院计算机与电子信息学院,广东茂名525000
出 处:《现代电子技术》2016年第2期110-112,共3页Modern Electronics Technique
基 金:国家自然科学基金面上项目(61473331)
摘 要:反向转化已经成为制约剩余数系统发展的瓶颈问题,尤其对于模集合个数多于3个的模集合。针对4基数模集合{2n,22n+1,2n+1,2n-1},在新中国余数定理Ⅰ的基础上,提出了一个新的高效并行转换算法。该算法可同时处理4个模,处理数的动态范围达到5n位,乘法逆元全部采用闭合形式,电路完全基于加法器构成,硬件实现容易。理论分析表明,与同类模集合反向转换器相比,大大降低了对硬件电路的要求,明显减小了转换器的面积和电路延迟,提高了转换效率。The reverse conversion has become the bottleneck which restricts the development of the residue number system(RNS),especially for the moduli sets in which the number of the moduli is larger than 3. For the 4-moduli set {2^n,2^2n+1,2^n+1,2^n-1},a new efficient parallel conversion algorithm is proposed based on the new Chinese Remainder Theorem I. The proposed algorithm can deal with the four moduli simultaneously,and the dynamic range of the treatment number can reach up to 5n bits.The close form is adopted by the multiplicative inverse of the moduli set,and the circuit is entirely constituted based on the summator,which is easy for hardware implementation. The theoretical analysis indicates that,compared with the congeneric moduli-set reverse converter,the system can greatly reduce the requirements for hardware circuit,obviously decrease the area and circuit delay of the converter,and improve the conversion efficiency.
分 类 号:TN911-34[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117