1. A network of nodes identified according to a G×H 2-dimension matrix of nodes having nearest neighbor connectivity between adjacent nodes in each dimension which includes wrap around adjacent nodes, the network comprising: groups of A g,h nodes, each group having a different g that is the same for each A g,h node in that group, gε{0, 1,. .. , G−1} and for each group, hε{0, 1,. .. , H−1}, and each A g,h node operable to output an A g,h data value; groups of R g,h nodes, each group having a different g that is the same for each R g,h node in that group, gε{0, 1,. .. , G−1} and for each group, hε{0, 1,. .. , H−1}, each group of R g,h nodes coupled to a corresponding group of A g,h nodes according to an adjacency of nodes in a first dimension, wherein each R g,h node is operable to select an A g,h data value from a coupled A g,h node and to output the selected A g,h data value as an R g,h data value; and groups of S g,h nodes, each group having a different g that is the same for each S g,h node in that group, gε{0, 1,. .. , G−1} and for each group, hε{0, 1,. .. , H−1}, each group of S g,h nodes coupled to three groups of R g,h nodes according to an adjacency of nodes in a second dimension, wherein each S g,h node is operable to select an R g,h data value from a coupled R g,h node and to output the selected R g,h data value as an S g,h data value.