pith. sign in

arxiv: 1304.1932 · v1 · pith:WDV7CA4Mnew · submitted 2013-04-06 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords low-rankadaptivealgorithmsdecompositionsgeneralizedspace-timeswitchingcompute
0
0 comments X p. Extension
pith:WDV7CA4M Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{WDV7CA4M}

Prints a linked pith:WDV7CA4M badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.