Leclère, Botteron, and Farine Figure 20. Timing diagram of the implementation of the post-FFT secondary code removal without memory in a parallel way (Figure 7) with NS = 4. The processing time to compute K times the full correlation is NFFT + L + NFFT + L + KNFFTNS - (NP + NZ) = NP(2KNS + 3) + NZ(KNS + 1) + 2L. Figure 21. Timing diagram of the implementation of the post-FFT secondary code removal using a memory followed by a sequential circular correlation (Figure 8) with NS = 4. The processing time to compute K times the full correlation is NFFT + L + NFFT + L + K[NFFT(NS - 1) + NP N S2] = NP[K( N S2 + 2NS - 2) + 4] + NZ[K(NS - 1) + 2] + 2L. AUGUST 2017 IEEE A&E SYSTEMS MAGAZINE 61