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.1 / Chapter 1.1 --- The 0-1 sorter and concentrator --- p.1 / Chapter 1.2 --- Review of literature on constructions --- p.3 / Chapter 1.2.1 --- Odd-even merging network --- p.4 / Chapter 1.2.2 --- The Fast Knockout algorithm --- p.5 / Chapter 1.2.3 --- Reverse Banyan network prepended by running sum adder --- p.10 / Chapter 1.2.4 --- Recursive construction using iterative cells --- p.14 / Chapter 1.2.5 --- Comparison of construction algorithms --- p.17 / Chapter Chapter 2 --- Compressor based on baseline-swap network --- p.22 / Chapter 2.1 --- Bit permutation induced exchange --- p.22 / Chapter 2.2 --- Compressor --- p.26 / Chapter 2.3 --- The baseline-swap network --- p.28 / Chapter 2.4 --- New algorithm for running parity initialization --- p.31 / Chapter 2.5 --- Input fairness --- p.42 / Chapter Chapter 3 --- The general architecture of 0-1 sorter --- p.46 / Chapter 3.1 --- Recursive 2X-construction --- p.46 / Chapter 3.2 --- Control a 2X-interconnection network as a cyclic 0-1 sorter --- p.50 / Chapter 3.3 --- Recursive construction of larger 0-1 sorter --- p.56 / Chapter Chapter 4 --- Epilogue --- p.59 / Chapter 4.1 --- Directions of further studies --- p.59 / Chapter 4.1.1 --- Synchronization within the same stage --- p.59 / Chapter 4.1.2 --- Layout complexity --- p.60 / Chapter 4.1.3 --- Statistical initialization of running parity --- p.62 / Chapter 4.2 --- Conclusion --- p.63 / REFERENCES --- p.65
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_323037 |
| Date | January 2000 |
| Contributors | So, Kin Tai., Chinese University of Hong Kong Graduate School. Division of Information Engineering. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English, Chinese |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, viii, 66 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0019 seconds