A longest common subprefix of two binary words p1 and p2 is identified
based on bit strings ip1 and ip2 which are extensions of p1 and p2, and
binary words n1 and n2 that define the length of p1 and p2. The bit
strings and words are processed to set a "greater" output if p1>p2 and
to set an "equal" output if p1=p2. A mask having a consecutive string of
most significant bits having a first logical value is constructed to
identify the matching subprefixes of p1 and p2.
