The present invention relates to a rake architecture employed in CDMA communication systems. More particularly the invention relates to a rake architecture employing a shared memory designed to significantly reduce the memory capacity required and thereby also reduce a die area of an application specific integrated circuit (ASIC) for the rake architecture without any reduction in system capabilities. The architecture may be employed in all types of communication systems employing a rake receiver including, but not limited to, frequency division duplex (FDD), time division duplex (TDD), and time division-synchronous code division multiple access (TD-SCDMA).
Rake receivers are utilized in many types of communications systems. In the wide band code division multiple access (W-CDMA) type of system, a base station transmits primary and secondary sync codes as well as a common pilot channel (CPICH), the pilot signal being unique to each base station. Wireless mobile units (UEs) then receive and synchronize to these codes in order to establish and support a communication.
Referring to
The early, late and punctual outputs are despread with the code for the specific base station at 18, 16 and 20 respectively. The early and late despread signals undergo integration and dumping at integration and dumping devices 22 and 24, squaring at squaring devices 26 and 28 and are summed at 30 to produce an error signal e (t).
Referring to
The early, late and punctual outputs are despread with the code for the specific base station at 18, 16 and 20 respectively. The early and late despread signals undergo integration and dumping at integration and dumping devices 22 and 24, squaring at squaring devices 26 and 28 and are summed at 30 to produce an error signal e (t).
Referring to
Each of the punctual outputs is fed into separate time delay elements (not shown) of the rake receiver. The purposes of time delay elements is to remove the time ambiguity, shown in
Referring to
The main advantage of the present invention resides in providing an apparatus and method to share the (possibly) many small memories needed to align the tracked multipaths and to move the shared memories ahead of the code tracker. Although the alignment of the multipaths and tracking of their movement is still performed by the code tracker, the code tracker now receives its data from a shared buffer of input symbols versus the more conventional method of sending the input stream to all code trackers and requiring that each code tracker buffers the results and then provides the required delay to obtain alignment.
The invention utilizes a circular buffer, preferably in the form of a shared memory, and has a memory read pointer for each rake finger to provide an offset from the location at which the memory write pointer writes the data, with the offset being associated with each rake finger receiving a multipath component. Each multipath component is sent to its assigned rake finger to undergo code tracking. Since the multipaths are all aligned, the codes are also time aligned, enabling a single code generator to be shared among the code trackers of all of the rake fingers. This novel apparatus and method enable a three-to-one savings in memory as well as reducing the number of code generators required for the rake receiver.
The method and apparatus of the present invention would be better understood upon a consideration of the drawings, in which:
The present invention will be described with reference to the drawing figures where like numbers represent like elements throughout.
The rake receiver 59 utilizes a circular buffer 60, preferably of the shared memory type, operating at twice the chip rate and having a write pointer 60a and six read pointers 60b, (shown as a single lead for purposes of simplicity). The rake receiver 59 performs time alignment by initially moving the multipath pilot signals from the same base station into alignment prior to undergoing code tracking.
Making reference to
Since the multipath components have been lined up, the codes are also time aligned and the desired code generator (i.e. one of 62, 64 and 66) can be shared among the code trackers 10′ of each of the six (6) rake fingers 1 through 6. Three code generators 62, 64 and 66 are provided for respectively generating pseudo-random noise (PN) codes for the three base stations BS1, BS2 and BS3, to be tracked by the UE having the rake receiver shown in
When the code trackers 10′ of the rake fingers request the code generator, 62 for example, to change to one of 64 or 66, the memory read pointer 68 for the rake fingers associated with that code generator are adjusted. The read point corresponding to that code tracker 10′ is incremented, or decremented by 1. The unique memory sharing arrangement of the present invention enables the use of a single memory 60 shared by all six (6) rake fingers, resulting in three-to-one savings in memory based on the fact that, although there is only one shared memory for all six rake fingers, the shared memory (60) operates at twice the chip rate, since the code tracker 10′ requires two samples per chip.
The code tracker 10′ thus provides a punctual time aligned output 70 according to the base station code being decoded. The code tracker 10′ which also includes the code offset circuit 56 shown in
This application is a continuation of U.S. patent application Ser. No. 10/034,874, filed Dec. 27, 2001, which is incorporated by reference as if fully set forth.
Number | Name | Date | Kind |
---|---|---|---|
4164628 | Reilly et al. | Aug 1979 | A |
5535412 | Nadehara | Jul 1996 | A |
5903550 | Spock | May 1999 | A |
5930288 | Eberhardt | Jul 1999 | A |
6011787 | Nakano et al. | Jan 2000 | A |
6078611 | La Rosa et al. | Jun 2000 | A |
6081549 | Shou et al. | Jun 2000 | A |
6192066 | Asanuma | Feb 2001 | B1 |
6215814 | Ylitalo et al. | Apr 2001 | B1 |
6269075 | Tran | Jul 2001 | B1 |
6282234 | Kameno et al. | Aug 2001 | B1 |
6442193 | Hirsch | Aug 2002 | B1 |
6445714 | d'Anjou et al. | Sep 2002 | B1 |
6985516 | Easton et al. | Jan 2006 | B1 |
7031737 | Braam et al. | Apr 2006 | B1 |
7123647 | Sheng | Oct 2006 | B1 |
20020037027 | Medlock et al. | Mar 2002 | A1 |
20020126745 | Prysby et al. | Sep 2002 | A1 |
20020176489 | Sriram et al. | Nov 2002 | A1 |
Number | Date | Country |
---|---|---|
2001-345739 | Dec 2001 | JP |
2003-087221 | Mar 2003 | JP |
2003-115821 | Apr 2003 | JP |
2004-072418 | Mar 2004 | JP |
466840 | Dec 2001 | TW |
466841 | Dec 2001 | TW |
0059123 | Oct 2000 | WO |
Number | Date | Country | |
---|---|---|---|
20040170220 A1 | Sep 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10034874 | Dec 2001 | US |
Child | 10793025 | US |