|
|
BSD 4.3
n� �*.KB� H
of x{zt of y
x{ V/(neighbor tbp{ y)[;;,zt]
edg{ 0
nn z { nn x
z { x
neighbor y{neighbor x;z;j
j{Rx
z{(j+1)Redg
z[1+I1Yj;1+I1Uj]{x
y{((j+1),8)R0
y[;;4]{1�y[;;3]{1�y[;;2]{1�y[;;1]{z
y[;;8]{`1�y[;;7]{`1�y[;;6]{`1�y[;;5]{1�y[;;4]
y{(j,8)Yy
thina y{thina x;a
a{xA~nn(6)of x
a{aVnn(4 8)of a
a{aV~nn(4 8)of x
y{xAaVnn(2)of x
a{yA~nn(8)of y
a{aVnn(2 6)of a
a{aV~nn(2 6)of y
y{yAaVnn(4)of y
a{yA~nn(2)of y
a{aVnn(4 8)of a
a{aV~nn(4 8)of y
y{yAaVnn(6)of y
a{yA~nn(4)of y
a{aVnn(2 6)of a
a{aV~nn(2 6)of y
y{yAaVnn(8)of y
edge x { y edge z
edg { z
x { y
edg t 8 d
�@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ zero 8 d
repeat y{ repeat z
y{ (�36) + ^/,tbp=z
where x{y where z
x{y
tt 8 d
�@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ �@ nndefine nndefine
nw { 1
n { 2
ne { 3
e { 4
se { 5
s { 6
sw { 7
w { 8
describe � ie� �
binary array processor simulator
see a systematically designed binary array processor
by a.p.reeves in ieee trans on computers vol. c-29
no. 4, pp. 278-287, april 1980 for details.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.