Efficient direction-of-arrival estimation using low-rank approximations
JP2023548435A5Active Publication Date: 2024-11-07アルベ ロボティクス リミテッド
View PDF 0 Cites 0 Cited by
Patent Information
- Application Number
- JP2023550748
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2020-11-09
- Filing Date
- 2021-11-09
- Publication Date
- 2024-11-07
- Estimated Expiration
- 2041-11-09
Abstract
A novel and useful Direction of Arrival (DOA) estimation system and method is provided that allows for DOA-dependent calibration with a complexity of order O(NlogN). In one embodiment, the architecture includes several Fast Fourier Transform (FFT) machines operating in parallel with coefficient multiplication before and after FFT operations. These pre- and post-FFT coefficients are computed using an optimal low-rank approximation of the distortion matrix using singular value decomposition. The values of the pre- and post-FFT calibration coefficients before and after each rank are calculated from the singular value decomposition of the distortion matrix C=B / F, where B is the digital beamforming (DBF) matrix and F is the ideal FFT matrix. A method for obtaining the beamforming matrix B is also disclosed. This architecture utilizes the relatively low rank required for full matrix multiplication, N. 2 This achieves K×N×log2N operations, where K is the rank of the approximation and N is the length of the FFT, which is significantly smaller than the approximation of K×N×log2N operations. We disclose a circuit and method for computing the calibration coefficients, as well as a simple proof of approximating this to a general beamforming matrix.
Need to check novelty before this filing date? Find Prior Art
