[ main page ] [ back ]

50/2012 : Building a Threshold-Gate with a Sorting Network with Application to the DARTS Project

RR Number
50/2012
Author(s)
Markus Chmelar
Abstract
This work researches the viability of so called sorting networks as a design approach in realizing threshold gates. The difficulty in building these threshold gates is that for the output it doesn’t matter which specific inputs are activated, as long as the count of activated input is higher than a specified number. The motivation of using a sorting network for this is that the sorting is potentially easy and may result in a more efficient result than other circuits. Furthermore it shall be investigated if a threshold gate built out of a sorting network is better suited for use in the ’Embedded Systems’ DARTS (Distributed Algorithms for Robust Tick Synchronization) project than the current solution.
Bibtex
@techreport{ chmelar:2012-50,
  author =       "Markus Chmelar",
  title =        "Building a Threshold-Gate with a Sorting Network with Application to the DARTS Project",
  institution =  "Technische Universit{\"a}t Wien, Institut f{\"u}r Technische Informatik",
  address =      "Treitlstr. 1-3/182-1, 1040 Vienna, Austria",
  type =         "Research Report",
  year =         "2012",
  number =       "50/2012"
}
Download
Get chmelar_projektarbeit_thresholdgates_final.pdf - Adobe PDF-format, (1027.6934 KB; posted at July 09 2013)

[ main page ] [ back ]