CN103684523B - Method for transmitting and receiving signal of complementary stirring code division multiple access system on basis of multi-path attenuation channels - Google Patents

Method for transmitting and receiving signal of complementary stirring code division multiple access system on basis of multi-path attenuation channels Download PDF

Info

Publication number
CN103684523B
CN103684523B CN201310641718.4A CN201310641718A CN103684523B CN 103684523 B CN103684523 B CN 103684523B CN 201310641718 A CN201310641718 A CN 201310641718A CN 103684523 B CN103684523 B CN 103684523B
Authority
CN
China
Prior art keywords
prime
centerdot
signal
sigma
overbar
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.)
Active
Application number
CN201310641718.4A
Other languages
Chinese (zh)
Other versions
CN103684523A (en
Inventor
陈晓华
刘权
孟维晓
许宏铭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Harbin Institute of Technology
Original Assignee
Harbin Institute of Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN201310641718.4A priority Critical patent/CN103684523B/en
Publication of CN103684523A publication Critical patent/CN103684523A/en
Application granted granted Critical
Publication of CN103684523B publication Critical patent/CN103684523B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Radio Transmission System (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses a method for transmitting and receiving signals of a complementary stirring code division multiple access system on the basis of multi-path attenuation channels, and relates to the field of communication. The method aims to solve problems of high bandwidth requirements and bit error rate and low transmission rate of the traditional direct-sequence spread-spectrum multiple-input-multiple-output complementary code division multiple access system. The method has the advantages that the method is combined with an MIMO (multiple-input-multiple-output) technology, a plurality of transmitting antennas and a plurality of receiving antennas are arranged at a transmitting end and a receiving end, accordingly, a bit error rate can be reduced and is comparably reduced by 15%, and a transmission rate can be increased and is comparably increased by 17%; bandwidth resources required by the complementary stirring code division multiple access system can be reduced and are comparably reduced by 20%; a stirring technology is combined with the traditional orthogonal complementary codes; a wireless channel transmission system is established among multiple users via multiple access; the method is applicable to the field of communication.

Description

The signal transmitting and receiving method of code division multiple access system is stirred in complementation based on multipath fading channels
Technical field
The present invention relates to the communications field.
Background technology
Tradition straight sequence exhibition frequently complementary code division multiple access (the Direct-sequence Multiple Access) system of multiple-input and multiple-output uses code to distinguish antenna, transmission data due to different antennae can use coding to be separated so can realize multicast or space diversity, but the demand too increased bandwidth, does not meet the main concept of multiple-input and multiple-output simultaneously.
The straight sequence exhibition of tradition frequently multiple-input and multiple-output mutual-complementing code division multiple access system uses the spreading codes of straight sequence to eliminate interference, and straight sequence exhibition frequently technology can consume a large amount of bandwidth especially transmit data grows fast time.Due to the data separating that traditional multiple antennas mutual-complementing code technology uses code different antennae to be transmitted, so traditional multiple antennas mutual-complementing code technology is not really wanted to use multiaerial system, and multiple antennas is used whether to meet benefit or a problem to realize traditional multiple antennas mutual-complementing code technology.
Summary of the invention
The present invention is that the demand of multiple-input and multiple-output mutual-complementing code division multiple access system to bandwidth is high frequently in order to solve the exhibition of tradition straight sequence, the error rate is high, the problem that transmission rate is low, and then the signal transmitting and receiving method providing the complementation stirring code division multiple access system based on multipath fading channels.
The signal transmitting method of code division multiple access system is stirred in complementation based on multipath fading channels, and described launching technique is:
Step one, by signal B to be sent (k)data Replica becomes N tindividual, N tfor being greater than the positive integer of zero, k=1,2 ... K;
Step 2, by each signal B (k)data are copied into M signal again, M be greater than zero positive integer;
By n-th tm signal in M the signal that individual signal is corresponding and coding carry out stirring operation, obtain signal n t=1,2 ... N t, m is the positive integer being greater than zero and being less than M;
Step 3, to be outputed signal in step 2 with carry out product, after product, obtain signal by n-th tby the end n-th after M the modulation signal that individual signal is corresponding superposes tindividual transmission antennas transmit.
The signal acceptance method of code division multiple access system is stirred in complementation based on multipath fading channels, and the signal acceptance method of user k is:
The N of step 4, receiving terminal rindividual reception antenna receives the signal that transmitting terminal is launched, N rfor being greater than the positive integer of zero, and N tbe less than or equal to N r, n-th rindividual reception antenna receives n-th tsignal after the superposition of individual transmission antennas transmit, and by N r× 1 dimensional signal merges formation vector Y t, n r=1,2 ... N r, vector Y tsignal U is obtained after superposing with N t, N is coding degree;
Step 5, the signal U that will obtain tdata Replica becomes N rindividual;
Step 6, by each signal U tat f mcarrier frequency carries out demodulation operation, and the signal after demodulation operation by obtaining two signal datas after low pass filter filtering is respectively and P m,t;
Signal signal is obtained by channel estimator by described signal carry out pseudo-inverse operation, obtain signal signal P m,tsample in time t, obtain signal R m,t; By signal with signal R m,tcarry out product, after product, obtain signal
Step 7, the signal that will obtain with carry out solution and stir operation, obtain solution stir after signal by N rindividual solution stir after signal data superpose after obtain signal then carry out adjudicating rear output final signal B (k).
In the present invention, adopt multiple transmitting antenna and multiple reception antenna in conjunction with MIMO (Multiple-Input-Multiple-Output) technology at transmitting terminal and receiving terminal, reduce the error rate, reduce 15% on year-on-year basis, improve transmission rate, improve 17% on year-on-year basis; The complementary code division multiple access system that stirs can reduce the demand of system to bandwidth resources, decreases 20% on year-on-year basis; Stirring technique is combined with conventional orthogonal mutual-complementing code; The wireless channel transmission system set up between multi-user is accessed by multiple access.
Channel is multipath frequency decay channel, and time delay expansion L must meet L≤N t≤ N r.Use table 1 represents ITU-R M.1225 channel model, is wherein indoor test environment tapped delay line parameter, as follows:
Use table 2 represents the probability that the inverse matrix element number range of channel matrix is greater than 1, as follows:
The Performance Evaluation of channel A under indoor environment:
In Performance Evaluation, suppose that indoor test environment adopts channel A as shown in table 1, we are 100ns the conventional letter duration, so we have selected time constant [0 110 170 290] ns as delay path, corresponding average power is [0-10-18-26] dB.
As shown in Figure 8, the complementary code division multiple access system that stirs uses transmitting antenna N t=4, reception antenna N r=[4 56 7].Delay path L is limited to the sum of transmitting antenna, thus extend path L=4, so we need more than 4 accept antenna to overcome multi-path jamming.Because symbol duration is chosen to be 100ns so the message transmission rate of each user is 10Mbps.Because system user sum K=2 is so the overall transmission rate of system is 2 × 10Mbps.Because each carrier wave occupies the bandwidth of 10MHz and the total carrier wave M=2 of system, so the total bandwidth that system occupies is 2 × 10MHz.
The performance of the increase system that we can find along with reception antenna quantity is become better and better, and when the quantity of transmitting antenna is equal with the quantity accepting antenna, systematic function is the poorest.This phenomenon produces, because when complementary stirring code division multiple access system performs pseudo-inverse operation to first channel matrix, so the number range of the element of the pseudo-inverse matrix of non-side's channel matrix will suppose that the inverse matrix of channel matrix is much little due to squeeze theorem.Stir in code division multiple access system in complementation, the element on first path of the inverse matrix of the channel matrix of side is the chief component of system MAI and MI, and when we use the transmitting antenna of varying number and accept antenna, the performance of system increases significantly.Systematic function is very responsive to the element in the inverse matrix of channel matrix, and when coefficient is less than 1, when the number range of element becomes large, interference and noise are also exaggerated.If channel matrix is square matrix, the value of the determinant of channel matrix directly affects the number range of the inverse matrix element of channel matrix, when channel matrix determinant value close to zero time, the number range of the inverse matrix of channel matrix will become very large result and produce worse performance, when coefficient is greater than 1, when the value of channel matrix determinant becomes very large, the number range of the inverse matrix of channel matrix will become very little result and produce good performance.
When code division multiple access execution pseudo inverse matrix operation is stirred in complementation, along with the increase of reception antenna quantity, channel matrix the number range of element of inverse matrix diminish.Table 2 represents the absolute value probability that is greater than 1, when absolute value when being greater than 1 will become very poor of the performance of system because bit error rate function into:
Along with reception antenna, to compare transmitting antenna increasing, absolute value be greater than that the probability of 1 will become more and more less, the performance of system will be become better and better.When transmitting antenna is equal with reception antenna quantity time, absolute value be greater than the probability of 1 close to 0.534, so the performance of system becomes very poor.
As shown in Figure 9, the complementary code division multiple access system that stirs uses transmitting antenna N t=4, reception antenna N r=6.Delay path L is limited to the sum of transmitting antenna, thus extend path L=4, in order to complete pseudoinverse inverse matrix we need more than 4 accept antenna to overcome multi-path jamming.According to formula (4-45), if K=M formula can abbreviation be:
According to formula, we can analyze: as K=M the error rate only and the signal to noise ratio of signal have relation and carrier number and number of users irrelevant.And as K<M, can analyze from formula (4-45), along with the increase of number of carriers, the error rate is more and more less, and then the performance of system improves.
As shown in Figure 10, the complementary code division multiple access system that stirs uses transmitting antenna N t=4, reception antenna N r=6.Delay path L is limited to the sum of transmitting antenna, thus extend path L=4, in order to complete pseudoinverse inverse matrix we need more than 4 accept antenna to overcome multi-path jamming.According to formula, we can analyze: as K=M the error rate only and the signal to noise ratio of signal have relation and carrier number and number of users irrelevant.And as K<M, can analyze from formula (4-45), along with the minimizing of number of users, the error rate is more and more less, and then the performance of system improves.
The Performance Evaluation of channel B under indoor environment:
In Performance Evaluation, suppose that indoor test environment adopts channel B as shown in table 1, we are 100ns the conventional letter duration, so we have selected time constant [0 100 200 300] ns as delay path, corresponding average power is [0-3.6-7.2-10.8] dB.
As shown in figure 11, the complementary code division multiple access system that stirs uses transmitting antenna N t=5, reception antenna N r=[5 67 8].Delay path L is limited to the sum of transmitting antenna, thus extend path L=5, so we need more than 5 accept antenna to overcome multi-path jamming.Because symbol duration is chosen to be 100ns so the message transmission rate of each user is 10Mbps.Because system user sum K=2 is so the overall transmission rate of system is 2 × 10Mbps.Because each carrier wave occupies the bandwidth of 10MHz and the total carrier wave M=2 of system, so the total bandwidth that system occupies is 2 × 10MHz.
The performance of the increase system that we can find along with reception antenna quantity is become better and better, and when the quantity of transmitting antenna is equal with the quantity accepting antenna, systematic function is the poorest.This phenomenon produces, because when complementary stirring code division multiple access system performs pseudo-inverse operation to first channel matrix, so the number range of the element of the pseudo-inverse matrix of non-side's channel matrix will suppose that the inverse matrix of channel matrix is much little due to squeeze theorem.Stir in code division multiple access system in complementation, the element on first path of the inverse matrix of the channel matrix of side is the chief component of system MAI and MI, and when we use the transmitting antenna of varying number and accept antenna, the performance of system increases significantly.Systematic function is very responsive to the element in the inverse matrix of channel matrix, and when coefficient is less than 1, when the number range of element becomes large, interference and noise are also exaggerated.If channel matrix is square matrix, the value of the determinant of channel matrix directly affects the number range of the inverse matrix element of channel matrix, when channel matrix determinant value close to zero time, the number range of the inverse matrix of channel matrix will become very large result and produce worse performance, when coefficient is greater than 1, when the value of channel matrix determinant becomes very large, the number range of the inverse matrix of channel matrix will become very little result and produce good performance.
When code division multiple access execution pseudo inverse matrix operation is stirred in complementation, along with the increase of reception antenna quantity, channel matrix the number range of element of inverse matrix diminish.Table 2 represents the absolute value probability that is greater than 1, when absolute value when being greater than 1 will become very poor of the performance of system because bit error rate function into:
Along with reception antenna, to compare transmitting antenna increasing, absolute value be greater than that the probability of 1 will become more and more less, the performance of system will be become better and better.When transmitting antenna is equal with reception antenna quantity time, absolute value be greater than the probability of 1 close to 0.534, so the performance of system becomes very poor.
As shown in figure 12, the complementary code division multiple access system that stirs uses transmitting antenna N t=5, reception antenna N r=7.Delay path L is limited to the sum of transmitting antenna, so latency path L=5, in order to complete pseudo inverse matrix we need more than 5 accept antenna to overcome multi-path jamming.According to formula (4-45), if K=M formula can abbreviation be:
According to formula, we can analyze: as K=M the error rate only and the signal to noise ratio of signal have relation and carrier number and number of users irrelevant.And as K<M, can analyze from formula (4-45), along with the increase of number of carriers, the error rate is more and more less, and then the performance of system improves.
As shown in figure 13, the complementary code division multiple access system that stirs uses transmitting antenna N t=5, reception antenna N r=7.Delay path L is limited to the sum of transmitting antenna, thus extend path L=5, in order to complete pseudoinverse inverse matrix we need more than 5 accept antenna to overcome multi-path jamming.According to formula, we can analyze: as K=M the error rate only and the signal to noise ratio of signal have relation and carrier number and number of users irrelevant.And as K<M, can analyze from formula (4-45), along with the minimizing of number of users, the error rate is more and more less, and then the performance of system improves.
Accompanying drawing explanation
Fig. 1 is that the present invention stirs mutual-complementing code emission system;
Fig. 2 is the flow chart of stirring operation in step 2;
Fig. 3 is that coding receiving system is stirred in the present invention's complementation;
Fig. 4 is step 6 baseband equivalence channel impulse response model flow figure;
Fig. 5 is step 6 baseband equivalence channel model flow chart;
Fig. 6 is the lag characteristic distribution map of baseband channel equivalent model;
Fig. 7 is the flow chart separating stirring operation in step 7;
Fig. 8 is the error rate of multi-user K=M=2, and system uses transmitting antenna N t=4, reception antenna N r=[4 56 7];
Fig. 9 is the error rate of multi-user K=2, M=[2 46 8], and system uses transmitting antenna N t=4, reception antenna N r=6;
Figure 10 is the error rate of multi-user M=8, K=[2 46 8], and system uses transmitting antenna N t=4, reception antenna N r=6;
Figure 11 is the error rate of multi-user K=M=2, and system uses transmitting antenna N t=5, reception antenna N r=[5 67 8];
Figure 12 is the error rate of multi-user K=2, M=[2 46 8], and system uses transmitting antenna N t=5, reception antenna N r=7;
Figure 13 is multi-user K=[2 46 8], the error rate of M=8, and system uses transmitting antenna N t=5, reception antenna N r=7.
Embodiment
Embodiment one: present embodiment is described below in conjunction with Fig. 1 and Fig. 2, stir the signal transmitting method of code division multiple access system described in present embodiment based on the complementation of multipath fading channels, described launching technique is:
Step one, by signal B to be sent (k)data Replica becomes N tindividual, N tfor being greater than the positive integer of zero, k=1,2 ... K;
Step 2, by each signal B (k)data are copied into M signal again, M be greater than zero positive integer;
By n-th tm signal in M the signal that individual signal is corresponding and coding carry out stirring operation, obtain signal n t=1,2 ... N t, m is the positive integer being greater than zero and being less than M;
Step 3, to be outputed signal in step 2 with carry out product, after product, obtain signal by n-th tby the end n-th after M the modulation signal that individual signal is corresponding superposes tindividual transmission antennas transmit.
Embodiment two: present embodiment is further qualified the signal transmitting method that code division multiple access system is stirred in the complementation based on multipath fading channels described in embodiment one, in present embodiment, the method for stirring operation in step 2:
Initial transmit for B ( k ) = [ b 1 ( k ) , b 2 ( k ) , . . . , b N ( k ) ] , - - - ( 2 - 1 )
b t ( t ) = b ( k ) p t , - - - ( 2 - 2 )
Signal B ( k ) = [ b 1 ( k ) , b 2 ( k ) , . . . , b N ( k ) ] 1 &times; N With coding C n t , m ( k ) = [ c n t , m , 1 ( k ) , c n t , m , 2 ( k ) , . . . , c n t , m , N ( k ) ] 1 &times; N In corresponding element stir formed output signal T n t , m ( k ) = [ b 1 ( k ) c n t , m , 1 ( k ) , b 2 ( k ) c n t , m , 2 ( k ) , . . . , b N ( k ) c n t , m , N ( k ) ] 1 &times; N .
Described in above-mentioned execution mode, the complementary code that stirs is obtained by following steps:
Steps A: set up orthogonal matrix A and D
Then step B is performed;
Step B: utilize orthogonal matrix A to be multiplied by orthogonal matrix D, obtains complementary stirring code division multiple access encoder matrix C (k)
C ( k ) = C n t , 1 , t ( k ) C n t , 2 , t ( k ) . . . C n t , M , t ( k ) = a t , n t d 1 , k d 2 , k . . . d M , k
Wherein, n is positive integer and n≤N.
Embodiment three: present embodiment is described below in conjunction with Fig. 3 to Fig. 7, stir the signal acceptance method of code division multiple access system described in present embodiment based on the complementation of multipath fading channels, the signal acceptance method of user k is:
The N of step 4, receiving terminal rindividual reception antenna receives the signal that transmitting terminal is launched, N rfor being greater than the positive integer of zero, and N tbe less than or equal to N r, n-th rindividual reception antenna receives n-th tsignal after the superposition of individual transmission antennas transmit, and by N r× 1 dimensional signal merges formation vector Y t, n r=1,2 ... N r, vector Y tsignal U is obtained after superposing with N t, N is coding degree;
Step 5, the signal U that will obtain tdata Replica becomes N rindividual;
Step 6, by each signal U tat f mcarrier frequency carries out demodulation operation, and the signal after demodulation operation by obtaining two signal datas after low pass filter filtering is respectively and P m,t;
Signal signal is obtained by channel estimator by described signal carry out pseudo-inverse operation, obtain signal signal P m,tsample in time t, obtain signal R m,t; By signal with signal R m,tcarry out product, after product, obtain signal
Step 7, the signal that will obtain with carry out solution and stir operation, obtain solution stir after signal by N rindividual solution stir after signal data superpose after obtain signal then carry out adjudicating rear output final signal B (k).
Embodiment four: present embodiment is further qualified the signal transmitting and receiving method that code division multiple access system is stirred in the complementation based on multipath fading channels described in embodiment three, in present embodiment, the detailed process of step 6 and step 7 is:
The detailed process of corresponding step 6 is: signal U tat carrier wave f mbe in time t from transmitting antenna n tto reception antenna n rchannel gain be
H ~ n t , n r , m , t ( k ) = &Sigma; l = 0 L - 1 h ~ n t , n r , m , t - l ( k ) = &Sigma; l = 0 L - 1 &beta; n t , n r , m , t ( k ) e i &theta; n t , n r , m , t ( k ) &delta; t - l , - - - ( 4 - 1 )
Channel postpones distribution by L and forms, and time of delay, t+1 to t+L was formed continuously, parameter represent l path, l=0,1,2 ..., L-1, obtains:
h ~ n t , n r , m , t - l ( k ) = &beta; n t , n r , m , t ( k ) e i &theta; n t , n r m , t ( k ) - - - ( 4 - 2 )
The overall attenuation factor depends on the complex Gaussian random variables of attenuation channel:
&beta; n t , n r , m , t ( k ) e i &theta; n t , n r m , t ( k ) - - - ( 4 - 3 )
The phase place of signal is: &theta; n t , n r , m , t ( k ) = &zeta; n t , n r , m , t ( k ) - 2 &pi; f c t And rayleigh distributed;
Multipath time of delay of time in units of a symbol of what l represented is time t; L represents the channel quantity of multipath fading, N t=L≤N r;
L is in units of the delay of a symbol time and a total L path, postpones expansion L and is less than N;
real part be then:
H n t , n r , m , t ( k ) = Re [ H ~ n t , n r , m , t ( k ) ] = &Sigma; l = 0 L - 1 &beta; n t , n r , m , t ( k ) cos ( &theta; n t , n r , m , t ( k ) ) &delta; n t , n r , m , t - l
Or h n t , n r , m , t ( k ) = Re [ h ~ n t , n r , m , t - l ( k ) ] = &beta; n t , n r , m , t ( k ) cos ( &theta; n t , n r , m , t ( k ) ) &delta; t - l ; - - - ( 4 - 4 )
The signal of user k is by transmitting antenna n tlaunch, reception antenna n rreceive, signal U tby carrier wave f mbe expressed as after demodulation after low pass filter be:
p n t , n r , m , t ( k ) = H n t , n r , m , t ( k ) * t n t , m , t ( k ) + n n r m , t ( k ) ,
The signal that user k' receives comprises the signal that all users launch:
p n t , n r , m , t = &Sigma; k = 1 K ( H n t , n r , m , t ( k ) * t n t , m , t ( k ) + n n r , m , t ( k ) ) , - - - ( 4 - 6 )
Multiple transmit antennas model, reception antenna n rwhat receive is the signal launched of each transmitting antenna and is:
p n r , m , t = &Sigma; n t = 1 N t p n t , n r , m , t = &Sigma; n t = 1 N t &Sigma; k = 1 K ( H n t , n r , m , t ( k ) * t n t , m , t ( k ) + n n r , m , t ( k ) ) , - - - ( 4 - 7 )
What perform is demodulation operation, obtains:
By
P m,t=[p 1,m,tp 2,m,t ... p Nr,m,t] T, (4-9)
Obtain signal phasor P m,t:
obey independent Gaussian distribution and itself and also Gaussian distributed:
&Sigma; k = 1 K n n r , m , t ( k ) = n n r , - - - ( 4 - 11 )
Channel matrix be divided into different path:
Above-mentionedly to obtain:
represent at carrier wave f mthe impulse response square of the baseband equivalence channel on l path, signal phasor P m,tbecome:
P m , t = &Sigma; k = 1 K { H m , t ( k ) * b t ( k ) c 1 , m , t ( k ) b t ( k ) c 2 , m , t ( k ) . . . b t ( k ) c N t , m , t ( k ) } + n 1 n 2 . . . n N r = &Sigma; k = 1 K { H m , t ( k , 0 ) * b t ( k ) c 1 , m , t ( k ) b t ( k ) c 2 , m , t ( k ) . . . b t ( k ) c N t , m , t ( k ) + &Sigma; l = 1 L - 1 H m , t ( k , l ) * b t ( k ) c 1 , m , t ( k ) b t ( k ) c 2 , m , t ( k ) . . . b t ( k ) c N t , m , t ( k ) , - - - ( 4 - 14 )
To P m,tsample at time t':
R m , t &prime; = &Integral; t = - &infin; &infin; P m , t &delta; t - t &prime; dt = &Sigma; k = 1 K { H m , t &prime; ( k , 0 ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) + &Sigma; l = 1 L - 1 H m , t &prime; ( k , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t . , m , t &prime; ( k ) } + n 1 n 2 . . . n N r , - - - ( 4 - 15 )
Channel receiver is estimated at carrier wave f by the control signal receiving receiver known mfor the impulse response matrix of the baseband equivalence channel of desired signal (l=0) on first path, matrix is:
Here l=0 represents first path of acknowledge(ment) signal:
h n t , n r , m , t &prime; - l ( k ) = &beta; n t , n r , m , t &prime; ( k ) &delta; n t , n r , m , t &prime; - l ( k ) cos &theta; n t , n r , m , t &prime; ( k ) , - - - ( 4 - 17 )
Channel estimator obtains gain and the phase data in Article 1 path, that is:
Launch data receive by user k', signal is broken down into:
R m , t &prime; = H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 0 L - 1 H m , t &prime; ( k , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) + n 1 n 2 . . . n N r , - - - ( 4 - 19 )
The signal of different user will face identical channel, that is:
H m , t &prime; ( 1,0 ) = H m , t &prime; ( 2,0 ) = . . . = H m , t &prime; ( K , 0 ) = H m , t &prime; ( k &prime; , 0 ) , - - - ( 4 - 20 )
Substituting into formula (4-19) abbreviation is:
R m , t &prime; = H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 0 L - 1 H m , t &prime; ( k , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) + n 1 n 2 . . . n N r , - - - ( 4 - 21 )
Signal phasor R m,t' and the N of user k' t× N rdimension pseudo inverse matrix is multiplied the signal being separated different antennae transmitting, N t× N rtie up pseudo-inverse channel-matrix for:
( H &OverBar; m , t &prime; ( k &prime; , 0 ) ) + = [ ( H &OverBar; m , t &prime; ( k &prime; , 0 ) ) H H &OverBar; m , t &prime; ( k &prime; , 0 ) ] - 1 ( H &OverBar; m , t &prime; ( k &prime; , 0 ) ) H , - - - ( 4 - 22 )
with signal R m,tobtain after product:
R ~ m , t &prime; ( k &prime; ) = [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + R m , t &prime; = [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) + [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + n 1 n 2 . . . n N r , - - - ( 4 - 23 )
Above formula is reduced to:
R ~ m , t &prime; ( k &prime; ) = b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) + [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + n 1 n 2 . . . n N r , - - - ( 4 - 24 )
Embodiment five: present embodiment stirs the signal acceptance method of code division multiple access system to the complementation based on multipath fading channels described in embodiment three, and in present embodiment, the detailed process of corresponding step 7 is:
The solution process of stirring is:
Signal the input signal separating stirring operation, and signal will by relevant coding separate and stir, for:
C m , t &prime; ( k &prime; ) = [ c 1 , m , t &prime; ( k &prime; ) , c 2 , m , t &prime; ( k &prime; ) , . . . , c N t , m , t &prime; ( k &prime; ) ] , - - - ( 4 - 25 )
with coding C m , t ( k &prime; ) = [ c 1 , m , t ( k &prime; ) , c 2 , m , t ( k &prime; ) , . . . , c N t , m , t ( k &prime; ) ] 1 &times; N t In corresponding element solution stir formed output signal s m , t ( k &prime; ) = C m , t ( k &prime; ) &times; R ~ m , t ( k &prime; ) ,
&Sigma; k = 1 k &NotEqual; k &prime; K c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . c N t , m , t &prime; ( k &prime; ) T b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) = &Sigma; k = 1 k &NotEqual; k &prime; K b t &prime; ( k ) c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . c N t , m , t &prime; ( k &prime; ) T c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . c N t , m , t &prime; ( k &prime; ) = &Sigma; k = 1 k &NotEqual; k &prime; K b t &prime; ( k ) d m , k &prime; a 1 , t &prime; d m , k &prime; a 2 , t &prime; . . . d m , k &prime; a N t , t &prime; d m , k &prime; a 1 , t &prime; d m , k &prime; a 2 , t &prime; . . . d m , k &prime; a N t , t &prime; = &Sigma; k = 1 k &NotEqual; k &prime; K N t b t &prime; ( k &prime; ) d m , k &prime; d m , k , - - - ( 4 - 26 )
According to formula (4-26) relation, separate stirring operation and draw:
Merging, judging process are:
Combined signal all carrier waves after obtain judgment variables
Orthogonality according to the vector of matrix D draws:
&Sigma; m = 1 M d m , k &prime; d m , k = 0 , - - - ( 4 - 29 )
Judgement vector becomes:
Finally obtain signal
According to multi-user interference equation is turned to four parts and the energy of every bit transmission signal is E b, Part I is desired signal, and desired signal is:
g t &prime; ( k &prime; ) = MN t b t &prime; ( k &prime; ) = MN t E b MN t = MN t E b , - - - ( 4 - 31 )
The average of desired signal is:
&mu; g = E [ g t &prime; ( k &prime; ) ] = MN t E b , - - - ( 4 - 32 )
Desired signal is a constant, show that variance is zero, that is:
&delta; g ( k &prime; ) = 0 , - - - ( 4 - 33 )
Part II is multi-path jamming part, and multi-path jamming part is:
I t &prime; ( k &prime; ) = &Sigma; m = 1 M &Sigma; l = 1 L - 1 c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . c N t , m , t &prime; ( k &prime; ) T [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) , - - - ( 4 - 34 )
Average is:
&mu; I ( k ) = E [ I t ( k ) ] = 0 , - - - ( 4 - 35 )
Variance is:
( &delta; I ( k ) ) 2 = var [ I t ( k ) | h i , n r , m , t ( k ) , &beta; n t , n r , m , l ( k ) ] = E b 2 M N t &Sigma; m = 1 M &Sigma; l = 1 L - 1 &Sigma; n t = 1 N t &Sigma; n r = 1 N r &Sigma; i = 1 N t ( h i , n r , m , t ( k ) ) 2 ( &beta; n t , n r , m , l ( k ) ) 2 , - - - ( 4 - 36 )
Part III is the multi-access inference that multi-user causes, that is:
J t &prime; ( k &prime; ) = &Sigma; m = 1 M &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . c N t , m , t &prime; ( k &prime; ) T [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) , - - - ( 4 - 37 )
Average is:
&mu; J ( k ) = E [ J t ( k ) ] = 0 , - - - ( 4 - 38 )
Variance is:
J t &prime; ( k &prime; ) = &Sigma; m = 1 M &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . c N t , m , t &prime; ( k &prime; ) T [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) . . . b t &prime; ( k ) c N t , m , t &prime; ( k ) , - - - ( 4 - 39 )
Last part is noise, that is:
&eta; t &prime; ( k &prime; ) = &Sigma; m = 1 M c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) . . . c N t , m , t &prime; ( k &prime; ) [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + n 1 n 2 . . . n N r , - - - ( 4 - 40 )
Average is:
&mu; &eta; ( k ) = 0 , - - - ( 4 - 41 )
Variance is:
( &delta; &eta; ( k ) ) 2 = N 0 2 &Sigma; m = 1 M &Sigma; n t = 1 N t &Sigma; n r = 1 N r ( h n t , n r , m , t ( k ) ) 2 , - - - ( 4 - 42 )
The error rate is:
P b ( x ) = Q ( MN t E b ( &delta; I ( k ) ) 2 + ( &delta; J ( k ) ) 2 + ( &delta; &eta; ( k ) ) 2 ) , - - - - ( 4 - 43 )
The data obtained substitute into formula (4-43) and obtain:
E bfor by N tthe energy of a mark signal of individual transmitting antenna and M carrier wave transmission.

Claims (3)

1., based on the signal transmitting method of the complementation stirring code division multiple access system of multipath fading channels, it is characterized in that:
Described launching technique is:
Step one, by signal B to be sent (k)data Replica becomes N tindividual, N tfor being greater than the positive integer of zero, k=1,2 ... K;
Step 2, by each signal B (k)data are copied into M signal again, M be greater than zero positive integer;
By n-th tm signal in M the signal that individual signal is corresponding and coding carry out stirring operation, obtain signal n t=1,2 ... N t, m is the positive integer being greater than zero and being less than M;
Step 3, to be outputed signal in step 2 with carry out product, after product, obtain signal by n-th tby n-th after M the modulation signal that individual signal is corresponding superposes tindividual transmission antennas transmit,
The method of stirring operation in step 2:
Initial transmit for B ( k ) = [ b 1 ( k ) , b 2 ( k ) , &CenterDot; &CenterDot; &CenterDot; , b N ( k ) ] , - - - ( 2 - 1 )
b t ( k ) = b ( k ) p t , - - - ( 2 - 2 )
B (k)∈-1 ,+1} and
Coding
Signal B ( k ) = [ b 1 ( k ) , b 2 ( k ) , &CenterDot; &CenterDot; &CenterDot; , b N ( k ) ] 1 &times; N With coding C n t , m ( k ) = [ c n t , m , 1 ( k ) , c n t , m , 2 ( k ) , &CenterDot; &CenterDot; &CenterDot; , c n t , m , N ( k ) ] 1 &times; N In corresponding element stir formed output signal e bfor by N tthe energy of a mark signal of individual transmitting antenna and M carrier wave transmission.
2., based on the signal acceptance method of the complementation stirring code division multiple access system of multipath fading channels, it is characterized in that:
The signal acceptance method of user k is:
The N of step 4, receiving terminal rindividual reception antenna receives the signal that transmitting terminal is launched, N rfor being greater than the positive integer of zero, and N tbe less than or equal to N r, n-th rindividual reception antenna receives n-th tsignal after the superposition of individual transmission antennas transmit, and by N r× 1 dimensional signal merges formation vector Y t, n r=1,2 ... N r, vector Y tsignal U is obtained after superposing with N t, N is coding degree;
Step 5, the signal U that will obtain tdata Replica becomes N rindividual;
Step 6, by each signal U tat f mcarrier frequency carries out demodulation operation, and the signal after demodulation operation by obtaining two signal datas after low pass filter filtering is respectively and P m,t;
Signal signal is obtained by channel estimator by described signal carry out pseudo-inverse operation, obtain signal signal P m,tsample in time t, obtain signal R m,t; By signal with signal R m,tcarry out product, after product, obtain signal
Step 7, the signal that will obtain with carry out solution and stir operation, obtain solution stir after signal by N rindividual solution stir after signal data superpose after obtain signal then carry out adjudicating rear output final signal B (k),
The detailed process of corresponding step 7 is:
The solution process of stirring is:
Signal the input signal separating stirring operation, and signal will by relevant coding separate and stir, for:
C m , t &prime; ( k &prime; ) = [ c 1 , m , t &prime; ( k &prime; ) , c 2 , m , t &prime; ( k &prime; ) , &CenterDot; &CenterDot; &CenterDot; , c N t , m , t &prime; ( k &prime; ) ] , - - - ( 4 - 25 )
with coding C m , t ( k &prime; ) = [ c 1 , m , t ( k &prime; ) , c 2 , m , t ( k &prime; ) , &CenterDot; &CenterDot; &CenterDot; , c N t , m , t ( k &prime; ) ] 1 &times; N t In corresponding element solution stir formed output signal s m , t ( k &prime; ) = C m , t ( k &prime; ) &times; R ~ m , t ( k &prime; ) ,
&Sigma; k = 1 k &NotEqual; k &prime; K c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; c N t , m , t &prime; ( k &prime; ) T b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; k c N t , m , t &prime; ( k ) = &Sigma; k = 1 k &NotEqual; k &prime; K b t &prime; ( k ) c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; c N t , m , t &prime; ( k &prime; ) T c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; c N t , m , t &prime; ( k &prime; ) = &Sigma; k = 1 k &NotEqual; k &prime; K b t &prime; ( k ) d m , k &prime; a 1 , t &prime; d m , k &prime; a 2 , t &prime; &CenterDot; &CenterDot; &CenterDot; d m , k &prime; a N t , t &prime; d m , k &prime; a 1 , t &prime; d m , k &prime; a 2 , t &prime; &CenterDot; &CenterDot; &CenterDot; d m , k &prime; a N t , t &prime; = &Sigma; k = 1 k &NotEqual; k &prime; K N t b t &prime; ( k &prime; ) d m , k &prime; d m , k , - - - ( 4 - 26 )
According to formula (4-26) relation, separate stirring operation and draw:
Merging, judging process are:
Combined signal all carrier waves after obtain judgment variables
Orthogonality according to the vector of matrix D draws:
&Sigma; m = 1 M d m , k &prime; d m , k = 0 , - - - ( 4 - 29 )
Judgement vector becomes:
Finally obtain signal
According to multi-user interference equation is turned to four parts, Part I is desired signal, and desired signal is:
g t &prime; ( k &prime; ) = M N t b t &prime; ( k &prime; ) = M N t E b MN t = MN t E b , - - - ( 4 - 31 )
The average of desired signal is:
&mu; g = E [ g t &prime; ( k &prime; ) ] = MN t E b , - - - ( 4 - 32 )
Desired signal is a constant, show that variance is zero, that is:
&delta; g ( k &prime; ) = 0 , - - - ( 4 - 33 )
Part II is multi-path jamming part, and multi-path jamming part is:
I t &prime; ( k &prime; ) = &Sigma; m = 1 M &Sigma; l = 1 L - 1 c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; c N t , m , t &prime; ( k &prime; ) T [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) , - - - ( 4 - 34 )
Average is:
&mu; I ( k ) = E [ I t ( k ) ] = 0 , - - - ( 4 - 35 )
Variance is:
( &delta; I ( k ) ) 2 = var [ I t ( k ) | h i , n r , m , t ( k ) , &beta; n t , n r , m , l ( k ) ] = E b 2 MN t &Sigma; m = 1 M &Sigma; l = 1 L - 1 &Sigma; n t = 1 N t &Sigma; n r = 1 N r &Sigma; i = 1 N t ( h i , n r , m , t ( k ) ) 2 ( &beta; n t , n r , m , l ( k ) ) 2 , - - - ( 4 - 36 )
Part III is the multi-access inference that multi-user causes, that is:
J t &prime; ( k &prime; ) = &Sigma; m = 1 M &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; c N t , m , t &prime; ( k &prime; ) T [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) , - - - ( 4 - 37 )
Average is:
&mu; J ( k ) = E [ J t ( k ) ] = 0 , - - - ( 4 - 38 )
Variance is:
J t &prime; ( k &prime; ) = &Sigma; m = 1 M &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; c N t , m , t &prime; ( k &prime; ) T [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) , - - - ( 4 - 39 )
Last part is noise, that is:
&eta; t &prime; ( k &prime; ) = &Sigma; m = 1 M c 1 , m , t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; c N t , m , t &prime; ( k &prime; ) [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r , - - - ( 4 - 40 )
Average is:
&mu; &eta; ( k ) = 0 , - - - ( 4 - 41 )
Variance is:
( &delta; &eta; ( k ) ) 2 = N 0 2 &Sigma; m = 1 M &Sigma; n t = 1 N t &Sigma; n r = 1 N r ( h n t , n r , m , t ( k ) ) 2 , - - - ( 4 - 42 )
The error rate is:
P b ( x ) = Q ( MN t E b ( &delta; I ( k ) ) 2 + ( &delta; J ( k ) ) 2 + ( &delta; &eta; ( k ) ) 2 ) , - - - ( 4 - 43 )
The data obtained substitute into formula (4-43) and obtain:
E bfor by N tthe energy of a mark signal of individual transmitting antenna and M carrier wave transmission.
3. the signal acceptance method of code division multiple access system is stirred in the complementation based on multipath fading channels according to claim 2, it is characterized in that: the detailed process of step 6 is:
The detailed process of corresponding step 6 is: signal U tat carrier wave f mbe in time t from transmitting antenna n tto reception antenna n rchannel gain be
H ~ n t , n r , m , t ( k ) = &Sigma; l = 0 L - 1 h ~ n t , n r , m , t - l ( k ) = &Sigma; l = 0 L - 1 &beta; n t , n r , m , t ( k ) e i &theta; n t , n r , m , t ( k ) &delta; t - l , - - - ( 4 - 1 )
Channel postpones distribution by L and forms, and time of delay, t+1 to t+L was formed continuously, parameter represent l path, l=0,1,2 ..., L-1, obtains:
h ~ n t , n r , m , t - l ( k ) = &beta; n t , n r , m , t ( k ) e i &theta; n t , n r , m , t ( k ) - - - ( 4 - 2 )
The overall attenuation factor depends on the complex Gaussian random variables of attenuation channel:
&beta; n t , n r , m , t ( k ) e i &theta; n t , n r , m , t ( k ) - - - ( 4 - 3 )
The phase place of signal is: and rayleigh distributed;
Multipath time of delay of time in units of a symbol of what l represented is time t; L represents the channel quantity of multipath fading, N t=L≤N r;
L is in units of the delay of a symbol time and a total L path, postpones expansion L and is less than N;
real part be then:
H n t , n r , m , t ( k ) = Re [ H ~ n t , n r , m , t ( k ) ] = &Sigma; l = 0 L - 1 &beta; n t , n r , m , t ( k ) cos ( &theta; n t , n r , m , t ( k ) ) &delta; n t , n r , m , t - l
Or h n t , n r , m , t - l ( k ) = Re [ h ~ n t , n r , m , t - l ( k ) ] = &beta; n t , n r , m , t ( k ) cos ( &theta; n t , n r , m , t ( k ) ) &delta; t - l ; - - - ( 4 - 4 )
The signal of user k is by transmitting antenna n tlaunch, reception antenna n rreceive, signal U tby carrier wave f mbe expressed as after demodulation after low pass filter be:
p n t , n r , m , t ( k ) = H n t , n r , m , t ( k ) * t n t , m , t ( k ) + n n r , m , t ( k ) , - - - ( 4 - 5 )
The signal that user k' receives comprises the signal that all users launch:
p n t , n r , m , t = &Sigma; k = 1 K ( H n t , n r , m , t ( k ) * t n t , m , t ( k ) + n n r , m , t ( k ) ) , - - - ( 4 - 6 )
Multiple transmit antennas model, reception antenna n rwhat receive is the signal launched of each transmitting antenna and is:
p n r , m , t = &Sigma; n t = 1 N t p n t , n r , m , t = &Sigma; n t = 1 N t &Sigma; k = 1 K ( H n t , n r , m , t ( k ) * t n t , m , t ( k ) + n n r , m , t k ) , - - - ( 4 - 7 )
What perform is demodulation operation, obtains:
By
P m , t = p 1 , m , t p 2 , m , t &CenterDot; &CenterDot; &CenterDot; p N r , m , t T , - - - ( 4 - 9 )
Obtain signal phasor P m,t:
obey independent Gaussian distribution and itself and also Gaussian distributed:
&Sigma; k = 1 K n n r , m , t ( k ) = n n r , - - - ( 4 - 11 )
Channel matrix be divided into different path:
Obtain:
represent at carrier wave f mthe impulse response square of the baseband equivalence channel on l path, signal phasor P m,tbecome:
P m , t = &Sigma; k = 1 K { H m , t ( k ) * b t ( k ) c 1 , m , t ( k ) b t ( k ) c 2 , m , t ( k ) &CenterDot; &CenterDot; &CenterDot; b t ( k ) c N t , m , t ( k ) } + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r = &Sigma; k = 1 K { H m , t ( k , 0 ) * b t ( k ) c 1 , m , t ( k ) b t ( k ) c 2 , m , t ( k ) &CenterDot; &CenterDot; &CenterDot; b t ( k ) c N t , m , t ( k ) + &Sigma; l = 1 L - 1 H m , t ( k , l ) * b t ( k ) c 1 , m , t ( k ) b t ( k ) c 2 , m , t ( k ) &CenterDot; &CenterDot; &CenterDot; b t ( k ) c N t , m , t ( k ) } + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r , - - - ( 4 - 14 )
To P m,tsample at time t':
R m , t &prime; = &Integral; t = - &infin; &infin; P m , t &delta; t - t &prime; dt = &Sigma; k = 1 K { H m , t &prime; ( k , 0 ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; k c N t , m , t &prime; ( k ) + &Sigma; l = 1 L - 1 H m , t &prime; ( k , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k ) c N t , m , t &prime; ( k ) } + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r , - - - ( 4 - 15 )
Channel receiver is estimated at carrier wave f by the control signal receiving receiver known mfor the impulse response matrix of the baseband equivalence channel of desired signal (l=0) on first path, matrix is:
Here l=0 represents first path of acknowledge(ment) signal:
h n t , n r , m , t &prime; - l ( k ) = &beta; n t , n r , m , t &prime; ( k ) &delta; n t , n r , m , t &prime; - l ( k ) cos &theta; n t , n r , m , t &prime; ( k ) , - - - ( 4 - 17 )
Channel estimator obtains gain and the phase data in Article 1 path, that is:
Launch data receive by user k', signal is broken down into:
R m , t &prime; = H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 0 L - 1 H m , t &prime; ( k , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k ) c N t , m , t &prime; ( k ) + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r , - - - ( 4 - 19 )
The signal of different user will face identical channel, that is:
H m , t &prime; ( 1,0 ) = H m , t &prime; ( 2,0 ) = &CenterDot; &CenterDot; &CenterDot; = H m , t &prime; ( K , 0 ) = H m , t &prime; ( k &prime; , 0 ) , - - - ( 4 - 20 )
Substituting into formula (4-19) abbreviation is:
R m , t &prime; = H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 0 L - 1 H m , t &prime; ( k , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k ) c N t , m , t &prime; ( k ) + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r , - - - ( 4 - 21 )
Signal phasor R m, t'with the N of user k' t× N rdimension pseudo inverse matrix is multiplied the signal being separated different antennae transmitting, N t× N rtie up pseudo-inverse channel-matrix for:
( H &OverBar; m , t &prime; ( k &prime; , 0 ) ) + = [ ( H &OverBar; m , t &prime; ( k &prime; , 0 ) ) H H &OverBar; m , t &prime; ( k &prime; , 0 ) ] - 1 ( H &OverBar; m , t &prime; ( k &prime; , 0 ) ) H , - - - ( 4 - 22 )
with signal R m,tobtain after product:
R ~ m , t &prime; ( k &prime; ) = [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + R m , t &prime; = [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , 0 ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k ) c N t , m , t &prime; ( k ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k ) c N t , m , t &prime; ( k ) + [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r , - - - ( 4 - 23 )
Above formula is reduced to:
R ~ m , t &prime; ( k &prime; ) = b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k &prime; ) c 1 , m , t &prime; ( k &prime; ) b t &prime; ( k &prime; ) c 2 , m , t &prime; ( k &prime; ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k &prime; ) c N t , m , t &prime; ( k &prime; ) + &Sigma; k = 1 k &NotEqual; k &prime; K b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k ) c N t , m , t &prime; ( k ) + &Sigma; k = 1 k &NotEqual; k &prime; K &Sigma; l = 1 L - 1 [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + H m , t &prime; ( k &prime; , l ) * b t &prime; ( k ) c 1 , m , t &prime; ( k ) b t &prime; ( k ) c 2 , m , t &prime; ( k ) &CenterDot; &CenterDot; &CenterDot; b t &prime; ( k ) c N t , m , t &prime; ( k ) + [ H &OverBar; m , t &prime; ( k &prime; , 0 ) ] + n 1 n 2 &CenterDot; &CenterDot; &CenterDot; n N r , - - - ( 4 - 24 ) .
CN201310641718.4A 2013-12-03 2013-12-03 Method for transmitting and receiving signal of complementary stirring code division multiple access system on basis of multi-path attenuation channels Active CN103684523B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310641718.4A CN103684523B (en) 2013-12-03 2013-12-03 Method for transmitting and receiving signal of complementary stirring code division multiple access system on basis of multi-path attenuation channels

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310641718.4A CN103684523B (en) 2013-12-03 2013-12-03 Method for transmitting and receiving signal of complementary stirring code division multiple access system on basis of multi-path attenuation channels

Publications (2)

Publication Number Publication Date
CN103684523A CN103684523A (en) 2014-03-26
CN103684523B true CN103684523B (en) 2015-06-17

Family

ID=50320958

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310641718.4A Active CN103684523B (en) 2013-12-03 2013-12-03 Method for transmitting and receiving signal of complementary stirring code division multiple access system on basis of multi-path attenuation channels

Country Status (1)

Country Link
CN (1) CN103684523B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10090818B1 (en) * 2017-09-18 2018-10-02 Silicon Laboratories Inc. Adaptive signal compressor for AM radio

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101146084A (en) * 2007-10-09 2008-03-19 北京交通大学 Uplink transmission and receiving method for space domain multiplexing MIMO MC-CDMA system
CN102340328A (en) * 2011-10-31 2012-02-01 哈尔滨工业大学 Multi-carrier MIMO (multiple input multiple output) system based on chip-level spread spectrum code of space-time-frequency three-dimensional complementary code
CN102394671A (en) * 2011-11-15 2012-03-28 哈尔滨工业大学 QPSK modulation and mutual complementing code based spread spectrum communication (SSC) method without multipath and multi-access interference
CN102427375A (en) * 2011-12-28 2012-04-25 哈尔滨工业大学 Code hopping multiple access method based on complementary code

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6990357B2 (en) * 2003-10-17 2006-01-24 Nokia Corporation Front-end arrangements for multiband multimode communication engines

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101146084A (en) * 2007-10-09 2008-03-19 北京交通大学 Uplink transmission and receiving method for space domain multiplexing MIMO MC-CDMA system
CN102340328A (en) * 2011-10-31 2012-02-01 哈尔滨工业大学 Multi-carrier MIMO (multiple input multiple output) system based on chip-level spread spectrum code of space-time-frequency three-dimensional complementary code
CN102394671A (en) * 2011-11-15 2012-03-28 哈尔滨工业大学 QPSK modulation and mutual complementing code based spread spectrum communication (SSC) method without multipath and multi-access interference
CN102427375A (en) * 2011-12-28 2012-04-25 哈尔滨工业大学 Code hopping multiple access method based on complementary code

Also Published As

Publication number Publication date
CN103684523A (en) 2014-03-26

Similar Documents

Publication Publication Date Title
CN1941663B (en) Multi-antenna channel duplicating method and wavebeam shaping method
CN101345592B (en) Self-adapting signal detector and detection method used for MIMO
CN101359952B (en) MIMO system communication method and apparatus under time division duplex mode
CN104702326A (en) MSE-based (mean square error-based) virtual MIMO (multiple input multiple output) user pairing and resource allocating method
CN107276726A (en) A kind of Massive MIMO FBMC beam space time coding downlink transmission methods
CN101815321B (en) Data processing method and device for hybrid networking
CN103684523B (en) Method for transmitting and receiving signal of complementary stirring code division multiple access system on basis of multi-path attenuation channels
CN101951277B (en) Method for suppressing residual multi-user interference in two-dimensional block spread spectrum system based on maximum likelihood detection
CN104639473B (en) A kind of mimo channel method of estimation based on fully-complementary sequence and compressed sensing
Tomeba et al. Frequency-domain space-time block coded-joint transmit/receive diversity for direct-sequence spread spectrum signal transmission
CN109039402A (en) MIMO topology interference alignment schemes based on user&#39;s compression
CN102857292B (en) Multi-user bidirectional relay transmission system and multi-user bidirectional relay transmission method
CN101931447A (en) Uplink data transmission method and device
CN100589340C (en) Bell idles transmitting diversity channel receiving demodulation method
CN109617580B (en) Mapping method of space shift keying
CN103051433B (en) A kind of method eliminating multi-user interference
CN105262531A (en) Decoding method of large-scale antenna system with user with double antennas
CN105262524A (en) Multi-user scheduling method for MIMO (Multiple Input Multiple Output) system based on feedback compensation
CN101944933B (en) Method for suppressing residual multi-user interference in 2-dimensional block spread spectrum system based on 2-dimensional minimum mean square error detection algorithm
CN103200141B (en) Based on the co-channel full duplex mimo system self feed back disturbance restraining method of spatial decomposition
CN105187110A (en) Decoding method applied to multi-cell multi-user large-scale antenna system
CN103825642B (en) The optimization method and system of emitting antenna selecting in three-dimensional multi-antenna transmission
CN105391481A (en) Low complexity decoding method for large-scale antenna system
CN101951278B (en) Method for inhibiting residual multi-user interference in two-dimensional block spread spectrum system based on parallel interference cancellation and iterative detection
CN103188052B (en) Based on the co-channel full duplex mimo system self feed back disturbance restraining method that space is chosen

Legal Events

Date Code Title Description
PB01 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