On the Rearrangeability of Shuffle-Exchange Networks
2000-09-15
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
On the Rearrangeability of Shuffle-Exchange Networks
Authors
Published Date
2000-09-15
Publisher
Type
Report
Abstract
Let m(n) be the minimum positive integer k so that the Shuffle-Exchange network with k stages, N = 2n inputs and N outputs is rearrangeable. Beneš conjectured that m(n)=2n-1 . The best bounds known so far are 2n-1 <= m(n) <= 3n-4 . In this paper, we verify Beneš conjecture for n=4 , and use this result to show that m(n) <= 3n-5 .
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Ngo, Hung Q.; Du, Ding-Zhu. (2000). On the Rearrangeability of Shuffle-Exchange Networks. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215432.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.