edited by
4,776 views

1 Answer

Best answer
66 votes
66 votes
$\begin{matrix}
& & & &a_3 & a_2 & a_1&a_0 \\
 & & &\times & b_3 &b_2 &b_1 &b_0 \\
\hline
& & & & a_3b_0 &a_2b_0 &a_1b_0 & a_0b_0&\\
& & &a_3b_1 &a_2b_1 &a_1b_1 & a_0b_1 &- &\\
& &a_3b_2 &a_2b_2 &a_1b_2 &a_0b_2 &- &- &\\
& a_3b_3 &a_2b_3 &a_1b_3 &a_0b_3 &- &- &- \\
\hline
c_7&c_6&c_5 &c_4 &c_3 &c_2 &c_1 &c_0 \\ \hline
\end{matrix}$

$c_1=b_1 a_0 \oplus a_1 b_0$
edited by

Related questions

51 votes
51 votes
4 answers
1
Kathleen asked Sep 12, 2014
11,418 views
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
19 votes
19 votes
3 answers
2
Kathleen asked Sep 12, 2014
5,671 views
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
16 votes
16 votes
1 answer
3
Kathleen asked Sep 12, 2014
3,133 views
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
25 votes
25 votes
5 answers
4
Kathleen asked Sep 12, 2014
8,134 views
Consider the number given by the decimal expression:$$16^3*9 + 16^2*7 + 16*5+3$$The number of $1’s$ in the unsigned binary representation of the number is ______