首页> 外文期刊>Very Large Scale Integration (VLSI) Systems, IEEE Transactions on >A High Bit Rate Serial-Serial Multiplier With On-the-Fly Accumulation by Asynchronous Counters
【24h】

A High Bit Rate Serial-Serial Multiplier With On-the-Fly Accumulation by Asynchronous Counters

机译:通过异步计数器实时累加的高比特率串行串行乘法器

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

摘要

A novel approach of designing serial-serial hybrid multiplier is proposed for applications with high data sampling rate ( $geq$4 GHz). The conventional way of partial product formation is revamped. Our proposed technique effectively forms the entire partial product matrix in just $n$ sampling cycles for an $ntimes n$ multiplication instead of at least $2n$ cycles in the conventional serial-serial multipliers. It achieves a high bit sampling rate by replacing conventional full adders and 5:3 counters with asynchronous 1's counters so that the critical path is limited to only an and gate and a D flip-flop (DFF). The use of 1's counter to column compress the partial products preliminarily reduces the height of the partial product matrix from $n$ to $lfloorlog_{2}nrfloor+1$, resulting in a significant complexity reduction of the resultant adder tree. The proposed hybrid column compressed multiplier consists of a serial-serial data accumulation unit and a parallel carry save adder (CSA) array that occupies approximately 35% and 58% less silicon area than the full CSA array multiplier with operands of wordlength 32 $times$ 32 and 64 $times$ 64, respectively. The post-layout simulation results based on 90-nm seven metal single poly CMOS process technology shows that our 64 $times$ 64 multiplier dissipates 39% less average power at a sampling rate of 4 GHz, and has only 11% ad-n-nditional delay penalty to complete a multiplication compared to the conventional fully parallel CSA array multiplier.
机译:针对具有高数据采样率($ geq $ 4 GHz)的应用,提出了一种设计串行-串行混合乘法器的新颖方法。改进了部分产品形成的常规方式。我们提出的技术仅需$ n $个采样周期即可有效地形成整个部分乘积矩阵,而乘以$ n×n $倍,而不是常规串行串行乘法器中的至少$ 2n $个周期。通过用异步1的计数器代替常规的全加法器和5:3计数器,可以实现较高的位采样率,因此关键路径仅限于与门和D触发器(DFF)。使用1的计数器对部分乘积进行列压缩可以将部分乘积矩阵的高度从$ n $初步降低到$ lfloorlog_ {2} nrfloor + 1 $,从而导致所得加法器树的复杂度大大降低。所提出的混合列压缩乘法器由一个串行-串行数据累加单元和一个并行进位保存加法器(CSA)阵列组成,与使用字长为32的完整CSA阵列乘法器相比,其硅面积约少35%和58% 32美元和64美元乘以64美元。基于90-nm七金属单多晶硅CMOS工艺技术的布局后仿真结果表明,我们的64 x 64乘数乘法器在4 GHz的采样率下平均功耗降低了39%,而ad-n-仅为11%与传统的完全并行CSA阵列乘法器相比,传统的延迟代价可以完成乘法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号