On construction of 0-1 sorters from 2x2 switches.

So Kin Tai.Thesis (M.Phil.)--Chinese University of Hong Kong, 2000.Includes bibliographical references (leaves 65-66).Abstracts in English and Chinese.Chapter Chapter 1 --- Introduction --- p.1Chapter 1.1 --- The 0-1 sorter and concentrator --- p.1Chapter 1.2 --- Review of literature on constructions --- p.3Chapter 1.2.1 --- Odd-even merging network --- p.4Chapter 1.2.2 --- The Fast Knockout algorithm --- p.5Chapter 1.2.3 --- Reverse Banyan network prepended by running sum adder --- p.10Chapter 1.2.4 --- Recursive construction using iterative cells --- p.14Chapter 1.2.5 --- Comparison of construction algorithms --- p.17Chapter Chapter 2 --- Compressor based on baseline-swap network --- p.22Chapter 2.1 --- Bit permutation induced exchange --- p.22Chapter 2.2 --- Compressor --- p.26Chapter 2.3 --- The baseline-swap network --- p.28Chapter 2.4 --- New algorithm for running parity initialization --- p.31Chapter 2.5 --- Input fairness --- p.42Chapter Chapter 3 --- The general architecture of 0-1 sorter --- p.46Chapter 3.1 --- Recursive 2X-construction --- p.46Chapter 3.2 --- Control a 2X-interconnection network as a cyclic 0-1 sorter --- p.50Chapter 3.3 --- Recursive construction of larger 0-1 sorter --- p.56Chapter Chapter 4 --- Epilogue --- p.59Chapter 4.1 --- Directions of further studies --- p.59Chapter 4.1.1 --- Synchronization within the same stage --- p.59Chapter 4.1.2 --- Layout complexity --- p.60Chapter 4.1.3 --- Statistical initialization of running parity --- p.62Chapter 4.2 --- Conclusion --- p.63REFERENCES --- p.6