Pipelined implementation of cordic based QRD-MVDR adaptive beamforming

Jun Ma, Keshab K Parhi, Ed F. Deprettere

Research output: Contribution to journalArticle

1 Citation (Scopus)

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(p2+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 languageEnglish (US)
Pages (from-to)514-517
Number of pages4
JournalInternational Conference on Signal Processing Proceedings, ICSP
Volume1
StatePublished - Dec 1 1998

Fingerprint

Beamforming
Antennas

Cite this

Pipelined implementation of cordic based QRD-MVDR adaptive beamforming. / Ma, Jun; Parhi, Keshab K; Deprettere, Ed F.

In: International Conference on Signal Processing Proceedings, ICSP, Vol. 1, 01.12.1998, p. 514-517.

Research output: Contribution to journalArticle

@article{ff733859ad9c4ab3b219125f72457088,
title = "Pipelined implementation of cordic based QRD-MVDR adaptive beamforming",
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(p2+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.",
author = "Jun Ma and Parhi, {Keshab K} and Deprettere, {Ed F.}",
year = "1998",
month = "12",
day = "1",
language = "English (US)",
volume = "1",
pages = "514--517",
journal = "International Conference on Signal Processing Proceedings, ICSP",

}

TY - JOUR

T1 - Pipelined implementation of cordic based QRD-MVDR adaptive beamforming

AU - Ma, Jun

AU - Parhi, Keshab K

AU - Deprettere, Ed F.

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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(p2+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.

AB - 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(p2+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.

UR - http://www.scopus.com/inward/record.url?scp=0032286945&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032286945&partnerID=8YFLogxK

M3 - Article

VL - 1

SP - 514

EP - 517

JO - International Conference on Signal Processing Proceedings, ICSP

JF - International Conference on Signal Processing Proceedings, ICSP

ER -