Ken Kundert
|
Reduction & is applied to one argument and returns the logical and of all the bits in that argument. So it always returns a single boolean value.
This contrasts to the bitwise & that applies to two bit vectors, and return a bit vector where each bit is the logical and of the corresponding bits in the arguments.
So if A is 2'b11 and B is 2'b01, then &A is 1, &B is 0, and A&B is 2'b10. The first two are reduction &, the last is bitwise &.
-Ken
|