2020
DOI: 10.1007/s41965-020-00033-3
|View full text |Cite
|
Sign up to set email alerts
|

An error-tolerant serial binary full-adder via a spiking neural P system using HP/LP basic neurons

Abstract: We present an implementation of an improved adder via a spiking neural P system. Our adder processes arbitrary length binary numbers, and thus, is suitable for cryptographic applications. Due to the use of dual-rail logic, the adder is also error tolerant. We present the implementation concept, as well as a simulation model in System-C.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(3 citation statements)
references
References 9 publications
0
3
0
Order By: Relevance
“…While this work is a preliminary one to introduce the visual tool Snapse for SN P systems, the Snapse version as of now can be used, at least in part, in some applications. Aside from the examples in Section 5 and their extensions or generalization, Snapse could be used in (parts of) the systems for skeletonizing images as in [27,28], aiding in the design of some systems in [30,[32][33][34], computational biology in [37], and other applications in [26,38].…”
Section: Final Remarksmentioning
confidence: 99%
See 1 more Smart Citation
“…While this work is a preliminary one to introduce the visual tool Snapse for SN P systems, the Snapse version as of now can be used, at least in part, in some applications. Aside from the examples in Section 5 and their extensions or generalization, Snapse could be used in (parts of) the systems for skeletonizing images as in [27,28], aiding in the design of some systems in [30,[32][33][34], computational biology in [37], and other applications in [26,38].…”
Section: Final Remarksmentioning
confidence: 99%
“…Much theoretical work has been done on SN P systems, e.g., their normal forms [14][15][16], formal representations [17][18][19], and their relations to classical models of computation [20][21][22][23][24][25] with a short and recent survey in [26]. After much theoretical work, more recently the work to apply SN P systems to real-world problems becomes even more active, with some early works on image processing e.g., [27] and more recently in [28], use for cryptography [29][30][31], use of evolutionary algorithms to design SN P systems [32][33][34], in pattern recognition [35,36], computational biology [37], with a recent survey in [38].…”
Section: Introductionmentioning
confidence: 99%
“…This have been harnessed already by introducing CuSNP, a set of simulators for SNP systems implemented with CUDA [21][22][23][24]. Simulators for specific solutions have been also defined in the literature [5,25]. Moreover, this is not unique for SNP systems, many simulators for other P system variants have been accelerated on GPUs [26][27][28].…”
Section: Introductionmentioning
confidence: 99%