Method and apparatus for a parallel correlator and applications thereof
US7233969B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 18, 2005 |
| Grant date | Jun 19, 2007 |
| Priority date | — |
| Expiry date | Apr 18, 2025 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/147
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A fast correlator transform (FCT) algorithm and methods and systems for implementing same, correlate an encoded data word (X0–XM−) with encoding coefficients (C0–CM−1), wherein each of (X0–XM−1) is represented by one or more bits and each said coefficient is represented by one or more bits, wherein each coefficient has k possible states, and wherein M is greater than 1. In accordance with the invention, X0 is multiplied by each state (C0(0) through C0(k−1)) of the coefficient C0, thereby generating results X0C0(0) through X0C0(k−1). This is repeating for data bits (X1–XM−1) and corresponding coefficients (C1–CM−1), respectively. The results are grouped into N groups. Members of each of the N groups are added to one another, thereby generating a first layer of correlation results. The first layer of results is grouped and the members of each group are summed with one another to generate a second layer of results. This process is repeated as necessary until a final layer of results is generated. The final layer of results includes a separate correlation output for each possible state of the complete set of coefficients (C0–CM−1). The final layer of results is compared to identify a m…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.