Run-length chain coding and shape´s moment computations on arrays with reconfigurable optical buses

The main contribution of this paper is the design of several efficient algorithms for modified run-length chain coding and for computing shape´s moments on arrays with reconfigurable optical buses. We first propose two constant time algorithms for boundary extraction and run-length chain coding. Based on the modified run-length chain coding, and the advantages of both optical transmission and electronic computation, a constant time parallel algorithm for computing shape´s moments using N/spl times/N processors is proposed. Based on the product of time and the number of processors used, the proposed parallel algorithms are time and cost optimal.