CN1874170A - United detection method for multiple cells in time division code division multiple access - Google Patents
United detection method for multiple cells in time division code division multiple access Download PDFInfo
- Publication number
- CN1874170A CN1874170A CNA2005100752061A CN200510075206A CN1874170A CN 1874170 A CN1874170 A CN 1874170A CN A2005100752061 A CNA2005100752061 A CN A2005100752061A CN 200510075206 A CN200510075206 A CN 200510075206A CN 1874170 A CN1874170 A CN 1874170A
- Authority
- CN
- China
- Prior art keywords
- mod
- chip
- district
- channel
- sub
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
Multiple cell united detection method includes steps: carrying out channel estimation in multiple code sets for received signal data so as to obtain results of channel estimation of this cell and each adjacent cell; ordinal intercepting results of channel estimation corresponding to each user in this cell from results of channel estimation of this cell and each adjacent cell; based on difference of relative time delay of users' signals among different cells to adjust result of channel estimation of each user in this cell and/or each adjacent cell, or combined estimated results of channel response; using estimated results of combined channel response in each cell carries out united detection for received data so as to obtain detected data. The invention restrains interference of multiple accesses from non-synchronous adjacent cells in same frequency so as to raise system performance of time slot CDMA system in constructing network in same frequency.
Description
Technical field
The present invention relates to the associated detection technique in mobile communication technology field, be specifically related to a kind of multi region combined detection method of time gap code division multi address system.
Background technology
In CDMA (code division multiple access) mobile communication system,, make MAI (multiple access interference) become main an interference of wideband CDMA system owing to have certain correlation between each subscriber signal.Traditional cdma system signal separating method be with MAI as noise processed, regard separately the Signal Separation of unique user as independently process, promptly single user's detection technique.This detection method can cause the signal to noise ratio severe exacerbation, has limited the capacity of system.In fact, comprise many information that can be used for improving the signal separating method accuracy among the MAI, as the subscriber channel sign indicating number that knows, each user's channel estimating etc., multiuser detection is exactly a joint-detection of utilizing these information to carry out.According to the difference of multiple access being disturbed processing method, multiuser detection can be divided into two kinds of Interference Cancellation and joint-detection.Wherein, the basic thought of interference cancellation techniques is a decision-feedback, at first rules out some of data from total received signal, reconstructs the signal of data correspondence according to data and user's spreading code, from total received signal, deduct reconstruction signal again, so loop iteration.Associated detection technique then refers to and makes full use of the multiple access interference, a kind of signal separation techniques of within the step all users' signal all being separated.
In cdma system, can adopt associated detection technique to eliminate multiple access to the received signal of this sub-district and disturb and intersymbol interference.TD-SCDMA (Time Division-Synchronous Code Division Multiple Access) promptly is a kind of slot CDMA system that this sub-district multiple user signals has been adopted the joint-detection scheme.
In the TD-SCDMA system, the burst structure of conventional time slot as shown in Figure 1: the midamble (intermediate code is also referred to as channel estimating code) at burst middle part is used for carrying out channel estimating, and the data block on both sides is used for transmit traffic data.
The associated detecting method of single sub-district has utilized all users of this sub-district to send the structural information (comprising spreading code and channel response) of signal, the interference signal of other sub-districts is all handled as the white Gaussian noise of time, therefore, single community associated detection algorithm has stronger ability to suppressing intersymbol interference with this sub-district multiple access interference, for single sub-district or alien frequencies cdma system, can greatly improve the performance of system.
But, under the identical networking situation, exist stronger phase mutual interference between the homogeneous frequency adjacent area signal, and interference between common-frequency near regions has very important influence to the performance of system, especially at the intersection of homogeneous frequency adjacent area, when having a plurality of code channels of homogeneous frequency adjacent area user to work, the most important often interference of co-channel interference.At this moment, the method for single community associated detection to the interference of co-frequency neighbor cell with powerless.
If can utilize the structural information of homogeneous frequency adjacent area, with associated detection technique from single cell extension to common frequency multi-cell, the performance in the time of will greatly improving the slot CDMA system identical networking.In view of this, Chinese patent application 200410080196.6 provides a kind of " multi region combined detection method of time gap code division multi address system ", in the method, utilize the channel estimation methods of many yards collection to obtain the channel estimation results of each neighbor cell, and the code channel of each neighbor cell carried out the code channel grouping, utilize the channel estimation results of each neighbor cell and the result of code channel grouping then, carry out joint-detection.This joint-detection scheme is used for the common frequency multi-cell slot CDMA system, and the multiple access that can greatly suppress homogeneous frequency adjacent area disturbs, and improves the systematic function of slot CDMA system when homogeneous frequency adjacent area is worked.This technical scheme is applicable to different districts subscriber signal synchronous or near-synchronous or the little situation of deviation in relative time delay.
Generally, all have relative time delay between the common frequency multi-cell signal.If the only interference of the most contiguous co-frequency cell on consideration and this geographical position, sub-district, relative time delay can be smaller, also can guarantee main footpath substantially in window so each user's of different districts channel response window is got according to this sub-district, thereby the influence that produce relative time delay can be ignored.But when large-scale network-estabilishing, may also to consider the co-channel interference of peripheral cell; When the layering networking, also to consider co-channel interference between macrocell and Microcell or the like.For example, lead the footpath in neighbor cell shown in Figure 2 and this sub-district in the subscriber channel estimated result and concern in the schematic diagram that adjacent sub-district 1 has less Δ T in relative time delay with this sub-district
1, each user's channel estimation results intercepts according to the method for this sub-district and can guarantee that also main footpath is substantially in the result in this sub-district; And adjacent sub-district 2 has less Δ T in relative time delay with this sub-district
2For this co-channel interference, has bigger relative time delay between multi-cell signals, if each user's channel estimation results still intercepts according to the method for this sub-district in should the neighbour sub-district, then can cause this to be intercepted by other users in this sub-district with the householder footpath, cause the interference of co-frequency neighbor cell correctly not eliminate, cause the severe exacerbation of systematic function.
Summary of the invention
The purpose of this invention is to provide a kind of multi region combined detection method of time gap code division multi address system, can not adapt to the shortcoming that has situation in big relative time delay between the common frequency multi-cell signal to overcome prior art, the correct interference of eliminating homogeneous frequency adjacent area improves the systematic function of slot CDMA system when the homogeneous frequency adjacent area work with big relative time delay.
For this reason, the invention provides following technical scheme:
A kind of multi region combined detection method of time gap code division multi address system comprises step:
A, the signal data that receives is carried out many yards collection channel estimating, obtain the channel estimation results of this sub-district and each neighbor cell;
B, from the channel estimation results of the channel estimation results of this sub-district and neighbor cell, intercept channel estimation results successively respectively to each user in should the sub-district;
C, adjust described this sub-district and/or each each user's of neighbor cell channel estimation results according to the relative time delay between subscriber signal difference in the different districts;
D, calculate the estimated result of this sub-district and the response of neighbor cell aggregate channel according to each user's spreading code and corresponding adjusted channel estimation results;
E, utilize the estimated result of the aggregate channel response of each sub-district to carry out joint-detection, obtain to detect data receiving data.
A kind of multi region combined detection method of time gap code division multi address system comprises step:
A ', the signal data that receives is carried out many yards collection channel estimating, obtain the channel estimation results of this sub-district and each neighbor cell;
B ', from the channel estimation results of the channel estimation results of this sub-district and neighbor cell, intercept channel estimation results successively respectively to each user in should the sub-district;
C ', calculate the estimated result of this sub-district and the response of neighbor cell aggregate channel according to each user's spreading code and corresponding channel estimation results;
D ', adjust the estimated result of the aggregate channel response of each user in described this sub-district and the neighbor cell according to the relative time delay between subscriber signal difference in the different districts;
E ', the estimated result that utilizes adjusted aggregate channel to respond carry out joint-detection to receiving data, obtain to detect data.
Intercept each subscriber channel estimated result among described step B and the step B ' according to the following steps:
B1, set the channel estimation results total length L n of each sub-district;
B2, obtain the relative time delay difference Δ T between each neighbor cell and this community user signal
n, and to poor Δ T in described relative time delay
nRound, obtain standard delay inequality Δ T '
n
B3, intercept the channel estimation results of each user in this sub-district successively from the 1st chip of the total channel estimation results in this sub-district;
If the b4 neighbor cell signal falls behind than this sub-district, then from the Δ T ' of the total channel estimation results of described neighbor cell
n+ 1 chip plays the channel estimation results of each user in this neighbor cell of circulation intercepting;
If the b5 neighbor cell signal is more leading than this sub-district, then from the Ln-Δ T ' of the total channel estimation results of described neighbor cell
n+ 1 chip plays the channel estimation results of each user in this neighbor cell of circulation intercepting.
Alternatively, described to difference Δ T in relative time delay
nThe operation that rounds is specially:
To poor Δ T in described relative time delay
nUnder round or on round or self-defined rounding.
Described step C specifically comprises:
C1, to set this community user channel estimation results length be W1, and adjacent community user channel estimation results length is W2; The length of spreading code is Q;
C2, expand each subscriber channel estimated result of described this sub-district in the following manner:
L1 of expansion predetermined length put 0 chip before each subscriber channel estimated result of this sub-district, if there is not leading this cell signal of neighbor cell signal, then not expanding is l1=0; Put 0 chip l2 of back expansion predetermined length, if there is not neighbor cell signal to fall behind this cell signal, then not expanding is l2=0;
C3, when W1+l2 〉=W2, expand each subscriber channel estimated result of each neighbor cell in the following manner:
(1) when neighbor cell signal falls behind than this sub-district,
If mod is (Δ T '
n, Q)≤and l2+ (W1-W2), then before each subscriber channel estimated result of adjacent sub-district, expand l1+mod (Δ T '
n, Q) individual 0 the chip of putting is expanded l2+ (W1-W2)-mod (Δ T ' behind the result
n, Q) individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l2+ (W1-W2) and Q-mod (Δ T '
n, Q)≤and l1, then before each subscriber channel estimated result of adjacent sub-district, expand l1-(Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting, expand l2+ (W1-W2)+(Q-mod (Δ T ' behind the result
n, Q)) and individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l2+ (W1-W2) and Q-mod (Δ T '
n, Q)＞and l1, then as mod (Δ T '
n, Q)≤during l2+W1, before each subscriber channel estimated result of adjacent sub-district, expand l1+mod (Δ T '
n, Q) individual 0 the chip of putting removes mod (Δ T ' behind the result
n, Q)-(l2+ (W1-W2)) individual chip; As Q-mod (Δ T '
n, Q)≤during l1+W2, remove preceding (Q-mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q))-a l1 chip, expand l2+ (W1-W2)+(Q-mod (Δ T ' behind the result
n, Q)) and individual 0 the chip of putting; As mod (Δ T '
n, Q)＞l2+W1 and Q-mod (Δ T '
n, Q)＞during l1+W2, this subscriber channel estimated result is that complete 0 the chip of W1+l1+l2 constitutes by a length;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T '
n, Q)≤and l1, then before each subscriber channel estimated result of adjacent sub-district, expand l1-mod (Δ T '
n, Q) individual 0 the chip of putting is expanded l2+ (W1-W2)+mod (Δ T ' behind the result
n, Q) individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l1 and Q-mod (Δ T '
n, Q)≤and l2+ (W1-W2), then before each subscriber channel estimated result of adjacent sub-district, expand l1+ (Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting, expand l2+ (W1-W2)-(Q-mod (Δ T ' behind the result
n, Q)) and individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l1 and Q-mod (Δ T '
n, Q)＞and l2+ (W1-W2), then as mod (Δ T '
n, Q)≤during l1+W2, remove preceding mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-and a l1 chip, expand l2+ (W1-W2)+mod (Δ T ' behind the result
n, Q) individual 0 the chip of putting; As Q-mod (Δ T '
n, Q)≤during l2+W1, before each subscriber channel estimated result of adjacent sub-district, expand l1+ (Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting, remove (Q-mod (Δ T ' behind the result
n, Q))-(l2+ (W1-W2)) individual chip; As mod (Δ T '
n, Q)＞l1+W2 and Q-mod (Δ T '
n, Q)＞during l2+W1, this subscriber channel estimated result is that complete 0 the chip of W1+l1+l2 constitutes by a length;
C4, when W1+l2＜W2, expand each subscriber channel estimated result of each neighbor cell in the following manner:
(1) when neighbor cell signal falls behind than this sub-district,
If Q-mod is (Δ T '
n, Q)≤and l1, then before each subscriber channel estimated result of adjacent sub-district, expand l1-(Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting; If Q-mod is (Δ T '
n, Q) 〉=(W2-(W1+l2)), then behind the result, expand (Q-mod (Δ T '
n, Q))-(W2-(W1+l2)) is individual to put 0 chip, if Q-mod is (Δ T '
n, Q)＜(W2-(W1+l2)), then remove (W2-(W1+l2))-(Q-mod (Δ T ' behind the result
n, Q)) and individual chip;
If Q-mod is (Δ T '
n, Q)＞and l1, then before each subscriber channel estimated result of adjacent sub-district, expand l1+mod (Δ T '
n, Q) individual 0 the chip of putting; If mod is (Δ T '
n, Q)≤and W1+l2, then remove back mod (Δ T '
n, Q)+(W2-(W1+l2)) individual chip is if mod is (Δ T '
n, Q)＞W1+l2, then this subscriber channel estimated result will be that complete 0 the chip of W1+l1+l2 constitutes by a length, and not consider the expansion of front;
Perhaps, if Q-mod is (Δ T '
n, Q)＞l1 and Q-mod (Δ T '
n, Q)≤l1+W2, then remove preceding Q-mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-a l1 chip; If Q-mod is (Δ T '
n, Q) 〉=(W2-(W1+l2)), then expand (Q-mod (Δ T ' behind the result
n, Q))-(W2-(W1+l2)) individual chip of 0 of putting; If Q-mod is (Δ T '
n, Q)＜(W2-(W1+l2)), then remove (W2-(W1+l2))-(Q-mod (Δ T ' behind the result
n, Q)) and individual chip; If Q-mod is (Δ T '
n, Q)＞l1+W2, then this subscriber channel estimated result is that complete 0 the chip of W1+l1+l2 constitutes by a length;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T '
n, Q)≤and l1, then before each subscriber channel estimated result of adjacent sub-district, expand l1-mod (Δ T '
n, Q) individual 0 the chip of putting; If mod is (Δ T '
n, Q) 〉=(W2-(W1+l2)), then behind the result, expand mod (Δ T '
n, Q)-(W2-(W1+l2)) is individual to put 0 chip, if mod is (Δ T '
n, Q)＜(W2-(W1+l2)), remove (W2-(W1+l2))-mod (Δ T ' behind the result
n, Q) individual chip;
If mod is (Δ T '
n, Q)＞l1 and mod (Δ T '
n, Q)≤l1+W2, then remove preceding mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-a l1 chip; If mod is (Δ T '
n, Q) 〉=(W2-(W1+l2)), then expand mod (Δ T ' behind the result
n, Q)-(W2-(W1+l2)) individual 0 the chip of putting; If mod is (Δ T '
n, Q)＜(W2-(W1+l2)), then remove (W2-(W1+l2))-mod (Δ T ' behind the result
n, Q) individual chip; If mod is (Δ T '
n, Q)＞l1+W2, then this subscriber channel estimated result is that complete 0 the chip of W1+l1+l2 constitutes by a length;
Perhaps, if mod is (Δ T '
n, Q)＞and l1, then before each subscriber channel estimated result of adjacent sub-district, expand l1+Q-mod (Δ T '
n, Q) individual 0 the chip of putting; If Q-mod is (Δ T '
n, Q)≤and W1+l2, remove back Q-mod (Δ T '
n, Q)+(W2-(W1+l2)) individual chip; If Q-mod is (Δ T '
n, Q)＞W1+l2, then this subscriber channel estimated result will be that complete 0 the chip of W1+l1+l2 constitutes by a length, and not consider the expansion of front.
Described step D ' specifically comprises:
D1 ', the estimated result length of setting this community user aggregate channel response are W3, and the estimated result length of adjacent community user aggregate channel response is W4; The length of spreading code is Q;
D2 ', expand the estimated result of described this sub-district each user's aggregate channel response in the following manner:
L3 of expansion predetermined length put 0 chip before the estimated result of each user's aggregate channel response of this sub-district, if there is not leading this cell signal of neighbor cell signal, then do not expand, i.e. l3=0; Put 0 chip l4 of back expansion predetermined length,, then do not expand, i.e. l4=0 if there is not neighbor cell signal to fall behind this cell signal;
D3 ', when W3+l4 〉=W4, expand the estimated result of each user's aggregate channel response of each neighbor cell in the following manner:
(1) when neighbor cell signal falls behind than this sub-district,
If mod is (Δ T '
n, Q)≤and l4+ (W3-W4), then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3+mod (Δ T '
n, Q) individual 0 the chip of putting is expanded l4+ (W3-W4)-mod (Δ T ' behind the result
n, Q) individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l4+ (W3-W4) and Q-mod (Δ T '
n, Q)≤and l3, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3-(Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting, expand l4+ (W3-W4)+(Q-mod (Δ T ' behind the result
n, Q)) and individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l4+ (W3-W4) and Q-mod (Δ T '
n, Q)＞and l3, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3+mod (Δ T '
n, Q) individual 0 the chip of putting removes mod (Δ T ' behind the result
n, Q)-(l4+ (W3-W4)) individual chip; Perhaps remove preceding (Q-mod (the Δ T ' of the estimated result of each user's aggregate channel response of adjacent sub-district
n, Q))-a l3 chip, expand l4+ (W3-W4)+(Q-mod (Δ T ' behind the result
n, Q)) and individual 0 the chip of putting;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T '
n, Q)≤and l3, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3-mod (Δ T '
n, Q) individual 0 the chip of putting is expanded l4+ (W3-W4)+mod (Δ T ' behind the result
n, Q) individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l3 and Q-mod (Δ T '
n, Q)≤and l4+ (W3-W4), then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3+ (Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting, expand l4+ (W3-W4)-(Q-mod (Δ T ' behind the result
n, Q)) and individual 0 the chip of putting;
If mod is (Δ T '
n, Q)＞l3 and Q-mod (Δ T '
n, Q)＞l4+ (W3-W4), then remove preceding mod (the Δ T ' of the estimated result of each user's aggregate channel response of adjacent sub-district
n, Q)-and a l3 chip, expand l4+ (W3-W4)+mod (Δ T ' behind the result
n, Q) individual 0 the chip of putting; Perhaps before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3+ (Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting, remove (Q-mod (Δ T ' behind the result
n, Q))-(l4+ (W3-W4)) individual chip;
D4 ' expands the estimated result of each user's aggregate channel response of each neighbor cell in the following manner when W3+l4＜W4:
(1) when neighbor cell signal falls behind than this sub-district,
If Q-mod is (Δ T '
n, Q)≤and l3, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3-(Q-mod (Δ T '
n, Q)) and individual 0 the chip of putting; If Q-mod is (Δ T '
n, Q) 〉=(W4-(W3+l4)), expansion (Q-mod (Δ T ' behind the result
n, Q))-(W4-(W3+l4)) is individual to put 0 chip, if Q-mod is (Δ T '
n, Q)＜(W4-(W3+l4)), remove (W4-(W3+l4))-(Q-mod (Δ T ' behind the result
n, Q)) and individual chip;
If Q-mod is (Δ T '
n, Q)＞and l3, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3+mod (Δ T '
n, Q) individual 0 the chip of putting removes mod (Δ T ' behind the result
n, Q)+(W4-(W3+l4)) individual chip;
Perhaps, if Q-mod is (Δ T '
n, Q)＞l3, remove preceding Q-mod (the Δ T ' of the estimated result of each user's aggregate channel response of adjacent sub-district
n, Q)-a l3 chip; If Q-mod is (Δ T '
n, Q) 〉=(W4-(W3+l4)), expansion (Q-mod (Δ T ' behind the result
n, Q))-(W4-(W3+l4)) individual chip of 0 of putting; If Q-mod is (Δ T '
n, Q)＜(W4-(W3+l4)), remove (W4-(W3+l4))-(Q-mod (Δ T ' behind the result
n, Q)) and individual chip;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T '
n, Q)≤and l3, before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3-mod (Δ T '
n, Q) individual 0 the chip of putting; If mod is (Δ T '
n, Q) 〉=(W4-(W3+l4)), expand mod (Δ T ' behind the result
n, Q)-(W4-(W3+l4)) is individual to put 0 chip, if mod is (Δ T '
n, Q)＜(W4-(W3+l4)), remove (W4-(W3+l4))-mod (Δ T ' behind the result
n, Q) individual chip;
If mod is (Δ T '
n, Q)＞l3, remove preceding mod (the Δ T ' of the estimated result of each user's aggregate channel response of adjacent sub-district
n, Q)-a l3 chip; If mod is (Δ T '
n, Q) 〉=(W4-(W3+l4)), behind the result, expand mod (Δ T '
n, Q)-(W4-(W3+l4)) is individual to put 0 chip, if mod is (Δ T '
n, Q)＜(W4-(W3+l4)), remove (W4-(W3+l4))-mod (Δ T ' behind the result
n, Q) individual chip;
Perhaps, if mod is (Δ T '
n, Q)＞and l3, before the estimated result of each user's aggregate channel response of adjacent sub-district, expand l3+Q-mod (Δ T '
n, Q) individual 0 the chip of putting; Remove Q-mod (Δ T ' behind the result
n, Q)+(W4-(W3+l4)) individual chip.
The estimated result of this sub-district and adjacent each user's of sub-district aggregate channel response is b=C h, and wherein, C is this sub-district or adjacent sub-district user's a pairing spreading code of code channel, and is the convolution algorithm symbol, and h is this user's a channel estimation results.
Preferably, between step B and step D, also comprise step:
Code channel to each neighbor cell divides into groups.
Preferably, between step B ' and step D ', also comprise step:
Code channel to each neighbor cell divides into groups.
Alternatively, in the following manner the code channel of each neighbor cell is divided into groups:
Divide into groups based on the code channel of code channel affiliated subdistrict to each neighbor cell; And/or
Divide into groups based on code channel power or amplitude code channel to each neighbor cell; And/or
Divide into groups based on the code channel of code channel correlation to each neighbor cell.
By above technical scheme provided by the invention as can be seen, the present invention is directed to the situation that has relative time delay in the cdma system between the common frequency multi-cell signal, utilize each user's of information adjustment in relative time delay different districts of minizone channel response, this adjustment process can be carried out before the estimated result of the aggregate channel response of calculating this sub-district and adjacent sub-district neatly, also can carry out behind the estimated result of the aggregate channel response of obtaining this sub-district and adjacent sub-district; And then realize that with adjusted channel response multi-plot joint detects, thereby avoided having community user master footpath exit window and the detection mistake that causes in big relative time delay, greatly suppressed to have relative time delay, the multiple access of the homogeneous frequency adjacent area when particularly time delay is big disturbs, and has improved the systematic function of slot CDMA system when actual identical networking effectively.
Description of drawings
Fig. 1 is a TD-SCDMA business time-slot burst structure schematic diagram;
Fig. 2 leads the footpath to concern schematic diagram in the subscriber channel estimated result in neighbor cell and this sub-district;
Fig. 3 is the realization flow figure of the inventive method;
Fig. 4 a to Figure 41 is the adjustment schematic diagram of neighbor cell subscriber channel estimated result under the different situations;
Fig. 5 is that different districts channel estimation results position concerns schematic diagram.
Embodiment
Core of the present invention is at the situation that has relative time delay between the homogeneous frequency adjacent area signal, at first utilize the channel estimation methods of many yards collection to obtain the channel estimation results of each neighbor cell, poor according to the relative time delay that exists between each subscriber signal of different districts then, each user's that Adjustment System intercepts from each cell channel estimated result channel estimation results.Can adjust this sub-district and/or each each user's of neighbor cell channel estimation results earlier according to the value in relative time delay, calculate the estimated result of the aggregate channel response of this sub-district and neighbor cell again according to adjusted channel estimation results; Also can calculate the estimated result of the aggregate channel response of this sub-district and neighbor cell earlier, again according to relative time delay value the estimated result of combinations thereof channel response is adjusted.Thereby other users' signal in avoiding in each user's channel estimation results, introducing with the sub-district, and then utilize the aggregate channel estimated result that obtains to carry out the multi-plot joint detection to receiving data, obtain detecting data.
In order to make those skilled in the art person understand the present invention program better, the present invention is described in further detail below in conjunction with drawings and embodiments.
The realization flow of the inventive method may further comprise the steps as shown in Figure 3:
Step 301: multi-cell channel is estimated: the signal data that receives is carried out many yards collection channel estimating, obtain the channel estimation results of this sub-district and each neighbor cell.
What the channel estimating code part of a plurality of co-frequency cells was corresponding is the channel estimating coded signal of a plurality of yards collection, adopts the method for many yards collection channel estimating, can obtain the channel estimation results of a plurality of homogeneous frequency adjacent areas.
There is the situation of many yards collection channel estimating code response signals when working, adopts multi-code set associated channel iteration method of estimation, can obtain the channel estimation results of a plurality of sub-districts based on finite time position judgment feedback processing at common frequency multi-cell.Detailed process is as follows:
Result to solid size collection channel estimating carries out the finite time decision process, only keep limited tap with strong signal response, recover other yards collection interference signal thus, and offset this interference signal, obtain the net signal of each yard collection, net signal with each yard collection carries out solid size collection channel estimating again, repeats above-mentioned processing after reaching iterations, the delivery channel estimated result.
Can also adopt many yards collection channel estimation methods of optimization, from solid size collection channel estimation results, extract the maximum interference tap, directly disturb the interative computation of recovery and Interference Cancellation, thereby obtain the channel estimation results of a plurality of sub-districts.
Step 302: from the channel estimation results of the channel estimation results of this sub-district and neighbor cell, intercept channel estimation results respectively successively to each user in should the sub-district.
Step 303: difference is adjusted the channel estimation results of this sub-district and/or each neighbor cell or the estimated result of aggregate channel response according to the relative time delay between the subscriber signal in the different districts.
By this adjustment, make between the channel estimation results of the channel estimation results of adjacent community user and this community user, or embody correct precedence relationship in time between the estimated result of the aggregate channel response of the estimated result of the aggregate channel of adjacent community user response and this community user, and avoid in each user's channel estimation results or the estimated result of aggregate channel response in introduce with the sub-district in other users' signal, the Recombinant Interferon of adjacent sub-district is correctly eliminated when guaranteeing joint-detection.
Concrete adjustment mode will be described in detail later.
Step 304: the channel estimation results to adjusted each sub-district carries out joint-detection, obtains to detect data.
In order to reduce the complexity of joint-detection, can be earlier before the channel estimation results to adjusted each sub-district carries out joint-detection the code channel of each neighbor cell be carried out the code channel grouping, and then the channel estimation results of adjusted this sub-district and the code channel channel estimation results of the neighbor cell after the grouping are carried out joint-detection.
Can carry out the code channel grouping to code channel by following several modes:
(1) based on the group technology of code channel affiliated subdistrict: have several co-frequency cells just to be set as several groups, the code channel in every group includes only this sub-district code channel.
(2) based on the group technology of code channel power or amplitude:,, can estimate the power or the amplitude of each code channel signal perhaps by the output result of each code channel matched filtering by the channel response that the multi-cell channel estimated result obtains; Then, divide into groups according to the power of power or amplitude.
(3) based on the group technology of code channel correlation: at first estimate the correlation between each code channel in the multi-cell signals, all code channels are divided into groups according to the power of correlation; Correlation for a plurality of code channels can be average, maximum or the minimum value of correlation.
(4) based on the mixed method of said method, or other group technology.
Associated detecting method can be an interference cancellation method, or the associated detecting method of linear block balance, can also be the method that both mix.For example, can in each grouping, adopt the associated detecting method of linear block balance, and between different code channel groupings, adopt the method for Interference Cancellation.
The code channel of above-mentioned participation code channel grouping and joint-detection can be the pre-assigned code channel of each neighbor cell;
When homogeneous frequency adjacent area is worked, many cell allocation a large amount of code channels, therefore, also can be that all code channels of each neighbor cell are detected those activated code channels that remain after handling through activating.
In the methods of the invention, community user master footpath exit window under the various relative time delay situation and the detection mistake that causes, can two kinds of adjustment modes:
(1) behind the channel estimation results that obtains this sub-district and each neighbor cell, earlier each user's channel estimation results is adjusted, and then calculated the estimated result of its aggregate channel response according to adjusted each user's channel estimation results;
(2) behind the channel estimation results that obtains this sub-district and each neighbor cell, calculate the estimated result of each user's aggregate channel response earlier according to this result, again the estimated result of each user's of obtaining aggregate channel response is adjusted.
These two kinds of adjustment modes are similar, and effect is similar.
Be example in (1) kind mode below, describe its adjustment process in detail.
The channel estimation results total length of supposing each sub-district is Ln, and the difference in relative time delay between adjacent sub-district and this community user signal is Δ T
n, it is rounded obtains standard delay inequality Δ T '
n
At first, poor according to the relative time delay between the subscriber signal in the different districts, from the channel estimation results of the channel estimation results of this sub-district and neighbor cell, intercept channel estimation results successively to each user in should the sub-district.
For this sub-district, from each user's of the 1st chip circulation intercepting of the total channel estimation results in this sub-district channel estimation results, intercepted length is W1.
If neighbor cell signal falls behind than this sub-district, then from the Δ T ' of the total channel estimation results of neighbor cell
n+ 1 chip plays the circulation intercepting; If neighbor cell signal is more leading than this sub-district, then from the Ln-Δ T ' of the total channel estimation results of neighbor cell
n+ 1 chip plays the circulation intercepting.Intercepted length is W2.
If the length of spreading code is 0, expand each subscriber channel estimated result of this sub-district: l1 of expansion predetermined length put 0 chip before each subscriber channel estimated result of this sub-district, if there is not leading this cell signal of neighbor cell signal, then not expanding is l1=0; Put 0 chip l2 of back expansion predetermined length, if there is not neighbor cell signal to fall behind this cell signal, then not expanding is l2=0;
With each subscriber channel estimated result of this sub-district is benchmark, at intercepted length W1 ≠ W2, during and the front and back extension length l1 of this sub-district ≠ l2, to the adjustment of adjacent sub-district multiple situation can be arranged, and will illustrate respectively below.
Fig. 4 a, 4b, 4c, 4d, 4e, 4f show the various different adjustment modes under W1+l2 〉=W2 situation respectively.
With reference to Fig. 4 a, establish W1=14chip, W2=16chip, l1=4chip, l2=6chip, Q=8chip, Δ T '
n=3chip and neighbor cell signal fall behind than this sub-district, then need expand 11+mod (Δ T ' before each subscriber channel estimated result of adjacent sub-district
n, Q)=7 put 0 chip, back expansion l2+ (W1-W2)-mod (Δ T '
n, Q)=1 put 0 chip.
Wherein, S01 is an adjusted community user channel estimation results; S1 is adjacent community user channel estimation results before adjusting; S1 ' is for adjusting the adjacent community user channel estimation results in back.
With reference to Fig. 4 b, establish W1=14chip, W2=16chip, l1=6chip, l2=4chip, Q=8chip, Δ T '
n=5chip and neighbor cell signal fall behind than this sub-district, then need expand l1-(Q-mod (Δ T ' before each subscriber channel estimated result of adjacent sub-district
n, Q))=3 put 0 chip, expand l2+ (W1-W2)+(Q-mod (Δ T ' behind the result
n, Q))=5 put 0 chip.
Wherein, S02 is an adjusted community user channel estimation results; S2 is adjacent community user channel estimation results before adjusting; S2 ' is for adjusting the adjacent community user channel estimation results in back.
With reference to Fig. 4 c, establish W1=14chip, W2=16chip, l1=2chip, l2=4chip, Q=8chip, Δ T '
n=5chip and neighbor cell signal fall behind than this sub-district.Wherein, S03 is an adjusted community user channel estimation results.
Because mod is (Δ T '
n, Q)＜and l2+W1, therefore before each subscriber channel estimated result of adjacent sub-district, expand l1+mod (Δ T '
n, Q)=7 put 0 chip, remove mod (Δ T ' behind the result
n, Q)-(l2+ (W1-W2))=3 chips.Adjusted adjacent community user channel estimation results is S31 '.
Because Q-mod is (Δ T '
n, Q)＜l1+W2, therefore remove preceding (Q-mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q))-a l1=1 chip, expand l2+ (W1-W2)+(Q-mod (Δ T ' behind the result
n, Q))=5 put 0 chip.Adjusted adjacent community user channel estimation results is S32 '.
If W1=2chip, W2=2chip, l1=1chip, l2=1chip, Q=8chip, Δ T '
n=4chip and neighbor cell signal fall behind than this sub-district.Wherein, S033 is an adjusted community user channel estimation results.
At this moment, because mod is (Δ T '
n, Q)＞l2+W1 and Q-mod (Δ T '
n, Q)＞l1+W2, so this subscriber channel estimated result will be that complete 0 the chip of W1+l1+l2=4 constitutes by a length.S33 is the adjacent community user channel estimation results before being adjusted into, and S33 ' is adjusted adjacent community user channel estimation results.
With reference to Fig. 4 d, establish W1=14chip, W2=16chip, l1=4chip, l2=6chip, Q=8chip, Δ T '
n=3chip and neighbor cell signal are more leading than this sub-district, then need expand l1-mod (Δ T ' before each subscriber channel estimated result of adjacent sub-district
n, Q)=1 put 0 chip, back expansion l2+ (W1-W2)+mod (Δ T '
n, Q)=7 put 0 chip.
Wherein, S04 is an adjusted community user channel estimation results; S4 is adjacent community user channel estimation results before adjusting; S4 ' is for adjusting the adjacent community user channel estimation results in back.
With reference to Fig. 4 e, establish W1=14chip, W2=16chip, l1=4chip, l2=6chip, Q=8chip, Δ T '
n=5chip and neighbor cell signal are more leading than this sub-district, then need expand l1+ (Q-mod (Δ T ' before each subscriber channel estimated result of adjacent sub-district
n, Q))=7 put 0 chip, back expansion l2+ (W1-W2)-(Q-mod (Δ T '
n, Q))=1 put 0 chip.
Wherein, S05 is an adjusted community user channel estimation results; S5 is adjacent community user channel estimation results before adjusting; S5 ' is for adjusting the adjacent community user channel estimation results in back.
With reference to Fig. 4 f, establish W1=14chip, W2=16chip, l1=2chip, l2=4chip, Q=8chip, Δ T '
n=5chip and neighbor cell signal are more leading than this sub-district.Wherein, S06 is an adjusted community user channel estimation results.
Because mod is (Δ T '
n, Q)＜l1+W2, therefore remove preceding mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-and a l1=3 chip, expand l2+ (W1-W2)+mod (Δ T ' behind the result
n, Q)=7 put 0 chip.Adjusted adjacent community user channel estimation results is S61 '.
Because Q-mod is (Δ T '
n, Q)＜and l2+W1, therefore before each subscriber channel estimated result of adjacent sub-district, expand l1+ (Q-mod (Δ T '
n, Q))=5 put 0 chip, remove (Q-mod (Δ T ' behind the result
n, Q))-(l2+ (W1-W2))=1 chip.Adjusted adjacent community user channel estimation results is S62 '.
If W1=2chip, W2=2chip, l1=1chip, l2=1chip, Q=8chip, Δ T '
n=4chip and neighbor cell signal are more leading than this sub-district.Wherein, S066 is an adjusted community user channel estimation results.
At this moment, because mod is (Δ T '
n, Q)＞l1+W2 and Q-mod (Δ T '
n, Q)＞l2+W1, so this subscriber channel estimated result will be that complete 0 the chip of W1+l1+l2=4 constitutes by a length.S66 is the adjacent community user channel estimation results before adjusting, and S66 ' is adjusted adjacent community user channel estimation results.
Fig. 4 g, 4h, 4i, 4j, 4k, 4l show the various different adjustment modes under W1+l2＜W2 situation respectively.
With reference to Fig. 4 g, establish W1=12chip, W2=16chip, l1=6chip, l2=2chip, Q=8chip, and neighbor cell signal falls behind than this sub-district.S07 is an adjusted community user channel estimation results.
As Δ T '
nDuring=5chip, need before each subscriber channel estimated result of adjacent sub-district, expand l1-(Q-mod (Δ T '
n, Q))=3 put 0 chip, behind the result expansion (Q-mod (Δ T '
n, Q))-(W2-(W1+l2))=1 put 0 chip.Wherein, adjacent community user channel estimation results before S71 adjusts; S71 ' is for adjusting the adjacent community user channel estimation results in back.
As Δ T '
nDuring=7chip, need before each subscriber channel estimated result of adjacent sub-district, expand l1-(Q-mod (Δ T '
n, Q))=5 put 0 chip, remove (W2-(W1+l2))-(Q-mod (Δ T ' behind the result
n, Q))=1 chip.Wherein, adjacent community user channel estimation results before S72 adjusts; S72 ' is for adjusting the adjacent community user channel estimation results in back.
With reference to Fig. 4 h, establish W1=4chip, W2=10chip, l1=2chip, l2=2chip, Q=8chip, and neighbor cell signal falls behind than this sub-district.S08 is an adjusted community user channel estimation results.
As Δ T '
nDuring=4chip, need before each subscriber channel estimated result of adjacent sub-district, expand l1+mod (Δ T '
n, Q)=6 put 0 chip, remove mod (Δ T ' behind the result
n, Q)+(W2-(W1+l2))=8 chips.Wherein, S81 is adjacent community user channel estimation results before adjusting; S81 ' is for adjusting the adjacent community user channel estimation results in back.
As Δ T '
nDuring=7chip, then this subscriber channel estimated result will be that complete 0 the chip of W1+l1+l2=8 constitutes by a length.Wherein, S82 is adjacent community user channel estimation results before adjusting; S82 ' is for adjusting the adjacent community user channel estimation results in back, and promptly length is complete 0 chip of 8chip.
With reference to Fig. 4 i, establish W1=4chip, W2=10chip, l1=2chip, l2=2chip, Q=8chip, and neighbor cell signal falls behind than this sub-district.S09 is an adjusted community user channel estimation results.
As Δ T '
nDuring=3chip, need remove preceding Q-mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-and a l1=3 chip, expansion (Q-mod (Δ T ' behind the result
n, Q))-(W2-(W1+l2))=1 put 0 chip.Wherein, S91 is adjacent community user channel estimation results before adjusting; S91 ' is for adjusting the adjacent community user channel estimation results in back.
As Δ T '
nDuring=5chip, need remove preceding Q-mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-a l1=1 chip, remove (W2-(W1+l2))-(Q-mod (Δ T ' behind the result
n, Q))=1 chip removes.Wherein, S92 is adjacent community user channel estimation results before adjusting; S92 ' is for adjusting the adjacent community user channel estimation results in back.
If W1=2chip, W2=4chip, l1=1chip, l2=1chip, Q=8chip, Δ T '
n=2chip and neighbor cell signal fall behind than this sub-district.Wherein, S099 is an adjusted community user channel estimation results.
At this moment, because Q-mod is (Δ T '
n, Q)＞l1+W2, so this subscriber channel estimated result will be that complete 0 the chip of W1+l1+l2=4 constitutes by a length.Wherein, S99 is the adjacent community user channel estimation results before adjusting, and S99 ' is adjusted adjacent community user channel estimation results.
With reference to Fig. 4 j, establish W1=12chip, W2=16chip, l1=6chip, l2=2chip, Q=8chip, and neighbor cell signal is more leading than this sub-district.S010 is an adjusted community user channel estimation results.
As Δ T '
nDuring=5chip, then need before each subscriber channel estimated result of adjacent sub-district, expand l1-mod (Δ T '
n, Q)=1 put 0 chip, behind the result, expand mod (Δ T '
n, Q)-(W2-(W1+l2))=3 put 0 chip.Wherein, S101 is adjacent community user channel estimation results before adjusting; S101 ' is for adjusting the adjacent community user channel estimation results in back.
As Δ T '
nDuring=1chip, then need before each subscriber channel estimated result of adjacent sub-district, expand l1-mod (Δ T '
n, Q)=5 put 0 chip, remove (W2-(W1+l2))-mod (Δ T ' behind the result
n, Q)=1 a chip removes.Wherein, S102 is adjacent community user channel estimation results before adjusting; S102 ' is for adjusting the adjacent community user channel estimation results in back.
With reference to Fig. 4 k, establish W1=4chip, W2=10chip, l1=2chip, l2=2chip, Q=8chip, and neighbor cell signal is more leading than this sub-district.S011 is an adjusted community user channel estimation results.
As Δ T '
nDuring=5chip, then need to remove preceding mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-and a l1=3 chip, behind the result, expand mod (Δ T '
n, Q)-(W2-(W1+l2))=1 put 0 chip.Wherein, S111 is adjacent community user channel estimation results before adjusting; S111 ' is for adjusting the adjacent community user channel estimation results in back.
As Δ T '
nDuring=3chip, then need to remove preceding mod (the Δ T ' of each subscriber channel estimated result of adjacent sub-district
n, Q)-a l1=1 chip, remove (W2-(W1+l2))-mod (Δ T ' behind the result
n, Q)=1 chip.Wherein, S112 is adjacent community user channel estimation results before adjusting; S112 ' is for adjusting the adjacent community user channel estimation results in back.
If W1=2chip, W2=4chip, l1=1chip, l2=1chip, Q=8chip is as Δ T '
n=6chip and neighbor cell signal are more leading than this sub-district.S055 is an adjusted community user channel estimation results.
Because mod (Δ T '
n, Q)＞l1+W2, so this subscriber channel estimated result is that complete 0 chip of W1+l1+l2=4 constitutes by a length.Wherein, S55 is adjacent community user channel estimation results before adjusting, and S55 ' is for adjusting the adjacent community user channel estimation results in back.
With reference to Figure 41, establish W1=4chip, W2=10chip, l1=2chip, l2=2chip, Q=8chip, and neighbor cell signal is more leading than this sub-district.S012 is an adjusted community user channel estimation results.
As Δ T '
nDuring=5chip, then need before each subscriber channel estimated result of adjacent sub-district, expand l1+Q-mod (Δ T '
n, Q)=5 put 0 chip, remove Q-mod (Δ T ' behind the result
n, Q)+(W2-(W1+l2))=7 chips.Wherein, S121 is adjacent community user channel estimation results before adjusting; S121 ' is for adjusting the adjacent community user channel estimation results in back.
As Δ T '
nDuring=2chip, then this subscriber channel estimated result will be that complete 0 the chip of W1+l1+l2=6 constitutes by a length.Wherein, S122 is adjacent community user channel estimation results before adjusting; S122 ' is for adjusting the adjacent community user channel estimation results in back, and promptly length is complete 0 chip of 6chip.
Adjustment and above-mentioned adjustment process to the estimated result of this sub-district and each each user's of neighbor cell aggregate channel response are similar, do not repeat them here.
The present invention is directed in the slot CDMA system phase mutual interference asynchronous between the homogeneous frequency adjacent area signal, utilize the relative time delay between the interior subscriber signal of different districts poor, adjust the channel estimation results of this sub-district and/or each neighbor cell or the estimated result of aggregate channel response, with the asynchronous co-channel interference of effective inhibition neighbor cell.
Following mask body is that example illustrates the process that multi-plot joint of the present invention detects with three homogeneous frequency adjacent areas.
This sub-district that this sub-district receives add close together or disturb the data division of multiple user signals of two stronger co-frequency cells such as Fig. 1 in the data block on both sides can be expressed as:
Wherein, A
0And d
0Be the transmission matrix and the data of this sub-district; A
iAnd d
iBe the transmission matrix and the data of the individual adjacent sub-district of i (i=1,2); n
0Be the interference and the noise power of removing after the interference of adjacent 2 sub-districts.
The first step, multi-cell channel is estimated:
What the channel estimating code part of three co-frequency cells was corresponding is the channel estimating coded signal of three sign indicating number collection, adopts the method for many yards collection channel estimating, can obtain the channel estimation results of three homogeneous frequency adjacent areas.
Suppose that the channel estimation results that obtains three sub-districts is respectively h0 ', h1 ' and h2 ', wherein h0 ' is this cell channel estimated result, and h1 ' is the channel estimation results of interfered cell 1, and h2 ' is the channel estimation results of interfered cell 2.
As shown in Figure 5, establish cell channel and estimate that total length is 24chip (chip); Channel estimating can be carried out to 4 users at most in this sub-district, and promptly each subscriber channel estimated result length of this sub-district (before adjusting) is 6chip; Channel estimating can be carried out to 6 users at most in adjacent sub-district 1, and promptly adjacent sub-district 1 each subscriber channel estimated result length (before adjusting) is 4chip; Channel estimating can be carried out to 3 users at most in adjacent sub-district 2, and promptly adjacent sub-district 2 each subscriber channel estimated result length (before adjusting) are 8chip; If adjacent sub-district 1 is than the leading 5chip in this sub-district, adjacent sub-district 2 is than this sub-district hysteresis 7chip; If spreading code length Q=4.
The channel estimation results of representing 4 users in this sub-district with a, b, c, d respectively, the channel estimation results of representing 6 users of adjacent sub-district 1 with e, f, g, h, i, j respectively, the channel estimation results of representing 3 users of adjacent sub-district 2 with k, l, m, a=(a1 wherein, a2 ..., a6), other representation classes are like a, and then the channel estimation results of each sub-district can specifically be expressed as follows:
h0′＝(a1，a2，a3，a4，a5，a6，b1，b2，b3，b4，b5，b6，c1，c2，c3，c4，c5，c6，d1，d2，d3，d4，d5，d6)；
h1′＝(f2，f3，f4，g1，g2，g3，g4，h1，h2，h3，h4，i1，i2，i3，i4，j1，j2，j3，j4，e1，e2，e3，e4，f1)；
h2′＝(m2，m3，m4，m5，m6，m7，m8，k1，k2，k3，k4，k5，k6，k7，k8，l1，l2，l3，l4，l5，l6，l7，l8，m1)；
Because distributing to each user's channel estimating code (as the intermediate code among Fig. 1) is cyclic shift, this has also just guaranteed to exist relative time delay situation lower channel estimated result to circulate, be leading 5chip the relative time delay of adjacent sub-district 1, thereby the e1 among the h1 ', e2, e3, e4, f1 have been recycled to the last of cell channel estimated result; Be hysteresis 7chip the relative time delay of adjacent sub-district 2, thereby the m2 among the h1 ', m3, and m4, m5, m6, m7, m8 have been recycled to the foremost of cell channel estimated result.
Second step, two kinds of processing modes are arranged, a kind of is according to relative time delay each user's of different districts channel estimation results being adjusted the estimated result of calculation combination channel response again, another kind is that each user's of different districts channel estimation results does not adjust, and calculates the estimated result of its aggregate channel response and according to relative time delay the estimated result of aggregate channel response being adjusted.
First kind of mode: the channel estimation results of adjusting each user of different districts earlier:
This sub-district: from the 1st chip, in the total channel estimation results h0 ' in this sub-district, intercept 6 chips successively, obtain the channel estimation results of user a, b, c, d successively, establish the equal in length of this front and back, sub-district benefit 0, i.e. L1=L2=L=2chip.Then adjusted channel estimation results is as follows:
a＝(0，0，a1，a2，...，a6，0，0)；
b＝(0，0，b1，b2，...，b6，0，0)；
c＝(0，0，c1，c2，...，c6，0，0)；
d＝(0，0，d1，d2，...，c6，0，0)。
Adjacent sub-district 1: because adjacent sub-district 1 leading this sub-district 5chip, so since 24-5+1=20 chip 4 chips of circulation intercepting successively in h1 ', obtain the channel estimation results of user e, f, g, h, i, j successively, then expansion: since W1+L2=6+2＞4=W2, mod (Δ T '
n, Q)=and mod (5,4)=1＜2=L1, the front replenishes L1-mod (Δ T '
n, Q)=and 2-mod (5,4)=1 puts 0 chip, and the back replenishes L2+ (W1-W2)+mod (Δ T '
n, Q)=5 put 0 chip.
Adjusted channel estimation results is as follows:
e＝(0，e1，e2，e3，e4，0，0，0，0，0)；
f＝(0，f1，f2，f3，f4，0，0，0，0，0)；
g＝(0，g1，g2，g3，g4，0，0，0，0，0)；
h＝(0，h1，h2，h3，h4，0，0，0，0，0)；
i＝(0，i1，i2，i3，i4，0，0，0，0，0)；
j＝(0，j1，j2，j3，j4，0，0，0，0，0)。
Adjacent sub-district 2: this sub-district 7chip because adjacent sub-district 2 lags behind, so since 7+1=8 chip preceding 8 chips of circulation intercepting successively in h2 ', obtain the channel estimation results of user k, l, m successively, expand then.Since W1+L2=8=W2, mod (Δ T '
n, Q)=mod (7,4)=3＞2+ (6-8)=L2+ (W1-W2), but Q-mod (Δ T '
n, Q)=and 4-mod (7,4)=1＜2=L1, therefore before its result, replenish L1-(Q-mod (Δ T '
n, Q))=2-(4-mod (7,4))=1 puts 0 chip, replenish L2+ (W1-W2)+(Q-mod (Δ T ' behind its result
n, Q))=0 chip is put in 2+ (6-8)+(4-mod (5,4))=1.
Adjusted channel estimation results is as follows:
k＝(0，k1，k2，k3，k4，k5，k6，k7，k8，0)；
l＝(0，l1，l2，l3，l4，l5，l6，l7，l8，0)；
m＝(0，m1，m2，m3，m4，m5，m6，m7，m8，0)。
Thus, the channel estimation results with each user of different districts is 10chip according to being adjusted to equal length its relative time delay.
The estimated result of calculation combination channel response again:
The response of user's aggregate channel is user's spreading code and channel estimation results to be carried out convolution algorithm obtain, i.e. b=C h, and the length of b is Q+W-1=4+10-1=13chip.Then the estimated result of the aggregate channel of each sub-district response can be expressed as:
This sub-district:
a’＝(0，0，a’1，a’2，...，a’9，0，0)；
b’＝(0，0，b’1，b’2，...，b’9，0，0)；
c’＝(0，0，c’1，c’2，...，c’9，0，0)；
d’＝(0，0，d’1，d’2，...，c’9，0，0)；
Adjacent sub-district 1:
e’＝(0，e’1，e’2，...，e’7，0，0，0，0，0)；
f’＝(0，f’1，f’2，...，f’7，0，0，0，0，0)；
g’＝(0，g’1，g’2，...，g’7，0，0，0，0，0)；
h’＝(0，h’1，h’2，...，h’7，0，0，0，0，0)；
i’＝(0，i’1，i’2，...，i’7，0，0，0，0，0)；
j’＝(0，j’1，j’2，...，j’7，0，0，0，0，0)；
Adjacent sub-district 2:
k’＝(0，k’1，k’2，...，k’11，0)；
l’＝(0，l’1，l’2，...，l’11，0)；
m’＝(0，m’1，m’2，...，m’11，0)。
The second way: the channel estimation results of not adjusting each user of different districts:
This sub-district: from the 1st chip, in the total channel estimation results h0 ' in this sub-district, intercept 6 chips successively, obtain the channel estimation results of user a, b, c, d successively:
a＝(a1，a2，...，a6)；
b＝(b1，b2，...，b6)；
c＝(c1，c2，...，c6)；
d＝(d1，d2，...，c6)；
Adjacent sub-district 1: because adjacent sub-district 1 leading this sub-district 5chip, intercept 4 chips, obtain the channel estimation results of user e, f, g, h, i, j successively so in h1 ', circulate successively since 24-5+1=20 chip:
e＝(e1，e2，e3，e4)；
f＝(f1，f2，f3，f4)；
g＝(g1，g2，g3，g4)；
h＝(h1，h2，h3，h4)；
i＝(i1，i2，i3，i4)；
j＝(j1，j2，j3，j4)；
Adjacent sub-district 2: this sub-district 7chip because adjacent sub-district 2 lags behind, so since 7+1=8 chip in h2 ' successively circulation intercept preceding 8 chips, obtain the channel estimation results of user k, l, m successively:
k＝(k1，k2，k3，k4，k5，k6，k7，k8)；
l＝(l1，l2，l3，l4，l5，l6，l7，l8)；
m＝(m1，m2，m3，m4，m5，m6，m7，m8)。
The estimated result of calculation combination channel response then:
The response of user's aggregate channel is user's spreading code and channel estimation results to be carried out convolution algorithm obtain, i.e. b=C h, and the length of b is Q+W-1, the difference according to the difference of each sub-district W.Then the estimated result of the aggregate channel of each sub-district response can be expressed as:
This sub-district: W=6chip is so the length of aggregate channel response is 4+6-1=9chip
a’＝(a’1，a’2，...，a’9)；
b’＝(b’1，b’2，...，b’9)；
c’＝(c’1，c’2，...，c’9)；
d’＝(d’1，d’2，...，c’9)；
Adjacent sub-district 1:W=4chip is so the length of aggregate channel response is 4+4-1=7chip
e’＝(e’1，e’2，...，e’7)；
f’＝(f’1，f’2，...，f’7)；
g’＝(g’1，g’2，...，g’7)；
h’＝(h’1，h’2，...，h’7)；
i’＝(i’1，i’2，...，i’7)；
j’＝(j’1，j’2，...，j’7)；
Adjacent sub-district 2:W=8chip is so the length of aggregate channel response is 4+8-1=11chip
k’＝(k’1，k’2，...，k’11)；
l’＝(l’1，l’2，...，l’11)；
m’＝(m’1，m’2，...，m’11)。
Again according to relative time delay the estimated result of aggregate channel response being adjusted:
This sub-district: establish the equal in length of this front and back, sub-district benefit 0, i.e. L3=L4=L=2chip.The estimated result of then adjusted aggregate channel response is as follows:
a’＝(0，0，a’1，a’2，...，a’9，0，0)；
b’＝(0，0，b’1，b’2，...，b’9，0，0)；
c’＝(0，0，c’1，c’2，...，c’9，0，0)；
d’＝(0，0，d’1，d’2，...，c’9，0，0)；
Adjacent sub-district 1: since W3+L4=9+2＞7=W4, mod (Δ T '
n, Q)=and mod (5,4)=1＜2=L3, therefore before its result, replenish L3-mod (Δ T '
n, Q)=2-mod (5,4)=1 puts 0 chip, replenishes L4+ (W3-W4)+mod (Δ T ' behind its result
n, Q)=2+ (9-7)+mod (5,4)=5 puts 0 chip.Adjusted channel estimation results is as follows:
e’＝(0，e’1，e’2，...，e’7，0，0，0，0，0)；
f’＝(0，f’1，f’2，...，f’7，0，0，0，0，0)；
g’＝(0，g’1，g’2，...，g’7，0，0，0，0，0)；
h’＝(0，h’1，h’2，...，h’7，0，0，0，0，0)；
i’＝(0，i’1，i’2，...，i’7，0，0，0，0，0)；
j’＝(0，j’1，j’2，...，j’7，0，0，0，0，0)；
Adjacent sub-district 2: because
W3+L4=9+2=11=W4, mod (Δ T '
n, Q)=mod (7,4)=3＞2+ (9-11)=L4+ (W3-W4), but Q-mod (Δ T '
n, Q)=and 4-mod (7,4)=1＜2=L3, therefore before its result, replenish L3-(Q-mod (Δ T '
n, Q))=2-(4-mod (7,4))=1 puts 0 chip, replenishes L4+ (W3-W4)+(Q-mod (Δ T ' behind the result
n, Q))=0 chip is put in 2+ (9-11)+(4-mod (5,4))=1.
Adjusted channel estimation results is as follows:
k’＝(0，k’1，k’2，...，k’11，0)；
l’＝(0，l’1，l’2，...，l’11，0)；
m’＝(0，m’1，m’2，...，m’11，0)。
Thus, the estimated result with the response of each user's of different districts aggregate channel is 13chip according to being adjusted to equal length its relative time delay.
The 3rd goes on foot, and utilizes the estimated result of the aggregate channel response of each sub-district different user, carries out multi-plot joint and detects, and obtains to detect data.
At first, the code channel with three sub-districts divides into groups:
According to first kind of group technology, code channel can be divided into three groups by the sub-district number based on the code channel affiliated subdistrict.Signal after the grouping can be expressed as:
e＝A
0d
0+A
1d
1+A
2d
2+n
0 (2)
Wherein, transmission matrix A
i, i=0,1, the 2 estimated result vector that is responded by second aggregate channel that goes on foot this users of all cells code channel that provides constitutes.
According to second kind of group technology,,, can estimate the power of each code channel signal perhaps by the output result of each code channel matched filtering by channel response or the aggregate channel response that the multi-cell channel estimated result obtains based on code channel power or amplitude; Then, according to the power of power all code channels are divided into two groups, the interference code channel that user's to be detected code channel and power are stronger is assigned in the code channel grouping that participates in joint-detection, and the more weak code channel of power is assigned to and disturbed in the code channel grouping.Signal after the grouping can be expressed as:
e＝A
Sd
S+(A
Id
I+n
0) (3)
Wherein, A
SAnd d
SBe to participate in joint-detection code channel transmission packets matrix and data; A
IAnd d
IBe to disturb code channel transmission packets matrix and data; A
SAnd A
IMake with first kind of packet mode.
According to the third group technology based on the code channel correlation, estimate that at first (the code channel here is meant the compound key of spreading code and scrambler for the average of correlation of all non-user's code channels to be detected and all code channels of user to be detected, or the estimated value of aggregate channel response), power according to the correlation average is divided into two groups with all code channels, the code channel that user's to be detected code channel and all and its code channel correlation average is stronger is assigned in the code channel grouping that participates in joint-detection, remaining code channel is assigned to disturbed during code channel divides into groups.Signal after the grouping can be expressed as:
e＝A
Sd
S+(A
Id
I+n
0) (4)
Wherein, A
SAnd d
SBe to participate in joint-detection code channel transmission packets matrix and data; A
IAnd d
IBe to disturb code channel transmission packets matrix and data; A
SAnd A
IMake with first kind of packet mode.Use same expression formula with second kind of group technology.
Then, carry out joint-detection:
For first kind of code channel group technology, joint-detection can adopt the method for linear block balance+interference counteracting:
1) each associated detecting method of linear block balance separately that divides into groups total received signal is carried out, promptly single community associated detection algorithm;
2) disturb recovery by the detected result that respectively organizes;
3) from total received signal, balance out the interference of non-group, obtain net signal;
4) net signal that is divided into groups in user to be detected place carries out the associated detecting method of linear block balance, obtains user's to be detected result.
Said process has only used Interference Cancellation one time.In real system, can use as required and repeatedly offset to obtain desired properties.
For code channel group technology in second kind and the 3rd,, adopt the associated detecting method of linear block balance to detect to participating in the code channel grouping of joint-detection.
Thus, send data d
SThe soft output value of estimating is:
Wherein, matrix T is provided by following formula:
Wherein,
Can all handle disturbing during realization, also can disturb and at first carry out the albefaction processing at coloured noise as white noise.Wherein, the characteristic of interference can be calculated by the background noise that disturbs the code channel grouping and measure.
As seen, the present invention is based on relative time delay between each subscriber signal of homogeneous frequency adjacent area in slot CDMA system difference adjusts each user's of different districts the channel estimation results or the estimated result of its aggregate channel response, utilize the estimated result of aggregate channel response to carry out the multi-plot joint detection then, obtain the detection data, suppressed interference between common-frequency near regions effectively.
The inventive method can be used for slot CDMA system or adopt the wireless communication system of similar signal structure.
Though described the present invention by embodiment, those of ordinary skills know, the present invention has many distortion and variation and do not break away from spirit of the present invention, wish that appended claim comprises these distortion and variation and do not break away from spirit of the present invention.
Claims (10)
1, a kind of multi region combined detection method of time gap code division multi address system is characterized in that, described method comprises step:
A, the signal data that receives is carried out many yards collection channel estimating, obtain the channel estimation results of this sub-district and each neighbor cell;
B, from the channel estimation results of the channel estimation results of this sub-district and neighbor cell, intercept channel estimation results successively respectively to each user in should the sub-district;
C, adjust described this sub-district and/or each each user's of neighbor cell channel estimation results according to the relative time delay between subscriber signal difference in the different districts;
D, calculate the estimated result of this sub-district and the response of neighbor cell aggregate channel according to each user's spreading code and corresponding adjusted channel estimation results;
E, utilize the estimated result of the aggregate channel response of each sub-district to carry out joint-detection, obtain to detect data receiving data.
2, a kind of multi region combined detection method of time gap code division multi address system is characterized in that, described method comprises step:
A ', the signal data that receives is carried out many yards collection channel estimating, obtain the channel estimation results of this sub-district and each neighbor cell;
B ', from the channel estimation results of the channel estimation results of this sub-district and neighbor cell, intercept channel estimation results successively respectively to each user in should the sub-district;
C ', calculate the estimated result of this sub-district and the response of neighbor cell aggregate channel according to each user's spreading code and corresponding channel estimation results;
D ', adjust the estimated result of the aggregate channel response of each user in described this sub-district and the neighbor cell according to the relative time delay between subscriber signal difference in the different districts;
E ', the estimated result that utilizes adjusted aggregate channel to respond carry out joint-detection to receiving data, obtain to detect data.
3, multi region combined detection method of time gap code division multi address system according to claim 1 and 2,11+mod (Δ T
n', Q) individual 0 the chip of putting is expanded 12+ (W1-W2)-mod (Δ T behind the result
n', Q) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞12+ (W1-W2) and Q-mod (Δ T
n', Q)≤11, then before each subscriber channel estimated result of adjacent sub-district, expand 11-(Q-mod (Δ T
n', Q)) individual 0 the chip of putting, expand 12+ (W1-W2)+(Q-mod (Δ T behind the result
n', Q)) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞12+ (W1-W2) and Q-mod (Δ T
n', Q)＞11, then as mod (Δ T
n', Q)≤during 12+W1, before each subscriber channel estimated result of adjacent sub-district, expand 11+mod (Δ T
n', Q) individual 0 the chip of putting removes mod (Δ T behind the result
n', Q)-(12+ (W1-W2)) individual chip; As Q-mod (Δ T
n', Q)≤during 11+W2, remove preceding (Q-mod (the Δ T of each subscriber channel estimated result of adjacent sub-district
n', Q))-11 chips, expand 12+ (W1-W2)+(Q-mod (Δ T behind the result
n', Q)) individual 0 the chip of putting; As mod (Δ T
n', Q)＞12+W1 and Q-mod (Δ T
n', Q)＞during 11+W2, this subscriber channel estimated result is that complete 0 the chip of W1+11+12 constitutes by a length;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T
n', Q)≤11, then before each subscriber channel estimated result of adjacent sub-district, expand 11-mod (Δ T
n', Q) individual 0 the chip of putting is expanded 12+ (W1-W2)+mod (Δ T behind the result
n', Q) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞11 and Q-mod (Δ T
n', Q)≤and 12+ (W1-W2), then before each subscriber channel estimated result of adjacent sub-district, expand 11+ (Q-mod (Δ T
n', Q)) individual 0 the chip of putting, expand 12+ (W1-W2)-(Q-mod (Δ T behind the result
n', Q)) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞11 and Q-mod (Δ T
n', Q)＞and 12+ (W1-W2), then as mod (Δ T
n', Q)≤during 11+W2, remove preceding mod (the Δ T of each subscriber channel estimated result of adjacent sub-district
n', Q)-11 a chip is expanded 12+ (W1-W2)+mod (Δ T behind the result
n', Q) individual 0 the chip of putting; As Q-mod (Δ T
n', Q)≤and during 12+W1, it is characterized in that, intercept each subscriber channel estimated result among described step B and the step B ' according to the following steps:
B1, set the channel estimation results total length L n of each sub-district;
B2, obtain the relative time delay difference Δ T between each neighbor cell and this community user signal
n, and to poor Δ T in described relative time delay
nRound, obtain standard delay inequality Δ T
n';
B3, intercept the channel estimation results of each user in this sub-district successively from the 1st chip of the total channel estimation results in this sub-district;
If the b4 neighbor cell signal falls behind than this sub-district, then from the Δ T of the total channel estimation results of described neighbor cell
n'+1 chip plays the channel estimation results of each user in this neighbor cell of circulation intercepting;
If the b5 neighbor cell signal is more leading than this sub-district, then from the Ln-Δ T of the total channel estimation results of described neighbor cell
n'+1 chip plays the channel estimation results of each user in this neighbor cell of circulation intercepting.
4, multi region combined detection method of time gap code division multi address system according to claim 3 is characterized in that, and is described to difference Δ T in relative time delay
nThe operation that rounds is specially:
To poor Δ T in described relative time delay
nUnder round or on round or self-defined rounding.
5, multi region combined detection method of time gap code division multi address system according to claim 3 is characterized in that, described step C specifically comprises:
C1, to set this community user channel estimation results length be W1, and adjacent community user channel estimation results length is W2; The length of spreading code is Q;
C2, expand each subscriber channel estimated result of described this sub-district in the following manner:
11 of predetermined lengths of expansion are put 0 chip before each subscriber channel estimated result of this sub-district, if there is not leading this cell signal of neighbor cell signal, then not expanding is 11=0; 12 of predetermined lengths of expansion are put 0 chip in the back, if there is not neighbor cell signal to fall behind this cell signal, then not expanding is 12=0;
C3, when W1+12 〉=W2, expand each subscriber channel estimated result of each neighbor cell in the following manner:
(1) when neighbor cell signal falls behind than this sub-district,
If mod is (Δ T
n', Q)≤and 12+ (W1-W2), then 11+ (Q-mod (Δ T is expanded in expansion before each subscriber channel estimated result of adjacent sub-district before each subscriber channel estimated result of adjacent sub-district
n', Q)) individual 0 the chip of putting, remove (Q-mod (Δ T behind the result
n', Q))-(12+ (W1-W2)) individual chip; As mod (Δ T
n', Q)＞11+W2 and Q-mod (Δ T
n', Q)＞during 12+W1, this subscriber channel estimated result is that complete 0 the chip of W1+11+12 constitutes by a length;
C4, when W1+12＜W2, expand each subscriber channel estimated result of each neighbor cell in the following manner:
(1) when neighbor cell signal falls behind than this sub-district,
If Q-mod is (Δ T
n', Q)≤11, then before each subscriber channel estimated result of adjacent sub-district, expand 11-(Q-mod (Δ T
n', Q)) individual 0 the chip of putting; If Q-mod is (Δ T
n', Q) 〉=(W2-(W1+12)), then behind the result, expand (Q-mod (Δ T
n', Q))-(W2-(W1+12)) is individual to put 0 chip, if Q-mod is (Δ T
n', Q)＜(W2-(W1+12)), then remove (W2-(W1+12))-(Q-mod (Δ T behind the result
n', Q)) individual chip;
If Q-mod is (Δ T
n', Q)＞11, then before each subscriber channel estimated result of adjacent sub-district, expand 11+mod (Δ T
n', Q) individual 0 the chip of putting; If mod is (Δ T
n', Q)≤and W1+12, then remove back mod (Δ T
n', Q)+(W2-(W1+12)) individual chip is if mod is (Δ T
n', Q)＞W1+12, then this subscriber channel estimated result will be that complete 0 the chip of W1+11+12 constitutes by a length, and not consider the expansion of front;
Perhaps, if Q-mod is (Δ T
n', Q)＞11 and Q-mod (Δ T
n', Q)≤11+W2, then remove preceding Q-mod (the Δ T of each subscriber channel estimated result of adjacent sub-district
n', Q)-11 chip; If Q-mod is (Δ T
n', Q) 〉=(W2-(W1+12)), then expand (Q-mod (Δ T behind the result
n', Q))-(W2-(W1+12)) individual chip of 0 of putting; If Q-mod is (Δ T
n', Q)＜(W2-(W1+12)), then remove (W2-(W1+12))-(Q-mod (Δ T behind the result
n', Q)) individual chip; If Q-mod is (Δ T
n', Q)＞11+W2, then this subscriber channel estimated result is that complete 0 the chip of W1+11+12 constitutes by a length;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T
n', Q)≤11, then before each subscriber channel estimated result of adjacent sub-district, expand 11-mod (Δ T
n', Q) individual 0 the chip of putting; If mod is (Δ T
n', Q) 〉=(W2-(W1+12)), then behind the result, expand mod (Δ T
n', Q)-(W2-(W1+12)) is individual to put 0 chip, if mod is (Δ T
n', Q)＜(W2-(W1+12)), remove (W2-(W1+12))-mod (Δ T behind the result
n', Q) individual chip;
If mod is (Δ T
n', Q)＞11 and mod (Δ T
n', Q)≤11+W2, then remove preceding mod (the Δ T of each subscriber channel estimated result of adjacent sub-district
n', Q)-11 chip; If mod is (Δ T
n', Q) 〉=(W2-(W1+12)), then expand mod (Δ T behind the result
n', Q)-(W2-(W1+12)) individual 0 the chip of putting; If mod is (Δ T
n', Q)＜(W2-(W1+12)), then remove (W2-(W1+12))-mod (Δ T behind the result
n', Q) individual chip; If mod is (Δ T
n', Q)＞11+W2, then this subscriber channel estimated result is that complete 0 the chip of W1+11+12 constitutes by a length;
Perhaps, if mod is (Δ T
n', Q)＞11, then before each subscriber channel estimated result of adjacent sub-district, expand 11+Q-mod (Δ T
n', Q) individual 0 the chip of putting; If Q-mod is (Δ T
n', Q)≤and W1+12, remove back Q-mod (Δ T
n', Q)+(W2-(W1+12)) individual chip; If Q-mod is (Δ T
n', Q)＞W1+12, then this subscriber channel estimated result will be that complete 0 the chip of W1+11+12 constitutes by a length, and not consider the expansion of front.
6, multi region combined detection method of time gap code division multi address system according to claim 3 is characterized in that, described step D ' specifically comprises:
D1 ', the estimated result length of setting this community user aggregate channel response are W3, and the estimated result length of adjacent community user aggregate channel response is W4; The length of spreading code is Q;
D2 ', expand the estimated result of described this sub-district each user's aggregate channel response in the following manner:
13 of predetermined lengths of expansion are put 0 chip before the estimated result of each user's aggregate channel response of this sub-district, if there is not leading this cell signal of neighbor cell signal, then do not expand, i.e. 13=0; 14 of predetermined lengths of expansion are put 0 chip in the back, if there is not neighbor cell signal to fall behind this cell signal, then do not expand, i.e. 14=0;
D3 ', when W3+14 〉=W4, expand the estimated result of each user's aggregate channel response of each neighbor cell in the following manner:
(1) when neighbor cell signal falls behind than this sub-district,
If mod is (Δ T
n', Q)≤and 14+ (W3-W4), then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13+mod (Δ T
n', Q) individual 0 the chip of putting is expanded 14+ (W3-W4)-mod (Δ T behind the result
n', Q) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞14+ (W3-W4) and Q-mod (Δ T
n', Q)≤13, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13-(Q-mod (Δ T
n', Q)) individual 0 the chip of putting, expand 14+ (W3-W4)+(Q-mod (Δ T behind the result
n', Q)) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞14+ (W3-W4) and Q-mod (Δ T
n', Q)＞13, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13+mod (Δ T
n', Q) individual 0 the chip of putting removes mod (Δ T behind the result
n', Q)-(14+ (W3-W4)) individual chip; Perhaps remove preceding (Q-mod (the Δ T of the estimated result of each user's aggregate channel response of adjacent sub-district
n', Q))-13 chips, expand 14+ (W3-W4)+(Q-mod (Δ T behind the result
n', Q)) individual 0 the chip of putting;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T
n', Q)≤13, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13-mod (Δ T
n', Q) individual 0 the chip of putting is expanded 14+ (W3-W4)+mod (Δ T behind the result
n', Q) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞13 and Q-mod (Δ T
n', Q)≤and 14+ (W3-W4), then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13+ (Q-mod (Δ T
n', Q)) individual 0 the chip of putting, expand 14+ (W3-W4)-(Q-mod (Δ T behind the result
n', Q)) individual 0 the chip of putting;
If mod is (Δ T
n', Q)＞13 and Q-mod (Δ T
n', Q)＞14+ (W3-W4), then remove preceding mod (the Δ T of the estimated result of each user's aggregate channel response of adjacent sub-district
n', Q)-13 a chip is expanded 14+ (W3-W4)+mod (Δ T behind the result
n', Q) individual 0 the chip of putting; Perhaps before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13+ (Q-mod (Δ T
n', Q)) individual 0 the chip of putting, remove (Q-mod (Δ T behind the result
n', Q))-(14+ (W3-W4)) individual chip;
D4 ' expands the estimated result of each user's aggregate channel response of each neighbor cell in the following manner when W3+14＜W4:
(1) when neighbor cell signal falls behind than this sub-district,
If Q-mod is (Δ T
n', Q)≤13, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13-(Q-mod (Δ T
n', Q)) individual 0 the chip of putting; If Q-mod is (Δ T
n', Q) 〉=(W4-(W3+14)), expansion (Q-mod (Δ T behind the result
n', Q))-(W4-(W3+14)) is individual to put 0 chip, if Q-mod is (Δ T
n', Q)＜(W4-(W3+14)), remove (W4-(W3+14))-(Q-mod (Δ T behind the result
n', Q)) individual chip;
If Q-mod is (Δ T
n', Q)＞13, then before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13+mod (Δ T
n', Q) individual 0 the chip of putting removes mod (Δ T behind the result
n', Q)+(W4-(W3+14)) individual chip;
Perhaps, if Q-mod is (Δ T
n', Q)＞13, remove preceding Q-mod (the Δ T of the estimated result of each user's aggregate channel response of adjacent sub-district
n', Q)-13 chip; If Q-mod is (Δ T
n', Q) 〉=(W4-(W3+14)), expansion (Q-mod (Δ T behind the result
n', Q))-(W4-(W3+14)) individual chip of 0 of putting; If Q-mod is (Δ T
n', Q)＜(W4-(W3+14)), remove (W4-(W3+14))-(Q-mod (Δ T behind the result
n', Q)) individual chip;
(2) when neighbor cell signal is more leading than this sub-district,
If mod is (Δ T
n', Q)≤13, before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13-mod (Δ T
n', Q) individual 0 the chip of putting; If mod is (Δ T
n', Q) 〉=(W4-(W3+14)), expand mod (Δ T behind the result
n', Q)-(W4-(W3+14)) is individual to put 0 chip, if mod is (Δ T
n', Q)＜(W4-(W3+14)), remove (W4-(W3+14))-mod (Δ T behind the result
n', Q) individual chip;
If mod is (Δ T
n', Q)＞13, remove preceding mod (the Δ T of the estimated result of each user's aggregate channel response of adjacent sub-district
n', Q)-13 chip; If mod is (Δ T
n', Q) 〉=(W4-(W3+14)), behind the result, expand mod (Δ T
n', Q)-(W4-(W3+14)) is individual to put 0 chip, if mod is (Δ T
n', Q)＜(W4-(W3+14)), remove (W4-(W3+14))-mod (Δ T behind the result
n', Q) individual chip;
Perhaps, if mod is (Δ T
n', Q)＞13, before the estimated result of each user's aggregate channel response of adjacent sub-district, expand 13+Q-mod (Δ T
n', Q) individual 0 the chip of putting; Remove Q-mod (Δ T behind the result
n', Q)+(W4-(W3+14)) individual chip.
7, multi region combined detection method of time gap code division multi address system according to claim 1 and 2, it is characterized in that, the estimated result of this sub-district and adjacent each user's of sub-district aggregate channel response is b=C h, wherein, C is this sub-district or adjacent sub-district user's a pairing spreading code of code channel, is the convolution algorithm symbol, and h is this user's a channel estimation results.
8, multi region combined detection method of time gap code division multi address system according to claim 1 is characterized in that, also comprises step between step B and step D:
Code channel to each neighbor cell divides into groups.
9, multi region combined detection method of time gap code division multi address system according to claim 2 is characterized in that, also comprises step between step B ' and step D ':
Code channel to each neighbor cell divides into groups.
10, according to Claim 8 or 9 described multi region combined detection method of time gap code division multi address system, it is characterized in that the code channel to each neighbor cell divides into groups in the following manner:
Divide into groups based on the code channel of code channel affiliated subdistrict to each neighbor cell; And/or
Divide into groups based on code channel power or amplitude code channel to each neighbor cell; And/or
Divide into groups based on the code channel of code channel correlation to each neighbor cell.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100752061A CN100376089C (en) | 2005-06-03 | 2005-06-03 | United detection method for multiple cells in time division code division multiple access |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100752061A CN100376089C (en) | 2005-06-03 | 2005-06-03 | United detection method for multiple cells in time division code division multiple access |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1874170A true CN1874170A (en) | 2006-12-06 |
| CN100376089C CN100376089C (en) | 2008-03-19 |
Family
ID=37484475
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100752061A Active CN100376089C (en) | 2005-06-03 | 2005-06-03 | United detection method for multiple cells in time division code division multiple access |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100376089C (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008128477A1 (en) * | 2007-04-23 | 2008-10-30 | Da Tang Mobile Communications Equipment Co., Ltd | A signal receiving method and apparatus for mobile communication terminal |
| WO2008138262A1 (en) * | 2007-05-09 | 2008-11-20 | Huawei Technologies Co., Ltd. | Joint detection method, aware system, user terminal and base station |
| CN101494468A (en) * | 2008-01-23 | 2009-07-29 | 展讯通信（上海）有限公司 | Estimation method and device for multi-district united channel |
| CN102201833A (en) * | 2011-05-26 | 2011-09-28 | 南京邮电大学 | Terminal multi-cell joint detection method for time division synchronous code division multiple access cluster system |
| CN102355280A (en) * | 2011-09-27 | 2012-02-15 | 上海华为技术有限公司 | Convolution implementation method for CDMA (Code Division Multiple Access), arithmetic device and wireless receiving device |
| CN102457300A (en) * | 2010-10-25 | 2012-05-16 | 中国移动通信集团公司 | Joint detection method and device |
| CN101304587B (en) * | 2007-05-09 | 2012-11-21 | 华为技术有限公司 | Association detection method, cognitive system, subscriber terminal and base station |
| CN104852755A (en) * | 2015-05-11 | 2015-08-19 | 饶品魁 | CoMP transmission system based on cloud computing |
| CN112153404A (en) * | 2020-09-23 | 2020-12-29 | 北京达佳互联信息技术有限公司 | Code rate adjusting method, code rate detecting method, code rate adjusting device, code rate detecting device, code rate adjusting equipment and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1145294C (en) * | 2001-01-12 | 2004-04-07 | 华为技术有限公司 | Detection method for forward link load in CDMA communication system |
| WO2003036835A1 (en) * | 2001-09-27 | 2003-05-01 | Linkair Communications, Inc. | A method of improve handover performance in synchronism code division multiple access mobile communication system |
| US20040116122A1 (en) * | 2002-09-20 | 2004-06-17 | Interdigital Technology Corporation | Enhancing reception using intercellular interference cancellation |
| ATE451756T1 (en) * | 2003-08-26 | 2009-12-15 | Ericsson Telefon Ab L M | POSITIONING A PATH FINDER WINDOW IN A CDMA RECEIVER |
-
2005
- 2005-06-03 CN CNB2005100752061A patent/CN100376089C/en active Active
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008128477A1 (en) * | 2007-04-23 | 2008-10-30 | Da Tang Mobile Communications Equipment Co., Ltd | A signal receiving method and apparatus for mobile communication terminal |
| CN100568767C (en) * | 2007-04-23 | 2009-12-09 | 大唐移动通信设备有限公司 | A kind of signal acceptance method of mobile communication terminal and device |
| WO2008138262A1 (en) * | 2007-05-09 | 2008-11-20 | Huawei Technologies Co., Ltd. | Joint detection method, aware system, user terminal and base station |
| CN101304587B (en) * | 2007-05-09 | 2012-11-21 | 华为技术有限公司 | Association detection method, cognitive system, subscriber terminal and base station |
| CN101494468A (en) * | 2008-01-23 | 2009-07-29 | 展讯通信（上海）有限公司 | Estimation method and device for multi-district united channel |
| CN101494468B (en) * | 2008-01-23 | 2013-02-13 | 展讯通信（上海）有限公司 | Estimation method and device for multi-district united channel |
| CN102457300A (en) * | 2010-10-25 | 2012-05-16 | 中国移动通信集团公司 | Joint detection method and device |
| CN102457300B (en) * | 2010-10-25 | 2013-12-18 | 中国移动通信集团公司 | Joint detection method and device |
| CN102201833A (en) * | 2011-05-26 | 2011-09-28 | 南京邮电大学 | Terminal multi-cell joint detection method for time division synchronous code division multiple access cluster system |
| CN102201833B (en) * | 2011-05-26 | 2013-09-25 | 南京邮电大学 | Terminal multi-cell joint detection method for time division synchronous code division multiple access cluster system |
| CN102355280A (en) * | 2011-09-27 | 2012-02-15 | 上海华为技术有限公司 | Convolution implementation method for CDMA (Code Division Multiple Access), arithmetic device and wireless receiving device |
| CN102355280B (en) * | 2011-09-27 | 2013-11-06 | 上海华为技术有限公司 | Convolution implementation method for CDMA (Code Division Multiple Access), arithmetic device and wireless receiving device |
| CN104852755A (en) * | 2015-05-11 | 2015-08-19 | 饶品魁 | CoMP transmission system based on cloud computing |
| CN104852755B (en) * | 2015-05-11 | 2019-04-26 | 北京中网华通设计咨询有限公司 | A kind of CoMP transmission system based on cloud computing |
| CN112153404A (en) * | 2020-09-23 | 2020-12-29 | 北京达佳互联信息技术有限公司 | Code rate adjusting method, code rate detecting method, code rate adjusting device, code rate detecting device, code rate adjusting equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100376089C (en) | 2008-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1874171A (en) | United detection method for multiple cells in time division code division multiple access | |
| CN1874170A (en) | United detection method for multiple cells in time division code division multiple access | |
| CN1227848C (en) | Method for generating and transmitting optimum cellular marker symbol | |
| CN1270445C (en) | Channel estimating device and method, demodulating device and method, and fading frequency determining device and method | |
| CN1265674C (en) | Method and apparatus for selecting serving sector in data communication system | |
| CN1411633A (en) | Apparatus and method for allocating channel using OVSF code for uplink synchronous transmission scheme in W-CDMA communication system | |
| CN1224177C (en) | Method for receiving multipath signals in radio communications system with CDMA and device for carrying out said method | |
| CN1288862C (en) | OFDM communication apparatus and OFDM communication method | |
| CN1841980A (en) | Mobile station | |
| CN1292611A (en) | Communication terminal device and basic station device | |
| CN1260649A (en) | OFDM sending/receiving device | |
| CN1874189A (en) | Method and device for concurrent eliminating same frequency interference in TDS-CDMA | |
| CN1187744A (en) | Spread spectrum communication system | |
| CN1863184A (en) | Signal decomposition apparatus and signal decomposition method | |
| CN101064563A (en) | Communication system, communication method for the same and mobile station and base station used for the same | |
| CN1235498A (en) | Radio communication apparatus and radio communication method | |
| CN1649254A (en) | Transmission circuit | |
| CN1643942A (en) | Method and apparatus for blind code detection | |
| CN1393066A (en) | Receiving apparatus and receiving method for radio communication | |
| CN1706110A (en) | Reduced complexity MMSE multiuser detection for a multirate CDMA link | |
| CN1874190A (en) | Method and device for serial eliminating same frequency interference in TDS-CDMA | |
| CN1968244A (en) | Carrier interference noise ratio estimation method and system | |
| CN1627742A (en) | Demodulation apparatus and method, and integrated circuit of demodulation apparatus | |
| CN1249580A (en) | Method and apparatus for demodulating in radio communication system by M sequence orthogonal modulating | |
| CN1218495C (en) | Radio signal receiving system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee | ||
| CP02 | Change in the address of a patent holder |
Address after: 201612 Shanghai City, Songjiang Caohejing Xuhui District hi tech park Xinzhuan Highway No. 518, building 6, room 101 Patentee after: Shanghai Ultimate Power Communication Technology Co., Ltd. Address before: 201700 Shanghai city Qingpu District No. 599 new road, building 3, No. 103 Patentee before: Shanghai Ultimate Power Communication Technology Co., Ltd. |
|
| C56 | Change in the name or address of the patentee | ||
| CP02 | Change in the address of a patent holder |
Address after: 201612 Shanghai Caohejing Songjiang hi tech park Xinzhuan Highway No. 518, building 6, room 101 Patentee after: Shanghai Ultimate Power Communication Technology Co., Ltd. Address before: 201612 Shanghai City, Songjiang Caohejing Xuhui District hi tech park Xinzhuan Highway No. 518, building 6, room 101 Patentee before: Shanghai Ultimate Power Communication Technology Co., Ltd. |