Complex CORDIC-like algorithms for linearly constrained MVDR beamforming

Otte, M.; Bücker, H. Martin; Götze, J.

doi:10.1109/izsbc.2000.829236

Cited by 3 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper introduces a more efficient addressing from the viewpoint of implementation based on the T G . Further, we will use T instead of T abu [3] and addressing provided by [6] ({a,b,u} = {4,1,2}), we have: …”

Section: A) Addressing Of Unitary Matrix Shapementioning

confidence: 99%

“…Similarly as in [3], it is also possible to adapt 4x4 element rotation matrix for the generalized case (28):…”

Section: Factorization Of Elementary Generalized Unitary Rotation mentioning

confidence: 99%

“…Probably, N. D. Hemkumar ([1]- [2]) is one of the first who speaks about the factorization of complex Jacobi rotation and its realization using the CORDIC. Independently, M. Otte with colleagues ( [3]) present the factorization more clearly than [2] and use the real-valued CORDIC to perform complex Jacobi rotation. At this moment, authors of this paper have not been able to find in available literature papers dealing with factorization of EGURM (firstly introduced in [4] and [6]).…”

Section: Introductionmentioning

confidence: 99%

“…At this moment, authors of this paper have not been able to find in available literature papers dealing with factorization of EGURM (firstly introduced in [4] and [6]). Researchers [1]- [3] operate only with two special cases of unitary Jacobi matrix.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

FPGA implementation of elementary generalized unitary rotation with CORDIC based architecture

2012

View full text Add to dashboard Cite

This paper describes the first trial of implementation of generalized unitary Jacobi-like rotation (the device is called EGU-rotator, further referred to as rotator) purely based on the CORDIC algorithm into Altera's and Xilinx FPGAs. The basics and examples for factorization of the generalized rotation matrix (further, matrix) are given. The number of matrix shapes alternates in the range from 4 to 64 depending on the range of used angles (parameters). A unified algorithm for implementation of parametrical rotator is provided. Reconfigurable architecture of rotator is briefly described. The choice of architecture is determined by 3 addresses and they correspond to different shapes of the matrix. The comparison of device resources for different wordlengths, the number of CORDIC iterations and platforms is given. The complex rotator works approximately 3 times slower and consumes approximately 5 times more device resources than a single CORDIC rotator.

show abstract

Section: A) Addressing Of Unitary Matrix Shapementioning

confidence: 99%

“…Similarly as in [3], it is also possible to adapt 4x4 element rotation matrix for the generalized case (28):…”

Section: Factorization Of Elementary Generalized Unitary Rotation mentioning

confidence: 99%