IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v319y2018icp218-235.html
   My bibliography  Save this article

Analog, parallel, sorting circuit for the application in Neural Gas learning algorithm implemented in the CMOS technology

Author

Listed:
  • Talaśka, Tomasz
  • Długosz, Rafał

Abstract

The paper presents a novel circuit, implemented in the CMOS technology, that allows for sorting analog signals in parallel. The circuit is to be used in neural networks trained in accordance with Neural Gas (NG) learning algorithm implemented in the CMOS technology. The role of the circuit is to determine, for a given learning pattern, the winning neuron as well as its neighbors. The proposed circuit is versatile. It can be also used, for example, in nonlinear filtering of analog signals. It is capable of performing simultaneously several typical nonlinear operations that include Min, Max and median filtering. The circuit offers high accuracy, which means that it is able to distinguish signals which differ by a relatively small value. However, the accuracy depends on the calculation time. For example, to be able to distinguish the signals that differ by 10 nA (for maximum range of 10 µ A), the assumed calculation time has to be set to at least 1 µ s. To improve the accuracy to 5 nA, the calculation time has to be doubled. The circuit provides us the sorted list of signals, in accordance with their values. This information contains both the positions of the signals on the sorted list and their values. The first parameter is used in the NG learning algorithm. The circuit was implemented in the TSMC 180 nm CMOS technology and verified by means of the corner analysis in the HSpice environment. For an example case of eight inputs varying in between 1 to 10 µ A the circuit dissipates an average power of 300 µ W, at data rate of million sorting operations per second.

Suggested Citation

  • Talaśka, Tomasz & Długosz, Rafał, 2018. "Analog, parallel, sorting circuit for the application in Neural Gas learning algorithm implemented in the CMOS technology," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 218-235.
    • Handle: RePEc:eee:apmaco:v:319:y:2018:i:c:p:218-235
    DOI: 10.1016/j.amc.2017.02.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317301340
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.02.030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kolasa, Marta & Talaska, Tomasz & Długosz, Rafał, 2015. "A novel recursive algorithm used to model hardware programmable neighborhood mechanism of self-organizing neural networks," Applied Mathematics and Computation, Elsevier, vol. 267(C), pages 314-328.
    2. Talaśka, Tomasz & Kolasa, Marta & Długosz, Rafał & Farine, Pierre-André, 2015. "An efficient initialization mechanism of neurons for Winner Takes All Neural Network implemented in the CMOS technology," Applied Mathematics and Computation, Elsevier, vol. 267(C), pages 119-138.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kolasa, Marta & Długosz, Rafał & Talaśka, Tomasz & Pedrycz, Witold, 2018. "Efficient methods of initializing neuron weights in self-organizing networks implemented in hardware," Applied Mathematics and Computation, Elsevier, vol. 319(C), pages 31-47.
    2. Yu, Peilin & Deng, Feiqi & Sun, Yuanyuan & Wan, Fangzhe, 2022. "Stability analysis of impulsive stochastic delayed Cohen-Grossberg neural networks driven by Lévy noise," Applied Mathematics and Computation, Elsevier, vol. 434(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:319:y:2018:i:c:p:218-235. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.