Information measures and performance bounds for array processors

DOI10.1109/TIT.1976.1055509MaRDI QIDQ4083317zbMATH OpenFDO

Authors Louis L. Scharf, Paul H. Moose

Publication date 1976

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1976.1055509

zbMATH Keywords

Cramer-Rao boundsJ-divergence

Mathematics Subject Classification ID

Communication theory (94A05) Information theory (general) (94A15)

Recommendations

• Statistical and Information-Theoretic Analysis of Resolution in Imaging
• Statistical analysis of the performance of information theoretic criteria in the detection of the number of signals in array processing
• On the number of signals resolvable by a uniform linear array
• Cramer-Rao bound of spatio-temporal linear pre-processing in parameter estimation from sensor array
• Some Functional Lower Bounds on the Expected Divergence for Multihypothesis Pattern Recognition, Communication, and Radar Systems

This page was built for publication: Information measures and performance bounds for array processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083317)