jalal.baba
Junior Member level 1
Hi friends.
each face Contains 3node. i have face matrix and i want obtain to a matrix that show which node connected to which node.
my node about 24000 and my face about 48000.
I have:
face-----> memory A
number of node ------> memory B
I suggest:
for k=node1 : node N ,searching in face matrix and find node k then store elements of row Where the node is located.
is this method slow in fpga Because there should be a lot of search operations?
How this method can be pipelined?
Anyone have an idea to make this project faster?
each face Contains 3node. i have face matrix and i want obtain to a matrix that show which node connected to which node.
my node about 24000 and my face about 48000.
I have:
face-----> memory A
number of node ------> memory B
I suggest:
for k=node1 : node N ,searching in face matrix and find node k then store elements of row Where the node is located.
is this method slow in fpga Because there should be a lot of search operations?
How this method can be pipelined?
Anyone have an idea to make this project faster?