Block circular and hyperbolic transformations for the block fast array RLS algorithm

Author

West, Roger D. ; Moon, Todd K. ; Gunther, Jacob H.

Author_Institution

Dept. of Elec. & Comp. Eng., Utah State Univ., Logan, UT, USA

fYear

2011

fDate

6-9 Nov. 2011

Firstpage

511

Lastpage

514

Abstract

Both circular and hyperbolic transformations are needed in the scalar fast array RLS (FARLS) algorithm to transform the pre-array into the post-array. These transformations `compress´ (in a J-unitary sense) the energy of the first column of the pre-array into the first entry of the post-array. Analogous transformations are needed in the block FARLS (BFARLS) algorithm, except the transformations need to `compress´ the energy of certain block matrices of the pre-array into the first square block of the post-array. A stable J-unitary block reflector is developed in this paper for transforming the pre-array into the post-array for the BFARLS algorithm.

Keywords

array signal processing; matrix algebra; BFARLS algorithm; J-unitary sense; block FARLS algorithm; block circular transformations; block fast array RLS algorithm; block matrices; hyperbolic transformations; scalar fast array algorithm; stable J-unitary block reflector; Algorithm design and analysis; Arrays; Moon; Null space; Signal processing algorithms; Transforms; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

978-1-4673-0321-7

Type

conf

DOI

10.1109/ACSSC.2011.6190053

Filename

6190053