PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Approximate Kernel Orthogonalization for Antenna Array Processing
Angel Navia-Vazquez, M. Martínez-Ramón, L.E. García-Muñoz and C.G. Christodoulou
IEEE Tr. On Antennas and Propagation Volume 58, Number 12, pp. 3942-3950, 2010. ISSN 0018-926X


We present a method for kernel antenna array processing using Gaussian kernels as basis functions. The method first identifies the data clusters by using a modified sparse greedy matrix approximation. Then, the algorithm performs model reduction in order to try to reduce the final size of the beamformer. The method is tested with simulations that include two arrays made of two and seven printed half wavelength thick dipoles, in scenarios with 4 and 5 users coming from different angles of arrival. The antenna parameters are simulated for all DOAs, and include the dipole radiation pattern and the mutual coupling effects of the array. The method is compared with other state-of-the-art nonlinear processing methods, to show that the presented algorithm has near optimal capabilities together with a low computational burden.

PDF - PASCAL Members only - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:7520
Deposited By:Angel Navia-Vazquez
Deposited On:17 March 2011