Claims
- 1. A digital signal processor that performs path search calculations for a Rake receiver in a CDMA system, the digital signal processor comprising:
a first storage area to hold received chips; a second storage area to hold code chips; wherein the digital signal processor, in response to a single instruction, performs multiple despread operations on the received chips and the code chips, the received chips and the code chips shifted relative to each other for each of the despread operations.
- 2. The digital signal processor of claim 1, wherein the code chips are limited to values of ±1±j.
- 3. The digital signal processor of claim 2, wherein the code chips are represented as two bits comprising one real bit and one imaginary bit.
- 4. The digital signal processor of claim 3, wherein a set code bit represents a value of −1 and a clear code bit represents a value of +1.
- 5. The digital signal processor of claim 3, wherein complex multiplications of the despread operations are performed by passing or negating received chips.
- 6. The digital signal processor of claim 1, wherein the code chips are limited to values of +1, −1, +j, or −j.
- 7. The digital signal processor of claim 1, wherein received chips are represented as 16 bits.
- 8. The digital signal processor of claim 7, wherein the received chips are represented by 8 real, bits and 8 imaginary bits.
- 9. The digital signal processor of claim 1, wherein received chips are represented as 32 bits.
- 10. The digital signal processor of claim 9, wherein the received chips are represented by 16 real bits and 16 imaginary bits.
- 11. The digital signal processor of claim 1, wherein the code chips have a spreading factor divisible by 8.
- 12. A digital signal processor that performs path search calculations for a Rake receiver in a CDMA system, the digital signal processor comprising:
a first storage area to hold complex values representative of received chips in a CDMA system; a second storage area to hold complex values representative of code chips in a CDMA system; a complex multiply-add unit to multiply complex values in the first storage area times complex values in the second storage area and to sum the results; and wherein the multiply-add unit performs a plurality of multiplications on the complex values in the first and second storage areas and either the first or second storage area shifts the complex values stored therein after each multiplication.
- 13. The digital signal processor of claim 12, wherein said complex multiply-add unit sets all multiplications above or below a certain cut point to zero.
- 14. The digital signal processor of claim 12, wherein said complex multiply-add unit receives instructions regarding which of said multiplied complex values is to be included in said sum.
- 15. The digital signal processor of claim 12, wherein the code chips are limited to the values of ±1±j.
- 16. The digital signal processor of claim 15, wherein the code chips are represented as two bits comprising one real bit and one imaginary bit.
- 17. The digital signal processor of claim 16, wherein a set code bit represents a value of −1 and a clear code bit represents a value of +1.
- 18. The digital signal processor of claim 16, wherein the multiplications are performed by passing or negating received chips.
- 19. The digital signal processor of claim 12, wherein the code chips are limited to values of +1, −1, +j, or −j.
- 20. The digital signal processor of claim 12, wherein received chips are represented as 16 bits.
- 21. The digital signal processor of claim 20, wherein the received chips are represented by 8 real bits and 8 imaginary bits.
- 22. The digital signal processor of claim 12, wherein received chips are represented as 32 bits.
- 23. The digital signal processor of claim 22, wherein the received chips are represented by 16 real bits and 16 imaginary bits.
- 24. The digital signal processor of claim 12, wherein the code chips have a spreading factor divisible by 8.
- 25. A method of processing a CDMA signal in a digital signal processor to perform path search calculations for a Rake receiver, the method comprising the step of:
in response to a single instruction, performing multiple despread operations on received chips and code chips in a CDMA system, where the received chips and the code chips are shifted relative to each other for each of the despread operations.
- 26. The digital signal processor of claim 25, wherein the code chips are values of +1+j.
- 27. The digital signal processor of claim 26, wherein the code chips are represented as two bits comprising one real bit and one imaginary bit.
- 28. The digital signal processor of claim 27, wherein a set code bit represents a value of −1 and a clear code bit represents a value of +1.
- 29. The digital signal processor of claim 27, wherein complex multiplications of the despread operations are performed by passing or negating received chips.
- 30. The digital signal processor of claim 25, wherein the code chips are limited to values of +1, −1, +j, or −j.
- 31. The digital signal processor of claim 25, wherein received chips are represented as 16 bits.
- 32. The digital signal processor of claim 31, wherein the received chips are represented by 8 real bits and 8 imaginary bits.
- 33. The digital signal processor of claim 25, wherein received chips are represented as 32 bits.
- 34. The digital signal processor of claim 33, wherein the received chips are represented by 16 real bits and 16 imaginary bits.
- 35. The digital signal processor of claim 25, wherein the code chips have a spreading factor divisible by 8.
- 36. A method of using a digital signal processor for performing path search calculations for a Rake receiver in a CDMA system, the method comprising:
issuing one or more instructions to load a register with received chip values; issuing one or more instructions to cause a digital signal processor to load a register with code chip values; and issuing a single instruction to despread the received chip values against the code chip values multiple times with a relative shift between the received chips and code chips each time the received chips are despread against the code chips.
- 37. The digital signal processor of claim 36, wherein the code chips are values of ±1±j.
- 38. The digital signal processor of claim 37, wherein the code chips are represented as two bits comprising one real bit and one imaginary bit.
- 39. The digital signal processor of claim 38, wherein a set code bit represents a value of −1 and a clear code bit represents a value of +1.
- 40. The digital signal processor of claim 38, wherein complex multiplications of the despreads are performed by passing or negating received chips.
- 41. The digital signal processor of claim 36, wherein the code chips are limited to values of +1, −1, +j, or −j.
- 42. The digital signal processor of claim 36, wherein received chips are represented as 16 bits.
- 43. The digital signal processor of claim 42, wherein the received chips are represented by 8 real bits and 8 imaginary bits.
- 44. The digital signal processor of claim 36, wherein received chips are represented as 32 bits.
- 45. The digital signal processor of claim 44, wherein the received chips are represented by 16 real bits and 16 imaginary bits.
- 46. The digital signal processor of claim 36, wherein the code chips have a spreading factor divisible by 8.
- 47. A digital signal processor comprising:
a first storage area to hold a first set of complex values; a second storage area to hold a second set complex values; a complex multiply-add unit to multiply complex values in the first storage area times complex values in the second storage area and to sum the results; and wherein the multiply-add unit performs a plurality of multiplications on the complex values in the first and second storage areas and either the first or second storage area shifts the complex values stored therein after each multiplication.
- 48. A digital signal processor of claim 47, wherein said complex multiply-add unit sets all multiplications above or below a certain cut point to zero.
- 49. The digital signal processor as per claim 47 wherein said complex multiply-add unit receives instructions regarding which of said multiplied complex values is to be included in said sum.
- 50. The digital signal processor as per claim 47 wherein said digital signal processor works in conjunction with a Rake receiver of a CDMA system and said first set of complex values are representative of received chips and the second set of complex values are representative of code chips.
- 51. The digital signal processor of claim 50, wherein the code chips are limited to the values of ±1±j.
- 52. The digital signal processor of claim 51, wherein the code chips are represented as two bits comprising one real bit and one imaginary bit.
- 53. The digital signal processor of claim 52, wherein a set code bit represents a value of −1 and a clear code bit represents a value of +1.
- 54. The digital signal processor of claim 52, wherein the multiplications are performed by passing or negating received chips.
- 55. The digital signal processor of claim 50, wherein the code chips are limited to values of +1, −1+j, or −j.
- 56. The digital signal processor of claim 50, wherein received chips are represented as 16 bits.
- 57. The digital signal processor of claim 56, wherein the received chips are represented by 8 real bits and 8 imaginary bits.
- 58. The digital signal processor of claim 50, wherein received chips are represented as 32 bits.
- 59. The digital signal processor of claim 58, wherein the received chips are represented by 16 real bits and 16 imaginary bits.
- 60. The digital signal processor of claim 50, wherein the code chips have a spreading factor divisible by 8.
PRIORITY INFORMATION
[0001] This application claims priority from provisional application Ser. No. 60/347,767 filed Jan. 10, 2002, which is incorporated herein by reference in its entirety.
Provisional Applications (1)
|
Number |
Date |
Country |
|
60347767 |
Jan 2002 |
US |