Şahin, Devrim2016-02-082016-02-082015http://hdl.handle.net/11693/28385Date of Conference: 18-20 March 2015One-sided crossbar switches allow for a simple implementation of complete K<inf>n</inf> graphs. However, designing these circuits is a cumbersome process and can be automated. We present an algorithm that allows designing automatic one-sided binary tree-crossbar switches which do not exceed & LeftFloor;n over 2⌋ columns, and achieves K<inf>n</inf> graph without connecting any wires between any three adjacent blocks, thus preserving locality in connections. © 2015 IEEE.EnglishConference Paper10.1109/CISS.2015.7086839