Fixed-point analysis and realization of a blind beamforming algorithm

Details Fixed-point analysis and realization of a blind beamforming algorithm Fixed-point analysis and realization of a blind beamforming algorithm

Nov 1999

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1999spie.3807..188x&link_type=abstract

Proc. SPIE Vol. 3807, p. 188-199, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, Franklin T. Luk;

Statistics

Computation

Scientific paper

We present the fixed-point analysis and realization of a blind beamforming algorithm. This maximum-power beamforming algorithm consists of the computation of a correlation matrix and its dominant eigenvector, and we propose that the later be accomplished by the power method. After analyzing the numerical stability of the power method, we derive a division-free form of the algorithm. Based on a block-Toeplitz assumption, we design an FIR filter based system to realize both the correlation computation and the power method. Our ring processor, which is optimized to implement digital filters, is used as the core of the architecture. A special technique for dynamically switching filter inputs is shown to double the system throughput. Finally we discuss the issue of hardware/software hybrid realization.

Affiliated with

Also associated with

No associations

Rating

Fixed-point analysis and realization of a blind beamforming algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fixed-point analysis and realization of a blind beamforming algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-point analysis and realization of a blind beamforming algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1513585