WO2012048575A1 - 一种多输入多输出mimo系统的数据发送方法和系统 - Google Patents
一种多输入多输出mimo系统的数据发送方法和系统 Download PDFInfo
- Publication number
- WO2012048575A1 WO2012048575A1 PCT/CN2011/075462 CN2011075462W WO2012048575A1 WO 2012048575 A1 WO2012048575 A1 WO 2012048575A1 CN 2011075462 W CN2011075462 W CN 2011075462W WO 2012048575 A1 WO2012048575 A1 WO 2012048575A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- base station
- pmi
- user
- interference
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0037—Inter-user or inter-terminal allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0058—Allocation criteria
- H04L5/0062—Avoidance of ingress interference, e.g. ham radio channels
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/0091—Signaling for the administration of the divided path
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
Definitions
- the present invention relates to the field of communications, and in particular, to a technology for data transmission in a multiple-input multiple-output (MIMO) system.
- MIMO multiple-input multiple-output
- MIMO technology is a major breakthrough in smart antenna technology in the field of wireless mobile communications.
- This technology can not only increase the capacity and spectrum utilization of communication systems without increasing bandwidth, but also use multipath to mitigate multipath fading. It can effectively eliminate channel interference, improve channel reliability, and reduce bit error rate. It is a key technology used in next-generation mobile communication systems and is now widely used in Long Term Evolution (LTE) and global radio access. In (WiMAX, World Interoperability for Microwave Access) interoperability and other wireless broadband systems.
- co-channel interference of neighboring cells is one of the most important factors leading to a decline in communication quality, especially in the uplink, where the interference source is the same frequency of the neighboring cell users.
- Cooperative MIMO technology to combat this co-channel interference the main idea is: Use MIMO technology to zeroize the interference of neighboring cells. The premise of zeroing is that each user must know its own interference channel to the neighboring cell.
- the cooperative base station MIMO is that the neighboring multiple base stations measure the channel of the subordinate user and the channel of the interfering user, and then notify the cooperative base station of the channel information of the interfering user in a certain manner, so that the cooperative base station can perform the process of avoiding interference, because the user Large number, collaboration The channel information transmission between the base stations inevitably leads to a large amount of overhead and delay. How to effectively and reasonably trade off the overhead and system performance when using the cooperative base station MIMO technology becomes an important issue. Summary of the invention
- a data transmission method of a multiple input multiple output MIMO system including:
- Step A Each base station in the set of base stations participating in the cooperation exchanges user scheduling information on the time-frequency resource block through a dedicated interface between the network backbone or the backbone network or the base station;
- Step B Each base station in the set of participating base stations obtains interference source user information according to user scheduling information on the time-frequency resource block, and obtains interference information by measuring channel information between the interference source user and itself, and sends the interference information to the interference.
- Step C Each base station receives interference information sent by other base stations in the set of coordinated base stations, and forms equivalent interference information according to the interference information;
- Step D Each base station uses the equivalent interference information and the channel information of the served user to itself to obtain pre-coding information on the time-frequency resource block, and sends the information to the user served by itself;
- Step E According to the received Regarding the precoded information, optimal precoding information is obtained, and the transmission signal is adjusted using the optimal precoding information.
- a data transmission system for a multiple input multiple output MIMO system includes: an information interaction unit, an interference information calculation and transmission unit, an equivalent interference information generation unit, and an optimal precoding information generation and transmission. a unit, and an adjustment unit, where the information interaction unit is configured to exchange user scheduling information of the base station in the set of base stations participating in the cooperation on the time-frequency resource block through a dedicated interface of the network backbone or the backbone network or the base station;
- An interference information calculation and sending unit configured to: according to user scheduling information on a time-frequency resource block, Obtaining interference source user information, and obtaining interference information by the measured interference source user to its own channel information, and transmitting the interference information to the base station to which the interference source user belongs;
- the equivalent interference information generating unit is configured to receive interference information sent by other base stations in the set of coordinated base stations, and form equivalent interference information according to the interference information;
- An optimal precoding information generating and transmitting unit configured to use the equivalent interference information and the channel information of the user served by the base station to obtain the information about the precoding on the time-frequency resource block, and send the information to the adjusting unit;
- an adjusting unit configured to receive the information about precoding, obtain optimal precoding information, and adjust the sending signal by using the optimal precoding information.
- the present invention enables the cooperative base station to suppress most interferences by simply performing simple information interaction through the information interaction mechanism and the precoding mechanism of the cooperative base station, thereby improving the uplink.
- the quality of the data transmission DRAWINGS
- FIG. 1 is a flow chart of a data transmission method of a multiple input multiple output MIMO system according to the present invention
- FIG. 2 is a structural diagram of a data transmission system of a multiple input multiple output MIMO system according to the present invention
- a network diagram of a data transmission system for a multiple input multiple output MIMO system
- Step 102 Each base station in the set of participating base stations obtains interference source user information according to user scheduling information on the time-frequency resource block, And obtaining interference information by measuring the channel information of the interference source user to itself, and transmitting the interference information to the base station to which the interference source user belongs;
- Step 103 Each base station receives interference information sent by other base stations in the coordinated base station set, and forms equivalent interference information according to the interference information.
- Step 104 Each base station obtains information about precoding on the time-frequency resource block by using the equivalent interference information and the channel information of the served user to itself, and sends the information to the served user.
- Step 105 The served user obtains the optimal precoding information according to the received information about the precoding, and adjusts the sending signal by using the optimal precoding information, and then maps to the corresponding antenna and sends the signal.
- the step 102 can be specifically as follows:
- Each of the base stations participating in the coordinated base station obtains information of the interference source user according to user scheduling information of other base stations on the time-frequency resource block;
- Each base station in the set of base stations participating in the cooperation will interfere with the channel information of the source user to itself.
- H does singular value decomposition or eigen-decomposes ( H ) HH or E (( H ) H ) to obtain a right singular matrix or eigenvector matrix V; extracts the first n- column vector of V, generates interference information and sends it to the user of the interference source.
- Base station k at this time, the equivalent interference information described in the step 103 is H1
- the step 102 can be specifically as follows:
- Each base station in the set of base stations participating in the cooperation is based on the time base resource blocks of other base stations User scheduling information, obtaining information of the user who interferes with the source;
- Each base station in the set of base stations participating in the cooperation will interfere with the channel information of the source user to itself.
- H is quantized into the codeword ⁇ ⁇ in the codebook set, and the corresponding index is obtained according to the codeword ⁇ ⁇
- the index PMI is transmitted to the base station k to which the interference source user belongs by connecting to the backbone network of the base station or the network backbone or a dedicated interface between the base stations;
- the step 102 can be specifically as follows:
- Each of the base stations participating in the coordinated base station obtains information of the interference source user according to user scheduling information of other base stations on the time-frequency resource block;
- Each base station in the set of base stations participating in the cooperation transmits the channel information H of the interference source user to itself to the base station k to which the interference source user belongs by connecting the backbone network of the base station or the network backbone or the dedicated interface between the base stations;
- the equivalent information described in the step 103 is ⁇ j l jm
- the step 104 described in combination with the above three cases may be specifically as follows:
- the step 104 may also be specifically:
- the base station k obtains the maximum gain transmission information by using the channel information of the served user to itself.
- PI MRT arg max ( W MRT)
- W PMI MRT PI MRT arg max W PMI MRT j WMRT Plate 1 .
- PMI ' MK1 ", or a 1 ° PMI base station k uses the H I and the WMRT to obtain minimized interference transmission information
- (W ZF ) H Wp Ml7F , ⁇ argmax (w PM I 7F ) H W ZF
- the step 105 is specifically: the user served by the base station k according to the received pmi MRT and
- the step 104 may also be specifically:
- the base station k obtains the maximum gain transmission information by using the channel information of the served user to itself.
- the MRT base station k uses the H I and the WMRT to obtain minimized interference transmission information.
- the PMI base station k forwards the index PMI W to the served user through the downlink control channel; wherein, ⁇ , - ⁇ - ⁇ , indicating standard orthogonalization of input parameters
- the step 102 may also be specifically:
- Each of the base stations participating in the coordinated base station obtains information of the interference source user according to user scheduling information of other base stations on the time-frequency resource block;
- Each base station in the set of base stations participating in the cooperation will interfere with the channel information of the source user to itself.
- H is quantized into the codeword w M i in the codebook set w, and the corresponding index is obtained according to the codeword w
- the equivalent information in the step 103 is 1 PMIj! PMI, where n is determined by the base station according to the decomposition of the channel information H, and m represents the set of users scheduled by the base station j on the same time-frequency resource block, ⁇ " ⁇ 1 ,..., N.
- the step 104 may be specifically: The base station k obtains the maximum gain transmission information by using the channel information of the served user to itself.
- the MRT base station k uses the H I and the W MRT to obtain minimized interference transmission information.
- Base station k obtains optimal precoding information of the served user +(1 ⁇ W ZF ), and sent to the served user through the downlink control channel; wherein, n H , ° rth (') means standard orthogonalization of the input parameters,
- the step 104 may also be specifically:
- the base station k obtains the maximum gain transmission information T by using the channel information of the served user to itself, and quantizes it into the codeword W PM1MRT in the codebook set, and obtains the corresponding codeword W PM1MRT.
- the base station k transmits the PMI MRT and the PMI ZF to the served user through the downlink control channel; wherein, ⁇ , O
- step 105 is specifically:
- the serving user of the base station k obtains the codeword W PMI MRT indexed as PMIMRT and the codeword W PMI ZF indexed as PMIZF according to the received PMI MRT and PMI ZF , and obtains an optimal pre-condition for adjusting the transmitted signal by the following formula.
- Coded information: W orth( W PMLMRT +(1 ⁇ )WPMI ZF ) where represents the standard orthogonalization operation on the input parameters, ⁇ 0 , 1 ].
- the step 104 may also be specifically:
- the base station k obtains the maximum gain transmission information by using the channel information of the served user to itself.
- the W PMI base station k delivers the PMI W to the served user through the downlink control channel; , indicating that the input parameters are subjected to standard orthogonalization operations.
- FIG. 2 is a structural diagram of a data transmission system of a multiple input multiple output MIMO system according to the present invention. As shown in FIG. 2, the system includes: an information interaction unit, an interference information calculation and transmission unit, an equivalent interference information generation unit, and the most An excellent precoding information generating and transmitting unit, and an adjusting unit; wherein
- An information interaction unit configured to exchange user scheduling information of a base station in a set of participating base stations on a time-frequency resource block through a dedicated interface between a network backbone or a backbone network or a base station to obtain all phases on each time-frequency resource block.
- User scheduling information of the neighboring base station
- the interference information calculation and sending unit is configured to obtain interference source user information according to user scheduling information on the time-frequency resource block, and obtain interference information by using the measured interference source user to its own channel information, and send the interference information to the base station to which the interference source user belongs.
- the interference information may be the channel information H of the interference source user to the base station itself, or may be the channel information H of the interference source user to the base station itself.
- the index corresponding to the codeword is ° ⁇ ' ⁇ 1 " , or
- the PMI may also be the interference information formed by the right singular matrix obtained by decomposing the channel information H or the first n columns of the characteristic vector matrix, or may be the signal of the interference source user to the base station itself.
- the code ⁇ is indexed by the PMI or
- the equivalent interference information generating unit is configured to receive interference information sent by other base stations in the set of coordinated base stations, and form equivalent interference information according to the interference information;
- An optimal precoding information generating and transmitting unit configured to use the equivalent interference information and the channel information of the user served by the base station to obtain the information about the precoding on the time-frequency resource block, and send the information to the adjusting unit;
- an adjusting unit configured to receive information about precoding, obtain optimal precoding information, and adjust the sending signal by using the optimal precoding information.
- Each base station in the set of participating base stations uses the information interaction unit to obtain user scheduling information of each base station on each resource block from a dedicated interface between the network backbone or the backbone network or the base station, and sends the user scheduling information Into the interference information calculation and transmission unit, the interference information calculation and transmission unit obtains the interference source user information on each time-frequency resource block according to the user scheduling information, and according to the measured interference source user to its own channel information.
- the equivalent interference information generating unit of the base station to which the user of the interference source belongs receives interference information transmitted from all neighboring cooperative base stations, finally forms equivalent interference information, and sends the equivalent interference information to the connected optimal precoding information generating and transmitting unit.
- the optimal precoding information generating and transmitting unit generates the information about the precoding on the time-frequency resource block by using the equivalent interference information and the channel information of the user served by the base station to itself, and sends the information to the user of the interference source.
- the unit, the adjustment unit of the interference source user obtains the optimal precoding information by using the information about the precoding to adjust the transmission signal.
- FIG. 3 is a network diagram of a data transmission system of a multiple input multiple output MIMO system according to an embodiment of the present invention, as shown in FIG. 3:
- the three neighboring base stations BS1, BS2, and BS3 in the set of participating base stations perform cooperative transmission of data.
- the base stations BS1, BS2, and BS3 respectively schedule users MS1, MS2, and MS3, and pass through the backbone network or
- the dedicated interface between the network backbone or the base station interacts with the user scheduling information, so that the BS1 obtains the interference source users MS2 and MS3 that interfere with the local cell, and the BS2 obtains the interference source users MS1 and MS3 that interfere with the local cell, and the BS3 obtains interference to form interference to the local cell.
- each cooperative base station serves only one user, but the present invention is equally applicable to a plurality of cooperative base stations, and each cooperative base station simultaneously serves a plurality of users.
- Embodiment 1 is a diagrammatic representation of Embodiment 1:
- the base stations BS1, BS2, and BS3 respectively schedule users MS1, MS2, and MS3, and respectively exchange user scheduling information with the number of user-sent data streams through a dedicated interface between the network backbone or the backbone network or the base station, so that the base station BS1 knows that the user MS1 will Will interfere with the user MS2 and the user MS3, the base station BS2 knows that the user MS2 will interfere with the user MS1 and the user MS3, the base station BS3 knows that the user MS3 will interfere with the user MS1 and the user MS2;
- the base station BS1 measures three user MS1, MS2, MS3 to its own channel information ⁇ , ⁇ , ⁇ 3 through the uplink pilot, and the base station BS2 measures three users MSI, MS2, MS3 through the uplink pilot.
- the base station BS1 pairs H i 2 , H i 3 performing eigen decomposition or singular value decomposition separately to obtain a feature vector matrix or a right singular matrix, and constructing interference information and V l 3 of part or all columns of the eigenvector matrix or the right singular matrix through the network backbone or the backbone network
- the dedicated interface between the base stations is respectively transmitted to the base station BS2 and the base station BS3; the base station BS2 performs eigen decomposition or singular value decomposition on i and 3
- V is transmitted to the base station BS1 and the base station BS2 through a dedicated interface between the network backbone or the backbone network or the base station.
- the base station BS1 forms the equivalent interference information " n T 21 ' 31 " according to the received interference information 1 and 1 corresponding to the user MS1;
- the base station BS1 obtains the maximum gain transmission information WMRT according to the channel information of the user MS1 to the base station BS1, and quantizes the WMRT into the codeword WPMi MRT in the preset codebook set.
- W PMlMRT corresponds to the index M RT g pMI PMI MRT
- the base station BS1 performs feature decomposition or singular value decomposition on the channel information of the user MSI to the base station BS1, and calculates the minimized interference transmission information according to the obtained n-column formation vector vi of the feature vector matrix or the right singular matrix.
- the base station BS1 quantizes the minimized interference transmission information WZF into a codeword WPMI ZF in a preset codebook set, and obtains an index corresponding to the codeword WPMIZF. ,or,
- the base station BS1 transmits the index pmi MRT and the PMi ZF to the user MSI through the downlink control channel; the user MSI obtains the codeword W PM1MRT indexed as PMI MRT and the codeword WPM F indexed as PMI ZF according to the received PMI MRT and PMI ZF . And obtain the optimal precoding information for adjusting the transmitted signal by the following formula:
- W orth ⁇ W PMLMRT +(1 ⁇ )WPMI ZF ) where represents the standard orthogonalization operation on the input parameters, ⁇ is a real number, ⁇ [. ,1].
- the base station BS2 and the base station BS3 perform operations similar to those of the base station BS1 to complete the corresponding transmission.
- Embodiment 2 is a diagrammatic representation of Embodiment 1:
- the base stations BS1, BS2, and BS3 respectively schedule users MS1, MS2, and MS3, and respectively exchange user scheduling information with the number of user-transmitted data streams through a dedicated interface between the network backbone or the backbone network or the base station, so that the base station BS1 knows that the user MS1 will Will interfere with the user MS2 and the user MS3, the base station BS2 knows that the user MS2 will interfere with the user MS1 and the user MS3, the base station BS3 knows that the user MS3 will interfere with the user MS1 and the user MS2;
- the base station BS1 measures the channel information ⁇ , ⁇ , ⁇ 3 of the three users MS1, MS2, and MS3 through the uplink pilot
- the base station BS2 measures the channel information H2 of the three users MSI, MS2, and MS3 through the uplink pilot.
- the base station BS3 measures the channel information H 3i' H 32, H 33 of the three users MS1, MS2, MS3 to itself through the uplink pilot;
- the base station BS1 performs eigen decomposition or singular value decomposition on H i2 and H i3 respectively, and quantizes 2 and 3 into the code w W preset by the system according to the eigenvalue or singular value distribution obtained after the decomposition.
- the codewords PMI 12 and PMI 1 3 in this set are dedicated through the network backbone or backbone network or base station.
- w W PML arg max (Hi 9 ) W ⁇ , , ⁇ interface index 12 corresponding to codeword W PMI 12 and W PMI 13 ⁇ ⁇ 12 or P MI 13
- the base station BS2 performs eigen decomposition or singular value decomposition on i and 3 respectively, and according to the eigenvalue or singular value distribution obtained after the decomposition, w w
- or 23 PMI 23 H 23 are respectively transmitted to base station BS1 and base station BS3; base station BS3 pairs, " 32 respectively perform feature decomposition or singular value decomposition, and according to the eigenvalue or singular value distribution obtained after decomposition, with
- the base station BS1 forms the equivalent interference information H1 L WpMl2 i WpMI 3iJ according to the received interference information PM12 i and PM13 i corresponding to the user MS1, where
- the WpM i represents an index ⁇ 1 ⁇ 2 ⁇ in the codebook set
- the codeword, the WpMI "represents the codeword corresponding to the index PMI 31 in the codebook set;
- the base station BS1 obtains the maximum gain transmission information WMRT according to the channel information Hi i of the user MS1 to the base station BS1, and quantizes it into the codeword WPMI MRT in the codebook set preset by the system, and obtains an index corresponding to the codeword WPM Imrt . or,
- the base station BS1 performs eigen decomposition or singular value decomposition on the channel information HII of the user MSI to the base station BS1, and calculates a minimum interference according to the obtained eigenvector matrix or the first n columns of the right singular matrix forming a matrix or a vector vi Transmitting information Wz ⁇ mX; wherein n is determined by the base station according to the decomposition of the channel information H Computer, indicating the number of data streams transmitted by the user MS1; Since in this embodiment, one base station only serves on a time-frequency resource block.
- the base station BS1 quantizes the minimized interference transmission information into the codeword WPMI ZF in the codebook set, and
- the base station BS1 transmits the index pmi MRT and PMIZF to the user MS1 through the downlink control channel; the user MS1 obtains the codeword W PMLMRT indexed as PMI MRT and the codeword WPMI ZF indexed as PMI ZF according to the received PMI MRT and PMIZF, and
- the optimal precoding information for adjusting the transmitted signal is obtained by the following formula: Where ° rth O represents the standard orthogonalization operation on the input parameters, ⁇ is a real number, ⁇ [. ,1].
- the base station BS2 and the base station BS3 perform operations similar to those of the base station BS1 to complete the corresponding transmission.
- Embodiment 3 Embodiment 3:
- the base stations BS1, BS2, and BS3 respectively schedule users MS1, MS2, and MS3, and respectively exchange user scheduling information with the number of user-transmitted data streams through a dedicated interface between the network backbone or the backbone network or the base station, so that the base station BS1 knows that the user MS1 will Will interfere with the user MS2 and the user MS3, the base station BS2 knows that the user MS2 will interfere with the user MS1 and the user MS3, the base station BS3 knows that the user MS3 will interfere with the user MS1 and the user MS2;
- the base station BS2 performs feature decomposition or singular value decomposition on H 2i and 3 respectively, and quantizes the sum 3 into a code in the codebook set according to the eigenvalue or singular value distribution obtained after the decomposition.
- Word w W
- PMI II ⁇ Mi 23 PMI are transmitted to base station BS1 and base station BS3, respectively;
- the base station BS3 performs feature decomposition or singular value decomposition on i and 2 , respectively, and quantizes i and 2 into codewords ww in the codebook set according to the eigenvalue or singular value distribution obtained after the decomposition.
- the WpMl2 i represents a codeword corresponding to the index PM1 2 i in the codebook set
- the PM l represents a codeword corresponding to the index PM1 l l in the codebook set;
- the base station BS1 obtains the maximum gain transmission information WMRT according to the channel information Hii of the user MS1 to the base station BS1, and quantizes it into the codeword WPMI MRT in the codebook set, and obtains the codeword WPMI MRT pair.
- H - should be indexed.
- MRT ⁇ (Hll ⁇ WPMlMRTl PMI
- MRT ⁇ (WPMIMRT factory H ll base station BS1 performs feature decomposition or singular value decomposition on channel information HII of user MS1 to base station BS1, and obtains according to The eigenvector matrix or the first n columns of the right singular matrix form a matrix or vector vi to calculate the minimized interference transmission information Wz ⁇ nHRT; wherein ⁇ is determined by the base station according to the decomposition of the channel information HII, indicating the number of data streams transmitted by the user MS1;
- ⁇ , ⁇ ⁇ ⁇ ( ⁇ ⁇ ⁇ ⁇ ) ⁇ ⁇ 1 - the base station BSl to minimize interference information transmission system WZF preset quantization codebook set codeword WPMI ZF, and to obtain a corresponding codeword index WPMI ZF , or
- ⁇ is a real number, ⁇ [. ,1].
- the base station BS2 and the base station BS3 perform operations similar to those of the base station BS1 to complete the corresponding transmission.
- Embodiment 4 is a diagrammatic representation of Embodiment 4:
- the base stations BS1, BS2, and BS3 respectively schedule users MS1, MS2, and MS3, and respectively exchange user scheduling information with the number of user-transmitted data streams through a dedicated interface between the network backbone or the backbone network or the base station, so that the base station BS1 knows that the user MS1 will Will interfere with the user MS2 and the user MS3, the base station BS2 knows that the user MS2 will interfere with the user MS1 and the user MS3, the base station BS3 knows that the user MS3 will interfere with the user MS1 and the user MS2;
- the base station BS1 measures three user MSI, MS2, MS3 to its own channel information Hii' H i 2 'Hi 3 through the uplink pilot, and the base station BS2 measures the three channels MSI, MS2, MS3 to its own channel information H2 through the uplink pilot.
- the base station BS3 measures three user MS1, MS2, MS3 to its own channel information 1'2' 3 by using the uplink pilot; the base station BS1 performs eigen decomposition or singular value decomposition on H i2 and H i3 respectively, and 2 and 3 are quantized into code words w W in the codebook set according to the eigenvalue or singular value distribution obtained after the decomposition
- the base station BS3 performs feature decomposition or singular value decomposition on H 3i and H 32 respectively, and quantizes the sum H32 into a codebook set according to the eigenvalue or singular value distribution obtained after the decomposition.
- Code word ww
- Hll L WpMl2 i WpMI 3i
- PMi corresponding to the user MS1.
- J wherein the ⁇ ⁇ represents codebook set index corresponding to a codeword ⁇ 1 ⁇ 2 ⁇ , the "PMl31 codebook set index indicates PMi 31 corresponding to the codeword;
- the base station BS1 obtains a maximum gain based on the channel information HI I of the user MS1 to the base station BS1.
- Rtl ⁇ WMRT+ ⁇ ) WzF ) where ° rth O represents the standard orthogonalization operation on the input parameters, which is a real number, and 0 ⁇ ⁇ 1;
- the base station BS1 quantizes w into the codeword PMI w in the codebook set and corresponds to the codeword PMI w
- the index W g PMl" 1 PM1 ⁇ 2 II or W g PMli PMIw il is transmitted to the user MSI through the downlink control channel;
- the MSI After obtaining the index PMI w, the MSI extracts the codeword WpM1 ⁇ 2 corresponding to the PMI w in the codebook set.
- the optimal precoding information PMI w is obtained, and then the transmission data s is precoded to obtain ws; wherein, the W PMI is the code word corresponding to the index PMIw.
- the base station BS2 and the base station BS3 perform operations similar to those of the base station BS1 to complete the corresponding transmission.
- Embodiment 5 is a diagrammatic representation of Embodiment 5:
- the base stations BS1, BS2, and BS3 respectively schedule the user MS1.
- the MS2 and the MS3 interact with each other through a dedicated interface between the network backbone or the backbone network or the base station, and the base station BS1 learns that the user MS1 will interfere with the user MS2 and the user MS3, and the base station BS2 Knowing that the user MS2 will dry the user MS1 and the user MS3, the base station BS3 knows that the user MS3 will interfere with the user MS1 and the user MS2;
- the base station BS1 measures three user MSI, MS2, MS3 to its own channel information Hii' H i 2 'Hi 3 through the uplink pilot, and the base station BS2 measures the three channels MSI, MS2, MS3 to its own channel information H2 through the uplink pilot.
- the base station BS3 measures the channel information 1'2' 3 of the three users MS1, MS2, MS3 to itself through the uplink pilot;
- the base station BS1 respectively transmits H i2 and H i3 to the base station BS2 and the base station BS3 through a dedicated interface between the backbone network or the network backbone or the base station;
- the base station BS2 respectively passes the H 2i, 3 through the dedicated interface between the backbone network or the network backbone or the base station. Transmitting to base station BS1 and base station BS3;
- the base station BS3 transmits ⁇ and H32 respectively to the base station BS1 and the base station BS2 through a dedicated interface between the backbone network or the network backbone or the base station;
- the base station BS1 forms equivalent interference information according to the received interference information H 21 and H 31 corresponding to the user MS1: ⁇ [HH 3 i] ;
- the channel information H ii of the MS1 to the base station is obtained to obtain the maximum gain transmission information WMRT, and the codeword for maximizing the gain transmission information is found in the preset codebook set of the system.
- the base station BS1 quantizes the minimized interference transmission information WZF into a preset codebook set of the system.
- the index corresponding to the codeword WPMIZF is ZF PMl PMIZF , or,
- W PMlMRT represents the codeword indexed as PMI MRT in the preset codebook
- WPMI ZF represents the preset codebook
- the codeword with the index PMIZF is a real number and 0 ⁇ ⁇ 1.
- the base station BS2 and the base station BS3 perform similar operations as the base station BS1 to complete the corresponding transmission.
- BS1, BS2, and BS3 respectively schedule users MS1, MS2, and MS3, and base stations BS1, BS2, and BS3 transmit the scheduling information and the number of data streams sent by the user through a dedicated interface between the backbone network or the network backbone or the base station. Interact, so that BS1 knows that MS1 will interfere with MS2 and MS3, BS2 knows that MS2 will interfere with MS1 and MS3, and BS3 knows that MS3 will interfere with users MS1 and MS2.
- BS1 performs eigenvalue or singular value decomposition on H i 2 and H i 3 respectively, and BS1 quantizes H i 2 and H i 3 into a preset codebook set according to the eigenvalue or singular value distribution of the sum.
- w W PMI 1 are max (Hi 7) W,., original codewords W PMI 12 and W PMI 13 , and get the corresponding index 12 8 ⁇ ⁇ 12 or
- the base station BS1 transmits the index PMI i 2 and PMI i 3 to the base station BS2 and the base station BS3 respectively through the backbone network or the network backbone or the dedicated interface between the base stations;
- BS2 respectively eigenvalue or singular value decomposition according ⁇ and 3, and BS2 according ⁇ 3 eigenvalues or singular values of the distribution of the quantized ⁇ 3 and the system preset codebook set Codewords W PMI 21 and PM, and to the corresponding index 21
- the base station BS2 respectively transmits the indexes PM12 i and PM123 to the base station BS1 and the base station BS3 through a dedicated interface between the backbone network or the network backbone or the base station;
- BS3 and 2 respectively according ⁇ singular value decomposition or eigenvalue, or singular value BS3 value according to the distribution characteristics ⁇ and 2, 2 and the quantization system ⁇ preset codebook set
- the base station BS2 transmits the indexes PM i and PM132 to the base station BS1 and the base station BS3 through a dedicated interface between the backbone network or the network backbone or the base station;
- the base station BS1 forms the equivalent interference information H according to the received interference information PMi, and PMi corresponding to the user MS1.
- the base station BS1 calculates the minimized interference transmission information by using the equivalent interference information "il and WMRT" WMKT; wherein, n is determined by the base station according to the decomposition of the channel information HII, indicating the user The number of data streams transmitted by the MSI;
- Rth( W MRT + (l- )W ZF ) where
- the WPMI MRT indicates a codeword whose index is PMIMRT in a preset codebook
- W PMI ZF indicates a codeword whose index is PMIZF in a preset codebook
- ⁇ is a real number
- the base station BS1 quantizes w into the codeword WpMI w in the preset codebook set of the system, and will
- the index W PMI f PM1 ⁇ 2I1 or W g PMl i PMIw il should be indexed to the user MS1 via the downlink control channel.
- the MSI After obtaining the index PMI w, the MSI extracts the codeword W PMI W corresponding to the PMI w in the codebook set.
- W W, obtain the optimal precoding information PMI w , and then precode the transmitted data s to obtain ws;
- PMI w is a codeword corresponding to the index PMI W.
- BS2 and BS3 perform similar operations to complete the corresponding transmission.
- the present invention provides a multi-base station information interaction mechanism and a data pre-coding mechanism, so that the participating base stations can suppress most interferences by simply performing simple information interaction, thereby improving the transmission quality of the uplink data.
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
本发明公开了一种多输入多输出MIMO系统的数据发送方法和系统,方法包括:每个基站根据交互的用户调度信息,获得干扰源用户信息,并通过测量被干扰用户的信道信息得到干扰信息,发送给干扰源用户所属的基站;干扰源用户所属的基站根据接收的干扰信息,形成等效干扰信息,并利用等效干扰信息和所服务用户到自己的信道信息,得到时频资源块上的关于预编码的信息,并发送给被干扰用户;被干扰用户接收关于预编码的信息,得到最优预编码信息,并使用所述最优预编码信息调节发送信号。本发明通过信息交互机制和数据预编码机制,使基站间只需简单的信息交互,就可以抑制大部分干扰,从而提高上行数据的传输质量。
Description
一种多输入多输出 MIMO系统的数据发送方法和系统 技术领域
本发明涉及通信领域, 特别涉及一种多输入多输出 ( MIMO , Multiple-Input Multiple-Output ) 系统数据传输的技术。 背景技术
MIMO技术是无线移动通信领域中智能天线技术的一个重大突破, 该 技术不仅可以在不增加带宽的情况下成倍地提高通信系统的容量和频谱利 用率, 还可以利用多径来减轻多径衰落, 并能有效地消除信道干扰, 提高 信道的可靠性, 降低误码率, 是新一代移动通信系统釆用的关键技术, 现 已广泛应用于长期演进 ( LTE , Long Term Evolution ) 和全球微波接入 ( WiMAX, World Interoperability for Microwave Access )互操作性等多种无 线宽带系统中。
对于以蜂窝结构布置网络的无线通信系统来说, 相邻小区的同频干扰 是导致通信质量下降的最重要因素之一, 尤其是在上行链路中, 干扰源为 邻小区用户在同时同频资源上发送的数据信号, 因此干扰水平变化较快, 这就给普通的干扰抑制和功率控制算法带来了巨大的挑战和困难, 所以, 在 3G和 4G的无线通信系统中,引入了多小区协作 MIMO技术来对抗这种 同频干扰, 其主要的思想是: 使用 MIMO技术将邻小区的干扰进行零化处 理, 零化处理的前提是每个用户必须知道自身到邻小区的干扰信道, 从而 对数据进行适当的预编码, 达到最大化传输自己的数据的同时最小化对邻 小区的干扰。 因此, 协作基站 MIMO就是相邻多个基站测量下属用户的信 道和干扰用户的信道, 然后将干扰用户的信道信息通过一定的方式通知给 协作基站, 以便协作基站做出避免干扰的处理, 由于用户数量较大, 协作
基站之间的信道信息传递必然导致大量的开销和时延, 如何能够在使用协 作基站 MIMO技术时, 在开销和系统性能上有效合理的折中, 就成为重要 问题。 发明内容
本发明的目的在于提供一种多输入多输出 MIMO系统的数据发送方法 和系统, 能更好地解决上行数据的传输质量问题。
根据本发明的一个方面, 提供的一种多输入多输出 MIMO系统的数据 发送方法包括:
步骤 A: 参与协作的基站集合中的每个基站通过网络骨干或骨干网或 基站之间的专用接口交互时频资源块上的用户调度信息;
步骤 B: 参与协作的基站集合中的每个基站根据时频资源块上的用户 调度信息, 获得干扰源用户信息, 并通过测量干扰源用户到自身之间的信 道信息得到干扰信息, 发送给干扰源用户所属的基站;
步骤 C: 每个基站接收协作基站集合中的其它基站发送的干扰信息, 并根据干扰信息, 形成等效干扰信息;
步骤 D: 每个基站利用等效干扰信息和所服务用户到自身的信道信息, 得到时频资源块上的关于预编码的信息, 并发送给自身所服务的用户; 步骤 E: 用户根据接收的关于预编码的信息, 得到最优预编码信息, 并 利用所述最优预编码信息调节发送信号。
根据本发明的另一个方面, 提供的一种多输入多输出 MIMO系统的数 据发送系统包括: 信息交互单元、 干扰信息计算和发送单元、 等效干扰信 息生成单元、 最优预编码信息生成和发送单元、 以及调节单元; 其中, 信息交互单元, 用于将参与协作的基站集合内的基站在时频资源块上 的用户调度信息通过网络骨干或骨干网或基站直接的专用接口交互;
干扰信息计算和发送单元, 用于根据时频资源块上的用户调度信息,
获得干扰源用户信息, 并通过测量的干扰源用户到自身的信道信息得到干 扰信息, 发送给干扰源用户所属的基站;
等效干扰信息生成单元, 用于接收协作基站集合中的其它基站发送的 干扰信息, 并根据所述干扰信息, 形成等效干扰信息;
最优预编码信息生成和发送单元, 用于利用等效干扰信息和本基站所 服务用户到自身的信道信息, 得到时频资源块上的关于预编码的信息, 并 发送给调节单元;
调节单元, 用于接收所述关于预编码的信息, 得到最优预编码信息, 并利用所述最优预编码信息调节发送信号。
与现有技术相比较, 本发明的有益效果在于: 本发明通过协作基站 的信息交互机制和预编码机制, 使协作基站只需进行简单的信息交互, 就 可以抑制大部分干扰, 从而提高了上行数据的传输质量。 附图说明
图 1是本发明的一种多输入多输出 MIMO系统的数据发送方法流程图; 图 2是本发明的一种多输入多输出 MIMO系统的数据发送系统结构图; 图 3是本发明实施例提供的一种多输入多输出 MIMO系统的数据发送 系统组网图。 具体实施方式
以下结合附图对本发明的优选实施例进行详细说明, 应当理解, 以下 所说明的优选实施例仅用于说明和解释本发明, 并不用于限定本发明。
图 1为本发明的一种 MIMO系统的数据发送方法流程图,如图 1所示, 步骤如下: 步骤 101 : 参与协作的基站集合 Ω = {Β8Ι ' Β82 ' ' " ' Β8Ν}中的每一个基站通过 网络骨干或骨干网或基站之间的专用接口交互时频资源块上的用户调度信
息, 获得在每个时频资源块上所有相邻基站调度的用户集合; 步骤 102:参与协作的基站集合中的每一个基站根据时频资源块上的用 户调度信息, 获得干扰源用户信息, 并通过测量干扰源用户到自身的信道 信息得到干扰信息, 发送给干扰源用户所属的基站;
步骤 103: 每个基站接收协作基站集合中的其它基站发送的干扰信息, 并根据干扰信息, 形成等效干扰信息;
步骤 104: 每个基站利用等效干扰信息和所服务用户到自身的信道信 息, 得到时频资源块上的关于预编码的信息, 并发送给所服务用户;
步骤 105: 所服务用户根据接收的关于预编码的信息,得到最优预编码 信息, 并利用所述最优预编码信息调节发送信号, 之后映射到相应的天线 上发送出去。
所述步骤 102可以具体为:
参与协作的基站集合中的每一个基站根据其它基站在时频资源块上的 用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每一个基站将干扰源用户到自身的信道信息
H做奇异值分解或对 (H)H H或E((H) H)做特征分解,得到右奇异矩阵或特征 向量矩阵 V; 提取 V的前 n列向量, 生成干扰信息 发送给干扰源用户所属的基 站 k; 此时, 所述步骤 103中所述的等效干扰信息为 Hl
其中, n由基站根据信道信息 H的分解决定; m表示在同一时频资源块 上基站 j调度的用户集合, j≠k,j = 1," ', N。
所述步骤 102可以具体为:
参与协作的基站集合中的每一个基站根据其它基站在时频资源块上的
用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每一个基站将干扰源用户到自身的信道信息
H量化成码本集合中的码字 ηΜΐ , 并根据码字 ηΜΐ得到对应的索引
PMI = arg max PMI = arg max WPMl ) HI
PMI 或者, PMI
通过连接基站的骨干网或网络骨干或基站间的专用接口将索引 PMI传 送给干扰源用户所属的基站 k;
PMIj ! PMI 此时, 所述步骤 103中所述的等效干扰信息为 jm 其中, n由基站根据信道信息 H的分解决定, m表示在同一时频资源块 上基站 j调度的用户集合, j≠k,j = 1," ', N。
所述步骤 102可以具体为:
参与协作的基站集合中的每一个基站根据其它基站在时频资源块上的 用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每一个基站通过连接基站的骨干网或网络骨 干或基站间的专用接口将干扰源用户到自身的信道信息 H传送给干扰源用 户所属的基站 k;
H H
此时, 所述步骤 103中所述的等效信息为 ■ j l jm
其中, m 表示在同一时频资源块上基站 j 调度的用户集合, j≠k,j = l,..., N。 结合上述三种情况所述步骤 104可以具体为:
基站 k利用所服务用户到自身的信道信息, 得到最大化增益传输信息 w V V MRT 基站 k 利用所述 Ηι和所述 WMRT , 得到最小化干扰传输信息 w V V ZF = i丄~丄f丄 w V V MRT ·
基站 k获得所服务用户的最优预编码信息 W = °rth( WMRT W ) ,并 通过下行控制信道发送给所服务用户; 其中,
, °rth(')表示对输入参数进行标准正交化操 作, [。,1]。
所述步骤 104还可以具体为:
基站 k利用所服务用户到自身的信道信息, 得到最大化增益传输信息
WMRT , 并量化为码本集合中的码字 WPMIMRT后, 得到码字 WPMIMRT对应的索
P IMRT = arg max (WMRT) WPMIMRT P IMRT = arg max WPMIMRT j WMRT 引 皿1 。PMI ' MK1", 或者, 皿 1 °PMI 基站 k 利用所述 HI和所述 WMRT , 得到最小化干扰传输信息 WZF = Π H.WMRT , 并量化为码本集合中的码字 WPM F后 , 得到码字 WPM F对 . , , P I/F = argmax||(WZF)HWpMl7F , ΡΜΙ = argmax (wPMI7F)HWZF
^的索引 PMI" zt , 或者, zt ΡΜΙΙ / ; 基站 k通过下行控制信道将 PMIMRT和 PMIZF传送给所服务用户; 其中, Il = Ι-Ηι(Η Ηι) H 。
此时, 所述步骤 105具体为: 基站 k所服务用户根据收到的 pmiMRT和
PMIZF , 得到索引为 PMIMRT的码字 WPMIMRT和索引为 PMIZF的码字 WPMIZF , 并通 过以下公式得到用于调节发送信号的最优预编码信息:
其中, °rth(')表示对输入参数进行标准正交化操作, ^0,1]。
所述步骤 104还可以具体为:
基站 k利用所服务用户到自身的信道信息, 得到最大化增益传输信息
MRT 基站 k 利用所述 HI和所述 WMRT , 得到最小化干扰传输信息
MRT 基站 k获得预编码信息 W=。rtl^WMRT+( )WzF), 并将其量化为码本集合中 的码字 . , v» PMI,,, = argmax||(W)HWpMr
"PMIW后, 得到码字" PM½对应的索引 W g P—M—I PMI , 或者,
PMI w arg max WPMIW) W|
此时, 所述步骤 105具体为: 基站 k所服务用户根据收到的 PMIw , 得 到最优预编码信息 W=WPMIW , 并调节发送信号; 所述 WpMIw为索引 PMIw的码 字。
所述步骤 102还可以具体为:
参与协作的基站集合中的每一个基站根据其它基站在时频资源块上的 用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每一个基站将干扰源用户到自身的信道信息
H量化成码本集合 w中的码字 w Mi , 并根据码字 w 得到对应的索引
PMI = arg min PMI = arg min
(H)HWPMI WPMI H
PMI , 或者, PMI
通过连接基站的骨干网或网络骨干或基站之间的专用接口将索引 PMI 传送给干扰源用户所属的基站 k;
H W,
此时, 所述步骤 103中所述的等效信息为 1 PMIj! PMI 其中, n由基站根据信道信息 H的分解决定, m表示同一时频资源块上 基站 j调度的用户集合, ^」^1,…, N。
此时, 所述步骤 104可以具体为:
基站 k利用所服务用户到自身的信道信息, 得到最大化增益传输信息
MRT 基站 k 利用所述 HI和所述 WMRT , 得到最小化干扰传输信息
基站 k获得所服务用户的最优预编码信息
+(1^WZF),并 通过下行控制信道发送给所服务用户; 其中, n
H , °rth(')表示对输入参数进行标准正交化操作,
所述步骤 104还可以具体为:
基站 k利用所服务用户到自身的信道信息, 得到最大化增益传输信息 T, 并量化为码本集合中的码字 WPMlMRT后, 得到码字 WPMlMRT对应的索
PMIMRT = ar x
MK1 8。層 max Ι (WM 1V1R1、T") W .'PwMIiMMRKT P IMRT = arg ma
I 者 MRT ° p^j WPMIMRX ) WMRT 基站 k 利用所述 HI和所述 WMRT , 得到最小化干扰传输信息 = II WMRT, 并量化为码本集合中的码字 WPMIZF后, 得到码字 WPMIZF对 应的索引 PMIzF g ll(WzF)Hw 11, 或者, 層 ZF
此时, 所述步骤 105具体为:
基站 k 所服务用户根据收到的 PMIMRT和 PMIZF , 得到索引为 PMIMRT的码 字 WPMIMRT和索引为 PMIZF的码字 WPMIZF , 并通过以下公式得到用于调节发送 信号的最优预编码信息:
W=orth( WPMLMRT +(1^)WPMIZF ) 其中, 表示对输入参数进行标准正交化操作, ^0,1]。
所述步骤 104还可以具体为:
基站 k利用所服务用户到自身的信道信息, 得到最大化增益传输信息
WMRT; 基站 k 利用所述 Ηι和所述 WMRT , 得到最小化干扰传输信息 w ZF = i丄~丄f Hi w MRT · 基站 k获得预编码信息 W=°RT WMRT+^)WZF) , 并将其量化为码本集合中
W W PMLTr = am max |(w)HwPMIw
的码字 "PMIW后, 得到码字" PM½对应的索引 W pMI ll W |l , 或者,
PMIW = arg max PMIW )HW|
W PMI 基站 k通过下行控制信道将 PMIW专送给所服务用户; , 表示对输入参数进行标准正交化操作,
此时, 所述步骤 105具体为: 基站 k所服务用户根据收到的 PMIw , 得 到最优预编码信息 W=WPMIW , 并调节发送信号; 所述 WpMIw为索引 PMIW的码 字。
图 2为本发明的一种多输入多输出 MIMO系统的数据发送系统结构图, 如图 2所示, 该系统包括: 信息交互单元、 干扰信息计算和发送单元、 等 效干扰信息生成单元、 最优预编码信息生成和发送单元、 以及调节单元; 其中,
信息交互单元, 用于将参与协作的基站集合内的基站在时频资源块上 的用户调度信息通过网络骨干或骨干网或基站间的专用接口交互, 获得在 每个时频资源块上所有相邻基站的用户调度信息;
干扰信息计算和发送单元, 用于根据时频资源块上的用户调度信息, 获得干扰源用户信息, 并通过测量的干扰源用户到自身的信道信息得到干 扰信息, 发送给干扰源用户所属的基站; 所述干扰信息可以是干扰源用户 到基站自身的信道信息 H ,还可以是将干扰源用户到基站自身的信道信息 H
PMI = arg max (H)HW;
量化成码本集合中的码字后, 码字对应的索引 ° ΡΜΙ ' ΡΜ1" , 或者
PMI = arg max WPMl ) HI
PMI , 还可以是分解信道信息 H得到的右奇异矩阵或特征向 量矩阵的前 n列形成的干扰信息, 还可以是将干扰源用户到基站自身的信
, , ― " , PMI = am min
等效干扰信息生成单元, 用于接收协作基站集合中的其它基站发送的 干扰信息, 并根据干扰信息, 形成等效干扰信息;
最优预编码信息生成和发送单元, 用于利用等效干扰信息和本基站所 服务用户到自身的信道信息, 得到时频资源块上的关于预编码的信息, 并 发送给调节单元;
调节单元, 用于接收关于预编码的信息, 得到最优预编码信息, 并利 用所述最优预编码信息调节发送信号。
所述数据发送系统的工作原理如下:
参与协作的基站集合中的每一个基站使用所述信息交互单元从网络骨 干或骨干网或基站间的专用接口获得其它基站在每一个资源块上的用户调 度信息, 并把所述用户调度信息送入所述干扰信息计算和发送单元, 由所 述干扰信息计算和发送单元根据用户调度信息, 得到每一个时频资源块上 的干扰源用户信息, 并根据测量的干扰源用户到自身的信道信息, 得到干 扰信息, 发送到干扰源用户所属基站的等效干扰信息生成单元中; 干扰源
用户所属基站的等效干扰信息生成单元接收来自所有相邻协作基站发送的 干扰信息, 最终形成等效干扰信息, 并将所述等效干扰信息送入相连的最 优预编码信息生成和发送单元; 所述最优预编码信息生成和发送单元利用 等效干扰信息和本基站所服务用户到自身的信道信息, 生成时频资源块上 的关于预编码的信息, 并发送给干扰源用户的调节单元, 由干扰源用户的 调节单元利用关于预编码的信息得到最优预编码信息, 以调节发送信号。
图 3显示了本发明实施例提供的一种多输入多输出 MIMO系统的数据 发送系统组网图, 如图 3所示:
参与协作的基站集合中的三个相邻基站 BS1、 BS2和 BS3进行协作传 输数据, 对于某个时频资源块, 基站 BS1、 BS2和 BS3分别调度用户 MS1、 MS2、 MS3 ,并通过骨干网或网络骨干或基站间的专用接口交互用户调度信 息,使 BS1获得对本小区形成干扰的干扰源用户 MS2和 MS3 , BS2获得对 本小区形成干扰的干扰源用户 MS1和 MS3 , BS3获得对本小区形成干扰的 干扰源用户 MS1和 MS2。
为更详细的说明本发明, 以下具体实施例为每个协作基站只为一个用 户服务的情况, 但本发明同样适用于多个协作基站, 以及每个协作基站同 时为多个用户服务的情况。
实施例一:
基站 BS1、 BS2和 BS3分别调度用户 MS1、 MS2、 MS3 , 并分别通过 网络骨干或骨干网或基站间的专用接口将用户调度信息和用户发送数据流 数目交互,从而使基站 BS1得知用户 MS1将会干扰用户 MS2和用户 MS3 , 基站 BS2得知用户 MS2将会干扰用户 MS1和用户 MS3 , 基站 BS3得知用 户 MS3将会干扰用户 MS1和用户 MS2;
基站 BS1通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道 信息 Ηιι,Η^,ι^3 , 基站 BS2通过上行导频测量三个用户 MSI、 MS2、 MS3到
自身的信道信息 H2i,H22,H23, 基站 BS3 通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道信息 H3 i'H32,H33; 基站 BS1 对 Hi2、 Hi3分别进行特征分解或者奇异值分解, 得到特征向 量矩阵或右奇异矩阵, 并将所述特征向量矩阵或右奇异矩阵的部分或全部 列构成的干扰信息 和 Vl3 , 通过网络骨干或骨干网或基站间的专用接口分 别传输给基站 BS2和基站 BS3 ; 基站 BS2对 i、 3分别进行特征分解或 奇异值分解, 得到特征向量矩阵或右奇异矩阵, 并将所述特征向量矩阵或 右奇异矩阵的部分或者全部列构成的干扰信息 和 V23通过网络骨干或骨 干网或基站间的专用接口传输给基站 BS 1和基站 BS3;基站 BS3对 H3 i、 H32 分别进行特征分解或奇异值分解, 得到特征向量矩阵或右奇异矩阵, 并将 所述特征向量矩阵或右奇异矩阵的部分或者全部列构成的干扰信息 1和
V 通过网络骨干或骨干网或基站间的专用接口传输给基站 BS1 和基站 BS2。
以基站 BS1和基站 BS1所服务用户 MS1为例, 进行如下的处理: 基站 BS1根据收到的用户 MS1对应的干扰信息 1和 1 , 形成等效干 扰信息 "nT21 '31」;
基站 BS1根据用户 MS1到基站 BS1的信道信息 , 获得最大化增益 传输信息 WMRT , 并将 WMRT量化为预先设定的码本集合中的码字 WPMiMRT ,
PMIA IR>T = ar max II H
(Hi i ) WPI HA/TDT II
得到码字 e
WPMlMRT对应的索引 MRT g pMI PMIMRT | , 或者,
PMI IMRT) Hl l 基站 BS1将用户 MSI到基站 BS1的信道信息 进行特征分解或奇异 值分解, 并根据得到的特征向量矩阵或右奇异矩阵的前 n列形成向量 vi 计 算最小化干扰传输信息 ^ρ ΓϋΛ ; 其中, n 由基站根据信道信息 的分
解决定;
由于本实施例中一个基站在一个时频资源 块上只服务一个用户, 因此, V1=WMRT , 即:
PMIZF = argmax|(WpMIZF)HwzF
PMI
基站 BS1将索引 pmiMRT和 PMiZF通过下行控制信道传送给用户 MSI; 用户 MSI根据收到的 PMIMRT和 PMIZF ,得到索引为 PMIMRT的码字 WPMlMRT 和索引为 PMIZF的码字 WPM F , 并通过以下公式得到调节发送信号的最优预 编码信息:
W=orth^WPMLMRT +(1^)WPMIZF ) 其中, 表示对输入参数进行标准正交化操作, λ为实数, Ε [。,1]。 同样的, 基站 BS2和基站 BS3进行与基站 BS1类似的操作, 完成相应 的传输。
实施例二:
基站 BS1、 BS2和 BS3分别调度用户 MS1、 MS2、 MS3, 并分别通过 网络骨干或骨干网或基站间的专用接口将用户调度信息和用户发送数据流 数目交互,从而使基站 BS1得知用户 MS1将会干扰用户 MS2和用户 MS3, 基站 BS2得知用户 MS2将会干扰用户 MS1和用户 MS3, 基站 BS3得知用 户 MS3将会干扰用户 MS1和用户 MS2;
基站 BS1通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道 信息 Ηιι,Η^,ι^3 , 基站 BS2通过上行导频测量三个用户 MSI、 MS2、 MS3到 自身的信道信息 H2i,H22,H23, 基站 BS3 通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道信息 H3i'H32,H33;
基站 BS1 对 Hi2、 Hi3分别进行特征分解或奇异值分解, 并根据分解后 得到的特征值或奇异值分布情况,将 2和 3分别量化为系统预先设定的码 w W
本集合中的码字 PMI12和 PMI13 , 并通过网络骨干或骨干网或基站间的专用
H
w W PML = arg max (Hi 9 ) W^, ,τ 接 口 将码字 WPMI12 和 WPMI13 对应 的 索 引 12 ΡΜΐ ΡΜΙ12 或 PMI13
ΡΜΙ = argmax (H23)HWD..T PMI?, = arg max WPMI
PMI PMI23||或 23 PMI 23 H23 分别传送给基站 BS1和基站 BS3; 基站 BS3对 、 "32分别进行特征分解 或奇异值分解, 并根据分解后得到的特征值或奇异值分布情况, 将 和
w w
量化为码本集合中的码字 PM 1和 PMl32, 并通过网络骨干或骨干网或基站
分别传送给基站 BS1和基站 BS2。
以基站 BS1和基站 BS1所服务用户 MSI为例, 进行如下的处理: 基站 BS1根据收到的用户 MS1对应的干扰信息 PMl2i和 PMl3i ,形成等效 干扰信息 Hl LWpMl2i WpMI3iJ, 其中, 所述 WpM i表示码本集合中索引 ΡΜ½ι对
应的码字, 所述 WpMI"表示码本集合中索引 PMI31对应的码字;
基站 BS1根据用户 MS1到基站 BS1的信道信息 Hi i, 得到最大化增益 传输信息 WMRT , 并量化为系统预先设定的码本集合中的码字 WPMIMRT后,得 到码字 WPMImrt 对应 的 索 引
或者,
ΡΜ τ = argmax w H 基站 BSl将用户 MSI到基站 BSl的信道信息 HII进行特征分解或奇异 值分解, 并根据得到的特征向量矩阵或右奇异矩阵的前 n列形成矩阵或者 向量 vi 计算最小化干扰传输信息 Wz^mX; 其中, n由基站根据信道信 息 H„ 的分解决定 , 表示用 户 MS1 传输的数据流数 目 ;
由于本实施例中一个基站在一个时频资源块上只服
基站 BSl把最小化干扰传输信息 量化为码本集合中码字 WPMIZF,并
II H
得到 码字 WPMIZF 对应 的 索 引 ZF PMI| PMIZF , 或者 ,
PMI7TJ = arg max |(WpMI7F )HWzF
t PMlll、 ' ;
基站 BSl将索引 pmiMRT和 PMIZF通过下行控制信道传送给用户 MS1 ; 用户 MS1根据收到的 PMIMRT和 PMIZF ,得到索引为 PMIMRT的码字 WPMLMRT 和索引为 PMIZF的码字 WPMIZF , 并通过以下公式得到调节发送信号的最优预 编码信息:
其中, °rth O表示对输入参数进行标准正交化操作, λ为实数, Ε [。,1]。 同样的, 基站 BS2和基站 BS3进行与基站 BS1类似的操作, 完成相应 的传输。
实施例三:
基站 BS1、 BS2和 BS3分别调度用户 MS1、 MS2、 MS3, 并分别通过 网络骨干或骨干网或基站间的专用接口将用户调度信息和用户发送数据流 数目交互,从而使基站 BS1得知用户 MS1将会干扰用户 MS2和用户 MS3, 基站 BS2得知用户 MS2将会干扰用户 MS1和用户 MS3, 基站 BS3得知用 户 MS3将会干扰用户 MS1和用户 MS2;
基站 BS1通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道 信息 Hii'Hi2'Hi3 , 基站 BS2通过上行导频测量三个用户 MSI、 MS2、 MS3到 自身的信道信息 H2i'H22'H23, 基站 BS3 通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道信息 H3i'H32,H33; 基站 BS1 对 Hi2、 Hi3分别进行特征分解或奇异值分解, 并根据分解后 得到的特征值或奇异值分布情况,将 2和 量化为系统预先设定的码本集 w W
分别传送给基站 BS2和基站 BS3; 基站 BS2对 H2i、 3分别进行特征分解或奇异值分解, 并根据分解后 得到的特征值或奇异值分布情况, 将 和 3量化为码本集合中的码字 w W
PMI21和 ΡΜΐ23 , 并通过网络骨干或骨干网或基站间的专用接口将码字
W , PMI 1 = arg min 、H
WPMI21 和 PMI23 对 应 的 索 引 21 MI (H21) WPMl2】
PMI?1 = arg min 23)HW PMI?, = arg min WpMl23)HH23
WPMI •gmin (H
1 PMI 21 H21
PMI II ^Mi23 PMI 分别传送给基站 BS1和基站 BS3;
基站 BS3对 i、 2分别进行特征分解或奇异值分解, 并根据分解后 得到的特征值或奇异值分布情况, 将 ι和 2量化为码本集合中的码字 w w
ΡΜ ι和 PMl32 , 并通过网络骨干或骨干网或基站间的专用接口将码字 WPMI3! 和 WPML32 对 应 的 索 引 PMI3 arg (H31)HWPML3』 或
= WPMI32J «32 分别传送给基站 BSl和基站 BS2;
以基站 BSl和基站 BSl所服务的用户 MSI为例, 进行如下的处理: 基站 BS1根据收到的用户 MS1对应的干扰信息 PMl2i和 PMl3i ,形成等效 干扰信息 Hll=[WpMl21 WpMI3i] , 其中, 所述 WpMl2i表示码本集合中索引 PMl2i对 应的码字, 所述 PM l表示码本集合中索引 PMl3l对应的码字;
基站 BS1根据用户 MS1到基站 BS1的信道信息 Hii, 得到最大化增益 传输信息 WMRT ,并量化为码本集合中的码字 WPMIMRT后,得到码字 WPMIMRT对
、H— 应的索引. MRT = ^^^(Hll^WPMlMRTl PMI MRT = ^^^(WPMIMRT厂 Hll 基站 BSl将用户 MS1到基站 BS1的信道信息 HII进行特征分解或奇异 值分解, 并根据得到的特征向量矩阵或右奇异矩阵的前 n列形成矩阵或者 向量 vi 计算最小化干扰传输信息 Wz^nHRT; 其中, η由基站根据信道 信息 HII 的分解决定, 表示用 户 MS1 传输的数据流数目 ;
PMI^p arg max (WPMIZF) WZF
基站 BS1将索引 pmiMRT和 PMIZF通过下行控制信道传送给用户 MS1; 用户 MS1根据收到的 PMIMRT和 PMIZF ,得到索引为 PMIMRT的码字 WPMLMRT 和索引为 PMIZF的码字 WPMIZF , 并通过以下公式得到调节发送信号的最优预 编码信息:
其中, °rthO表示对输入参数进行标准正交化操作, λ为实数, Ε [。,1]。 同样的, 基站 BS2和基站 BS3进行与基站 BS1类似的操作, 完成相应 的传输。
实施例四:
基站 BS1、 BS2和 BS3分别调度用户 MS1、 MS2、 MS3, 并分别通过 网络骨干或骨干网或基站间的专用接口将用户调度信息和用户发送数据流 数目交互,从而使基站 BS1得知用户 MS1将会干扰用户 MS2和用户 MS3, 基站 BS2得知用户 MS2将会干扰用户 MS1和用户 MS3, 基站 BS3得知用 户 MS3将会干扰用户 MS1和用户 MS2;
基站 BS1通过上行导频测量三个用户 MSI、 MS2、 MS3到自身的信道 信息 Hii'Hi2'Hi3 , 基站 BS2通过上行导频测量三个用户 MSI、 MS2、 MS3到 自身的信道信息 H2i'H22'H23, 基站 BS3 通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道信息 1' 2' 3; 基站 BS1 对 Hi2、 Hi3分别进行特征分解或奇异值分解, 并根据分解后 得到的特征值或奇异值分布情况, 将 2和 3量化为码本集合中的码字 w W
PMI12和 ΡΜ 3 , 并通过网络骨干或骨干网或基站间的专用接口将码字 wPMI12 和 wPMIi3 对 应 的 索 引 pMi 12= "dh2)HwPMi12| 或
PML Ί = arg min ML ~ = arg min
W PMIl2)HHl2 PML » = arg min P
WPMI
1 PMI 13 PMI 13J PMI13||或 13 PMI 13 H13
分别传送给基站 BS2和基站 BS3; 基站 BS2对 H2i、 H23分别进行特征分解或奇异值分解, 并根据分解后 得到的特征值或奇异值分布情况, 将 和 3量化为码本集合中的码字 w W
PMI21和 ΡΜΐ23 , 并通过网络骨干或骨干网或基站间的专用接口将码字
W W„,„ , ΡΜΙ,. = arg min (H2l )11W,
分别传送给基站 BSl和基站 BS3; 基站 BS3对 H3i、 H32分别进行特征分解或奇异值分解, 并根据分解后 得到的特征值或奇异值分布情况, 将 和 H32量化为码本集合中的码字 w w
ΡΜ ι和 PMl32 , 并通过网络骨干或骨干网或基站间的专用接口将码字
分别传送给基站 BSl和基站 BS2;
以基站 BSl和基站 BSl所服务的用户 MSI为例, 进行如下的处理: 基站 BS1根据收到的用户 MS1对应的干扰信息 PMi,,和 PMI,,形成等效 干扰信息 Hll=LWpMl2i WpMI3i J , 其中, 所述 ΡΜ ι表示码本集合中索引 ΡΜ½ι对 应的码字, 所述" PMl31表示码本集合中索引 PMi31对应的码字;
基站 BS1根据用户 MS1到基站 BS1的信道信息 HI I , 得到最大化增益
H
传输信息 WMRT;其中,所述最大化增益传输信息 WMRT可通过 HuHl l l^ lVl l或
H
者 ΗίιΗιι=νιιΛιινιι计算, ir , 则 WMRT^
基站 BS1利用所述等效干扰信息 Hll和 WMRT 计算最小化干扰传输信息 ¾=] ^¾^; 其中, n 由基站根据信道信息 Hl1的分解决定, 表示用户 MS1传输的数据流数目;
基站 BS1利用 和 W ZF计算最优预编码信息 W=。rtl^WMRT+^)WzF) ,其 中, °rthO表示对输入参数进行标准正交化操作, 为实数, 且 0≤ ≤1;
W W
基站 BS1将 w量化为码本集合中的码字 PMIw , 并将码字 PMIw对应的
、H—
PML,, = arg max (W) WD T PML,, = arg max W T W,
索引 W gPMl"1 PM½II或 W gPMli PMIw il通过下行控制信道传送 给用户 MSI;
MSI 在得到索引 PMIw后, 在码本集合中取出 PMIw对应的码字 WpM½ ,
W = W
得到最优预编码信息 PMIw, 然后对待传输数据 s进行预编码得到 ws; 其中, WPMI为索引 PMIw对应的码字。 同样的, 基站 BS2和基站 BS3进行与基站 BS1类似的操作, 完成相应 的传输。
实施例五:
对于某个待调度资源块, 基站 BS1、 BS2和 BS3分别调度用户 MS1、
MS2、 MS3,并分别通过网络骨干或骨干网或基站间的专用接口将用户调度 信息和用户发送数据流数目交互,从而使基站 BS1得知用户 MS1将会干扰 用户 MS2和用户 MS3 ,基站 BS2得知用户 MS2将会干 ·ί尤用户 MS1和用户 MS3, 基站 BS3得知用户 MS3将会干扰用户 MS1和用户 MS2;
基站 BS1通过上行导频测量三个用户 MSI、 MS2、 MS3到自身的信道 信息 Hii'Hi2'Hi3 , 基站 BS2通过上行导频测量三个用户 MSI、 MS2、 MS3到 自身的信道信息 H2i'H22'H23, 基站 BS3 通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道信息 1' 2' 3;
基站 BSl 将 Hi2、 Hi3通过骨干网或网络骨干或基站间的专用接口分别 传输给基站 BS2和基站 BS3; 基站 BS2将 H2i、 3通过骨干网或网络骨千或基站间的专用接口分别 传输给基站 BS1和基站 BS3;
基站 BS3将 ι、 H32通过骨干网或网络骨千或基站间的专用接口分别 传输给基站 BS1和基站 BS2;
对于基站 BS1和基站 BS1所服务用户 MS1, 进行如下的处理: 基站 BS1根据收到的用户 MS1对应的干扰信息 H21和 H31形成等效千扰 信息: ^[H H3i] ; 基站 BS1利用 MS1到本基站的信道信息 Hii, 得到最大化增益传输信 息 WMRT, 并在系统预先设定的码本集合中找到最大化增益传输信息的码字
WPMIMRT ,得到码字 WPMiMRT对应的索引
(Hu) WPM t , 或者, PMI IRT =argmax (WPM½rt HL 基站 BSl将 Hii进行奇异值分解, 并取分解出的去右奇异向量的前 n列 形成矩阵或者向量 vi , 利用 Vl得到
其中, n 由基站根据信 道信息 HII的分解决定, 表示用户 MS1 传输的数据流数目 ; = Ι-ΗΠ (Η1 Η 1Η11) 。 基站 BSl 将最小化千扰传输信息 WZF量化为系统预先设定的码本集合
II H
中的码字 WPMIZF ,码字 WPMIZF对应的索引为 ZF PMl PMIZF ,或者,
PMIZF = arg max |(Wp IZF )H WZF
PMI
基站 BSl将索引 pmiMRT和 PMiZF利用下行控制信道传输给用户 MS1。 用户 MS1在得到索引 PMIMRT和 PMIZF以后, 利用系统预先设定的公式计
算最优预编码信息: W=°rt WPMIMRT +^)WPMIzF) , 其中, WPMlMRT表示预先设 定的码本中索引为 PMIMRT的码字, WPMIZF表示预先设定的码本中索引为 PMIZF 的码字, 为实数, 且 0≤ ≤1。
同样的, 基站 BS2和基站 BS3进行与基站 BS1类似的操作, 完成相应的传 输。
实施例六:
对于某个待调度资源块, BS1、 BS2和 BS3分别调度用户 MS1、 MS2、 MS3, 基站 BS1、 BS2和 BS3通过骨干网或网络骨干或基站间的专用接口 将该调度信息和用户发送数据流数目交互, 从而 BS1 得知 MS1 将会干扰 MS2和 MS3, BS2得知 MS2将会干扰 MS1和 MS3, BS3得知 MS3将会干 扰用户 MS1和 MS2。
基站 BS1通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道 信息 Hii'Hi2'Hi3 , 基站 BS2通过上行导频测量三个用户 MSI、 MS2、 MS3到 自身的信道信息 H2i'H22'H23, 基站 BS3 通过上行导频测量三个用户 MS1、 MS2、 MS3到自身的信道信息 1' 2' 3;
BS1对 Hi2、 Hi3分别进行特征值或者奇异值分解, BS1根据 和 的 特征值或者奇异值分布情况,将 Hi2和 Hi3量化为系统预先设定的码本集合中
H
w W PMI1 = are max (Hi 7) W,.,„ 的码字 WPMI12和 WPMI13 , 并得到对应的索引 12 8ΡΜΐΓ ΡΜΙ12 或
PML ? = arg max ~ = arg max
W PMIl2)HHl2 PML » = arg max PML
1 PMI (Hl3) WPMIl3
13 PMI 或 1 PMI WPMI13 H13 基站 BS1将索引 PMIi2和 PMIi3通过骨干网或网络骨干或基站间的专用接口分 别传输给基站 BS2和基站 BS3;
BS2根据 ι和 3分别进行特征值或者奇异值分解, BS2根据 ι和 3 的特征值或奇异值分布情况,将 ι和 3量化为系统预先设定的码本集合中
的码字 WPMI21和 PM , 并 到对应的索引 21
|或
PMI?~ = arg max WpMl23)HH23
15 PMI ,基站 BS2将索引 PMl2i和 PMl23通过骨干网或网络骨 干或基站间的专用接口分别传输给基站 BS1和基站 BS3;
BS3根据 ι和 2分别进行特征值或者奇异值分解, BS3根据 ι和 2 的特征值或者奇异值分布情况,将 ι和 2量化为系统预先设定的码本集合
PMI~? = arg max WpMl32)HH32
51 PMI ,基站 BS2将索引 PM i和 PMl32通过骨干网或网络骨 干或基站间的专用接口传输给基站 BS1和基站 BS3;
以基站 BS1和基站 BS1所服务的用户 MS1为例, 进行如下的处理: 基站 BS1根据收到的用户 MS1对应的干扰信息 PMi,,和 PMi,形成等效干 扰信息 H
11 W,
PMI2i "ΡΜΙ3ι 其中, wPMT 表示码本系统预先设定的码本集合 中索引为 PMI71对应的码字, Wp PMMTI3,1表示码本系统预先设定的码本集合中索引 为 PMI ,对应的码字 基站 BS1 利用 MS1 到本基站的信道 Ηιι , 计算最大化增益传输信息
Η
基站 BS1利用 WMRT和 WZF计算最优预编码信息 W=。rth( WMRT +(l- )WZF) ,其中
WPMIMRT表示预先设定的码本中索引为 PMIMRT的码字, WPMIZF表示预先设定 的码本中索引为 PMIZF的码字, Λ为实数, 且 0≤ 1≤1。 基站 BS1将 w量化为系统预先设定的码本集合中的码字 WpMIw ,并将对
H
PML,. = arg max (W) Wpi fT PML1 = arg max WpMT W ,
应索引 W PMIf PM½I1或 W g PMl i PMIw il通过下行控制信道输 给用户 MS1。
MSI 在得到索引 PMIw后, 在码本集合中取出 PMIw对应的码字 WPMIW,
W = W , 得到最优预编码信息 PMIw , 然后对待传输数据 s进行预编码得到 ws;
W
其中, PMIw为索引 PMIW对应的码字。 同样的, BS2和 BS3进行类似的操作, 完成相应的传输。
综上所述, 本发明提供了一种多基站信息交互机制和数据预编码机制, 使得参与协作的基站只需进行简单的信息交互, 就可以抑制大部分干扰, 从而提高上行数据的传输质量。
尽管上文对本发明进行了详细说明, 但是本发明不限于此, 本技术领 域技术人员可以根据本发明的原理进行各种修改。 因此, 凡按照本发明原 理所作的修改, 都应当理解为落入本发明的保护范围。
Claims
权利要求书
1、一种多输入多输出 MIM0系统的数据发送方法,其特征在于,包括: 步骤 A: 参与协作的基站集合中的每个基站通过网络骨干或骨干网或 基站之间的专用接口交互时频资源块上的用户调度信息;
步骤 B: 参与协作的基站集合中的每个基站根据时频资源块上的用户 调度信息, 获得干扰源用户信息, 并通过测量干扰源用户到自身之间的信 道信息得到干扰信息, 发送给干扰源用户所属的基站;
步骤 C: 每个基站接收协作基站集合中的其它基站发送的干扰信息, 并根据干扰信息, 形成等效干扰信息;
步骤 D: 每个基站利用等效干扰信息和所服务用户到自身的信道信息, 得到时频资源块上的关于预编码的信息, 并发送给自身所服务的用户; 步骤 E: 用户根据接收的关于预编码的信息, 得到最优预编码信息, 并 利用所述最优预编码信息调节发送信号。
2、 根据权利要求 1所述的数据发送方法, 其特征在于, 所述步骤 B, 为:
参与协作的基站集合中的每个基站根据参与协作的基站集合中的其它 基站在时频资源块上的用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每个基站将干扰源用户到自身的信道信息 H 做奇异值分解或对 (H)H H或 E((H)H H)做特征分解, 得到右奇异矩阵或特征 向量矩阵 V;
提取 V的前 n列向量, 生成干扰信息 vn , 发送给干扰源用户所属的基 站;
其中, n由基站根据信道信息 H的分解决定。
3、根据权利要求 2所述的数据发送方法,其特征在于,所述步骤 C中, 所述等效干扰信息为:
Ητ V
j: vf
i jm
其中,表示在同一时频资源块上基站 j调度的用户集合, j≠ k, j = 1,…, N 4、 根据权利要求 1所述的数据发送方法, 其特征在于, 所述步骤 B, 参与协作的基站集合中的每个基站根据参与协作的基站集合中的其它 基站在时频资源块上的用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每个基站将干扰源用户到自身的信道信息 H 量化成码本集合中的码字 WP"MI , 并根据码字 WP"M 到对应的索引
I
PMI = arg max 或者, PMI
PMI )H
通过连接基站的骨干网或网络骨干或基站间的专用接口将索引 PMI传 送给干扰源用户所属的基站;
其中, n由基站根据信道信息 H决定。
5、根据权利要求 4所述的数据发送方法,其特征在于,所述步骤 C中, 所述等效干扰信息为:
wu wu
PMIj! PMI jm
其中, m 表示在同一时频资源块上基站 j 调度的用户集合, j≠k,j = l,..., N。
6、 根据权利要求 1所述的数据发送方法, 其特征在于, 所述步骤 B, 为:
参与协作的基站集合中的每个基站根据参与协作的基站集合中的其它 基站在时频资源块上的用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每个基站通过连接基站的骨干网或网络骨干 或基站之间的专用接口, 将干扰源用户到自身的信道信息 H传递给干扰源 用户所属的基站。
7根据权利要求 6述的数据发送方法, 其特征在于, 所述步骤 C中, 所述等效干扰信息为:
Ηι H H
■ jl jm
其中, m 表示在同一时频资源块上基站 j 调度的用户集合, j≠k,j = l,..., N。
8、 根据权利要求 1至 7任一项所述的数据发送方法, 其特征在于, 所 述步骤 D, 为:
基站利用所服务用户到自身的信道信息, 得到最大化增益传输信息 w VVMRT
基站利用所述 Hl和所述 , 得到最小化干扰传输信息 w VVZF =i丄~丄f丄 w VVMRT: ,
9、 根据权利要求 1至 7任一项所述的数据发送方法, 其特征在于, 所 述步骤 D, 为:
基站利用所服务用户到自身的信道信息, 得到最大化增益传输信息 W^, 并量化为码本集合中的码字 WPMImrt后, 得到码字 wpMlMR^†应的索 引 PMI MRT = arg™Xj (WMRT)HWpMIMRT , 或者, PMIMRT = argp^Xj WPMIMRT j WMRT 基站利用所述 和所述 , 得到最小化干扰传输信息
WZF = ]1HWmrt , 并量化为码本集合中的码字 WPMIzf后, 得到码字 wPMIZF对 应的索引 PMIZF = argmax (WPMIzf)HWZF , 或者 , PMI ZF = arg max ||( WZF )H WPMIZF I
10、 根据权利要求 9所述的数据发送方法, 其特征在于, 所述步骤 E, 为: 用户根据收到的 PMiMR PMiZF, 得到索引为 PMImrt的码字 WPMImrt和索 引为 PMIZF的码字 WpMIzF , 并通过以下公式得到用于调节发送信号的最优预 编码信息:
其中, 。rtA(.)表示对输入参数进行标准正交化操作, [0,1]。
11、 根据权利要求 1至 7任一项所述的数据发送方法, 其特征在于, 所述步骤 D, 为:
基站利用所服务用户到自身的信道信息, 得到最大化增益传输信息
W
VVMRT: '
基站利用所述 Hl和所述 , 得到最小化干扰传输信息 w VVZF =i丄~丄f丄 w VVMRT: ,
基站获得预编码信息 W=。rth( WMRT+(l- )WZF) , 并将所述预编码信息量化为 码本集合 中 的码字 WpM½ 后 , 得到 码字 WpM½ 对应 的 索 引
PMI = argmax (w) Wp^j || , ΡΜΙ,,. = arg max PM TWI
W PMI 11 W" W PMI
基站通过下行控制信道将索引 PMIW传送给所服务用户; 其中, Γϋ^-ΗΐΚ^ΓΗί1,。ώ(.)表示对输入参数进行标准正交化操作, λ£ [(
12、根据权利要求 11所述的数据发送方法, 其特征在于, 所述步骤 Ε, 为:
用户根据收到的 PMIw , 得到用于调节发送信号的最优预编码信息
W = WPMIw ; 所述 WpMIw表示索引!^^的码字。
13、 根据权利要求 1所述的数据发送方法, 其特征在于, 所述步骤 B, 为:
参与协作的基站集合中的每个基站根据参与协作的基站集合中的其它 基站在时频资源块上的用户调度信息, 获得干扰源用户的信息;
参与协作的基站集合中的每个基站将干扰源用户到自身的信道信息 H 量化成码本集合 w中的码字 wp n MT , 并根据码字 ^得到对应的索引
H
PMI = arg min (H)HW P"MI或者 PMI = arg min WPMI HI
PMI PMI
通过连接基站的骨干网或网络骨干或基站之间的专用接口将索引 PMI 传送给干扰源用户所属的基站;
其中, n由基站根据信道信息 H的分解决定。
14、 根据权利要求 13所述的数据发送方法, 其特征在于, 所述步骤 C 中, 所述等效干扰信息为:
wn wn
HI PMIj! PMIjm 其中, m 表示在同一时频资源块上基站 j 调度的用户集合, j≠k,j = l,..., N。
15、 根据权利要求 1、 13或 14所述的数据发送方法, 其特征在于, 所 述步骤 D, 为:
基站利用所服务用户到自身的信道信息, 得到最大化增益传输信息 w V V MRT: '
基站利用所述 Hl和所述 WMRT , 得到最小化干扰传输信息 w V V ZF = i丄~丄f丄 w V V MRT: ,
基站获得所服务用户的最优预编码信息 W=。rth( WMRT+(l- )WZF) , 并通过下
行控制信道发送给所服务用户;
其中, Γ^ Η^Η^Η^Η;1, Λ(.)表示对输入参数进行标准正交化操作,
16、 根据权利要求 1 13或 14所述的数据发送方法, 其特征在于, 所 述步骤 D, 为:
基站 Κ利用所服务用户到自身的信道信息, 得到最大化增益传输信息 W^, 并量化为码本集合中的码字 WPMImrt后, 得到码字 wpMlMR^†应的索 引 H
PMI MRT = argmax (WMRT) WPMIMRT , 或者, PMI MRT = ar8ma WPMIMRT ) W RT
1 PMI 1 PMI
基站利用所述 Hl和所述 WMRT , 得到最小化干扰传输信息
WZF = ]1HWmrt , 并量化为码本集合中的码字 WPMIzf后, 得到码字 wPMIZF对 应的索引 PMIZF = argmax|(WzF)HWp]yIZF| , 或者, ΡΜΙ^ρ = arg max (WpMIZp ) W^F;
PMI PMI
17、根据权利要求 16所述的数据发送方法, 其特征在于, 所述步骤 E, 为:
用户根据收到的 PM½RT和 PM½F , 得到索引为 PM½RT的码字 WPMImrt和索 引为 PMIZF的码字 WpMIzF , 并通过以下公式得到用于调节发送信号的最优预 编码信息:
其中, οΛ(.)表示对输入参数进行标准正交化操作, Le[0l]
18、 根据权利要求 1 13或 14所述的数据发送方法, 其特征在于, 所 述步骤 D, 为:
基站利用所服务用户到自身的信道信息, 得到最大化增益传输信息
W
VVMRT: '
基站获得预编码信息 W=。rth( WMRT+(l- )WZF) , 并将所述预编码信息量化为 码本集合 中 的码字 WPMIw 后 , 得到 码字 WPMIw 对应 的 索 引
PMI =argmax|(W)HWPMI , 或者, PMI = arg max (wPMi )HW;
w PMI 11 w w ΡΜΐΙΓ w
基站通过下行控制信道将 PMIW传送给所服务用户;
其中, Γ^ Η^Η^Η^Η;1,。rth(.)表示对输入参数进行标准正交化操作, le[0,l]。
19、根据权利要求 18所述的数据发送方法, 其特征在于, 所述步骤 E, 为:
用户根据收到的 PMIw , 得到用于调节发送信号的最优预编码信息 w' =wpMIw ;
所述 WPMIw为索引 PMIW的码字。
20、 一种多输入多输出 MIMO系统的数据发送系统, 其特征在于, 包 括: 信息交互单元、 干扰信息计算和发送单元、 等效干扰信息生成单元、 最优预编码信息生成和发送单元、 以及调节单元; 其中,
信息交互单元, 用于将参与协作的基站集合内的基站在时频资源块上 的用户调度信息通过网络骨干或骨干网或基站间的专用接口交互;
干扰信息计算和发送单元, 用于根据时频资源块上的用户调度信息, 获得干扰源用户信息, 并通过测量的干扰源用户到自身的信道信息得到干 扰信息, 发送给干扰源用户所属的基站;
等效干扰信息生成单元, 用于接收协作基站集合中的其它基站发送的 干扰信息, 并根据所述干扰信息, 形成等效干扰信息;
最优预编码信息生成和发送单元, 用于利用等效干扰信息和本基站所 服务用户到自身的信道信息, 得到时频资源块上的关于预编码的信息, 并 发送给调节单元;
调节单元, 用于接收所述关于预编码的信息, 得到最优预编码信息, 并利用所述最优预编码信息调节发送信号。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201010502909.9A CN102447534B (zh) | 2010-10-13 | 2010-10-13 | 一种多输入多输出mimo系统的数据发送方法和系统 |
CN201010502909.9 | 2010-10-13 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012048575A1 true WO2012048575A1 (zh) | 2012-04-19 |
Family
ID=45937866
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2011/075462 WO2012048575A1 (zh) | 2010-10-13 | 2011-06-08 | 一种多输入多输出mimo系统的数据发送方法和系统 |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN102447534B (zh) |
WO (1) | WO2012048575A1 (zh) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104184547B (zh) * | 2013-05-27 | 2017-12-01 | 华为技术有限公司 | 协作多点传输方法、装置和系统 |
WO2015027522A1 (zh) * | 2013-09-02 | 2015-03-05 | 华为技术有限公司 | 一种上行协作发射方法及设备 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1893308A (zh) * | 2005-07-06 | 2007-01-10 | 都科摩(北京)通信技术研究中心有限公司 | Mimo通信系统以及用户调度方法 |
CN101547066A (zh) * | 2008-03-25 | 2009-09-30 | 中兴通讯股份有限公司 | 基于mu-mimo方式的下行预编码信息指示方法 |
WO2009136726A2 (en) * | 2008-05-07 | 2009-11-12 | Korea Bundy Co., Ltd. | Heat exchange system |
CN101674655A (zh) * | 2009-10-14 | 2010-03-17 | 中兴通讯股份有限公司 | 一种上行及下行信道信息获取方法和系统 |
CN101841903A (zh) * | 2009-03-20 | 2010-09-22 | 松下电器产业株式会社 | 无线通信系统中减小基站间干扰的装置和方法 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8374275B2 (en) * | 2007-06-23 | 2013-02-12 | Panasonic Corporation | Method and system for communication channel optimization in a multiple-input multiple-output (MIMO) communication system |
EP2141825A1 (en) * | 2008-06-30 | 2010-01-06 | Alcatel, Lucent | Method of reducing intra-cell spatial interference in a mobile cellular network |
KR101475816B1 (ko) * | 2008-07-07 | 2014-12-23 | 삼성전자주식회사 | 다중 입출력 무선통신 시스템에서 셀 간 간섭 제거 장치 및방법 |
KR101268687B1 (ko) * | 2008-08-18 | 2013-05-29 | 한국전자통신연구원 | 다중-셀 협력 통신을 위한 기지국들 및 단말을 포함하는 통신 시스템 |
CN101754346B (zh) * | 2009-12-25 | 2012-09-05 | 华中科技大学 | 一种基于信道相关性多用户调度的小区间干扰抑制方法 |
-
2010
- 2010-10-13 CN CN201010502909.9A patent/CN102447534B/zh not_active Expired - Fee Related
-
2011
- 2011-06-08 WO PCT/CN2011/075462 patent/WO2012048575A1/zh active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1893308A (zh) * | 2005-07-06 | 2007-01-10 | 都科摩(北京)通信技术研究中心有限公司 | Mimo通信系统以及用户调度方法 |
CN101547066A (zh) * | 2008-03-25 | 2009-09-30 | 中兴通讯股份有限公司 | 基于mu-mimo方式的下行预编码信息指示方法 |
WO2009136726A2 (en) * | 2008-05-07 | 2009-11-12 | Korea Bundy Co., Ltd. | Heat exchange system |
CN101841903A (zh) * | 2009-03-20 | 2010-09-22 | 松下电器产业株式会社 | 无线通信系统中减小基站间干扰的装置和方法 |
CN101674655A (zh) * | 2009-10-14 | 2010-03-17 | 中兴通讯股份有限公司 | 一种上行及下行信道信息获取方法和系统 |
Also Published As
Publication number | Publication date |
---|---|
CN102447534B (zh) | 2014-04-09 |
CN102447534A (zh) | 2012-05-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20220239360A1 (en) | Csi omission rules for enhanced type ii csi reporting | |
JP6060241B2 (ja) | 無線通信システムにおいてチャネル状態情報をフィードバックする端末装置及びその方法 | |
CN106233640B (zh) | 无线通信系统中用于信道信息反馈的装置和方法 | |
EP2702778B1 (en) | Enhancement of download multi-user multiple-input multiple-output wireless communications | |
JP5406854B2 (ja) | 無線通信システム及びプリコーディング方法 | |
Määttänen et al. | System-level performance of LTE-Advanced with joint transmission and dynamic point selection schemes | |
US20240007164A1 (en) | Methods for reducing overhead of nr type ii channel state information feedback using angle and delay reciprocity | |
US9337906B2 (en) | Feedback and scheduling for coordinated multi-point (CoMP) joint transmission (JT) in orthogonal frequency division multiple access (OFDMA) | |
CN105723627A (zh) | 用于多分辨率预编码矩阵指示符反馈的方法和设备 | |
EP4179638A1 (en) | Signaling to aid enhanced nr type ii csi feedback | |
WO2012129937A1 (zh) | 一种多基站多用户下行传输的分布式预处理方法和系统 | |
WO2018024157A1 (zh) | 信道状态信息的发送方法、接收方法、装置和系统 | |
CN115173909A (zh) | 用于频率参数化线性组合码本的码本子集限制 | |
CN108463953B (zh) | 基于统计csi-t的非线性预编码 | |
US9048970B1 (en) | Feedback for cooperative multipoint transmission systems | |
WO2012048575A1 (zh) | 一种多输入多输出mimo系统的数据发送方法和系统 | |
WO2023170655A1 (en) | Type ii precoder matrix indicator (pmi) enhancement for coherent joint transmission (cjt) | |
WO2012113185A1 (zh) | 一种发射信号预处理发送方法及装置 | |
Li et al. | Enhanced limited rate implicit CSI feedback and its usage in covariance matrix based MU-MIMO | |
US20240356607A1 (en) | Channel state information omission for type ii channel state information | |
CN117321928A (zh) | 配置信道状态信息(csi)反馈 | |
CN116711222A (zh) | 用于使用角度和延迟互易性减少nr类型ii信道状态信息反馈的开销的方法 | |
WO2024172732A1 (en) | Target channel state information (csi) based channel quality indicator (cqi) |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 11831972 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 11831972 Country of ref document: EP Kind code of ref document: A1 |