CMP EMBEDDED.COM

Login | Register     Welcome Guest   IPS  
HOME DESIGN PRODUCTS COLUMNS E-LEARNING CONFERENCES CODE FORUMS/BLOGS NEWSLETTERS CONTACT FEATURES RSS RSS

Listing 1: Pseudocode

for(i=0; i<samples; i++){
x[0] = Xn[samples];
Yn[samples] = 0;
for(j=0; j<=N; j++){ 
Yn[samples+=(coefs[j]*x[j]; 
//This is the transveral. It could be anything
}
Error = Dn[samples]-Yn[samples];
for(j=N; j>=0; j--) {
Coefs[j] = coefs[j]+(2*beta*error*Xn[j]);
if(j!=0) x[j] = x[j-1];
}
}

Return to article
Embedded.com Career Center
Ready for a change?
SEARCH JOBS

Browse all jobs

SPONSOR
RECENT JOB POSTINGS





 :