The thesis presents a new approach to the decomposition of incompletely specified functions and its application to FPGA (Field Programmable Gate Array) mapping. Five methods: Variable Partitioning, Graph Coloring, Bond Set Encoding, CLB Reusing and Local Transformation are developed in order to efficiently perform decomposition and FPGA (Lookup-Table based FPGA) mapping. 1) Variable Partitioning is a high quality hemistic method used to find the "best" partitions, avoiding the very time consuming testing of all possible decomposition charts, which is impractical when there are many input variables in the input function. 2) Graph Coloring is another high quality heuristic\ used to perform the quasi-optimum don't care assignment, making the program possible to accept incompletely specified function and perform a quasi-optimum assignment to the unspecified part of the function. 3) Bond Set Encoding algorithm is used to simplify the decomposed blocks during the process of decomposition. 4) CLB Reusing algorithm is used to reduce the number of CLBs used in the final mapped circuit. 5) Local Transformation concept is introduced to transform nondecomposable functions into decomposable ones, thus making it possible to apply decomposition method to FPGA mapping. All the above developed methods are incorporated into a program named TRADE, which performs global optimization over the input functions. While most of the existing methods recursively perform local optimization over some kinds of network-like graphs, and few of them can handle incompletely specified functions. Cube calculus is used in the TRADE program, the operations are global and very fast. A short description of the TRADE program and the evaluation of the results are provided at the_ end of the thesis. For many benchmarks the TRADE program gives better results than any program published in the literature.

Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.

Thesis (Ph.D.)--Ohio University, June, 2009. / Includes bibliographical references (leaves 146-149)

Thesis (Ph.D.)--Ohio University, June, 2009. / Title from PDF t.p. Includes bibliographical references (leaves 146-149)

Not available / text

Bibliography: leaves 143-146 / vii, 147 leaves ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Mathematical Physics, 1986

Thesis (Ph. D.)--University of Adelaide, Dept. of Mathematical Physics, 1986. / Includes bibliographical references (leaves 143-146).

Thesis (Ph.D.)--University of Cincinnati, 2008. / Committee/Advisors: David Herron PhD (Committee Chair), David Minda PhD (Committee Member), Nageswari Shanmugalingam PhD (Committee Member). Includes bibliographical references and abstract.

Thesis (MSc (Applied Mathematics))--University of Stellenbosch, 2005. / The surface of a 3D model may be digitally represented as a collection of flat polygons in R3. The collection is known as a polygonal mesh. This representation method has become standard in computer graphics.

The relationship between the convergence of a sequence of self mappings of a metric space and their fixed points, known as the stability (or continuity) of fixed points has been of continuing interest and widely studied in fixed point theory. In this thesis we study the stability of common fixed points in a Hausdorff uniform space whose uniformity is generated by a family of pseudometrics, by using some general notations of convergence. These results are then extended to 2-metric spaces due to S. Gähler. In addition, a well-known theorem of T. Suzuki that generalized the Banach Contraction Principle is also extended to 2-metric spaces and applied to obtain a coincidence theorem for a pair of mappings on an arbitrary set with values in a 2-metric space. Further, we prove the existence of coincidence and fixed points of Ćirić type weakly generalized contractions in metric spaces. Subsequently, the above result is utilized to discuss applications to the convergence of modified Mann and Ishikawa iterations in a convex metric space. Finally, we obtain coincidence, fixed and stationary point results for multi-valued and hybrid pairs of mappings on a metric space.