Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
Dear elmolla,
thanks for your post and for your PM (i did not see you post untill today)
first ... do not worry, i think you are really good at maths :D
YEP, my mistake, i mix up the kroneker and the delta function:|, thanks for your clarification :idea:
BUT I have, again :cry:, some...
Dear elmolla,
I read your proof, i would like to say something:
1- Thank you for your answer, i really appreciated ...
2- Your proof is magic :D, but unfortunatly, i don't agree with you (or i have to say, there is some points that i did not understand )
i- You wrote...
dear elmolla, lp
thanks for your help,
For the first case if wi=wj and Φj=Φi it's clear that the sum is equal to N and the limite to 1
But, i really did not understand your explanation ::: what do you mean by '' they won't be covered by the inverse transform area of integration, causing a...
hello,
plz it's a small problem , but i need it , it's very important for me and very urgent [45point or more as you like]
i have to give the proof of this
for p≠0, 2π, 4π, ... and q≠0, 2π, 4π, ...
y(p,q) = (1/N) Σ exp ^{i(pl+ql²)} = 0 when N goes to infinity ( l goes from 0 to N-1)
In...
Re: complexity of algorithm
Dear Mowgli,
Thank you very much for you answer, i did understand the definition and the usefulness of this concept.
Plz am I right if i said that :
%let note nX=length(X); nEn=length(En);
[U,V,D]=svd(X*X'); % has O(nX*nX)
En=U(:,Ns+1:end); % has no O()...
THANK YOU VERY MUCH,
But plz, i did not understand how we use it, for a better understanding here is a small exemple (Matlab):
What is the number of folps of each instuction , and finally what's the number of flops of the algorithm...
%
[U,V,D]=svd(X*X');
En=U(:,Ns+1:end);
En2=En*En'...
Hello everyone,
plz i have two algorithm and i have to compare between then, i need to you use the ?
complexity of algorithm by number of flops ?
Can some one help, give me a link to understand this method or some references,
thanks to everyone and have a nice day
Nab...
Ok, The DOA problem forumulation is :
You have N sensors
M sources (far-field)
T snapshot
For each sensors you have the sum of all the sources, and you aim is to process this output from the sensors to estimate the direction of arrival.
Let Y denote the output, X the sources, A...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
