【24h】

Design and implementation of 32 bit unsigned multiplier using CLAA and CSLA

机译:使用CLAA和CSLA的32位无符号乘法器的设计与实现

获取原文
获取原文并翻译 | 示例

摘要

This project deals with the comparison of the VLSI design of the carry look-ahead adder (CLAA) based 32-bit unsigned integer multiplier and the VLSI design of the carry select adder (CSLA) based 32-bit unsigned integer multiplier. Both the VLSI design of multiplier multiplies two 32-bit unsigned integer values and gives a product term of 64-bit values. The CLAA based multiplier uses the delay time of 99ns for performing multiplication operation where as in CSLA based multiplier also uses nearly the same delay time for multiplication operation. But the area needed for CLAA multiplier is reduced to 31% by the CSLA based multiplier to complete the multiplication operation. These multipliers are implemented using Altera Quartus II and timing diagrams are viewed through avan waves.
机译:该项目致力于比较基于进位提前加法器(CLAA)的32位无符号整数乘法器的VLSI设计和基于进位选择加法器(CSLA)的32位无符号整数乘法器的VLSI设计。乘法器的VLSI设计都将两个32位无符号整数值相乘,并给出64位值的乘积项。基于CLAA的乘法器使用99ns的延迟时间执行乘法运算,而基于CSLA的乘法器也使用几乎相同的延迟时间进行乘法运算。但是,基于CSLA的乘法器将CLAA乘法器所需的面积减少到31%,以完成乘法运算。这些乘法器是使用Altera Quartus II实现的,时序图通过avan wave查看。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号