Pith. sign in

REVIEW 1 cited by

A Survey Examining Neuromorphic Architecture in Space and Challenges from Radiation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.15006 v1 pith:TGBWMDYX submitted 2023-11-25 cs.ET

classification cs.ET
keywords computingneuromorphicspacesystemsapplicationschallengesradiationaerospace
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Inspired by the human brain's structure and function, neuromorphic computing has emerged as a promising approach for developing energy-efficient and powerful computing systems. Neuromorphic computing offers significant processing speed and power consumption advantages in aerospace applications. These two factors are crucial for real-time data analysis and decision-making. However, the harsh space environment, particularly with the presence of radiation, poses significant challenges to the reliability and performance of these computing systems. This paper comprehensively surveys the integration of radiation-resistant neuromorphic computing systems in aerospace applications. We explore the challenges posed by space radiation, review existing solutions and developments, present case studies of neuromorphic computing systems used in space applications, discuss future directions, and discuss the potential benefits of this technology in future space missions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators

    cs.LO 2024-12 conditional novelty 7.0 of 10

    MaxSAT, Max2SAT, and QUBO are mutually reducible in linear time with treewidth preserved up to small constants, giving ETH- and SETH-tight bounds and a 2^treewidth algorithm for QUBO.

Pith tools