In this paper, a new approach to the design of broad-band time-domain element space antenna array processors is presented. The basic approach is based on the idea of minimizing the mean-square deviation between the desired look-direction response and the response of the processor over a frequency band of interest. With this approach, three types of presteering can be handled: no presteering, coarse presteering, and exact presteering. The elimination of presteering lime delays is important in a digital implementation of antenna array processors. The relationship that the new processor has to other broad-band processors is explored and the significance of the parameters associated with the new processor is established. Furthermore, the approach presented enables various types of errors and mismatches between signal model and actual scenario to be incorporated in the problem formulation.

A new approach to the design of broad-band element space antenna array processors

Recursive algorithms are presented for time domain, broadband, adaptive beamforming. The algorithms are rapidly converging and can be computationally efficient for a certain range of array processor parameters. The algorithms are presented for two forms of array processor. One form is a Frost-type structure in which explicit constraints are required for defining the array-look direction and also to control the sensitivity of the array processor to implementation errors. The other form is a partitioned array processor in which constraints are built into the processor and the adaptive weight control algorithm is therefore unconstrained. The two processors presented are both element-space processors but the algorithms can be applied also to beam-space processors.

Fast Algorithms for Time Domain Broadband Adaptive Array Processing

TG4 process of defining the PHY layer. Abstract This document contains a structure for the TG4 PHY development, it contains various PHY modes and describes the common structure between them. Purpose This proposal should be used for the PHY specification of the TG4. Notice This document has been prepared to assist IEEE 802.16. It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release The contributor grants a free, irrevocable license to the IEEE to incorporate text contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEE's name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEE's sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE 802.16. Patent Policy and Procedures The contributor is familiar with the IEEE 802.16 Patent Policy and Procedures (Version 1.0) , including the statement "IEEE standards may include the known use of patent(s), including patent applications, if there is technical justification in the opinion of the standards-developing committee and provided the IEEE receives assurance from the patent holder that it will license applicants under reasonable terms and conditions for the purpose of implementing the standard."

IEEE 802.16 TG4 OFDM PHY Proposal for the 802.16b PHY Layer Date Submitted

This paper reports the development of an algorithm for the processing of data from an array of broad-band sensors using lattice type processor. The problem is to enhance the look-direction signal in the presence of spatially distributed interference sources and sensor self noise by employing a multi-channel processor subject to the constraint that it has a desired response for look-direction signals. The multichannel lattice algorithm proposed here possess stage by stage decoupling, and do not involve an arbitrary size of the step length, unlike conventional tapped-delay-line algorithms.

Adaptive Lattice Algorithms for Passive Array Data

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.

Lai C. Godara

Papers

Fast Algorithms for Time Domain Adaptive Array Processing