Schur type algorithms for spatial LS estimation with highly pipelined architectures

Liu, X.; Fan, H.

doi:10.1109/78.277806

Cited by 2 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 except requiring several columns of data cj,j ( t ) as extra inputs. The normalized versions of Levinson and Schur type spatial LS algorithms as well as their pyramid systolic array implementation can be developed by the same procedures as the unnormalized ones [5]. Thus, the Cholesky decomposition of the matrix ( X T N X~, N ) -~ is computed [5].…”

Section: (7)mentioning

confidence: 99%

See 1 more Smart Citation

A spatial Schur type LS algorithm and its pyramid systolic array implementation

Liu

Fan

1993 IEEE International Symposium on Circuits and Systems

Self Cite

View full text Add to dashboard Cite

A Schur type spatial LS algorithm is de-veloped to solve the spatial LS estimation probleni by order recursion in wliich tlie correlation matrix is neitlier Toeplitz nor near-to-Toeplitz. A pyraiiiid systolic array, wliich lias highly modular structures and localized communication, is designed to calculate not only the Alter parameters but also tlie LDU decomposition of the inverse cross-correlation matrix at every clock phase. This pyramid array can be mapped onto a two dimensional systolic array which has a simpler structure. The normalized versions of Levinson a n d Schur type spatial LS algorithms as well as their pyramid systolic array implementation can also be derived.

show abstract

Section: (7)mentioning

confidence: 99%

“…The derivation of the Schur type spatial LS algorithm can be found in [ 5 ] , which is derived by the well-known update formulas of the projection and transversal filter operators. For clarity of presentation, a complete summary of this algorithm is demonstrated in Table 1.…”

Section: (7)mentioning

confidence: 99%