METHOD AND APPARATUS FOR CODE SPACE SEARCH IN A RECEIVER

摘要

Apparatus and methods of implementing code space search of received signals are described herein. A code space search is implemented as a searcher (220) that perform a subtask that is dynamically reconf igurable at each boundary of an initial integration time. Each particular subtask sets forth a programmabl configuration of coherent integration hypothesis that are performed during th initial integration time. The searcher stores the results of the coherent integration hypothesis in a first portion of memory. A search accelerator (250) operates on the initial integration results. The search accelerator can perform coherent integration of various frequency bins of different timing hypothesis, can generate energy values of the coherent integration results, and can generate a non-coherent energy summation. The energy values of the coherent integrations and non-coherent energy summations are stored in a second portion of memory. The ability to reconfigure the subtasks and accelerator operation provides flexibility in search space dimensions.