Professional Documents
Culture Documents
Dr. Chih-Peng Li ()
1
Table of Contents
Maximal Ratio Combining (MRC) Implementation for Uplink RAKE Receiver Implementation for Downlink RAKE Receiver Multipath Searcher (Acquisition or Delay Estimation) RAKE Finger Management Hardware Functions Partitioning of Baseband Signal Processing
Receiver
r = SNR: SNRL = 2 2 n
2 L
G r
l =1 L l 2 l =1
2 2 Gl n ,l
Since
G r
l =1 l
rl = Gl n ,l l =1 n ,l
L
n ,l
rl
SNRL
G 1
l =1 l
2 n ,l
l =1 2
n ,l
rl
2 L rl 1 = 2 = SNRl 2 l =1 n ,l l =1 L 2
2 Gl n ,l l =1
n ,l
rl*
Channel
RF
SRRC
Rake Receiver
Channel Decoder
Uplink Transmitter
Soft DPDCH
Cch256,1 Ci+jCq W-Dn Finger Delay Adjustment Cch1 Integrate & Dump
Channel Estimator
Buffer
Soft DPCCH
Rake Receiver N
Integrate & Dump Buffer Finger N Soft DPDCH Channel Estimator Finger N Integrate & Dump Buffer Soft DPCCH SIR -for Power Control
C256,1
10
Control OVSF
SRRC Delay Element Frequency Offset Delay D Delay Estimation (Searcher) (Acquisition) Scramble Code Data OVSF 11
MRC
Interpolation
MRC
Channel Decoder
2.
3.
4. 5.
6.
First, the received signal is delayed by the Delay Element by DE chips, which is the same for all RAKE fingers. The delay of DE chips has to be larger than the overall multipath delay spread. The interpolator performs the tracking (fine timing adjustment) and reduces the sampling rate down to one sample per chip. The scramble code de-scrambles the received signals. The OVSF code of control channel reduces the control channel from chip rate to symbol rate. The OVSF code of data channel reduces the data channel from the chip rate to maximal symbol rate of data channel.
12
8.
9.
10.
Frequency offset of the baseband signal is compensated by a phase rotation. Channel estimation parameters are obtained by measuring pilot symbols. Due to the different processing requirements for the control channel, both fast and slow channel estimation are computed for the DPCCH. All the channel estimation algorithms introduces certain delay, which needs to be compensated in both the data channel and the control channel.
13
Implementation Issues
In processing the data in DPDCH, the TFCI information in one frame of DPCCH is needed before the associated DPDCH can be fully processed. This introduces 10 ms delay before DPDCH can be processed. As a result, a buffer is needed to store the 10 ms data. According to the location of this buffer with respect to the RAKE finger operations, there are chiefly three candidates: Buffer in front of RAKE finger operations. Buffer after MRC Two-stage despreading. Data modulation in the uplink direction is BPSK.
14
Channel Compensation
DPDCH(1)
. . .
Interpolation
. . . DPDCH(n)
Interpolation
MRC
TPC, FBI.
. . .
. . .
User 1, Finger L
. . .
Channel Compensation
Interpolation
Interpolation
15
Buffer size (when neglecting multipath delay) = 3 sectors * 2 antennas/sector * 2(I/Q data) * 5 bits/sample * 2 samples/chip * 3840000 chips/sec * 0.01 sec/frame = 4,608,000 bits = 576 KByte.
16
Interpolation
DPDCH(1) Despreading
. . .
DPDCH(1)
DPDCH(n) Despreading
DPDCH(n)
Channel Compensation DPCCH Despreading/ Interpolation TFCI Decoder Channel Compensation Channel Estimation
Interpolation
TPC, FBI.
17
This architecture has the advantage of that the RAKE finger complexity is not increased by multiple DPDCHs. There is only one despreading operation per DPDCH.
Note that there is one despreading operation per DPDCH and per RAKE finger when buffer is located in front of RAKE finger operation.
The despreading process operates with real-value only. This reduces the complexity by half.
18
Buffer size = 15 bits/sample * 3840000 chips/sec * 0.01 sec/frame = 576,000 bits = 72 KByte.
19
Two-Stage Despreading
User 1, Finger 1 DPDCH Despreading SF=4 Interpolation DPCCH Despreading/ Interpolation Channel Compensation Channel Estimation . . . User 1, Finger L DPDCH Despreading SF=4 Interpolation DPCCH Despreading/ Interpolation Channel Compensation Channel Estimation Channel Compensation TFCI Decoder MRC RAM (Buffer: 10ms) Channel Compensation
TPC, FBI.
20
Tow-Stage Despreading
Two-stage despreading can be adopted in the uplink direction. This architecture exploits the fact that all data channel have a common root in the OVSF code tree. As a result, the despreading operation from the chip rate to the symbol rate can be split into two stages: 1st stage: fixed rate despreading with the common root code. 2nd stage: variable rate despreading with the residual despreading code. The 2nd stage despreading can be applied once TFCI has been decoded. A buffer is required after MRC to store the soft MRC outputs of the DPDCh for 10 ms.
21
Tow-Stage Despreading
In case of multi-code transmissions, all the spreading factors of DPDCH are 4. As a consequence, the despreading can be done in one step.
Buffer size = 15 bits/sample * 3840000 chips/sec * 0.01 sec/frame / 4 (SF) * 2 Buffers = 288,000 bits = 36 KByte.
22
Re{}
Real Part
Finger 1 Finger 2
Adder
Finger L
26
Delay
MRC
27
Downlink Transmitter
28
29
Searcher Ranges
If the coarse synchronization is not provided by the cell search (downlink) or PRACH preamble detection (uplink), the searcher may be required to search a wide range of propagation delays, which have two components: The delay associated with the base station coverage: this is related to the maximum cell radius that the base station is designed to support. This delay corresponds, in general, to the shortest propagation path that is detected and is usually referred to as the main path. (Coarse Synchronization) The additional delays that come after the main path. The difference in time between the main path and the last path is usually referred to as the multi-path delay spread.
31
Acquisition Mechanisms
The method of searching has the following approaches:
Coherent approach: The searches are performed on the DPCCH or CPICH, where symbol accumulation is achieved only on the pilot symbols. This method give the best results in terms of false alarm and probability of detection. Rely on a more complicated code generator controlling mechanism since multipath searcher must have additional control logic to ensure that only pilot symbols are accumulated.
32
Acquisition Mechanisms
Non-coherent approach: This approach uses any of the symbols within the radio frame and this simplifies the timing control mechanism. The performance is much lower that of coherent approaches. Semi-coherent (most popular): The pilot symbols are coherently accumulated over a number (I) of time slots. Typically, one time slot coherent accumulation is adopted (I=1). The final acquisition outputs are the results of the noncoherent accumulation of J of I coherently accumulated time slots. Typically, non-coherent accumulation is made within one frame, i.e., 15 time slots (J=15).
33
Searcher Architecture
The mechanism of multipath searching is based on correlating the incoming data samples with a locally generated code sequence. The correlation results indicate the potential multipath locations. There are two approaches for implementing the searcher: sliding correlator or matched filter. Bother approaches perform the same function. Typically, since approximate propagation delay has been estimated before this stage, searcher can concentrate its efforts on the multipath delay spread of the channel. As a result, a serial and parallel matched filter architecture can be adopted. However, in certain systems, the approximate propagation delay may not be known by the receiver. Under such situation, the search has to obtain the coarse synchronization.
34
Searcher Architecture
The searcher is typically implemented as a length N code matched filter that has complex code-coefficient. N usually takes a value of 128 or 256, which corresponds to delay spreads of 5 Km or 10 Km.
Delay Line Length = N Over-sampling Rate
CN CN-1
C1
35
15TimeSlot
||
||
15TimeSlot
Peak Search
36
1 Amplitude
0.5
|sin| |cos|
a=max(|sin|,|cos|) b=min(|sin|,|cos|)
(sin)2+(cos)2 |sin|+|cos| a+b/2 a+(sqrt(2)-1)*b max((a+b/8),(53a+37b)/64) 0 -1 -0.8 -0.6 -0.4 -0.2 0 0.2 Radian (pi) 0.4 0.6 0.8 1
37
2. 3. 4. 5.
The profile of semi-coherently accumulated pilot energy is compared with a threshold. The collection is denoted by S. Find the maximum value of the peaks in S. Store the peak in set T. Remove two peaks that are chip on either side of the peak in 2. Repeat steps 2 and 3 until S is empty. If the number of peaks in T is greater than the maximum number (L) preset by the algorithm, find the maximum L peaks in T.
Alternatively, we can select the best N peaks in set T.
6.
t =x/c t =2x/c
t =0
Matched Filter (N=256) Empty
Time
10 Km
40
10 Km
2x/c
1
x/c
Pilot Symbol #1, Path #3 Pilot Symbol #1, Path #2 Pilot Symbol #1, Path #1
t =256 chips
Time
10 Km
x/c
Pilot Symbol #1, Path #3 Pilot Symbol #1, Path #2 Pilot Symbol #1, Path #1
t =512 chips
Matched Filter (N=256)
Time
Accumulated matched filter output stored in the 1st stage of the 256 chips delay.
2x/c
45
t =768 chips
Matched Filter (N=256)
Time
Accumulated matched filter output stored in the 1st stage of the 256 chips delay.
2x/c
46
t =1023.5 chips
Matched Filter (N=256)
Time
Accumulated outputs stored in the 1st stage of the 256 chips delay are shifted to the 2nd stage of the 256 chips delay.
47
t =1024 chips
Matched Filter (N=256)
Empty
Time
Accumulated outputs stored in the 1st stage of the 256 chips delay are shifted to the 2nd stage of the 256 chips delay.
48
49
52
1-
Selection of : The should be large enough to respond to the channel variation. The should be small enough to reduce the error due to the instantaneous noise and interference that passes through the channel estimation filter.
55
2.
3.
Initialization of RAKE Finger Management: RFM (typically implemented in DSP) initializes the multipath search and RAKE finger verification/tracking process by updating related parameters, which includes the active finger set, candidate finger set, inactive finger set, etc. Then, searcher starts to search the multipaths and RFM is ready to read searcher output. After receiving multipaths from the searcher, RFM launches the multipath verification process, which is followed by the finger tracking process. Read Searcher Output: RFM obtains the peaks, together with the associated delays, and compares with the pre-set threshold. New Multipath Checking: If a new multipath found is
56
4.
6.
Finger Tracking Function: The RFM checks the output of channel estimation metric of each active RAKE fingers and evaluate whether to keep or drop a RAKE finger from the active finger set. The metric can be tested once per time slot for a pre-set time duration (e.g. 15 time slots). If all the tests fall below a pre-set threshold, the RFM drops the finger. The finger tracking function has to check all the active fingers. The RAKE finger management function will be done, for example, once per frame (15 time slots). All the parameters mentioned above have to be optimized through simulation and field test. The procedures mentioned above is based on the assumption that the cost of false alarm is much higher than miss detection.
58
59
62