Size Bounds for Superconcentrators


We prove that any N-superconcentrator of indegree two has at least 4N o( N 1 nodes. From this lowe’r bounds of 4N -o(N) follow on the number of additions required to compute the Discrete Fourier Transform of prime order and cyclic convolution. Using small examples we illustrate how sbnall superconcentrators can suggest fast algorithms for instances of these… (More)
DOI: 10.1016/0304-3975(83)90105-6


12 Figures and Tables

Slides referencing similar topics