论文信息 - Fast Algorithms for Time Domain Adaptive Array Processing

Fast Algorithms for Time Domain Adaptive Array Processing

The paper presents recursive algorithms for time domain array beamforming. The algorithms are computationally efficient and rapidly converging. The algorithms can be used for adaptive beamforming both for a Frost type processor with a constraints and a partitioned processor without constraints.

Antonio Cantoni | Lai C. Godara

[1] O. L. Frost,et al. An algorithm for linearly constrained adaptive array processing , 1972 .

[2] C. Jim. A comparison of two LMS constrained optimal array structures , 1977, Proceedings of the IEEE.

[3] L. Ljung,et al. Fast calculation of gain matrices for recursive estimation schemes , 1978 .

[4] M. Fujita,et al. An adaptive antenna array under directional constraint , 1976 .

[5] Antonio Cantoni,et al. Fast adaptation of equaliser and desired response for digital data receivers , 1978 .

[6] William S. Hodgkiss. Adaptive array processing: Time vs. frequency domain , 1979, ICASSP.