Modular expansion and reconfiguration of shufflenets in multi-star implementations.

Abstract

by Philip Pak-tung To.Thesis (M.Phil.)--Chinese University of Hong Kong, 1994.Includes bibliographical references (leaves 57-60).Chapter 1 --- Introduction --- p.1Chapter 2 --- Modular Expansion of ShuffleNet --- p.8Chapter 2.1 --- Multi-Star Implementation of ShuffleNet --- p.10Chapter 2.2 --- Modular Expansion of ShuffleNet --- p.21Chapter 2.2.1 --- Expansion Phase 1 --- p.21Chapter 2.2.2 --- Subsequent Expansion Phases --- p.24Chapter 2.3 --- Discussions --- p.26Chapter 3 --- Reconfigurability of ShuffleNet in Multi-Star Implementation --- p.33Chapter 3.1 --- Reconfigurability of ShuffleNet --- p.34Chapter 3.1.1 --- Definitions --- p.34Chapter 3.1.2 --- Rearrangable Conditions --- p.35Chapter 3.1.3 --- Formal Representation --- p.38Chapter 3.2 --- Maximizing Network Reconfigurability --- p.40Chapter 3.2.1 --- Rules to maximize Tsc and Rsc --- p.41Chapter 3.2.2 --- Rules to Maximize Z --- p.42Chapter 3.3 --- Channels Assignment Algorithms --- p.43Chapter 3.3.1 --- Channels Assignment Algorithm for w = p --- p.45Chapter 3.3.2 --- Channels Assignment Algorithm for w = p. k --- p.46Chapter 3.3.3 --- Channels Assignment Algorithm for w=Mpk --- p.49Chapter 3.4 --- Discussions --- p.51Chapter 4 --- Conclusions --- p.5