method 50 can be implemented in parallel using comparators and a few registers each comparator outputs true or false u2014 hence with some additional logic one can deduce whether an entry shall be added or updated or whether the algorithm shall go to the next sample although conceptually the cell candidate list 24 is to be sorted in practice it is sufficient in one embodiment to keep track of two cell candidate registers one having the smallest correlation metric and the one that was added most recently this too can be handled with low complexity and in parallel using comparators and a few registers accordingly the method 50 may be implemented with low complexity consuming little silicon area or battery power in some embodiments complexity may be decreased even further depending on how the algorithms are to be deployed and how much meta information is to be used in subsequent cell search stages for example if the metrics u03b7 n will not be used once the cell candidate list 24 has been formed or the ratio can be calculated at low cost at a later stage then the divider 36 in the matched filter 20 can be removed instead the filter 20 may output u03c1 n and x h n x n in this case the decision u03b7 n gt t fig3 block 56 is replaced by u03c1 n gt t u00b7 x h n x n this means that a division is replaced by a multiplication which is generally a lower complexity operation furthermore in this case x h n x n may be stored in the cell candidate list 24 instead of u03b7 n other optimizations will be apparent to those of skill in the art given the present disclosure all of which fall.