Imagen de Portada

Generalized Reduced-Rank Decompositions Using Switching and Adaptive Algorithms for Space-Time Adaptive Processing

Guardado en:
Publicado en:arXiv.org (Apr 6, 2013), p. n/a
Autor principal: de Lamare, R C
Publicado:
Cornell University Library, arXiv.org
Materias:
Spacetime
Algorithms
Signal processing
Switching
Adaptive algorithms
Decomposition
Acceso en línea:Citation/Abstract
Full text outside of ProQuest
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
Resumen:This work presents generalized low-rank signal decompositions with the aid of switching techniques and adaptive algorithms, which do not require eigen-decompositions, for space-time adaptive processing. A generalized scheme is proposed to compute low-rank signal decompositions by imposing suitable constraints on the filtering and by performing iterations between the computed subspace and the low-rank filter. An alternating optimization strategy based on recursive least squares algorithms is presented along with switching and iterations to cost-effectively compute the bases of the decomposition and the low-rank filter. An application to space-time interference suppression in DS-CDMA systems is considered. Simulations show that the proposed scheme and algorithms obtain significant gains in performance over previously reported low-rank schemes.
ISSN:2331-8422
Fuente:Engineering Database