Hi,
I have a problem in understanding the following masking operation:
m & n = n if m + 1 = 2 ^ (1+log m) and 0 <= n <= m
where & is the bitwise AND operator and m denotes a bitmask 0xff…f.
I have attached the research paper. Its on page 3.
Some body please guide me.
Zulfi.
I have a problem in understanding the following masking operation:
m & n = n if m + 1 = 2 ^ (1+log m) and 0 <= n <= m
where & is the bitwise AND operator and m denotes a bitmask 0xff…f.
I have attached the research paper. Its on page 3.
Some body please guide me.
Zulfi.
Attachments

557 KB Views: 3