UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
A high-speed scalable CMOS current-mode winner-take-all network
  • Publication Type:
    Conference
  • Authors:
    Demosthenous A, Taylor J, Smedley S
  • Publisher:
    Springer-Verlag
  • Publication date:
    1996
  • Place of publication:
    Berlin / Heidelberg, Germany
  • Pagination:
    371, 376
  • Published proceedings:
    Artificial Neural Networks - ICANN 96: 1996 International Conference Bochum, Germany, July 16–19, 1996: Proceedings
  • Volume:
    1112
  • Series:
    Lecture Notes in Computer Science
  • Editors:
    Malsburg CVD,Seelen WV,Vorbrüggen JC,Sendhoff B
  • ISBN-13:
    9783540615101
  • Status:
    Published
  • Language:
    English
Abstract
A CMOS modular high-speed current-mode 2-input Winner-Take-All (2-WTA) circuit for use in VLSI tree-structure WTA networks is described. The classification speed of the design is not input pattern dependent, but is a function of the value of the largest current input only. Simulations show that the new circuit can resolve input currents differing by less than 1mgrA with a negligible loss of operating speed. Detailed simulations and preliminary measured results of a single WTA cell and of a complete 8-input tree WTA network are presented.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Electronic & Electrical Eng
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by