In this paper the parallel conflict-free access to complete extended binary subtrees of complete binary trees is investigated. Thereby linear and also nonlinear memory module assignment functions S are considered. Fur...
详细信息
The all-nearest-neighbours (ANN) problem is a fundamental problem in computational geometry. In the letter a new two-dimensional triangular systolic array with mesh-connected cells is proposed for the ANN problem. Thi...
详细信息
The all-nearest-neighbours (ANN) problem is a fundamental problem in computational geometry. In the letter a new two-dimensional triangular systolic array with mesh-connected cells is proposed for the ANN problem. This array can process a queue of ANN problems at a throughput of one ANN problem per time period, with an efficiency of 100%.
暂无评论