A Flexible FPGA Implementation of Morris-Lecar Neuron for Reproducing Different Neuronal Behaviors
Bibliographic record
Abstract
The Morris-Lecar (ML) neuronal model is one of the most popular biophysical models for studying the biological behaviors of single neurons. It has been implemented on hardware in different approaches. Field Programmable Gate Arrays (FPGA) technology has been recently used to implement different neuron models, which have a significant impact on new designs in the field of neuromorphic engineering. This interest is due to the FPGA's ability to implement massive and parallel architectures with high flexibility and accuracy. To date, different analog and digital designs have been proposed to implement the ML model on electronic circuits. In this work, we developed a real-time tunable architecture of the ML neuron on an FPGA. Using a noisy signal to stimulate the neuron, we tested the performance of the implemented ML model on both hardware and software models. We verified the FPGA model's capability to adjust various parameters in real-time. We used Xilinx ZCU102 FPGA boards to implement the real-time ML neuron. We discretized the ML model and updated FPGA model parameters for different ionic currents to reproduce neuronal activities generated by MATLAB. The hardware implementation demonstrated that the FPGA-based model reproduced the exact behavior implemented by MATLAB for different parameters and noisy injected current. Our design enabled adaptive alterations of the FPGA model neuron from Integrator mode to Differentiator mode in real-time. The Spike Triggered Average (STA) for several behaviors has been calculated.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".