Method and apparatus for the parallel correlator and applications thereof

Number of patents in Portfolio can not be more than 2000

United States of America Patent

PATENT NO 7433910
APP PUB NO 20050185741A1
SERIAL NO

11107862

Stats

ATTORNEY / AGENT: (SPONSORED)

Importance

Loading Importance Indicators... loading....

Abstract

See full text

A fast correlator transform (FCT) algorithm and methods and systems for implementing same, correlate an encoded data word (X.sub.0-X.sub.M-1) with encoding coefficients (C.sub.0-C.sub.M-1), wherein each of (X.sub.0-X.sub.M-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, X.sub.0 is multiplied by each state (C.sub.0(0)through C.sub.0(k-1)) of the coefficient C.sub.0, thereby generating results X.sub.0C.sub.0(0) through X.sub.0C.sub.0(k-1). This is repeating for data bits (X.sub.1-X.sub.M-1) and corresponding coefficients (C.sub.1-C.sub.M-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 (C.sub.0-C.sub.M-1). The final layer of results is compared to identify a most likely code encoded on said data word. In an embodiment, the summations are pruned to exclude summations that would result in invalid combinations of the encoding coefficients (C.sub.0-C.sub.M-1). In an embodiment, substantially the same hardware is utilized for processing in-phase and quadrature phase components of the data word (X.sub.0-X.sub.M-1). In an embodiment, the coefficients (C.sub.0-C.sub.M-1) represent real numbers. In an alternative embodiment, the coefficients (C.sub.0-C.sub.M-1) represent complex numbers. In an embodiment, the coefficients (C.sub.0-C.sub.M-1) are represented with a single bit. Alternatively, the coefficients (C.sub.0-C.sub.M-1) are represented with multiple bits (e.g., magnitude). In an embodiment, the coefficients (C.sub.0-C.sub.M-1) represent a cyclic code keying ('CCK') code set substantially in accordance with IEEE 802.11 WLAN standard.

Loading the Abstract Image... loading....

First Claim

See full text

Family

Loading Family data... loading....

Patent Owner(s)

  • PARKERVISION, INC.

International Classification(s)

  • [Classification Symbol]
  • [Patents Count]

Inventor(s)

Inventor Name Address # of filed Patents Total Citations
Rawlins, Gregory S Heathrow, FL 163 7461
Rawlins, Michael W Lake Mary, FL 129 6754
Sorrells, David F Middleburg, FL 233 10982

Cited Art Landscape

Load Citation

Patent Citation Ranking

Forward Cite Landscape

Load Citation