Skip to main content
SpringerLink
Log in

Fast Algorithms for Time Domain Adaptive Array Processing

  • Conference paper
Underwater Acoustics and Signal Processing

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 66))

  • 451 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Frost, O.L., An algorithm for linearly constraint adaptive array processing Proc. IEEE, Vol. 60, No. 8, pp. 926 – 935, August 1972.

    Article  Google Scholar 

  2. Hodgkiss, W.S., Adaptive array processing: Time Vs frequency domain IEEE ICASSP ′79, pp. 282 – 285.

    Google Scholar 

  3. Jim, C.W., A comparison of two LMS constrained optimal array structures Proc. IEEE, Vol. 65, No. 12, December 1977, pp. 1730 – 1731.

    Article  Google Scholar 

  4. Kazuaki Takao, et al., An adaptive antenna array under directional constraint, IEEE Trans. Antennas and Propagation, AP24, No. 5, Sept. 1976, pp. 662 – 669.

    Google Scholar 

  5. Ljung, L., et al., Fast calculation of gain matrices for recursive estimation schemes, International Journal of Control, 1978, Vol. 27, No. 1, pp. 1 – 19.

    Article  Google Scholar 

  6. Cantoni, A. and Godara, L.C., Fast algorithm for Time Domain Adaptive Array Processing, Tech. Report No. EE8003, Dept. Elect. Engg, University of Newcastle, March 1980.

    Google Scholar 

  7. Baird, C.A. Pecursive algorithms for adavtive array antennas, Final Report, Contract F30602-72-C-0499, Rome Air Develop¬ment Center, September 1973.

    Google Scholar 

  8. Dean, H.B., Cantoni, A., Fast adavtation of eaualizer and desired response for digital data receivers, IEE Electronic Circuits and Systems, Sept. 1978, Vol. 2, No. 5, pp. 159 – 166.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, The University of Newcastle, N.S.W., 2308, Australia

    Antonio Cantoni & Lai C. Godara

Authors
  1. Antonio Cantoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lai C. Godara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Denmark, Lyngby, Denmark

    Leif Bjørnø

Rights and permissions

Reprints and permissions

Copyright information

© 1981 D. Reidel Publishing Company

About this paper

Cite this paper

Cantoni, A., Godara, L.C. (1981). Fast Algorithms for Time Domain Adaptive Array Processing. In: Bjørnø, L. (eds) Underwater Acoustics and Signal Processing. NATO Advanced Study Institutes Series, vol 66. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-8447-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-8447-9_30

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-8449-3

  • Online ISBN: 978-94-009-8447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation