Get full access to Blind Equalization in Neural Networks and 60K+ other titles, with a free 10-day trial of O'Reilly.
There are also live events, courses curated by job role, and more.
where
E[ x(n−k)x*(n−l)x(n−m)x*(n−r) ]={ E[ | x(n)4 | ]k=l=m=rE[ | x(n)2 | ]k=l=m=r,k=r=l=m| E[ x2(n) ] |2k=m=l=r0others
If k1 = 0, L = k2, τ = k3, τ1 = k4, there is
C4y(L,τ,τ1)=h0hτ1*hτhL*C4x(0,0,0) (5.48)
C4y(L,0,τ1)=h0hτ1*h0hL*C4x(0,0,0) (5.49)
C4y(L,0,τ1)hτ=C4y(L,τ,τ1)h0 for 0≤τ1≤L (5.50)
So,
C4y*(L,0,τ1)C4y(L,0,τ1)hτ=C4yτ(L,0,τ1)C4y(L,τ,τ1)h0 (0≤τ1≤L) (5.51)
∑τ1=0LC4y*(L,0,τ1)C4y(L,0,τ1)hτ=∑τ1=0LC4y*(L,0,τ1)C4y(L,τ,τ1)h0 (5.52)
hτ∑τ1=0LC4y*(L,0,τ1)C4y(L,0,τ1)=h0∑τ1=0LC4yL(L,o,τ1)C4y(L,τ,τ1) (5.53)
hτ=h0∑τ1=0LC4y*(L,0,τ1)C4y(L,τ,τ1)∑τ1=0LC4y*(L,0,τ1)C4y(L,0,τ1) =h0∑τ1=0LC4y*(L,0,τ1)C4y(L,
Get Blind Equalization in Neural Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.