Netlist Decomposition and Candidate Generation for Analog IC Routing

Netlist decomposition and candidate generation is a non-conventional approach in the routing stage of the place and route (PnR) flow. While there has been significant research and advancement in the digital domain for automation with respect to this as well as other techniques, very little work has been done in the analog domain due to its complex constraints and specific requirements. With this proposed method, the most common requirements of Analog circuits are taken into consideration to provide candidate routes for netlists of analog Integrated Chips (IC). Netlist decomposition is an important stage of breaking down multi-pin nets into two-pin nets by adding additional nodes for each net. The proposed method takes into account blockages and constraints such as symmetry and bends to develop a new algorithm using Steiner trees and Hanan grids to generate optimal Steiner points. This method also breaks down multi-pin nets to 3-pin nets which reduces the wirelength and computations significantly. The decomposed net segments are run through Dijkstra algorithm to generate multiple candidates and an Integer Linear programming (ILP) solver is used to pick the best candidates that follow all the constraints and design rules. The experimental results show that overall wirelength is reduced by 5.16% while using 3-pin net decomposition when compared to 2-pin net decomposition. There is also a reduction in the number of metal layers used and the number of Steiner points generated. The method shows lesser computations when compared to other decomposition techniques as it avoids multiple reroutes to obtain Design Rule Check (DRC) clean routes

Netlist Decomposition and Candidate Generation for Analog IC Routing

Netlist decomposition and candidate generation is a non-conventional approach in the routing stage of the place and route (PnR) flow. While there has been significant research and advancement in the digital domain for automation with respect to this as well as other techniques, very little work has been done in the analog domain due to its complex constraints and specific requirements. With this proposed method, the most common requirements of Analog circuits are taken into consideration to provide candidate routes for netlists of analog Integrated Chips (IC). Netlist decomposition is an important stage of breaking down multi-pin nets into two-pin nets by adding additional nodes for each net. The proposed method takes into account blockages and constraints such as symmetry and bends to develop a new algorithm using Steiner trees and Hanan grids to generate optimal Steiner points. This method also breaks down multi-pin nets to 3-pin nets which reduces the wirelength and computations significantly. The decomposed net segments are run through Dijkstra algorithm to generate multiple candidates and an Integer Linear programming (ILP) solver is used to pick the best candidates that follow all the constraints and design rules. The experimental results show that overall wirelength is reduced by 5.16% while using 3-pin net decomposition when compared to 2-pin net decomposition. There is also a reduction in the number of metal layers used and the number of Steiner points generated. The method shows lesser computations when compared to other decomposition techniques as it avoids multiple reroutes to obtain Design Rule Check (DRC) clean routes

Coherence in Synchronous Shared Experiences

Bulterman, D.C.A. [Promotor]Steen, M.R. van [Promotor

Synthesis of Azide-Modified NHC Coinage Metal Thiolates

Research on phosphine and N-heterocyclic carbene (NHC) terminated coinage metal complexes of the type L-M-X (L = NHC, Phosphine and X = S, Se) has been well-documented, however, the synthesis of coinage metal complexes of the type containing functional chalcogenolate ligands remains largely unexplored. Previous studies on sulfur containing precursors have provided an effective pathway for their incorporation onto coinage metal complexes through the generation of trimethylsilylsulfides and thiolates. The reaction of NHC-coinage metal salts, [(NHC)MX] (X = halide, carboxylate, etc.), with an azide-modified ligand affords clickable NHC-coinage metal thiolates: [(iPr2-bimy)Au-1-SCH2-2,5-(CH3)2Ph-4-CH2N3] (1), [(IPr)Au-1-SCH2-2,5-(CH3)2Ph-4-CH2N3] (2), [(IPr)Ag-1-SCH2-2,5-(CH3)2Ph-4-CH2N3] (3) and [(IPr)Cu-1-SCH2-2,5-(CH3)2Ph-4-CH2N3] (4) (R = {CH2Ph(CH3)2CH2N3}, iPr2-bimy =1,3-di-isopropylbenzimidazol-2-ylidene, IPr = 1,3-bis(2,6-di-iso-propylphenyl)imidazol-2-ylidene). Single crystal X-ray analysis of 1-4 show that they are two-coordinate, nearly linear, with a terminally bound thiolate ligand. The successful conversion of [(NHC)MX] from X = halide, carboxylate, etc. to X = SR is further confirmed by heteronuclear spectroscopy, and elemental analysis. The complexes are also found to be luminescent at 298 K. The results of the UV-Vis and photoluminescence spectroscopy are also presented. The Strain Promoted Alkyne-Azide Cycloaddition (SPAAC) reaction of one of the complexes with bicyclononynylmethanol (BCN-OH), a cyclooctyne, has also been demonstrated in order to illustrate the reactivity of the azide moiety toward strained-alkynes (5). Additionally, the reaction kinetics have also been determined, further confirming that the azide moiety is available for SPAAC reaction. Altogether, a novel approach towards functional coinage-metal thiolate complexes is presented for post-assembly modifications through SPAAC chemistry

EthnoGraphemes

Spoken and written languages are living processes. As with our own natural systems, they are born, evolve in stages, yet also face the eventuality of death. Current research indicates that there are 7,111 spoken languages in the world. UNESCO lists a total of 577 languages as critically endangered. This thesis examines the role of graphic design and its potential contribution to the preservation of endangered languages and writing systems of indigenous communities. My interest lies in exploring possibilities of the script serving as a vessel to share and celebrate deeper stories of each of these communities’ heritage. Through my practice, I experiment with new media tools to explore: the linguistic frameworks and visual arrangements of underrepresented languages, to create narratives that can speculate on how we can signify timelessness — bridging past, present & future. I intend to support communities in their efforts to reclaim their histories through cultural dialogue and collaboration to create meaningful future identities. This thesis details my collaborative process of revitalizing the Sora Sompeng script in support of the Sora forest tribe in Orissa, India. EthnoGraphemes offers an initial methodology, framework and reference guide for future work in engaging graphic design towards socio-cultural conservation, encouraging human diversity, while celebrating cultural identity and pride among indigenous communities by looking into the future, while honoring one’s past