返回
摘要
En 中文
A new algorithm for the multiplication of two n-bit numbers based on the synchronous computation of the partial sums of the two operands is presented. The proposed algorithm permits an efficient realization of the parallel multiplication using iterative arrays. At the same time, it permits high-speed operation. Multiplier arrays for positive numbers and numbers in two's complement form based on the proposed technique are implemented. Also, an efficient pipeline form of the proposed multiplication scheme is introduced. All multipliers obtained have low circuit complexity permitting high-speed operation and the interconnections of the cells are regular, well-suited for VLSI realization.
Keyword:
array multipliers
multiplication algorithm
two's complement multiplication
pipeline multipliers
期刊
IF:
3.8
论文数:
5.3K
被引数:
9.8K
机构
暂无机构信息
引用论文
Infinite Coordination Polymer Polydopamine Nanocomposites Dual-Pathway Multistep Induction of Long-Term Hyperimmunity Combined With Photothermal-Chemo Synergistic Therapy Colorectal Cancer无限配位聚合物聚多巴胺纳米复合材料双通路多步诱导长期超免疫联合光热-化疗协同治疗结直肠癌
AGGREGATE
IF0
PARALLEL BIT-LEVEL PIPELINED VLSI DESIGNS FOR HIGH-SPEED SIGNAL-PROCESSING
PROCEEDINGS OF THE IEEE
IF25.9
TIME TO STABLE THERAPEUTIC ANTICOAGULATION USING WEIGHT-BASED IV HEPARIN DOSING CLINICAL DECISIONS SUPPORT PROGRAM使用基于体重的静脉肝素给药的临床决策支持程序达到稳定治疗性抗凝所需时间

