2015
DOI: 10.1109/tnsre.2014.2370510
|View full text |Cite
|
Sign up to set email alerts
|

Complexity Optimization and High-Throughput Low-Latency Hardware Implementation of a Multi-Electrode Spike-Sorting Algorithm

Abstract: Reliable real-time low-latency spike sorting with large data throughput is essential for studies of neural network dynamics and for brain-machine interfaces (BMIs), in which the stimulation of neural networks is based on the networks' most recent activity. However, the majority of existing multi-electrode spike-sorting algorithms are unsuited for processing high quantities of simultaneously recorded data. Recording from large neuronal networks using large high-density electrode sets (thousands of electrodes) i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
18
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 28 publications
1
18
0
Order By: Relevance
“…Dragas et al have incorporated spatial and temporal overlap in neuron activity in spike sorting hardware to perform spike detection [18]. Franke et al have also similarly incorporated the spatial and temporal information to resolve overlapping spikes from neurons in the brain [19].…”
Section: Introductionmentioning
confidence: 99%
“…Dragas et al have incorporated spatial and temporal overlap in neuron activity in spike sorting hardware to perform spike detection [18]. Franke et al have also similarly incorporated the spatial and temporal information to resolve overlapping spikes from neurons in the brain [19].…”
Section: Introductionmentioning
confidence: 99%
“…A dierent strategy for high density recordings, developed by Marre et al (2012), is to estimate spatio-temporal templates, which are then used to identify spikes from each neuron (see also Dragas et al, 2014). This shifts the computational burden from spatial interpolation and source localization in our method to the deconvolution of spikes from raw data.…”
Section: Discussionmentioning
confidence: 99%
“…In our system, spikes often produced a high amplitude only for less than 0.5 ms (2–3 frames at 7 kHz) and on 1–4 electrodes. If the true spatio-temporal profile of a spike was known, a dot product of the raw voltage traces and such templates could be employed to efficiently detect spikes (Marre et al, 2012 ; Dragas et al, 2015 ). However, estimating such templates required a high firing rate, large amplitudes, or long recordings (and would be biased toward detecting units satisfying those criteria) and was computationally demanding.…”
Section: Methodsmentioning
confidence: 99%
“…For detecting and sorting spikes, one way is to identify candidate events which are then used to create templates and a subsequent fitting of such templates to the raw voltage traces. Template matching can be implemented in a highly efficient way on FPGAs (Dragas et al, 2015 ), but relies on an assumption that spikes from the same neuron will only change in amplitude and the generation of templates often requires a considerable amount of manual intervention. For efficient detection of data from high density arrays without using templates, Gibson et al ( 2010 ) proposed using the Teager Energy Operator for sampling rates of 24 kHz and when hardware dependent noise sources can be neglected, and found a good performance for a threshold based approach as well.…”
Section: Introductionmentioning
confidence: 99%