{"doi":"10.1109/ted.2021.3131116","title":"A Neuromorphic Brain Interface Based on RRAM Crossbar Arrays for High Throughput Real-Time Spike Sorting","abstract":"Real-time spike sorting and processing are crucial for closed-loop brain–machine interfaces and neural prosthetics. Recent developments in high-density multielectrode arrays with hundreds of electrodes have enabled simultaneous recordings of spikes from a large number of neurons. However, the high channel count imposes stringent demands on real-time spike sorting hardware (HW) regarding data transmission bandwidth and computation complexity. Thus, it is necessary to develop a specialized real-time HW that can sort neural spikes on the fly with high throughputs while consuming minimal power. Here, we present a real-time, low latency spike sorting processor that utilizes high-density CuO <sub xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><i>x</i></sub> resistive crossbars to implement in-memory spike sorting in a massively parallel manner. We developed a fabrication process that is compatible with CMOS back end of line (BEOL) integration. We extensively characterized switching characteristics and statistical variations of the CuO <sub xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"><i>x</i></sub> memory devices. In order to implement spike sorting with crossbar arrays, we developed a template matching-based spike sorting algorithm that can be directly mapped onto resistive random-access memory (RRAM) crossbars. By using synthetic and <italic xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">in vivo</i> recordings of extracellular spikes, we experimentally demonstrated energy-efficient spike sorting with high accuracy. Our neuromorphic interface offers substantial improvements in area ( <inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$\\sim 1000\\times $ </tex-math></inline-formula> less area), power ( <inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$\\sim 200\\times $ </tex-math></inline-formula> less power), and latency ( <inline-formula xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\"> <tex-math notation=\"LaTeX\">$4.8~\\mu \\text{s}$ </tex-math></inline-formula> latency for sorting 100 channels) for real-time spike sorting compared to other HW implementations based on field-programmable gate arrays (FPGAs) and microcontrollers.","journal":"IEEE Transactions on Electron Devices","year":2021,"id":189593,"datarank":0.0,"base_score":0.0,"endowment":0.0,"self_citation_contribution":0.0,"citation_network_contribution":0.0,"self_endowment_contribution":0.0,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":15,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":0.9543,"is_data_producer":false,"deposit_databanks":null,"is_oa":true,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":"2021-01-01","fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":752332,"name":"Akshay Ananthakrishnan","orcid":"0000-0002-2791-9514","position":1,"is_corresponding":false},{"id":752333,"name":"Sangheon Oh","orcid":"0000-0003-2371-7410","position":2,"is_corresponding":false},{"id":397787,"name":"Xin Liu","orcid":"0000-0003-3993-3505","position":3,"is_corresponding":false},{"id":752926,"name":"Gopabandhu Hota","orcid":null,"position":4,"is_corresponding":false},{"id":752334,"name":"Gert Cauwenberghs","orcid":"0000-0002-3166-5529","position":5,"is_corresponding":false},{"id":397790,"name":"Duygu Kuzum","orcid":"0000-0002-2125-1285","position":6,"is_corresponding":false},{"id":752331,"name":"Yuhan Shi","orcid":"0000-0002-3246-6994","position":0,"is_corresponding":true}],"reference_count":32,"raw_metadata":null,"created_at":"2026-07-18T23:49:18.604374Z","pmid":"37168652","pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}