.png){kind=icon}
Return
Multiplexer-based array multipliers
.png){kind=icon}
PRE
AI
DOI：10.1109/12.743408.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
array multipliers
multiplication algorithm
two's complement multiplication
pipeline multipliers
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available
Cited Papers
ShareSaveInfinite Coordination Polymer Polydopamine Nanocomposites Dual-Pathway Multistep Induction of Long-Term Hyperimmunity Combined With Photothermal-Chemo Synergistic Therapy Colorectal Cancer.png)
AGGREGATE
OAAI
AGGREGATEIF0
OAAIShareSaveShareSaveShareSavePARALLEL BIT-LEVEL PIPELINED VLSI DESIGNS FOR HIGH-SPEED SIGNAL-PROCESSINGPROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
ShareSaveShareSaveShareSave
View more