2008
DOI: 10.1109/icassp.2008.4518185
|View full text |Cite
|
Sign up to set email alerts
|

A compressive beamforming method

Abstract: Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compressible signals. This paper considers the direction-of-arrival (DOA) estimation problem with an array of sensors using CS. We show that by using random projections of the sensor data, along with a full waveform recording on one reference sensor, a sparse angle space scenario can be reconstructed, giving the number of sources and their D… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
65
0
2

Year Published

2008
2008
2021
2021

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 118 publications
(69 citation statements)
references
References 7 publications
0
65
0
2
Order By: Relevance
“…When the source steering matrix satisfies the RIP property, it is known that the errors in the sparse vector estimates are well behaved under additive perturbations of the measurements [4]. In [8], we further discuss how each source can be modeled as additive noise in (4) and detail the construction of the steering matrices as a basis pursuit strategy.…”
Section: Estimation Of Steering Matricesmentioning
confidence: 99%
“…When the source steering matrix satisfies the RIP property, it is known that the errors in the sparse vector estimates are well behaved under additive perturbations of the measurements [4]. In [8], we further discuss how each source can be modeled as additive noise in (4) and detail the construction of the steering matrices as a basis pursuit strategy.…”
Section: Estimation Of Steering Matricesmentioning
confidence: 99%
“…In [42], a compressive wireless array is proposed for bearing estimation. In [43], a compressive beamforming method is presented. Both approaches apply compressive sampling in the time domain to reduce the ADC sampling rate or the number of time samples for each element of the array.…”
Section: Espirit Algorithmsmentioning
confidence: 99%
“…Linear programming techniques, e.g., basis pursuit [1], or iterative greedy algorithms [9] can be used to solve (6). Distributed versions of CS have been considered in [2] and [5] in order to exploit the underlying correlation structures in the signal observations.…”
Section: Compressive Samplingmentioning
confidence: 99%
“…In this paper we propose a new architecture for array-based applications by exploiting the sparsity in the angle spectrum, with fun- damental differences from the approaches in [3] and [6]. Our CS array applies compressive sampling in the spatial domain, which compresses or transforms the array of a large number of elements into an array of a much smaller number of elements.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation