### Abstract

Cordic based QRD-MVDR adaptive beamforming algorithms possess desirable properties for VLSI implementation such as regularity and good finite-word length behavior. But this algorithm suffers from speed limitation constraint due to the presence of recursive operations in the algorithm. In this paper, a fine-grain pipelined Cordic based QRD-MVDR adaptive beamforming algorithm is developed using the matrix lookahead technique. The proposed architecture can operate at arbitrarily high sample rates, and consists of only Givens rotations which can be mapped onto a Jacobi specific dataflow processor. It requires a complexity of O(M(p^{2}+Kp)) Givens rotations per sample time, where p is the number of antenna elements, K is the number of look direction constrains, and M is the pipelining level.

Original language | English (US) |
---|---|

Pages (from-to) | 514-517 |

Number of pages | 4 |

Journal | International Conference on Signal Processing Proceedings, ICSP |

Volume | 1 |

State | Published - Dec 1 1998 |

### Fingerprint

### Cite this

*International Conference on Signal Processing Proceedings, ICSP*,

*1*, 514-517.