2007
DOI: 10.1109/mwscas.2007.4488798
|View full text |Cite
|
Sign up to set email alerts
|

Compression and encryption of self-test programs for wireless sensor network nodes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…In order to recover K-sparsity of the original signal, now we have MK  system of linear equations, with M equations and K unknowns, and since MK  , it is possible to find the K-sparsity of the original signal [73]. As an example, Figure 3.4 shows how compressed signal can be generated from the original signal D [74]. The received signal can be written as:…”
Section: Basic Theoremmentioning
confidence: 99%
“…In order to recover K-sparsity of the original signal, now we have MK  system of linear equations, with M equations and K unknowns, and since MK  , it is possible to find the K-sparsity of the original signal [73]. As an example, Figure 3.4 shows how compressed signal can be generated from the original signal D [74]. The received signal can be written as:…”
Section: Basic Theoremmentioning
confidence: 99%