Cart (Loading....) | Create Account
Close category search window
 

Finite word length effects on array processing algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Long, E. ; Quest Research Corp., McLean, VA ; Schumpert, J.

Finite word length effects on the performance of several array processing/beam forming algorithms are considered for bearing estimation criterion based on minimum mean square error linear prediction, maximum likelihood, and eigenvector analysis. Algorithms are evaluated via computer simulations which represent quantized input signals and (some of) the arithmetic operations by various word lengths. Adaptive and non-adaptive algorithms were studied and trade-offs were established between word lengths, convergence rates, averaging times and beam patterns.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '85.  (Volume:10 )

Date of Conference:

Apr 1985

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.