activity
20072026
most citedAnalysis of Fisher Information and the Cramér-Rao Bound for Nonlinear Parameter Estimation after Compressed Sensing

56 citations · 198 across the 34 of their papers we have counts for

collaborators
Showing 2012 · cs.ITShow all

5 papers · 2 filters

cs.IT2012★ 1 cited

Submodularity and Optimality of Fusion Rules in Balanced Binary Relay Trees

Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2

We study the distributed detection problem in a balanced binary relay tree, where the leaves of the tree are sensors generating binary messages. The root of the tree is a fusion ce…

cs.IT2012★ 14 cited

Detection Performance in Balanced Binary Relay Trees with Node and Link Failures

Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2

We study the distributed detection problem in the context of a balanced binary relay tree, where the leaves of the tree correspond to identical and independent sensors generati…

cs.IT2012

Coordinating Complementary Waveforms for Sidelobe Suppression

Wenbing Dang, Ali Pezeshki, Stephen Howard +2

We present a general method for constructing radar transmit pulse trains and receive filters for which the radar point-spread function in delay and Doppler, given by the cross-ambi…

cs.IT2012★ 2 cited

Detection Performance of M-ary Relay Trees with Non-binary Message Alphabets

Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2

We study the detection performance of -ary relay trees, where only the leaves of the tree represent sensors making measurements. The root of the tree represents the fusion cente…

cs.IT2012★ 3 cited

Error Probability Bounds for M-ary Relay Trees

Zhenliang Zhang, Edwin K. P. Chong, Ali Pezeshki +2

We study the detection error probabilities associated with an M-ary relay tree, where the leaves of the tree correspond to identical and independent sensors. Only these leaves are…