Z
Zhen
Guest
There are two vectors, named V1 and V2, the sizes of which are 1*M and
1*N, respectively. We have known that there is at most one common
element in both vectors. I am looking for the quick algorithm to
search this common element.
The general algorithm is to compare every element in V1 with each
element in V2. the comparison complexity will be O(M*N). Is there any
efficient method to complete it?
I hope it can be done in FPGA. If M=N=60, and each element is 20 bit
long,there isn't enough pins for the general search algorithms at one
time. It need some loops to do it. So I am looking for an efficient
algorithm and expect that the common element can be found in around
10ns~50ns. Is it possible?
Thanks,
1*N, respectively. We have known that there is at most one common
element in both vectors. I am looking for the quick algorithm to
search this common element.
The general algorithm is to compare every element in V1 with each
element in V2. the comparison complexity will be O(M*N). Is there any
efficient method to complete it?
I hope it can be done in FPGA. If M=N=60, and each element is 20 bit
long,there isn't enough pins for the general search algorithms at one
time. It need some loops to do it. So I am looking for an efficient
algorithm and expect that the common element can be found in around
10ns~50ns. Is it possible?
Thanks,