Abstract
A class of modified single-state shuffle/exchange (S/E) networks with reconfigurable connections is described. The capability of these modified networks to simulate every arbitrary permutation and other multistage S/E networks is studied. In particular, the upper bounds on simulating six multistage S/E networks are given. It is also shown that C.L. Wu and T.Y. Feng's (1981) modified single-stage S/E network is optimal in terms of its universality and cost for the networks with one reconfigurable connection. However, some of the modified networks with two reconfigurable connections have better capability although they are slightly more expensive than Wu and Feng's network. Also proposed is a link folding scheme that can be used to reduce the connection complexity of implementing the connection selection mechanism.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.