Upload
aaron-nelson
View
220
Download
0
Embed Size (px)
DESCRIPTION
This paper discusses a compact, fast, parallel multiplication scheme of the generation-reduction type using generalized Dadda-type pseudoadders for reduction and m X m multipliers for generation. The implications of present and future LSI are considered, a partitioning algorithm is presented, and the results obtained for a 24 X 24-bit implementation are discussed.
Citation preview
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 1/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 2/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 3/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 4/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 5/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 6/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 7/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 8/10
7/21/2019 A Compact High-Speed Parallel Multiplication Scheme
http://slidepdf.com/reader/full/a-compact-high-speed-parallel-multiplication-scheme 9/10