The dual channel sinewave model: Co-prime sparse sampling, parameter estimation, and the Cramér–Rao Bound

Negusse, Senay; Händel, Peter

doi:10.1016/j.measurement.2012.03.021

Cited by 3 publications

(7 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The main difference between the proposed method and the one in [4] is that here we take advantage of the coprimeness and use a projection process in the search for optimal DOAs, while the method in [4] iteratively tries different combinations of the estimates and find the best one among them. Although solving the modular equations in our method requires an iterative process, it can be avoided by using a lookup table.…”

Section: Combination Of the Estimates From Subarraysmentioning

confidence: 99%

“…Direction-of-arrival (DOA) estimation using sensor arrays is a problem that is frequently encountered in many engineering areas including radar, sonar, and wireless communication, and it has been studied for several decades. Recently, the notion of coprime array signal processing has emerged as an area of interest where, as the name suggests, the processing is applied to signals acquired by coprime arrays [1,2,3,4]. In general, it has been shown that coprime sampling allows us to sample a signal sparsely and estimate parameters of signals at higher resolutions [2].…”

Section: Introductionmentioning

confidence: 99%

“…The parameters can be the frequencies of temporal signals or the DOAs of spatial signals. By sparse sampling, one can reduce the rate of analog-to-digital converter for sampling in the temporal domain [4] or reduce the number of array sensor elements for sampling in the spatial domain [1]. This entails that systems where coprime sampling is applied can have lower cost than systems with Nyquist sampling, yet without degrading the performance of the latter.…”

Section: Introductionmentioning

confidence: 99%

“…For example, the cost of ADC usually grows exponentially with the bandwidth or the sampling rate. By using coprime sampling, one can reduce the requirements on the analog front-end by significantly lowering the sampling rate [4].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A search-free DOA estimation algorithm for coprime arrays

Weng

Djurić

2014

Digital Signal Processing

View full text Add to dashboard Cite

Recently, coprime arrays have been in the focus of research because of their potential in exploiting redundancy in spanning large apertures with fewer elements than suggested by theory. A coprime array consists of two uniform linear subarrays with inter-element spacings M λ/2 and N λ/2, where M and N are coprime integers and λ is the wavelength of the signal. In this paper, we propose a fast search-free method for direction-of-arrival (DOA) estimation with coprime arrays. It is based on the use of methods that operate on the uniform linear subarrays of the coprime array and that enjoy many processing advantages. We first estimate the DOAs for each uniform linear subarray separately and then combine the estimates from the subarrays. For combining the estimates, we propose a method that projects the estimated point in the two-dimensional plane onto one-dimensional line segments that correspond to the entire angular domain. By doing so, we avoid the search step and consequently, we greatly reduce the computational complexity of the method. We demonstrate the performance of the method with computer simulations and compare it with that of the FD-root MUSIC method.

show abstract

Section: Combination Of the Estimates From Subarraysmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A search-free DOA estimation algorithm for coprime arrays

Weng

Djurić

2014

Digital Signal Processing

View full text Add to dashboard Cite

show abstract

“…The sinewave parameters of two common frequency channels subsampled with coprime pair of sparse samplers is the subject of [9]. The Cramér-Rao Bound based on the coprime subsampled data set is determined and numerical examples show the relation between the cost in performance of this method.…”

mentioning

confidence: 99%