An algorithm has been developed that maps pseudo-random number codes onto a set of sample times and stores the results in a bit-wise parallel format. It allows bit-wise parallel software correlation of code-division multiple-access signals to be carried out using long pseudo-random number codes. Bit-wise parallel algorithms speed up software correlation by operating in parallel on multiple samples. The new algorithm uses table look-ups to over-sample a pseudo-random number code. It reduces the PRN code memory requirements of a GPS software receiver by a factor of 3.8 or more, maintains operational efficiency, and keeps code distortion low.
No takes yet. Share an insight, caveat, or question.
Mark L. Psiaki (2006) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: