Low complexity spread spectrum correlator

The implementation of a low complexity differential digital matched filter (DDMF) used as a spread spectrum correlator is considered. It is shown that the complexity of a DDMF is minimised by using only add/subtract operations with a single shift operation and has an identical performance to that of a conventional matched filter correlator. The architecture can be further simplified, if a slight degradation in performance is accepted, and the complexity can be reduced to 50% of that of a conventional spread spectrum correlator