2013
DOI: 10.1007/s00034-013-9701-5
|View full text |Cite
|
Sign up to set email alerts
|

Deterministic Sensing Matrices Based on Multidimensional Pseudo-Random Sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 12 publications
0
4
0
Order By: Relevance
“…For LFSR, different feedback polynomials generate distinct m-sequences [31]. For m-sequence, the properties of balance, excursion distribution and auto-correlation are similar to the basic properties of random sequence [32]. Therefore, m-sequence is the most widely used pseudorandom sequence.…”
Section: Lemma 11mentioning
confidence: 99%
“…For LFSR, different feedback polynomials generate distinct m-sequences [31]. For m-sequence, the properties of balance, excursion distribution and auto-correlation are similar to the basic properties of random sequence [32]. Therefore, m-sequence is the most widely used pseudorandom sequence.…”
Section: Lemma 11mentioning
confidence: 99%
“…For the convenience of the following discussion, we assume that the last element of x is 0, so the last column of A can be abandoned. Then (13) changes into…”
Section: Practical Implementationmentioning
confidence: 99%
“…In practical application, random sensing matrices usually imply random sampling in data acquisition, which is difficult to implement in hardware. Many scholars have become interested in finding deterministic RIP matrix constructions [13] [17]. A deterministic construction of sensing matrices was given by polynomials over finite fields and the RIP weaker than random matrices was proven [7].…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, this innovative theory of improving sampling efficiency has been of great interest in the fields of digital signal processing [11], optical imaging [12], medical imaging [13], radio communication [14], radar imaging [15], and pattern recognition [16]. The research conducted on compressed sensing comprises three main areas: (1) the sparse representation of original signals, with commonly used sparse transform methods such as the Fourier Transform (FT) [17], Discrete Cosine Transform (DCT) [18], and Wavelet Transform (DWT) [19]; (2) the design of the measurement matrix, including the random measurement matrix [20,21] and deterministic measurement matrix [22,23]; (3) reconstruction algorithms, such as the basis pursuit (BP) algorithm [24,25], matching pursuit (MP) algorithm [26], and orthogonal matching pursuit algorithm [27][28][29][30].…”
Section: Introductionmentioning
confidence: 99%