You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
At the moment each iteration is independent of the previous ones and no assumption on the stability of the signal is done. The correlation calculation as iFFT(FFTxFFT*) on an N-long code requires N.ln2(N) multiplications.
Assuming we know the next correlation peak is close to the previous one (+/-1), does a time-domain calculation save time with the 3xN multiplications?
The text was updated successfully, but these errors were encountered:
At the moment each iteration is independent of the previous ones and no assumption on the stability of the signal is done. The correlation calculation as
iFFT(FFTxFFT*)
on an N-long code requires N.ln2(N) multiplications.Assuming we know the next correlation peak is close to the previous one (+/-1), does a time-domain calculation save time with the 3xN multiplications?
The text was updated successfully, but these errors were encountered: