An explicit construction of Euler circuits in shuffle nets and related networks

In this paper, we present a construction of Euler circuits for some circular multistage interconnection networks, which have a uniform structure between consecutive stages.

[1]  Anthony S. Acampora,et al.  Terabit lightwave networks: The multihop approach , 1987, AT&T Technical Journal.

[2]  Tuvi Etzion,et al.  UPP Graphs and UMFA Networks-Architecture for Parallel Systems , 1992, IEEE Trans. Computers.

[3]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[4]  Tuvi Etzion,et al.  Algorithms for the generation of full-length shift-register sequences , 1984, IEEE Trans. Inf. Theory.

[5]  Tuvi Etzion.  An Algorithm for Constructing m-ary de Bruijn Sequences , 1986, J. Algorithms.

[6]  Dharma P. Agrawal,et al.  Graph Theoretical Analysis and Design of Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[7]  Cauligi S. Raghavendra,et al.  Uniform Minimal Full-Access Networks , 1988, J. Parallel Distributed Comput..

[8]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.