CN101605016B - Method and device for sorting codebook - Google Patents
Method and device for sorting codebook Download PDFInfo
- Publication number
- CN101605016B CN101605016B CN200810110192.6A CN200810110192A CN101605016B CN 101605016 B CN101605016 B CN 101605016B CN 200810110192 A CN200810110192 A CN 200810110192A CN 101605016 B CN101605016 B CN 101605016B
- Authority
- CN
- China
- Prior art keywords
- code book
- probability
- index
- codebook set
- current
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses a method and a device for sorting a codebook, wherein the method comprises the following steps: determining the relation between a current codebook and the other codebook in a codebook set according to the predetermined rule; determining that the fault transmission of the current codebook is the probability of the other codebook index according to the given fault probability; and sorting the codebook in the codebook set according to the determined relation and the probability in the codebook set. The invention can solve the problem of decreased pre-coding performance caused by the fault feedback of the codebook so as to effectively improve the pre-coding performance.
Description
Technical field
The present invention relates to the communications field, and especially, relate to a kind of code book sort method and device.
Background technology
At Long Term Evolution (Long term Evolution, LTE) system, global microwave access intercommunication (World Interoperability for Microwave Access, etc. WiMAX)) in system, in order to improve power system capacity, introduced OFDM (OFDM) technology and multiple-input, multiple-output (Multiple input Multiple output, MIMO) technology.
OFDM technology can be divided into channel the subchannel of several quadratures, make high-speed data signal convert parallel low speed sub data flow to, because the signal bandwidth of every sub-channels is less than the correlation bandwidth of channel, therefore every sub-channels can be regarded flatness fading channel as, thereby eliminate intersymbol interference, and make channel equalization relatively easy.And the introducing of MIMO technology can improve the capacity of system greatly, theory analysis is known, when transmitting antenna is abundant, and the maximum system capacity increase that is directly proportional to reception antenna quantity.
The precoding technique of selecting based on precoding vector is accepted by LTE (3GPP) at present, its basic thought is the channel information feeding back by recipient, the data that send are processed with pre-coding matrix, and made each data flow in the transmitting procedure of space channel, be equivalent to separate channel to transmit.Conventionally, be first that receiver side goes out one group of precoding weights by estimating channel characteristics information decomposition, and these group weights are informed to transmit leg, transmit leg carries out sending after precoding with the weights of being apprised of; Meanwhile, recipient detects with corresponding weights.In time division duplex (Time Division Duplex, referred to as TDD) system, in the effective situation of the mutual benefit of channel, the calculating of weights also can complete at transmitter side.
When the precoding weights of recipient feedback feed back, due to the characteristics such as frequency selective fading of channel, likely in transmitting procedure, occur that precoding weights make mistakes, thereby have a strong impact on the performance of precoding technique.Yet, for how reducing error of transmission, simple and effective scheme is never proposed at present.
Summary of the invention
Consider the problems referred to above and make the present invention, for this reason, main purpose of the present invention is to provide a kind of code book ordering mechanism, to solve the problem of the precoding hydraulic performance decline being caused due to code book error of transmission.
According to embodiments of the invention, provide a kind of code book sort method.
The method comprises: the relation of determining current code book and other code book in codebook set according to pre-defined rule; According to given error probability, determine that index error that current code book is corresponding is transmitted as the probability of the index that other code book is corresponding; According to definite relation and probability, in codebook set, the code book in codebook set is sorted.
Wherein, after determining the relation of the concentrated current code book of code book and other code book, the method can further comprise: according to definite relation, the relation of current code book and other code book is arranged in order, form code book relational matrix.
And, at definite index error corresponding to current code book, be transmitted as after the probability of the index that other code book is corresponding, the method can further comprise: the probability that index error corresponding to current code book is transmitted into the index that other code book is corresponding according to definite probability is arranged in order, forms erroneous transmissions probabilistic relation matrix.
Wherein, above-mentioned pre-defined rule comprise following one of at least: signal-to-noise ratio (SNR) Criterion, Euclidean distance criterion, correlation criterion.
The processing of in addition, the code book in codebook set being sorted is specially:
Steps A, using the first code book of unsorted codebook set as current code book, according to the wrong probabilistic relation passing as index corresponding to other code book of index that in erroneous transmissions probabilistic relation matrix, current code book is corresponding, while is in conjunction with the relation of current code book and other code book in code book relational matrix, to be related to that the index position of code book of maximum is corresponding with the wrong index position that passes maximum probability with current code book, wherein, above-mentioned position correspondence refers to that location swap and/or index exchange.
Now, current code book is completed after the sequence in codebook set, thereby other code book outside current code book in codebook set is successively as current code book and perform step the sequence that A completes code book in codebook set, until in codebook set all code books carried out steps A or the code book of predetermined quantity in codebook set carried out to steps A.
And, during in the situation that the code book in codebook set is sorted, there is conflict, according to predetermined priority principle, determine the code book of priority ordering, wherein, conflict refers to after other code book being sorted for current code book, the sequence before can upsetting when the code book in codebook set is sorted for other code book.
Wherein, predetermined priority principle can comprise: error probability is maximum preferentially, correlation is maximum preferential.
In addition, during in the situation that the code book in codebook set is sorted, there is conflict, further comprise: before current code book execution step A is sorted, according to predetermined priority ordering principle, record the corresponding wrong probability that passes of code book that each occurrence positions is corresponding, the initialization value of current code book is set to 1, and the initialization value of other in codebook set is set to 0; If this need to carry out the mistake biography probability that code book corresponding to position is corresponding, be greater than the mistake biography probability that carries out code book corresponding to position in last minor sort process, carry out index upgrade, upgrade simultaneously and carry out the mistake biography probability that code book corresponding to position is corresponding; Afterwards, after each current code book has sorted, the mistake of current code book passes probability and is set to 1, and while selecting current code book to sort with execution step A at every turn, and it is not that 1 code book is preferentially as current code book that mistake is passed to maximum probability and initialization value; Or
According to steps A, current code book is being reordered in process, passing probability certain code book is carried out to position correspondence according to mistake, wherein, carrying out the corresponding wrong probability that passes of code book corresponding to position institute is that this code book is misinformated as to carry out the probability of code book corresponding to position with it;
Wherein, conflict refers to after other code book being sorted for current code book, the sequence before can upsetting when the code book in codebook set is sorted for other code book.
In addition, when determining the probability of erroneous transmissions, as long as any bit transfer mistake of code book, think erroneous transmissions.
According to another embodiment of the present invention, provide a kind of code book collator.
This device comprises: the first determination module, for determine the relation of the current code book of codebook set and other code book according to pre-defined rule; The second determination module, for determining that according to given error probability index error that current code book is corresponding is transmitted as the probability of the index that other code book is corresponding; Order module, sorts to other code book in codebook set according to definite relation and probability.
By technique scheme of the present invention, can solve the precoding hydraulic performance decline problem that code book feedback error causes, thereby effectively improve precoding performance.
accompanying drawing explanation
Accompanying drawing described herein is used to provide a further understanding of the present invention, forms the application's a part, and schematic description and description of the present invention is used for explaining the present invention, does not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is according to the flow chart of the code book sort method of the inventive method embodiment;
Fig. 2 is according to the flow chart of the detailed processing procedure of the code book sort method of the inventive method embodiment;
Fig. 3 is according to the process chart of sequencer procedure in the code book sort method of the inventive method embodiment;
Fig. 4 is according to the block diagram of the code book collator of apparatus of the present invention embodiment.
Embodiment
Embodiment of the method
In the present embodiment, provide a kind of code book sort method.
As shown in Figure 1, according to the code book sort method of the present embodiment, comprise: step S102, determines the relation of current code book and other code book in codebook set according to pre-defined rule; Step S 104, according to given error probability, determine the probability that current code book erroneous transmissions is other code book index; Step S106, sorts to the code book in codebook set in codebook set according to definite relation and probability.
Wherein, after determining the relation of the concentrated current code book of code book and other code book, the method can further comprise: according to definite relation, the relation of current code book and other code book is arranged in order, form code book relational matrix.
And, after determining the probability that current code book erroneous transmissions is other code book, the method can further comprise: according to definite probability, to current code book index erroneous transmissions, become the probability of other code book index to arrange in order, form erroneous transmissions probabilistic relation matrix.
Wherein, above-mentioned pre-defined rule comprise following one of at least: signal-to-noise ratio (SNR) Criterion, Euclidean distance criterion, correlation criterion.
The processing of in addition, the code book in codebook set being sorted is specially:
Steps A, using the first code book of unsorted codebook set as current code book, according to wrong biography of current code book index in erroneous transmissions probabilistic relation matrix, it is the probabilistic relation of other code book index, simultaneously in conjunction with the relation of current code book and other code book in code book relational matrix, will be related to that the index position of code book of maximum is corresponding with the index position of mistake biography maximum probability with current code book.
Now, current code book is completed after the sequence in codebook set, thereby other code book outside current code book in codebook set is successively as current code book and perform step the sequence that A completes code book in codebook set, until in codebook set all code books carried out steps A or the code book of predetermined quantity in codebook set carried out to steps A.
And, during in the situation that the code book in codebook set is sorted, there is conflict, according to predetermined priority principle, determine the code book of priority ordering, wherein, conflict refers to after other code book being sorted for current code book, the sequence before can upsetting when the code book in codebook set is sorted for other code book.
Wherein, predetermined priority principle can comprise: error probability is maximum preferentially, correlation is maximum preferential.
In addition, during in the situation that the code book in codebook set is sorted, there is conflict, further comprise: before current code book execution step A is sorted, according to predetermined priority ordering principle, record the corresponding wrong probability that passes of code book that each occurrence positions is corresponding, the initialization value of current code book is set to 1, and the initialization value of other in codebook set is set to 0; If this need to carry out the mistake biography probability that code book corresponding to position is corresponding, be greater than the mistake biography probability that carries out code book corresponding to position in last minor sort process, carry out index upgrade, upgrade simultaneously and carry out the mistake biography probability that code book corresponding to position is corresponding; Afterwards, after each current code book has sorted, the mistake of current code book passes probability and is set to 1, and while selecting current code book to sort with execution step A at every turn, and it is not that 1 code book is preferentially as current code book that mistake is passed to maximum probability and initialization value; Or
According to steps A, current code book is being reordered in process, passing probability certain code book is carried out to position correspondence according to mistake, wherein, carrying out the corresponding wrong probability that passes of code book corresponding to position institute is that this code book is misinformated as to carry out the probability of code book corresponding to position with it.
For example, it is priority ordering criterion that the mistake of take passes maximum probability, before each sequencer procedure, it is 0 that mistake before initialization other code book except current code book exchanges passes probability, current code book is 1, carries out position at once at every turn, and mistake corresponding while recording current exchange passes probability.If carry out position at once in the last minor sort of code book m, last processing code book k is wrong pass for the error probability of m be P
i, and in this sequencer procedure, the probability that current processing code book k+1 mistake passes into code book m is P
i+1if, P
i+1> P
i, carry out code book m to carry out index upgrade, upgrade the mistake biography probability of code book m when this exchanges is P simultaneously
i+1, otherwise do not replace, do not carry out mistake simultaneously and pass probability renewal.
In addition, when determining the probability of erroneous transmissions, as long as any bit transfer mistake of code book, think erroneous transmissions.
Preferably, above-mentioned position correspondence refers to that location swap and/or index exchange.
It should be noted that in actual applications, the order of the processing in the processing in step S102 and step S104 can be changed, and also can be both executed in parallel.
Below in conjunction with instantiation, the present embodiment is described.
As shown in Figure 2, as follows according to the detailed processing procedure of the code book sort method of the present embodiment:
(1), according to a certain specific criterion, determine the relation of each code book and other code book in codebook set, the line ordering of going forward side by side;
For example, when according to maximum correlation criterion, from current code book (for example, while the code book of k=1) starting to sort, calculate respectively each code book in codebook set and this code book (, code book k) correlation, and according to descending order sequence, and correlated results and the result after sequence that hypothesis calculates are as shown in table 1, wherein, Corr represents the correlation of corresponding code book, suppose that the size order of correlation is as shown in the 3rd row of table 1 here, and the less expression correlation of sequence number is larger;
| Original code book | 0000 number basis and other code book correlation | Correlation size order |
| 0001 | Corr 1 | 5 |
| 0010 | Corr 2 | 9 |
| 0011 | Corr 3 | 2 |
| 0100 | Corr 4 | 6 |
| 0101 | Corr 5 | 8 |
| 0110 | Corr 6 | 10 |
| 0111 | Corr 7 | 3 |
| 1000 | Corr 8 | 7 |
| 1001 | Corr 9 | 12 |
| 1010 | Corr 10 | 4 |
| 1011 | Corr 11 | 1 |
| 1100 | Corr 12 | 11 |
| 1101 | Corr 13 | 13 |
| 1110 | Corr 14 | 15 |
| 1111 | Corr 15 | 14 |
Table 1
(2), according to certain given erroneous transmissions probability, in calculating codebook set, each code book mistake passes into the probability of other code book, the line ordering of going forward side by side;
Particularly, the probability of supposing each bit error of transmission is that (the mistake bit of system leads and is less than 0.5 p,, p < 0.5), code book number is 16, and current code book is 0000, can calculating this code book mistake, to pass into the probability of other code book sequence number respectively as shown in table 1, obviously, to become 0001,0010,0100 and 1000 probability be maximum to this code book sequence number erroneous transmissions.For simplification process, also can only consider the situation of part transmission error probability, for example only consider the situation of single bit erroneous transmissions, thereby simplify sequencer procedure;
| Original code book | 0000 code book index mistake passes into the probability of other code book index | Error probability size order |
| 0001 | P(1-P) 3 | 1 |
| 0010 | P(1-P) 3 | 1 |
| 0011 | P 2(1-P) 2 | 2 |
| 0100 | P(1-P) 3 | 1 |
| 0101 | P 2(1-P) 2 | 2 |
| 0110 | P 2(1-P) 2 | 2 |
| 0111 | P 3(1-P) | 3 |
| 1000 | P(1-P) 3 | 1 |
| 1001 | P 2(1-P) 2 | 2 |
| 1010 | P 2(1-P) 2 | 2 |
| 1011 | P 3(1-P) | 3 |
| 1100 | P 2(1-P) 2 | 2 |
| 1101 | P 3(1-P) | 3 |
| 1110 | P 3(1-P) | 3 |
| 1111 | P 4 | 4 |
Table 2
(3) relation between the transmission error probability calculating according to (1), (2) and code book, sorts to the code book in codebook set.
As shown in Figure 3, for step (3), can specifically sort in such a way:
(3a) for example, from any one the code book k (from k=1) codebook set, first according to the result of step (2), obtain wrong code book sequence number m (that is, sequence number is the maximum probability that k mistake passes into sequence number m) corresponding to value that passes maximum probability of sequence number k;
(3b), for the code book k selecting in (3a), the result of calculating according to step (1), selects the code book the most approaching with current code book to deserved sequence number n (that is code book that the code book that, sequence number is k and sequence number are n the most approaching; The code book correlation that the code book that sequence number is k in other words and sequence number are n is the strongest; In codebook set (except the code book itself that sequence number is k) in other words, the code book that is n by sequence number replaces the code book that sequence number is k, can obtain maximum SINR (or minimum error probability, or there is minimum Euclidean distance with code book k, or there is maximum correlation);
(3c) code book that is n by index and index are that the code book of m carries out index upgrade;
(3d) (not shown) subsequently, passes probability and similitude time large sorting according to (3a)～(3b) similar rule according to mistake respectively, and the like;
(3e) sequence number that (not shown) obtains after resequencing based on (3a)～(3d) again, in pair set, remaining code book is carried out the sequence of (3a)～(3d); When after sequence and sequence before exist while conflict, according to certain priority principle determine (for example, error probability maximum preferentially, the maximum priority scheduling of correlation) determine the sequence number of collision position, until all code books are all in optimum position.
For instance, the result obtaining according to table 1 and table 2, first selects in loading error occurring situation, and the wrong sequence number that passes maximum probability, gets sequence number 0001; And correlation maximum for correspond to 1011 numbers in former sequence this, by original 1011 numbers this and No. 0001 location swaps; And then select the wrong probability time large sequence number that passes, get 0010, and correlation time large code book current sequence number is 0011, so by 0011 current number this with 0010 this location swap of number, the like.
According to the hypothesis in (1) and (2), take first code book 0000 as current code book is after sequence, the corresponding relation of the code book sequence number after the code book sequence number before sequence and sequence is (suppose bit lead be less than 0.5) by mistake:
| Code book index | Code book index before sequence | The rear corresponding former code book index of sequence for the first time | Take 0000 code book during as current code book, the wrong probability that passes of corresponding exchange |
| 1 | 0000 | 0000 | 1 |
| 2 | 0001 | 1011 | P(1-P) 3 |
| 3 | 0010 | 0011 | P(1-P) 3 |
| 4 | 0011 | 0001 | P 2(1-P) 2 |
| 5 | 0100 | 0111 | P(1-P) 3 |
| 6 | 0101 | 0100 | P 2(1-P) 2 |
| 7 | 0110 | 1000 | P 2(1-P) 2 |
| 8 | 0111 | 1100 | P 3(1-P) |
| 9 | 1000 | 1010 | P(1-P) 3 |
| 10 | 1001 | 0101 | P 2(1-P) 2 |
| 11 | 1010 | 0010 | P 2(1-P) 2 |
| 12 | 1011 | 1001 | P 3(1-P) |
| 13 | 1100 | 0110 | P 2(1-P) 2 |
| 14 | 1101 | 1101 | P 3(1-P) |
| 15 | 1110 | 1111 | P 3(1-P) |
| 16 | 1111 | 1110 | P 4 |
Table 3
Table 3 shows take 0000 as the ordinal relation of current code book sequence front and back and the corresponding wrong probability that passes of the code book of location swap.
When take k=0000 number originally as with reference to after sort, so with k=0010,0011 ..., 1111 sort for reference.In sequencer procedure, when there is conflict (, the sequence number relation obtaining after the sequence number sequencing when sequence number is k-1 above and the sequence of current code book is inconsistent), the large person of the error probability of take or the large person of correlation are preferential displacement,, if when error probability (or correlation) corresponding to current k value is greater than the result of (k-1) minor sort, carries out sequential replacement, otherwise retain original order.
With sort for the second time bright for instance in the middle of renewal process, take 0000 for current code book completes after sequence, result is as shown in table 3, therefrom selects to exchange the code book of maximum probability, as current code book, the step of reference (3a) to (3b) sorts.If bit error rate is less than 0.5, by 0000 code book, transmit into 0001,0010,0100,1000 probability equates, and maximum probability, four index respectively corresponding former sequence number are 1011,0011,0111,1010.Get one of them as current code book, as get 1011, the new index in the table of code book 1011 after sequence is 2, that is, and and 0001.If ranking results is if table 4 is to as shown in table 6:
| Original code book | 1011 numbers bases and other code book correlation | Correlation size order |
| 0000 | Corr 1 | 10 |
| 0001 | Corr 2 | 15 |
| 0010 | Corr 3 | 14 |
| 0011 | Corr 4 | 1 |
| 0100 | Corr 5 | 3 |
| 0101 | Corr 6 | 13 |
| 0110 | Corr 7 | 7 |
| 0111 | Corr 8 | 12 |
| 1000 | Corr 9 | 11 |
| 1001 | Corr 10 | 6 |
| 1010 | Corr 11 | 8 |
| 1100 | Corr 12 | 5 |
| 1101 | Corr 13 | 9 |
| 1110 | Corr 14 | 4 |
| 1111 | Corr 15 | 2 |
Table 4
| Original code book | 0001 (1011 in corresponding original collection) code book index mistake passes into the probability of other code book index | Error probability size order |
| 0000 | P(1-P) 3 | 1 |
| 0010 | P 2(1-P) 2 | 2 |
| 0011 | P(1-P) 3 | 1 |
| 0100 | P 2(1-P) 2 | 2 |
| 0101 | P(1-P) 3 | 1 |
| 0110 | P 3(1-P) | 3 |
| 0111 | P 2(1-P) 2 | 2 |
| 1000 | P 2(1-P) 2 | 2 |
| 1001 | P(1-P) 3 | 1 |
| 1010 | P 3(1-P) | 3 |
| 1011 | P 2(1-P) 2 | 2 |
| 1100 | P 3(1-P) | 3 |
| 1101 | P 2(1-P) 2 | 2 |
| 1110 | P 4 | 4 |
| 1111 | P 3(1-P) | 3 |
Table 5
Table 6
Table 6 shows take 0000 as the ordinal relation of current code book sequence front and back and the corresponding wrong probability that passes of the code book of location swap.
Wherein, in table 6, before the sequence of code book index 1, after the sequence for the second time of code book sequence number 0000 and the rear corresponding former code book sequence number 0000 of code book sequence for the second time and code book index 2, corresponding former code book sequence number 1011 expressions are used as current code book;
After sequence, the wrong strikethrough that passes code book index 4,6,8,10,12,14,15,16 in probability one row of corresponding renewal partly represents that the wrong probability that passes upgrades for the second time, and wherein, the probability of the code book that code book index is 4 is by P
2(1-P)
2be updated to P (1-P)
3; Code book index is that the probability of 6 code book is by P
2(1-P)
2be updated to P (1-P)
3; Code book index is that the probability of 8 code book is by P
3(1-P) be updated to P
2(1-P)
2; Code book index is that the probability of 10 code book is by P
2(1-P)
2be updated to P
3(1-P); Code book index is that the probability of 12 code book is by P
3(1-P) be updated to P
2(1-P)
2; Code book index is that the probability of 14 code book is by P
3(1-P) be updated to P
2(1-P)
2; Code book index is that the probability of 15 code book is by P
3(1-P) be updated to P
2(1-P)
2; Code book index is that the probability of 16 code book is by P
4be updated to P
2(1-P)
2;
Before the sequence of code book index 4 code book sequence number 0001 to the arrow of sequence number 0001 after second this sequence of code book index 16, before the sequence of code book index 1000 code book sequence number 0101 to the arrow of sequence number 0101 after second this sequence of code book index 15, the front code book sequence number 1111 of the sequence of code book index 15 is that sequence number during according to preference for probability principle is moved to the arrow indication of second this sequence number 1111 after sorting of code book index 4.
Device embodiment
In the present embodiment, provide a kind of code book collator.
As shown in Figure 4, according to the code book collator of the present embodiment, comprise: the first determination module 402, for determine the relation of the current code book of codebook set and other code book according to pre-defined rule; The second determination module 404, for determining that according to given error probability current code book erroneous transmissions is the probability of other code book index; Order module 406, sorts to other code book in codebook set according to definite relation and probability.
In sum, the present invention, by considering the relation between code book, carries out rational sorting to code book, rationally adjusted the position of the code book that error probability is large, thereby solved the precoding hydraulic performance decline problem that code book feedback error causes, effectively improved precoding performance.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in protection scope of the present invention.
Claims (10)
1. a code book sort method, is characterized in that, comprising:
According to pre-defined rule, determine the relation of current code book and other code book in codebook set;
According to given error probability, determine that index error corresponding to described current code book is transmitted as the probability of the index that described other code book is corresponding;
According to described relation and the described probability determined, in described codebook set, the code book in described codebook set is sorted, wherein, the processing that code book in described codebook set is sorted is specially: steps A, using the first code book of unsorted codebook set as current code book, according to the wrong probabilistic relation passing as index corresponding to other code book of index corresponding to current code book described in erroneous transmissions probabilistic relation matrix, while is in conjunction with the relation of current code book described in code book relational matrix and other code book, by to be related to that the index of code book of maximum and the wrong index that passes maximum probability carry out position corresponding with described current code book, wherein, position correspondence refers to that location swap and/or index exchange.
2. method according to claim 1, is characterized in that, after determining the relation of the concentrated current code book of described code book and described other code book, further comprises:
According to the described relation of determining, the relation of described current code book and other code book is arranged in order, form code book relational matrix.
3. method according to claim 1, is characterized in that, is determining that index error corresponding to described current code book is transmitted as after the probability of the index that described other code book is corresponding, further comprises:
The probability that index error corresponding to described current code book is transmitted into the index that other code book is corresponding according to the described probability of determining is arranged in order, forms erroneous transmissions probabilistic relation matrix.
4. method according to claim 2, is characterized in that, described pre-defined rule comprise following one of at least: signal-to-noise ratio (SNR) Criterion, Euclidean distance criterion, correlation criterion.
5. method according to claim 1, it is characterized in that, described current code book is completed after the sequence in described codebook set, thereby other code book outside current code book described in described codebook set is successively as current code book and carry out the sequence that described steps A completes code book in described codebook set, until in described codebook set all code books carried out described steps A or the code book of predetermined quantity in described codebook set carried out to described steps A.
6. method according to claim 5, it is characterized in that, in the situation that the code book in described codebook set is carried out. during sequence, there is conflict, according to predetermined priority principle, determine the code book of priority ordering, wherein, described conflict refers to after described other code book being sorted for described current code book, the sequence before can upsetting when the code book in described codebook set is sorted for described other code book.
7. method according to claim 6, is characterized in that, described predetermined priority principle comprises: error probability is maximum preferentially, correlation is maximum preferential.
8. method according to claim 5, is characterized in that, in the situation that there is conflict when the code book in described codebook set is sorted, further comprises:
Before current code book carried out to described steps A sorting, according to predetermined priority ordering principle, record the corresponding wrong probability that passes of code book that each occurrence positions is corresponding, the initialization value that the mistake of described current code book passes probability is set to 1, and the initialization value that the mistake of other code book in described codebook set passes probability is set to 0; If this need to carry out the mistake biography probability that code book corresponding to position is corresponding, be greater than the mistake biography probability that carries out code book corresponding to position in last minor sort process, carry out index upgrade, upgrade simultaneously and carry out the mistake biography probability that code book corresponding to position is corresponding; Afterwards, after each current code book has sorted, the mistake of current code book passes probability and is set to 1, and while selecting current code book to sort to carry out described steps A at every turn, and it is not that 1 code book is preferentially as current code book that mistake is passed to maximum probability and initialization value; Or
According to described steps A, described current code book is being reordered in process, according to mistake, pass probability certain code book is carried out to position correspondence, wherein, carry out code book corresponding to position the corresponding wrong probability that passes be that this code book misinformation is for to carry out the probability of code book corresponding to position with it;
Wherein, described conflict refers to after described other code book being sorted for described current code book, the sequence before can upsetting when the code book in described codebook set is sorted for described other code book.
9. method according to claim 1, is characterized in that, when determining the probability of erroneous transmissions, as long as any bit transfer mistake of code book, thinks erroneous transmissions.
10. a code book collator, is characterized in that, comprising:
The first determination module, for determining the relation of the current code book of codebook set and other code book according to pre-defined rule;
The second determination module, for determining that according to given error probability index error corresponding to described current code book is transmitted as the probability of the index that described other code book is corresponding;
Order module, according to described relation and the described probability determined, in described codebook set, described other code book is sorted, wherein, the processing that code book in described codebook set is sorted is specially: steps A, using the first code book of unsorted codebook set as current code book, according to the wrong probabilistic relation passing as index corresponding to other code book of index corresponding to current code book described in erroneous transmissions probabilistic relation matrix, while is in conjunction with the relation of current code book described in code book relational matrix and other code book, by to be related to that the index of code book of maximum and the wrong index that passes maximum probability carry out position corresponding with described current code book, wherein, position correspondence refers to that location swap and/or index exchange.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810110192.6A CN101605016B (en) | 2008-06-12 | 2008-06-12 | Method and device for sorting codebook |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810110192.6A CN101605016B (en) | 2008-06-12 | 2008-06-12 | Method and device for sorting codebook |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101605016A CN101605016A (en) | 2009-12-16 |
| CN101605016B true CN101605016B (en) | 2014-04-09 |
Family
ID=41470581
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810110192.6A Expired - Fee Related CN101605016B (en) | 2008-06-12 | 2008-06-12 | Method and device for sorting codebook |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101605016B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101136718A (en) * | 2006-11-07 | 2008-03-05 | 中兴通讯股份有限公司 | Multi-input multi-output space multiplexing precoding method of wireless communication system |
| CN101166052A (en) * | 2006-10-19 | 2008-04-23 | 株式会社Ntt都科摩 | Precoding method for multi-input multi-output system and apparatus using same |
-
2008
- 2008-06-12 CN CN200810110192.6A patent/CN101605016B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101166052A (en) * | 2006-10-19 | 2008-04-23 | 株式会社Ntt都科摩 | Precoding method for multi-input multi-output system and apparatus using same |
| CN101136718A (en) * | 2006-11-07 | 2008-03-05 | 中兴通讯股份有限公司 | Multi-input multi-output space multiplexing precoding method of wireless communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101605016A (en) | 2009-12-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102349240B (en) | In multiaerial system, send the method and apparatus for the control information of interference mitigation | |
| CN104488210B (en) | Feedback method, receiving terminal and the transmitting terminal of pre-coding matrix instruction | |
| CN101411110B (en) | Feedback of channel state information for MIMO and subband scheduling in a wireless communication system | |
| CN101496439B (en) | Feedback device, feedback method, scheduling device and scheduling method | |
| CN104040907B (en) | It is used for the method and apparatus for sending and receiving feedback information in mobile communication system | |
| CN102571177A (en) | Wireless base station device, terminal, and wireless communication method | |
| CN103098383A (en) | System and method for pucch subband feedback signaling in a wireless network | |
| CN104321983B (en) | Method, user equipment and the base station of transmitting pre-encoding matrix | |
| CN102195698A (en) | Downlink transmission in a multiple-user multiple-input multiple-output MU-MIMO wireless communication system | |
| CN103581891A (en) | Method and device for information processing | |
| CN102420645B (en) | A kind of grouping scheduling method of multiuser mimo system and device | |
| WO2010135924A1 (en) | Communication device, communication method and base station | |
| CN103391129B (en) | Apparatus and method for decoding received signal | |
| CN103905345B (en) | channel correcting device, method and system | |
| CN104662953A (en) | Feedback method and apparatus for channel state information | |
| CN101783776B (en) | Precoding feedback method, system, user equipment and base station | |
| CN103001676A (en) | Wireless communication method, user equipment and base station | |
| CN101156335B (en) | Wireless base station apparatus | |
| CN101965011B (en) | Method and device for realizing selection of multiple antenna transmission modes | |
| CN103929225B (en) | Feed back control system, feedback device and multiuser MIMO feedback method | |
| CN101998498B (en) | Rank self-adapting method and rank self-adapting device | |
| CN102238733B (en) | User scheduling method in mobile communication system | |
| JP5498856B2 (en) | Channel information feedback method, precoding method, receiving station and transmitting station | |
| CN106685598A (en) | Channel state information CSI feedback method, terminal and base station | |
| CN101605016B (en) | Method and device for sorting codebook |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20091216 Assignee: SANECHIPS TECHNOLOGY Co.,Ltd. Assignor: ZTE Corp. Contract record no.: 2015440020319 Denomination of invention: Method and device for sorting codebook Granted publication date: 20140409 License type: Common License Record date: 20151123 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180426 Address after: California, USA Patentee after: Global innovation polymerization LLC Address before: 518057 Zhongxing building, science and technology south road, Nanshan District hi tech Industrial Park, Guangdong, Shenzhen Patentee before: ZTE Corp. |
|
| TR01 | Transfer of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140409 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |