1984
DOI: 10.1109/tac.1984.1103630
|View full text |Cite
|
Sign up to set email alerts
|

Bilinear system identification by Volterra kernels estimation

Abstract: N1)-lV, respectively, and using &,V = AV, cl V = 0, we get AV*(N;'-Nl)-lV+XV*(N~l-Nl)-lV =V*(N,-'-Nl)-lNlc~lNl(N;'-Nl)-lV -V * ( N ; ' -N l ) -l N ; ' c~l N ; ' ( N ; ' -N l ) -l V . (12) Since Nl is diagonal, we can write Nl(N;'-Nl)-lV=(N;'-N,)-lNIV=[N;'(I-N:)]-lNIV = ( Z -N ; ) -l N ; V . Thus, c1Nl(N;' -Nl)-'V=el(I-N;)-'N;V= HV, say. Then the first term on the right-hand side of (12) becomes ( H V ) * ( H V ) . Now consider clNC1(N<' -N1)-'V. We can write c l N~l ( N ; l -N l ) -l V =~l ( z -N f ) -l V . (1… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
11
0
1

Year Published

1996
1996
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(12 citation statements)
references
References 6 publications
0
11
0
1
Order By: Relevance
“…. , y (N ) of y, which can be put in matrix form as X = [x (1) x (2) · · · x (N ) ] and Y = [y (1) y (2) · · · y (N ) ]. A currently used estimation of the autocorrelation matrix is given by…”
Section: Examplesmentioning
confidence: 99%
See 3 more Smart Citations
“…. , y (N ) of y, which can be put in matrix form as X = [x (1) x (2) · · · x (N ) ] and Y = [y (1) y (2) · · · y (N ) ]. A currently used estimation of the autocorrelation matrix is given by…”
Section: Examplesmentioning
confidence: 99%
“…The system to be identified is governed by a nonstationary version of Narendra's difference equation: (33) where t = n Δt with Δt = 0.05, [·] denotes the real part, and α is an r.v. uniformly distributed in the interval [1,50]. Figure 2 shows the identification capabilities of the proposed approach for this system, with N = 50, L = 240, and polynomial order p = 5.…”
Section: Examplementioning
confidence: 99%
See 2 more Smart Citations
“…Tais representações buscam caracterizar o comportamento desses sistemas através de sistemas lineares, fornecendo assim um adequado compromisso entre a precisão da representação obtida e a simplicidade do tratamento matemático. Para tal, diferentes algoritmos adaptativos envolvendo formas bilineares vêm sendo desenvolvidos visando aplicações de identificação de sistema [2]- [4], equalização de canal [5], cancelamento de eco [6], controle ativo de ruído [7], [8], redes neurais [9], dentre outras. Contudo, os algoritmos discutidos até então têm considerado que o termo bilinear seja definido com respeito aos dados, isto é, com vistas à relação de entradas e saídas do sistema.…”
Section: Introductionunclassified