How narrow is narrowband?
M. Zatman
Abstract
M. Zatman
Abstract
The ‘narrowband’ assumption is often made in the analysis of array signal processing algorithms. The author provides a definition for the notion of narrowband, and the derivation of an expression which is useful in determining if a particular scenario qualifies as narrowband. The expression derived correctly predicts where the narrowband assumption fails for some super-resolution algorithms, the Cramer–Rao bound on angle estimation and the signal-to-interference plus noise performance of adaptive beamformers.
OpenAlex reports 105 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The ‘narrowband’ assumption is often made in the analysis of array signal processing algorithms. The author provides a definition for the notion of narrowband, and the derivation of an expression which is useful in determining if a particular scenario qualifies as narrowband. The expression derived correctly predicts where the narrowband assumption fails for some super-resolution algorithms, the Cramer–Rao bound on angle estimation and the signal-to-interference plus noise performance of adaptive beamformers.
Key concepts: Narrowband, Expression (computer science), Algorithm, Computer science, SIGNAL (programming language), Noise (video), Interference (communication), Signal processing