CN101911498A - Channel coding method of variable length information using block code - Google Patents
Channel coding method of variable length information using block code Download PDFInfo
- Publication number
- CN101911498A CN101911498A CN2008801226741A CN200880122674A CN101911498A CN 101911498 A CN101911498 A CN 101911498A CN 2008801226741 A CN2008801226741 A CN 2008801226741A CN 200880122674 A CN200880122674 A CN 200880122674A CN 101911498 A CN101911498 A CN 101911498A
- Authority
- CN
- China
- Prior art keywords
- matrix
- sign indicating
- indicating number
- generator matrix
- row
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/615—Use of computational or mathematical techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/618—Shortening and extension of codes
Abstract
A channel coding method of variable length information using block code is disclosed. A method for channel-coding information bits using a code generation matrix including 20 rows and A columns corresponding to length of the information bits includes, channel-coding the information bits having ''A'' length using basis sequences having 20-bit length corresponding to columns of the code generation matrix. If ''A'' is 10, individual basis sequences of the code generation matrix correspond to column-directional sequences of a specific matrix composed of 20 rows and 10 columns. The specific matrix is made from 20 rows of the (32, 10) code matrix used for TFCI coding were selected.
Description
Technical field
The present invention relates to the coding method of mobile communication system, more particularly, relate to and use block code that the information of variable-length is carried out the method that chnnel coding is handled effectively.
Background technology
Understand the present invention for convenience of explanation and better, will from several basic coding theories, specifically introduce some notions required for the present invention below.
Usually, represent general binary system error correction coding with [n, k, d], wherein, " n " is that " k " is the information bit that produces before encoding process through the bit number of the code word of coding, and " d " is the minimum range between the code word.In this case, only consider binary code is used for above-mentioned binary system error correcting code, thereby, represent to pass through the sum of the code word of encoding with 2k with the quantity that 2n comes code word point possible in the indication code space.Simultaneously, if it is so important to think that minimum range does not have, then above-mentioned binary system error correcting code also can be represented with [n, k].If do not mention above-mentioned error correction coding in this application, will be appreciated that then " n ", " k " and " d " each value can be set to above-mentioned value.
In this case, above-mentioned error correcting code should not obscured with the block code of the matrix type that is made of the row (that is, X is capable) of X quantity and the row of Y quantity (that is Y row).
Simultaneously, encoding rate R is defined as when the resulting particular value during divided by the bit number of each code word with information bit.In other words, encoding rate R represents by " k/n ", that is, and and R=k/n.
Below, will specifically introduce Hamming distance.
Comprise some bits with different bit values if having the binary code of same number of bits, then above-mentioned Hamming distance represents to have the quantity of the above-mentioned bit of different bit values.Usually, if represent Hamming distance " d ", then can proofread and correct " a " individual mistake with d=2a+1.For example, if one of two code words are 101011, and another is 110010, and then the Hamming distance between these two code words is 3.
Simultaneously, term " minimum range " expression that is used for coding theory is included in the minimum value between two any code words of sign indicating number.Minimum range is regarded as being used to one of criterion of assessing code performance.Long more by the distance between the code word of encoding process generation, then that corresponding code word flase drop survey is low more for the probability of another code word.Consequently, coding efficiency is good more.Estimate all performances of sign indicating number by minimum range between the code word with the poorest performance.In a word, if make the minimum range maximization of special code, then this special code can have good performance.
In next generation mobile communication system, control information transmitting system configuration information and transmitting channel information, thereby it is regarded as the very important information of decision systems performance.Usually, this control information length is short in to use the few system resource of relative populations.Utilization comes above-mentioned control information is encoded to the coding techniques that channel error has very strong resistivity, then with its transmission.In the 3GPP mobile communication system, considered to be used for the multiple encoding scheme of above-mentioned control information, for example, based on the duplication code of Reed-Muller (RM) yard short length block code, tail-biting convolution code and complex code (complex code).
Simultaneously, come to encode as the control information of the 3GPPLTE system of the upgrade version of above-mentioned mobile communication system, then, send the control information after the block encoding being used for by block code.More specifically, be " A " if send the length of (Tx) information bit, (that is, the whole bag of tricks that sends control information of the block code of (20, A) block code) composition is furtherd investigate by 20 row and A row to utilizing for then many developers and company.
(20, A) block code can have various forms.The user is difficult to find optimum form after each coding efficiency of having checked each variable length descriptor bit that is associated with each block code.
Summary of the invention
Therefore, the present invention is directed to a kind of method of utilizing block code to come the information of variable-length is carried out chnnel coding, this method has eliminated basically because the restriction of prior art and one or more problem that shortcoming is caused.
One object of the present invention be to provide a kind of to variable length descriptor effectively (20, A) block coding method.In other words, under the condition of the length that changes information bit in every way, the bit length of the code word behind the coding also changes in every way, the invention provides the combination that is used for supporting effectively variable bit length (20, A) block coding method.
Simultaneously, the quantity of the bit behind the coding can be equal to or less than 20, and can change the quantity of information bit according to variety of way.Therefore, according to following execution mode of the present invention, the invention provides a kind of method of only utilizing some necessary part of the block code that is proposed effectively, the block code that is proposed and length the quantity of long information bit or length the quantity of the coded-bit of length be associated.
In order to realize these purposes and other advantage, and according to purpose of the present invention, as this concrete implements and broadly described, the sign indicating number generator matrix that provides a kind of utilization to comprise 20 row and A row comes information bit is carried out the method for chnnel coding, described A is listed as the length corresponding to described information bit, said method comprising the steps of: utilize corresponding with each row of described sign indicating number generator matrix, length is that the basic sequence of 20 bits is that the described information bit of A carries out chnnel coding to length, wherein, if described A value is " 10 ", each basic sequence of then described sign indicating number generator matrix is corresponding to the sequence of first matrix or the second matrix column direction, wherein, described first matrix comprises 20 row and 10 row, by from being used for transport format combination indicator TFCI information is encoded, selection is except the 2nd in yard matrix of being made up of 32 row and 10 row, the 5th, the 8th, the 11st, the 15th, the 16th, the 21st, the 22nd, the 25th, the 29th, 20 row beyond the 30th and the 31st row are constructed described first matrix, and obtain described second matrix by in the position between the position in the ranks of described first matrix and row at least one carried out displacement.
Preferably, when described A value during greater than " 10 ", each basic sequence of described sign indicating number generator matrix is corresponding to the sequence of the 3rd matrix column direction, wherein, by being added in described first matrix or described second matrix as the sequence of column direction, (A-10) the individual basic sequence in a plurality of other basic sequences generates described the 3rd matrix, and the length of each described other basic sequence is " 20 ", and the maximum that satisfies smallest hamming distance is 4 predetermined condition.
Preferably, when described A value during greater than " 10 ", each basic sequence of described sign indicating number generator matrix is corresponding to the sequence of the 3rd matrix column direction, wherein, by adding (A-10) the individual basic sequence in a plurality of other basic sequences to described first matrix as the sequence of column direction or described second matrix generates described the 3rd matrix, and the length of each other basic sequence is " 20 ", and comprises 4 " 0 " values.
Preferably, described other basic sequence comprises at least one in following: [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0], [1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,0,0], [0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0] and [0,0,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1].
Preferably, if described A value is equal to or less than " 14 ", then based on the sequence order ground of the column direction of the predetermined quantity left side, corresponding with described length A of the 4th matrix column direction sequence each basic sequence corresponding to described sign indicating number generator matrix, wherein, described the 4th matrix is represented by following table
[table]
| i | M i，0 | M i，1 | M i，2 | M i，3 | M i，4 | M i，5 | M i，6 | M i，7 | M i，8 | M i，9 | M i，10 | M i，11 | M i，12 | M i，13 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 2 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 4 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 5 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 |
| 6 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
| 7 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 9 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 11 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 13 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 15 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 16 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 17 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 18 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 19 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
Preferably, if described A value is equal to or less than " 13 ", then based on the sequence order ground of the column direction of the predetermined quantity left side, corresponding with described length A of the 5th matrix column direction sequence each basic sequence corresponding to described sign indicating number generator matrix, wherein, described the 5th matrix is represented by following table:
[table]
| I | M i，0 | ?M i，1 | ?M i，2 | ?M i，3 | M i，4 | M i，5 | M i，6 | M i，7 | M i，8 | M i，9 | M i，10 | M i，11 | M i，12 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 |
| 2 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 4 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 5 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 6 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 7 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 9 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 11 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 13 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 15 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 |
| 16 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 17 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 |
| 18 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 19 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
In another aspect of the present invention, the sign indicating number generator matrix that provides a kind of utilization to comprise 20 row and A row comes information bit is carried out the method for chnnel coding, described A is listed as the length corresponding to described information bit, said method comprising the steps of: utilize corresponding with each row of described sign indicating number generator matrix, length is that the basic sequence of 20 bits is that the described information bit of A carries out chnnel coding to length, wherein, when if described A value is " 10 ", each basic sequence of then described sign indicating number generator matrix is corresponding to the sequence of first matrix or the second matrix column direction, wherein, by being carried out displacement, in the position between the position in the ranks of described first matrix and row at least one obtain described second matrix.And described first matrix is represented by following table:
[table]
| 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 |
| 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 |
| 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
| 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 |
| 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 |
| 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
Preferably, if described A value greater than " 10 ", each basic sequence of described sign indicating number generator matrix is corresponding to the sequence of the 3rd matrix column direction, wherein, generate described the 3rd matrix when adding in described first matrix or described second matrix as the sequence of column direction (A-10) the individual sequence in a plurality of sequences, and described a plurality of sequence is [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0], [1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,0,0], [0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0] and [0,0,1,1,1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1].
Preferably, if described A value is equal to or less than " 14 ", be that the sequence order ground of column direction of predetermined quantity benchmark, corresponding with described length A is corresponding to each basic sequence of described sign indicating number generator matrix then with the left side of the 4th matrix column direction sequence, wherein, described the 4th matrix is represented by following table:
[table]
| i | M i，0 | M i，1 | M i，2 | M i，3 | M i，4 | M i，5 | M i，6 | M i，7 | M i，8 | M i，9 | M i，10 | M i，11 | M i，12 | M i，13 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 2 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 4 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 5 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 |
| 6 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
| 7 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 9 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 11 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 13 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 15 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 16 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 17 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 18 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 19 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
Preferably, if described A value is equal to or less than " 13 ", be that the sequence order ground of column direction of predetermined quantity benchmark, corresponding with described length A is corresponding to each basic sequence of described sign indicating number generator matrix then with the left side of the 4th matrix column direction sequence, wherein, described the 4th matrix is represented by following table:
[table]
| I | ?M i，0 | ?M i，1 | ?M i，2 | ?M i，3 | M i，4 | ?M i，5 | ?M i，6 | ?M i，7 | M i，8 | M i，9 | M i，10 | M i，11 | M i，12 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 |
| 2 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 4 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 5 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 6 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 7 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 9 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 11 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 13 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 15 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 |
| 16 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 17 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 |
| 18 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 19 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
Preferably, described information bit comprises in following at least one: channel quality information (CQI) bit, precoding matrix indicators (PMI), channel sequence designator (RI) and ACK/NACK data.
Preferably, send information bit after the described chnnel coding via Physical Uplink Control Channel (PUCCH).
Should be appreciated that above general introduction of the present invention and following detailed description are exemplary and indicative, it is intended to the further explanation that the invention provides to being protected by claim.
According to above-mentioned execution mode of the present invention, the present invention will be used for the TFCI of traditional 3GPP system, and (Transport Format Combination Indicator: transport format combination indicator) part of the sign indicating number generator matrix of information coding is carried out multiplexing, make its can easily realize (20, k) block encoding.Consequently, maximum between the code word of generation or minimum range increase, thereby have improved the performance of system.
Description of drawings
Accompanying drawing is included so that further understanding of the invention to be provided, and accompanying drawing shows embodiments of the present invention, and is used from explanation principle of the present invention with specification one.
In the accompanying drawings:
Fig. 1 is an illustration generates the flow chart of the method for (20,10) block code effectively according to basis (32,10) the TFCI information code of an embodiment of the invention;
Fig. 2 is an illustration generates the concept map of the method for (20,10), (18,10) or (16,10) sign indicating number generator matrix according to the basic code of basis (32, the 10) form of an embodiment of the invention;
Fig. 3 is an illustration generates (20,10) sign indicating number and utilizes (20,10) sign indicating number to generate each the concept map of method of (18,10) sign indicating number and (16,10) sign indicating number according to the basic code of basis (32, the 10) form of another embodiment of the present invention;
Fig. 4 is an illustration according to the basis (32 of another embodiment of the present invention, 10) the basic code generator matrix of form generates (20,10) sign indicating number generator matrix, utilization (20,10) the sign indicating number generator matrix generates (18,10) sign indicating number generator matrix and utilization (18,10) the sign indicating number generator matrix generates the concept map of the method for (16,10) sign indicating number generator matrix;
Fig. 5 is an illustration according to the basis (32 of another embodiment of the present invention, 10) the basic code generator matrix of form generates (20,10) sign indicating number generator matrix, utilization (20,10) the sign indicating number generator matrix generates (16,10) sign indicating number generator matrix and utilization (16,10) the sign indicating number generator matrix generates the concept map of the method for (18,10) sign indicating number generator matrix;
Fig. 6 and Fig. 7 show respectively according to of the present invention (20, A) and (18, coding efficiency A).
Embodiment
To describe preferred implementation of the present invention in detail below, wherein, example shows the example of these execution modes in the accompanying drawings.In the accompanying drawings, will use identical Reference numeral number to refer to identical or similar part as far as possible.
Before explanation the present invention, should be noted that, disclosed most of term among the present invention is all corresponding to generic term as known in the art, but the applicant has selected some terms as required for use, and will disclose these terms after a while in the following description of the present invention.Therefore, preferably, should understand these terms based on the term implication in the present invention of applicant's definition.For example, though relating to, following specification is applied to 3GPP LTE (3rd generation partnership project longTerm Evolution, third generation partner program Long Term Evolution) the concrete example of system, but the present invention not only can be applicable to above-mentioned 3GPP LTE system, need also to can be applicable to use block code carries out that chnnel coding handles to the control information of variable-length other communication system arbitrarily.
Understand the present invention for convenience of explanation and better, will omit ordinary construction as known in the art and device, perhaps represent by block diagram or flow chart.In the accompanying drawings, will use identical Reference numeral to indicate identical or similar part as much as possible.
According to an aspect of the present invention, the invention provides a kind of to variable length descriptor carry out effectively (20, the A) method of block encoding.For this reason, the generator matrix that the present invention is based on the block code that is used for legacy system is constructed sign indicating number, makes it can reduce the time of Code And Decode.More specifically, the present invention handles in the search of the generator matrix that is used for the long information of length is encoded increases a certain conditions, makes that it can be rapidly and search for large-sized generator matrix effectively.
Simultaneously, according to another aspect of the present invention, the invention provides a kind of only use effectively the block code proposed, with length some necessary method partly of being associated of the quantity of the coded-bit of the quantity of long information bit or length-specific.For this reason, when variable length descriptor was grouped coding, the present invention realized the generator matrix corresponding with each length substantially and publicly, makes it can carry out encoding process effectively.In other words, according to large-sized generator matrix based on the length of maximum fault information, the present invention has constructed and has been used to contrast the specific generator matrix that the short or long information of maximum length is encoded, and makes it being used for farthest keeping common point between the generator matrix of each length.
According to first method that is used to realize above-mentioned execution mode, the present invention optimizes each generator matrix according to the quantity of each information, and the length of each information is equal to or less than maximum length, makes it can construct optimum generator matrix.According to second method that is used to realize above-mentioned execution mode, when being configured to the generator matrix that information is encoded, the length of this information is equal to or less than maximum length, utilizes nested structure, and the information that length of the present invention is long also can be configured to the generator matrix of short information of length.According to third party's method, the present invention can utilize maximum sized nested structure to come to make it can construct the generator matrix of mixed structure at the optimum generator matrix of each message length structure.
According to an above-mentioned aspect of the present invention, according to channel coding method of the present invention will (20, A) block code expands to the scope of (20,14) block code, and uses the result after the expansion to come the information and executing chnnel coding of length as A.
In first handled, the present invention generated (20,10) sign indicating number from (32, the 10) sign indicating number that is used for coding transmission format combination indicator (TFCI) information, and it specifies and will be introduced below.
In second handled, if the length of information bit (that is, information bit length) is equal to or greater than 10 bits, then the present invention added basic sequence in (20,10) sign indicating number according to the quantity of information bit, makes maximum can generate (20,14) sign indicating number.It specifies and will be introduced below.
In the 3rd handled, the present invention proofreaied and correct to improve performance (20,14) sign indicating number.
Simultaneously, the present invention will openly can generate the block coding method of the code word of 18 bits or 16 bit lengths based on above-mentioned (20,14) sign indicating number, and it specifies and will be introduced below.
In the chnnel coding that the present invention can suitably be applied to carry out when the capable physically control channel (PUCCH) of 3GPP LTE system is gone up transmission CQI (channel Quality Information, channel quality information) information.But range of application of the present invention is not limited only to above-mentioned example, and it can also be applied to and need carry out in the various systems of chnnel coding the control information of variable-length.
First aspect-(20, A) block encoding
(1) generation of first step-(20,10) block code
This execution mode of the present invention provides the generator matrix of Reed-Muller (PRM) sign indicating number of the punching that is used for next generation mobile communication system.This PRM sign indicating number generator matrix is based on the generator matrix that is used for transport format combination indicator (TFCI) information is carried out (32,10) sign indicating number of chnnel coding, thereby comes TFCI information is punched according to the length of code word behind the coding.
(32,10) TFCI information code multiplexing has a plurality of advantages.At first, the TFCI information code is based on that Reed-Muller (RM) sign indicating number designs, and makes that the TFCI sign indicating number after the punching can have amended Reed-Muller (RM) code structure.This advantage based on the sign indicating number of Reed-Muller (RM) is that it can promptly be decoded by quick Hadamard transformation during decoding processing.Secondly, variable length descriptor bit and variable length code bit are supported in the TFCI coding method.In this way, can change the length of information bit or the length of coded-bit, make it possible to satisfy well the CQI transmission requirements of 3GPP LTE according to multiple mode.
Following table 1 shows (32,10) sign indicating number generator matrix that is used for the TFCI information of 3GPP 99 versions is carried out chnnel coding.At this moment, (32,10) sign indicating number generator matrix has generated length and the value d with 32 bits
Min=12 certain code word.
[table 1]
In the following description, (32, the 10) block code shown in the table 1 is called TFCI information code or TFCI information coding groups sign indicating number.
Usually, as known in the art, though other position that the position between position in the ranks or row is grouped in the sign indicating number replaces, the code word that is generated does not have difference on performance.Following table 2 show utilize aforementioned advantages, with the specific block code of (32,10) the block code equivalence that is used for above-mentioned TFCI information coding.
[table 2]
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | |
| g 10by20[1] | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 |
| g 10by20[2] | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| g 10by20[3] | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| g 10by20[4] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by20[5] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by20[6] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| g 10by20[7] | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
| g 10by20[8] | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by20[9] | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
| g 10by20[10] | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 |
It can be seen that from the block code shown in the table 2 position of row and column that is used for (32,10) sign indicating number of TFCI coding is changed and is other position, and the position between some row (perhaps based on the position between some row of TFCI information code) exchanges each other.
In other words, according to this execution mode of the present invention, can be with (32,10) punching of the row of 12 in the TFCI information code (table 1) of form or its equivalent matrix (table 2) is fallen, perhaps from (32,10) select 20 row in the TFCI information code (table 1) of form or its equivalent matrix (table 2), thereby constructed (20,10) block code.In this case, from the viewpoint of the block code of table 2,12 row punchings perhaps can be able to be selected 20 row.First kind of situation of use table 1 and second kind of situation of use table 2 do not have difference on the performance of pattern.Understand the present invention for convenience of explanation and better,, suppose that then the present invention uses the form (referring to table 2) of the equivalence of TFCI information code if in above-mentioned specification, do not mention.
Simultaneously, generated and be used for (32,10) sign indicating number that TFCI information is encoded based on Reed-Muller (RM) sign indicating number.In this case, in order to realize the performance of error correction, it is important to search for for above-mentioned (32,10) sign indicating number and make code word can have the longest distance (d
Min) the punching pattern.
Execution mode is compared therewith, will specifically introduce the exhaustive search of the optimum punching pattern in the generator matrix that can search for (32, the 10) sign indicating number that is used for the TFCI coding below.The quantity of supposing the row of the generator matrix that will punch in (32 * 10) matrix (also can by (32*10) matrix notation) is set to " P ", and then the quantity of all available punching patterns is used
Expression.At this moment,
The number of times of the situation of p row is selected in expression from 32 row.
For example, if " p " value is 12 (p=12), then there is different (10 * 20) individual generator matrixes (that is,
792,840 (10 * 20) generator matrixes), with the information (that is, 2 of 10 bits
10=1,024 message segment) is encoded into the code word of 20 bits.Calculate the smallest hamming distance (d between the code word that generates by single matrix
Min), make at above-mentioned smallest hamming distance (d
Min) in find generator matrix with peak.If being used for formation, the punching pattern has maximum (d
Min) value generator matrix, then should the punching pattern be considered to be last pattern that finally finds.The associative operation of each step is as follows.
Step 1: with 12 row punchings arbitrarily of (32*10) matrix, thus structure
792,840 (20 * 10) generator matrixes.
Step 2:, generate by (2 in each of 840 generator matrixes from 225,792
10=1,024) 1024 code words of individual information unit establishment, and the smallest hamming distance between the compute codeword.
Step 3: the present invention searches for the punching pattern of expectation from following generator matrix, have maximum in the smallest hamming distance of this generator matrix between code word.
But, generate a large amount of calculating of process need of optimum (20,10) block code based on above-mentioned steps, cause using very inconvenience.
Therefore, this execution mode of the present invention increases specific constraints in the processing of determining the punching pattern, make it reduce to be used to obtain optimum (d
Min) scope of search volume of value.
Then, will specifically introducing more effectively below, search has generated d
MinThe method of the generator matrix of (20,10) sign indicating number of the code word of=d.Hypothetical target (d
Min) value represents with d, each row vector g of (20,10) sign indicating number generator matrix
10by20Hamming weight w (the g of [i] (1≤i≤10)
10by20[i]) have some requirement, shown in following equation 1.
[equation 1]
d≤w(g
10by20[i]≤20-d)
i＝0，1，...，10
I ≠ 6 (all being 1 in this row vector)
For example, if the value of d is 6 (d=6), then equation 1 is by following formula 2 expressions.
[equation 2]
6≤w(g
10by20[i])≤14
Therefore, if the above-mentioned restriction of equation 2 is increased to each row vector g of (10*20) matrix that from above-mentioned exhaustive search is handled, generates
10by20In [i], then the result of Zeng Jiaing can reduce to search for and generated d
MinThe quantity of the search volume of the generator matrix of=6 code word
Usually,, known in the artly be the maximum (d of (20,10) sign indicating number based on various citing documents
Min) value is 6, its concrete introduction is disclosed in " The Theory of Error-Correcting Codes (by F.J.Mac Williams and N.J.A Sloane) ".Therefore, with d
Min=6 condition is applied to the condition of equation 1, makes the present invention can use following method to generate (20,1) sign indicating number.
Fig. 1 is an illustration according to the flow chart of the method for (20,10) block code that generates effectively from (32,10) TFCI information code of an embodiment of the invention.
With reference to Fig. 1, at step S101, channel coding method according to the present invention at random generates (20,10) block code from the TFCI information code of (32,10) form.Then, at step S102, channel coding method judges whether the weights of the basic sequence corresponding with each row satisfy the condition of equation 2.At this moment, if do not satisfy the condition of equation 2, then channel coding method is back to above-mentioned steps S101.If satisfy the condition of equation 2, then channel coding method enters next step S103.Channel coding method uses (20, the 10) sign indicating number that generates in step S103 to generate 1024 code words.Channel coding method is judged these 1024 code words (d that whether satisfies condition
Min=6).At this moment, if do not satisfy condition (d
Min=6), then channel coding method is back to step S101.If satisfy condition (d
Min=6), then channel coding method enters step S105, thereby in step S105, calculates weights and distribute.Then, if do not determine that in step S106 optimum weights distribute, then channel coding method is back to step S101.Otherwise, distribute if in step S106, determined optimum weights, then channel coding method enters step S107, thereby selects in the optimum matrix pattern one in step S107.
From the above-mentioned steps of Fig. 1 as can be seen, minimum range d
MinMaximum be 6 (that is d,
Min=6), can generate and satisfy d
MinThe sum of the generator matrix of the code word of=6 condition is 360.The maximum d of (20,10) sign indicating number
MinValue is 6.As shown in Figure 1, can generate with the method shown in this execution mode and have maximum d
MinValue is 6 code word, makes the present invention can use the aforesaid way shown in this execution mode more effectively to search for to be used to (20,1) sign indicating number generator matrix that generates optimum code word.
At this moment, determine optimum code word by the minimum range characteristic.In other words, minimum range is long more, and then code performance is good more.The quantity of the code word corresponding with minimum range is few more, and then code performance is good more.Therefore, optimum sign indicating number is as follows.If the maximum of minimum range is provided, and represent that the quantity of the code word of minimum range is minimum value, then corresponding sign indicating number is confirmed as optimum code.More particularly, represent that by multinomial then the minimum exponent number except constant term is represented by maximum, and the coefficient of corresponding exponent number is represented by minimum value if the Hamming weights of special code distribute.Suppose to have two sign indicating numbers, and the distribution of the Hamming weights of two sign indicating numbers is represented that by multinomial then the performance of these two sign indicating numbers can compare based on their exponent number and coefficient.In other words, if the minimum exponent number that the Hamming weights of first yard distribute is higher than the minimum exponent number that the Hamming weights of second sign indicating number distribute, then first yard has higher performance.If the minimum exponent number of first yard equals the minimum exponent number of second sign indicating number, then the coefficient with the minimum exponent number of the correspondence of first yard compares with the coefficient of the corresponding minimum exponent number of second sign indicating number, makes the corresponding sign indicating number with lower coefficient have higher performance.Simultaneously, when the multinomial that the Hamming weights of two sign indicating numbers are distributed compares each other,, then compare performance with two sign indicating numbers that are compared to each other with this minimum exponent number and next exponent number if minimum exponent number equals the coefficient of minimum exponent number.
When using said method in Fig. 1, the present invention can utilize punching to handle and obtain 360 (that is d, from the TFCI information code
Min=6) individual (10*20) matrix.Simultaneously, if when calculating the Hamming weights of above-mentioned generator matrix and distributing, the Hamming weights that then calculate distribute can be divided into following 3 kinds of situations (being illustrated in respectively in the equation 1,2,3).Represent the 1st kind of situation in 3 kinds of situations with following multinomial 3.Represent the 2nd kind of situation in 3 kinds of situations with following multinomial 4.Represent the 3rd kind of situation in 3 kinds of situations with following multinomial 5.
[equation 3]
A
A1，20(x)＝x
20+90x
14+255x
12+332x
10+255x
8+90x
6+1
[equation 4]
A
A2，20(x)＝x
20+94x
14+239x
12+356x
10+239x
8+94x
6+1
[equation 5]
A
A3，20(x)＝x
20+98x
14+223x
12+380x
10+223x
8+98x
6+1
Following table 3 shows the exemplary generator matrix (A of the Hamming weights distribution of satisfying equation 3
A1,20(x)).Following table 4 shows the exemplary generator matrix (A of the Hamming weights distribution of satisfying equation 4
A2,20(x))).Following table 5 shows the example (A of (10*20) generator matrix of the Hamming weights distribution of satisfying equation 3
A3,20(x)).(10*20) matrix that the whole punching patterns that distributed by the Hamming weights with equation 3 to 5 generate has identical error correcting capability aspect the minimum range.
[table 3]
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | |
| g 10by20[1] | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 |
| g 10by20[2] | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 |
| g 10by20[3] | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 |
| g 10by20[4] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
| g 10by20[5] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by20[6] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| g 10by20[7] | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 |
| g 10by20[8] | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 |
| g 10by20[9] | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 |
| g 10by20[10] | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
[table 4]
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | |
| g 10by20[1] | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 |
| g 10by20[2] | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| g 10by20[3] | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 |
| g 10by20[4] | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
| g 10by20[5] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
| g 10by20[6] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| g 10by20[7] | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 |
| g 10by20[8] | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
| g 10by20[9] | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| g 10by20[10] | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
[table 5]
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | |
| g 10by20[1] | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 |
| g 10by20[2] | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 |
| g 10by20[3] | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| g 10by20[4] | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| g 10by20[5] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by20[6] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| g 10by20[7] | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by20[8] | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| g 10by20[9] | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 |
| g 10by20[10] | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 |
In fact, there is the multiple generator matrix that identical Hamming weights distribute that has.If found all matrix by the exhaustive search processing, then had 360 generator matrixes.
At the U.S. Provisional Application No.61/016 that submits to by the applicant identical with the present invention, 492, denomination of invention discloses above-mentioned 360 punching patterns in the appendix " A " of " GENERATION METHOD OF VARIOUS SHORT LENGTHBLOCK CODES WITH NESTED STRUCURE BY PUNCTURING A BASECODE ".Particularly, index based on the row after the punching of table 2 is disclosed in appendix " A ".For convenience of explanation, omitted above-mentioned index here.
If distributing according to the Hamming weights classifies to 360 punching patterns, then can obtain following result.(20,10) sign indicating number generator matrix for the Hamming weights of representing equation 3 distribute always co-exists in 290 punching patterns.In addition, (20,10) sign indicating number generator matrix for the Hamming weights of representing equation 4 distribute always co-exists in 60 punching patterns.Simultaneously, (20,10) sign indicating number generator matrix for the Hamming weights of representing equation 5 distribute always co-exists in 10 punching patterns.
Will be according to the following pattern in 360 punching patterns of the present invention as example.
Following table 6 shows one of 60 punching patterns of the Hamming weights distribution of representing equation 4:
[table 6]
| 10 * 32 |
1 | ?2 | 3 | 4 | ?5 | ?6 | ?7 | ?8 | ?9 | 10 | ?11 | ?12 | ?13 | ?14 | ?15 | ?16 | ?17 | ?18 | ?19 | ?20 | ?21 | ?22 | ?23 | ?24 | 25 | ?26 | ?27 | ?28 | ?29 | ?30 | ?31 | ?32 |
| Table 2 | 0 | ?0 | 1 | 1 | ?1 | ?0 | ?1 | ?1 | ?0 | 0 | ?1 | ?1 | ?1 | ?1 | ?0 | ?1 | ?0 | ?1 | ?1 | ?1 | ?0 | ?1 | ?1 | ?0 | 1 | ?1 | ?0 | ?1 | ?1 | ?0 | ?1 | ?0 |
Punching pattern shown in the table 6 is corresponding to U.S. Provisional Application No.61/016, the 6th index of the Table A .2 of 492 appendix " A ".In this case, the value of table 6 " 0 " the expression row corresponding with the position reset are perforated.The value of table 6 " 1 " the expression row corresponding with the position set are not perforated, and are selected for (20,10) block code.
Be applied under the situation of table 2 in the punching pattern with table 6, it the results are shown in the following table 7.
[table 7]
| Index | ?M i，0 | M i，1 | M i，2 | ?M i，3 | M i，4 | ?M i，5 | M i，6 | M i，7 | M i，8 | M i，9 | (20,10) are punched |
| 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | |
| 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | |
| 2 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | |
| 3 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | |
| 4 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | |
| 5 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | |
| 6 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | |
| 7 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | |
| 8 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | Punching |
| 9 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | Punching |
| 10 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | |
| 11 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
| 12 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | |
| 13 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | Punching |
| 15 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | |
| 16 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | Punching |
| 17 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | |
| 18 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 |
| 19 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | |
| 20 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | Punching |
| 21 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | |
| 22 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | |
| 23 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | Punching |
| 24 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | |
| 25 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | |
| 26 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | Punching |
| 27 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | |
| 28 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | |
| 29 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | Punching |
| 30 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | |
| 31 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | Punching |
In this case, compare with table 2, the direction of the row and column of table 7 changes, and table 4 has the identical meaning with table 2.Row after the right side of table 4 shows 12 punchings in the sequence of each line direction.Consequently, can represent (20,10) block code of being generated by table 8.
[table 8]
Simultaneously, almost there is not difference between the row order of table 7 or table 8 and the matrix exponent number based on the TFCI coding of 3GPP.As mentioned above, though according to above-mentioned coding theory, the position of each row is changed and is the another location, and the performance between the code word that is generated does not have difference.If the row order according to mode adjustment form 7 identical with TFCI sign indicating number matrix or table 8 then can obtain following table 9.
[table 9]
As mentioned above, the row order of having only table 9 is different with table 7, but the equating fully of the residue character of table 6 and table 4.The advantage of the method for expressing of table 9 is, at the punching time durations from (20,10) sign indicating number to (18,10) sign indicating number, latter two bit is perforated.To introduce its particular content below.
The generation of (2) second steps-(20,14) block code
For according to this execution mode (20, A) block code supposes to represent that the CQI value of the channel quality information (CQI) of 3GPP LTE system is applied to be used for PUCCH transmission channel coding method.Simultaneously, in above-mentioned first step, the bit number of the CQI information of 3GPP LTE system can be defined as in the scope of 4 bit to 10 bits, makes that it can largest extension be (20,10) block code.But under the situation of mimo system, the amount of bits of CQI information as required can be greater than 10 bits.But transmission (Tx) quantity of actual CQI is determined by CQI generation method.For encoding process, the present invention can consider to support the method for the full detail amount of bits from 4 bits to 14 bits.
Therefore, will introduce (20,14) block coding method below, it can support maximum 14 bits by adding the row corresponding with information bit to above-mentioned (20,10) block code.
In order in exhaustive search, to search for the row that added, must carry out a large amount of calculating.For example, in (20, the 10) block code of single file being added to table 9, must search 2
20≈ 10
24The number of times of enormous quantity.Therefore, it is inefficent or unfavorable carrying out exhaustive search in all situations.
In this step, should be mentioned that the 6th row with table 6 are made as " 1 ", and used as basic sequence.Therefore, if the row that add must satisfy minimum range " d ", then the minimum number of " 0 " must be equal to or greater than " d ".In this example, the quantity of " 0 " equals the minimum range between code word.
Particularly, the difference between row that added and original the 6th row be made up of " 1 " is represented two distances between the code word, makes the quantity that is included in " 0 " in the row that added equal the distance between the code word.
Usually, the maximum of minimum range that can be used for (20,10) sign indicating number is 6.In the present invention, the minimum value of ultimate range that can be used for corresponding to (20,11) sign indicating number of the extended version of (20,10) sign indicating number is 4.More particularly, can represent characteristic with table 10 based on the maximum/minimum range of the various information bit quantity of 20 bit codewords.
[table 10]
Therefore, this execution mode of the present invention has offered a kind of method of adding row, and it is " 4 " that this method allows the maximum/minimum range of the row of interpolation.According to this method of adding row, the row that will have 4 " 0 " values at least add in the row that added.
In order to minimize searching times, suppose that the row of the interpolation of this execution mode comprise 4 " 0 " values (that is 4 " 0 " value).In this manner, if the row that add comprise 4 " 0 " values and 16 " 1 " values, then can construct the row of this interpolation according to variety of way.Table 11 shows the representational example of the row of this interpolation.If (20,10) of table 9 sign indicating number is expanded to (20,14) sign indicating number, then can obtain table 11.
[table 11]
| i | ?M i，0 | ?M i，1 | M i，2 | M i，3 | M i，4 | M i，5 | ?M i，6 | ?M i，7 | ?M i，8 | M i，9 | M i，10 | M i，11 | M i，12 | M i，13 |
| 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
| 2 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 3 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 5 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 6 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 8 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 |
| 9 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
| 11 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | |
| 12 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 13 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 16 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 17 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 18 | 0 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 19 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 22 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 23 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 25 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 26 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 27 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 31 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
With reference to table 11, the row of 4 interpolations are represented by 4 row that are positioned at the right side.In the row of each interpolation, " 0 " is represented with thick line.
Modification/the optimization of (3) third step---block code
In an embodiment of the invention, according to large scale generator matrix based on the length of maximum fault information, the present invention has constructed and has been used to contrast the specific generator matrix that the shorter or longer information of maximum length is encoded, and makes this specific generator matrix farthest to keep common ground between at the generator matrix of each length.
According to first method that is used to realize above-mentioned execution mode, the present invention optimizes each generator matrix (length of this information is equal to or less than maximum length) according to the quantity of each information, makes it can construct optimum generator matrix.According to second method that is used to realize above-mentioned execution mode, when the generator matrix that is configured to information is encoded (length of this information is equal to or less than maximum length), the information that length of the present invention is long can also use nested structure to be configured to the generator matrix of short information of length.According to third party's method, the present invention can use maximum sized nested structure to construct optimum generator matrix at various message lengths, makes it can construct the generator matrix of mixed structure.
At first, table 12 expression distributes based on the Hamming weights of the information bit length shown in the equation 1.
[table 12]
In table 12, assign to represent smallest hamming distance with shadow part.For convenience of explanation, the present invention only relate to that minimal information bit number k is minimum and be 4 (that is) specific situation, k 〉=4, thus omitted the residue situation of representing with k＜3.Simultaneously, each " k " value can be divided into groups according to minimum range.More particularly, the situation of k=4～6 can be that 8 group is classified with minimum range, and the situation of k=7～10 can be that 6 group is classified with minimum range.The situation of k=11～14 can be that 4 group is classified with minimum range.Cognoscible is to have shown above-mentioned sorted result in table 10.
In this step, the present invention has constructed the sign indicating number with low encoding rate, and wherein, the sign indicating number of structure makes the minimum range between the code word reach maximum.Simultaneously, the present invention can easily construct above-mentioned sign indicating number with simple method.
For example, if the information bit length of table 4 is made as 4, then prior art is selected preceding 4 row, and controls selected 4 row sequentially corresponding to left column.But, in fact,, can construct the sign indicating number of expectation though from 14 row, select 4 row arbitrarily.But, preferably, make the minimum range maximization of sign indicating number.When selection 4 row from 14 row,, might be able to not remain on obtainable minimum range " 8 " when selecting preceding 4 to be listed as though from No.7 to No.14 row, selected any 4 row.But with reference to table 12 and 10, row 10 (that is, the 10th row) and row 5 (that is, the 5th row) expression minimum range are 8 group, and making can be from selecting any 4 row in a plurality of row of row 6 (that is the 6th row).
Therefore, when selecting to be listed as according to each information bit, the present invention can select optimum row from a plurality of row of minimum range characteristic, and the minimum range of each row of these a plurality of row is equal to or greater than can be by other minimum range of corresponding information bit acquisition.
For example, for the information bit optimization in will from 11 to 14 scopes, the present invention is at first fixing with the 1st to the 10th row (that is, row 1～10), and distributes according to the Hamming weights of information bit with reference to following table 13,14 and 15.
[table 13]
[table 14]
[table 15]
Distribute by shadow part expression table 13 to the best weight value of table 15 of assigning to.The weights (that is the weights that, have minimum range) of the representation of optimum performance except " 0 " are very high.The quantity of the code word corresponding with above-mentioned weights is few more, and then performance is high more.If the minimum weights performance of a sign indicating number equals the minimum weights performance of another yard, then determine the performance of sign indicating number by the characteristic of the minimum weights (that is the second minimum weights) of the next one.In other words, next minimum weights are high more, and then performance is high more.If the second minimum weights of two sign indicating numbers are equal to each other, the quantity of the code word of structure corresponding weight value is few more, and then performance is high more.
If so that each information bit Length Indication optimal performance, then represent the row that distributed with following table 16 by repeating that table 13 to 15 above-mentioned processing carries out that row distribute.The present invention only relates to information bit length and is at least 4.Original information bits is fixed in the scope of 3 bits, and searches for optimum column in the scope more than or equal to 4 bits, so that at the optimum column of being searched for shown in the following table 16.
[table 16]
If " k " value is equal to or less than 3, suppose o'clock must consider displacement between row that the optimum column that each information bit then has been shown distributes in table 16 in k≤3.Shown in table 16, the row of the information bit that is used for increasing gradually do not comprise the row of distributing to undersized information bit all the time.In other words, the row of distributing to big information bit do not keep comprising the nested structure of the row of distributing to undersized information bit.
If do not keep nested structure, then assignment of allocation is to the row of each information bit apart from each other, and this causes using extremely inconvenience.Therefore, the invention provides a kind of method that keeps optimum allocation and form nested structure simultaneously substantially.
At first, with specifically be presented in will be listed as in the group with identical minimum range between the order change into another the order displacement.For example, first group comprises 4 row 11,12,13 and 14 with identical minimum range 4.In first group, 4 row 11,12,13 and 14 order become another order of row 11,13,14 and 12.In the mapped mode of optimum, if the k value is that 11 (that is, k=11), then optimum mapped mode is represented with [1～10]+[11].(that is, k=12), then optimum mapped mode is represented with [1～10]+[11,13] if the k value is 12.(that is, k=13), then optimum mapped mode is represented with [1～10]+[11,13,14] if the k value is 13.(that is, k=14), then optimum mapped mode is represented with [1～10]+[11,12,13,14] if the k value is 14.
As mentioned above, if distribute with " k " value order execution pro rata row, then Lie order can change to implement the optimum allocation pattern, and is as shown in table 17 below.
[table 17]
| i | ?M i，0 | ?M i，1 | M i，2 | ?M i，3 | ?M i，4 | M i，5 | M i，6 | M i，7 | M i，8 | ?M i，9 | M i，10 | M i，11 | M i，12 | M i，13 |
| Original row | [1] | [2] | [3] | [5] | [4] | [6] | [8] | [9] | [10] | [7] | [11] | [13] | [14] | [12] |
| 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| 2 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 |
| 3 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 5 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 6 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 8 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 |
| 9 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 |
| 11 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 12 | 1 | 0 | 1 | 0 | 1 | 1 | I | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 13 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 16 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 17 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 18 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 19 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 22 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 0 |
| 23 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
| 25 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
| 26 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 |
| 27 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 |
| 31 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 |
Need not superfluous words,, change the method for row order when also having the multiple optimum allocation pattern that satisfies table 16 except the method for table 17.Except the method for table 16 and 17, following table 18 shows another kind of method.
[table 18]
| i | ?M i，0 | ?M i，1 | M i，2 | M i，4 | M i，3 M i，5 | ?M i，8 | M i，9 | ?M i，6 | ?M i，7 | M i，12 | M i，10 | M i，13 | M i，11 |
| Original row | [1] | [2] | ?[3] | [5] | [4] [6] | [9] | [10] | [7] | [8] | [13] | [11] | [14] | [12] |
| 0 | 1 | 0 | 0 | 0 | 0 1 | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
| 2 | 1 | 1 | 0 | 0 | 0 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 1 |
| 3 | 0 | 0 | 1 | 0 | 0 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 5 | 0 | 1 | 1 | 0 | 0 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 6 | 1 | 1 | 1 | 0 | 0 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 8 | 1 | 0 | 0 | 0 | 1 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 1 |
| 9 | 0 | 1 | 0 | 0 | 1 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 |
| 11 | 0 | 0 | 1 | 0 | 1 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 12 | 1 | 0 | 1 | 0 | 1 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 13 | 0 | 1 | 1 | 0 | 1 1 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 16 | 0 | 1 | 0 | 1 | 0 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 17 | 1 | 1 | 0 | 1 | 0 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 18 | 0 | 0 | 1 | 1 | 0 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 19 | ?1 | ?0 | ?1 | ?1 | 0 1 | ?0 | ?1 | 0 | 1 | 1 | ?1 | 1 | 1 |
| 22 | ?0 | ?0 | ?0 | ?1 | 1 1 | ?0 | ?0 | 0 | 1 | 1 | ?1 | 1 | 0 |
| 23 | ?1 | ?0 | ?0 | ?1 | 1 1 | ?0 | ?1 | 1 | 1 | 1 | ?1 | 1 | 0 |
| 25 | ?1 | ?1 | ?0 | ?1 | 1 1 | ?0 | ?1 | 1 | 0 | 1 | ?0 | 1 | 1 |
| 26 | ?0 | ?0 | ?1 | ?1 | 1 1 | ?1 | ?0 | 0 | 0 | 1 | ?0 | 1 | 1 |
| 27 | ?1 | ?0 | ?1 | ?1 | 1 1 | ?0 | ?0 | 1 | 1 | 0 | ?0 | 1 | 0 |
| 31 | ?0 | ?0 | ?0 | ?1 | 0 1 | ?0 | ?0 | 1 | 0 | 0 | ?0 | 1 | 0 |
Though with information bit quantity " k " pro rata order assignment row, perhaps order assignment the row that begin from the left side,, if generator matrix is constructed to then realize optimum allocation shown in table 17 or 18.
According to another implementation of the invention, if the quantity of information bit is equal to or less than 4, then the position of the sequence of column direction (basic sequence) can become another.More specifically, with reference to table 11, according to this execution mode, the 6th row (that is M, of table 11
I, 5Whole bits of row) be set to " 1 ", make the 6th row be regarded as basic sequence.This basic sequence greatly helps whole code words of corresponding bits.Therefore, from the viewpoint of corresponding bits, the basic sequence with multiple weights is used in expectation.
But, all have several code words to carry out XOR (XOR) computing in the code word, thereby must consider the result of their combination.Therefore, in order to reduce the quantity of combined situation, all be that the basic sequence of value " 1 " moves to prostatitis with each of whole bits, caused the increase of contribution rate (contributionrate).In this manner, if the more a spot of bit (promptly; little amount of bits) to data is encoded, then the present invention can consider that with each of whole bits all be " 1 " basic sequence move to foremost said method, the result after moving is represented by following table 19.
[table 19]
| i | ?M i，0 | ?M i，1 | ?M i，2 | ?M i，3 | M i，4 | ?M i，5 | ?M i，6 | ?M i，7 | ?M i，8 | M i，9 | M i，10 | M i，11 | M i，12 | M i，13 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 2 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 4 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 5 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 |
| 6 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 |
| 7 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 9 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 11 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 13 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 15 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 |
| 16 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 17 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 18 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
| 19 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 |
With reference to table 19, the 6th sequence in the basic sequence of original column direction (that is, the value of each bit of the 6th sequence is " 1 ") is moved to the position of first basic sequence, the order of other sequence does not become another order.
Following table 20 shows the performance based on the minimum range of the notion of table 19.
[table 20]
According to this execution mode of table 20, if the quantity of information bit is 1 or 2, then performance becomes better.
According to coding theory, though the position of the row or column of generator matrix is replaced, generator matrix has identical sign indicating number characteristic, has therefore omitted above-mentioned modified example for convenience of explanation here.
But if in the generator matrix of the information bit of supporting variable-length, basic sequence is sequentially distributed to the information bit coding, and then column permutation might be undesirably becomes another matrix with the generator matrix of the information bit of corresponding variable-length degree.
Simultaneously, according to coding theory, though " 0 " and " 1 " value can put upside down, source code and put upside down after the sign indicating number can be considered to be equal to each other, this modified example will specifically be introduced in the back.
Then, the project that should consider jointly in each execution mode of the present invention will specifically be presented in.
[n, k] sign indicating number is a special code, and wherein, the quantity of coded-bit is " n ", and the quantity of information bit is " k ".
At this moment, if in the generator matrix of each yard, do not mention, then represent this generator matrix with the basic sequence type list.
As mentioned above, the method based on the TFCI sign indicating number of the coding method of the block code that is proposed and 3GPP 99 versions is similar.In other words, information bit is sequentially distributed to the basic sequence in left side, and increase the sequence corresponding by the binary arithmetic operation corresponding (that is, the XOR addition), thereby generate coded-bit with the product of this basic sequence and information bit with the quantity of information bit.
If obtained this sign indicating number according to aforesaid way, though then the quantity of information bit (below, be called " information bit quantity ") is variable,, the invention has the advantages that it can come data are carried out encoding process based on the table of the basic sequence of matrix-type.Utilize above-mentioned advantage, the present invention can support the quantity of various information bits.Therefore, consider that maximum sized information bit quantity obtains basic sequence table or sign indicating number generator matrix.If, then being preferably use less than size proposed below, the maximum quantity of the information bit that practical application is required do not have table at the basic sequence of corresponding at least maximal bit quantity (that is the corresponding maximum quantity of bit).
The basic sequence that is proposed by following execution mode is designed to have the information bit (that is, variable information bit quantity) of variable number, and is designed to have the coded-bit (that is, variable coded-bit quantity) of variable number.Therefore, when design creative notion of the present invention, considered from specific basic sequence table, to have deleted the special code of particular column in advance.For example, if represent the basic sequence table with specific format (such as (32,15)), then the basic sequence table is one of the application examples of the basic sequence table of top (32,15) form.
In brief, determine row and column based on the maximum sized row and column of basic sequence table according to basic sequence of the present invention.Under the situation of undersized row and column, order is deleted the row and column of maximum sized basic sequence, thereby uses the result who obtains after the deletion.Need not superfluous words, as previously mentioned, though in undersized basic sequence table, can come the line to be replaced position with column position, though perhaps in the basic sequence table, the position reset can be replaced by other set, but the result after the above-mentioned replacement can have identical sign indicating number.
Understand the present invention for convenience of explanation and better, when the order of expression any data of the present invention, the direction sequential advancement that information bit is listed as to the right side at the left column from above-mentioned basic sequence table.Coded-bit is in the most descending direction sequential advancement that goes upward to most from above-mentioned basic sequence table.Therefore, the maximum of supposing information bit length is 13 bits, if delete the basic sequence of the single rightmost side from the basic sequence table shown in the following table 19, then can obtain following table 21.
[table 21]
| i | M i，0 | M i，1 | M i，2 | M i，3 | M i，4 | M i，5 | M i，6 | M i，7 | M i，8 | M i，9 | M i，10 | M i，11 | M i，12 |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 |
| 2 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 |
| 4 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 |
| 5 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
| 6 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
| 7 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 9 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 |
| 10 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
| 11 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
| 13 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 |
| 15 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 |
| 16 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 |
| 17 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 |
| 18 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
| 19 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
Preferably, the basic sequence of AD HOC might can not be used in the specific channel estimation methods.At this moment, the particular table that does not have specific basic sequence in a plurality of tables that can consider in each execution mode of the present invention, to propose.At this moment, consider, corresponding basic sequence can be set to " 0 " all the time, thereby its expression has obtained identical coding efficiency, but reduced the quantity of information bit from the viewpoint of encoding process.Therefore, the basic sequence table that does not have specific basic sequence in the above-mentioned basic sequence table in each execution mode also belongs to scope of the present invention.
Based on above-mentioned (20, A) block code, will introduce below according to another aspect of the present invention corresponding with 18 bit codewords length (18, A) block code or corresponding with 16 bit codewords length (16, A) block code.
2. second aspect---(18, A) or (16, A) block encoding
As mentioned above, (18, A) and (16, A) block code can be according to (20, A) mode that block code is identical be used the TFCI information code of (32,10) form.Therefore, will specifically introduce according to generation of the present invention (18,10) or (16,10) block code below, revise (18,10) that generated or (16,10) block code and generate arbitrarily (18, A) or (16, the A) method of block code.
The following three kinds of methods of following execution mode utilization are searched for the punching pattern, and making to provide (18,10) and (16,10) of optimum sign indicating number generator matrix.In the following description, understand the present invention for convenience of explanation and better, the equivalent form of supposing the TFCI information code is basic (32,10) sign indicating number as shown in table 2.
At first, by being punched, (32,10) sign indicating number generator matrix can generate whole yards generator matrix.For convenience of explanation, below this method is called first method.More particularly, can search for (20,10) sign indicating number generator matrix by (32,10) sign indicating number generator matrix is punched.Also can search for (18,10) sign indicating number generator matrix by (32,10) sign indicating number generator matrix is punched.Also can search for (16,10) sign indicating number generator matrix by (32,10) sign indicating number generator matrix is punched.If generated (20,10) sign indicating number, (18,10) sign indicating number, (16,10) sign indicating number, can consider that then optimum punching pattern generates each sign indicating number according to said method.
Fig. 2 shows above-mentioned first method.
Fig. 2 is an illustration generates the concept map of the method for (20,10), (18,10) or (16,10) sign indicating number generator matrix according to an embodiment of the invention according to the basic code of (32,10) form.
But if the single block code of generation as shown in Figure 2, then the quantity of the actual punching pattern of considering is how much number ground growths, causes using greatly inconvenience.Under the situation of (20,10) sign indicating number, must from 32 row of original (32,10) sign indicating number generator matrix, deletion 12 be listed as, make the quantitaes of the whole punching patterns that must consider be
792,840.Under the situation of (18,10) sign indicating number, the quantity of the punching pattern that consider further increases, and makes the quantitaes of punching pattern be
435,600.The sum of the punching pattern that (16,10) sign indicating number must be considered (that is,
080,390 punching pattern).All the punch situation of pattern of above-mentioned consideration has been brought great amount of calculation, makes and must consider a kind of method of searching for the punching pattern effectively.
According to another embodiment of the invention, be not that whole sign indicating number generator matrixes all generates according to (32,10) after punching sign indicating number generator matrix.At first search for (20,10) sign indicating number generator matrix, thereby dispose the generator matrix of (18,10) or (16,10) sign indicating number based on (20,1) sign indicating number generator matrix.Below this method is called second method.At this moment, should be mentioned that based on (20,10) sign indicating number and generated (18,10) and (16,10) yard.Fig. 3 shows this second method.
Fig. 3 is an illustration generates (20,10) sign indicating number according to another embodiment of the present invention according to the basic code of (32,10) form, and utilizes (20,10) sign indicating number to generate the concept map of the method for (18,10) sign indicating number and (16,10) sign indicating number.
Mentioned as above-mentioned first aspect of the present invention, according to by (32,10) sign indicating number generator matrix punching of routine being generated the method for (20,10) sign indicating number generator matrix, can think to have 360 kinds of maximum d
MinValue is (20,10) sign indicating number generator matrix of 6.In this case, additionally 2 row of (20,10) sign indicating number generator matrix are fallen in punching, thus structure (18,10) sign indicating number generator matrix.Equally, additionally 4 row of (20,10) sign indicating number generator matrix are fallen in punching, thus structure (16,10) sign indicating number generator matrix.In the method, the present invention searches for all available patterns according to the exhaustive search method, has maximum d thereby search out from (10*20) generator matrix
Min(10*18) of value or (10*16) generator matrix.
Simultaneously, according to another execution mode of the present invention, the row of (32,10) sign indicating number generator matrix are fallen in punching sequentially, thereby can search (20,10) sign indicating number generator matrix, (18,10) sign indicating number generator matrix and (16,10) sign indicating number generator matrix.Below the method is called third party's method.Specifying of this third party's method is as follows.
At first, the present invention distributes and maximum d thereby obtain to have optimum Hamming weights to the punching of (32,10) sign indicating number generator matrix
MinOptimum (20,10) the sign indicating number generator matrix that is worth both.By the punching of optimum (20,1) sign indicating number generator matrix is handled, the present invention has obtained to have optimum Hamming weights and has distributed and maximum d
Min(18,10) sign indicating number generator matrix that is worth both.Profit uses the same method, and to the punching of (18,10) sign indicating number generator matrix, distributes and maximum d thereby can obtain to have optimum Hamming weights
Min(16,10) sign indicating number generator matrix that is worth both.Below above-mentioned processing is called third party's method, figure 4 illustrates this third party's method.
Fig. 4 has been an illustration according to another implementation of the invention according to (32,10) the basic code generator matrix of form generates (20,10) sign indicating number generator matrix, utilize (20,10) the sign indicating number generator matrix generates (18,10) sign indicating number generator matrix, and utilizes (18,10) the sign indicating number generator matrix generates the concept map of the method for (16,10) sign indicating number generator matrix.
With reference to Fig. 4,, thereby obtain (20,10) sign indicating number generator matrix to the punching of (32,10) sign indicating number generator matrix.With two row punchings of (20,10) sign indicating number generator matrix, thereby obtaining to serve as has maximum d
Min(10*18) matrix of (18,10) sign indicating number generator matrix of value.At this moment, additionally two row in addition with (20,10) sign indicating number generator matrix punch, thereby obtaining to serve as has maximum d
Min(10*16) matrix of (16,10) sign indicating number generator matrix of value.
Generator matrix by above mentioned method construct has been shared same section substantially, makes generator matrix have many common ground.Simultaneously, known in the artly be the maximum d of (16,10) sign indicating number
MinValue is 4, but the maximum d of the sign indicating number that can generate by third party's method
MinValue is 3.Therefore, if construct generator matrix by third party's method, then (16,10) sign indicating number mis-behave.
Simultaneously, in order to improve above mentioned problem, the invention provides the method that a kind of change generates the order of (18,10) and (16,10) sign indicating number.Below this method is called cubic method.In cubic method, the present invention makes it can obtain to have maximum d the punching of (32,10) sign indicating number generator matrix
MinValue and optimum Hamming weights distribute both (20,10) sign indicating number generator matrix.By processing that optimum (20,10) sign indicating number generator matrix is punched, the present invention has obtained to have maximum d
MinValue and optimum Hamming weights distribute both (16,10) sign indicating number generator matrix.2 row are added in 4 row that punch in order to obtain (16,10) sign indicating number generator matrix, thereby obtain (18,10) sign indicating number generator matrix.Fig. 5 shows above-mentioned processing.
Fig. 5 has been an illustration according to another implementation of the invention according to (32,10) the basic code generator matrix of form generates (20,10) sign indicating number generator matrix, utilize (20,10) the sign indicating number generator matrix generates (16,10) sign indicating number generator matrix, and utilizes (16,10) the sign indicating number generator matrix generates the concept map of the method for (18,10) sign indicating number generator matrix.
With reference to Fig. 5,, thereby obtain (20,10) sign indicating number generator matrix to the punching of (32,10) sign indicating number generator matrix.With 4 row punchings of (20,10) sign indicating number generator matrix, thereby obtaining to serve as has maximum d
Min(10*16) generator matrix of (16,10) sign indicating number of value.When 2 row in 4 row that will punch from (20*10) generator matrix of (20,10) sign indicating number in order to generate (10*16) matrix add in (10*16) matrix, can generate (10*18) generator matrix of (18,10) sign indicating number.
At this moment, appear at any position, do not have difference between the performance of source code and amended sign indicating number though above-mentioned row add.For convenience of explanation, suppose row are added to the rightmost side of (10*16) matrix.Simultaneously, the invention provides by adding 2 row and construct the method for (10*18) matrix, should (10*18) matrix generate the code word of quantity minimum, should have the d that distributes with the optimum Hamming weights that obtain (18,10) sign indicating number by (10*18) matrix
MinBe worth identical Hamming weights.
Below, with the concrete generator matrix of specifically introducing based on said method.
At this moment, shown in above-mentioned first party method, for convenience of explanation, to not consider by the generator matrix punching of (32,10) sign indicating number is generated (20,10) sign indicating number, (18,10) sign indicating number and (16,10) in fact each in the sign indicating number generator matrix or whole situations because too many kind of situation arranged, thereby are difficult to construct effectively required sign indicating number in above-mentioned code generating method.Therefore, following example has been considered by to generator matrix punching of (32,10) sign indicating number and structure optimum (20,10) the sign indicating number generator matrix and the method for constructing (18,10) or (16,10) sign indicating number generator matrix based on (20,10) sign indicating number generator matrix.That is to say that following example only considers second to cubic method.
At first will specifically introduce second method.In second method, can generate the whole of (18,10) sign indicating number generator matrix and (16,10) sign indicating number generator matrix or each according to (20,10) after punching sign indicating number generator matrix.
At first, by being punched, (32,10) sign indicating number generator matrix constructs (20,10) sign indicating number generator matrix.According to the method for a first aspect of the present invention among Fig. 1, can obtain optimum (20,10) sign indicating number generator matrix.There are 360 maximum d altogether
MinValue is 6 (d
Min=6) (20,10) sign indicating number generator matrix.If 2 row punchings of above-mentioned optimum (20,10) sign indicating number generator matrix are fallen, then can be generated (18,10) sign indicating number generator matrix.If 4 row punchings of above-mentioned (20,10) sign indicating number generator matrix are fallen, are then generated (16,10) sign indicating number generator matrix.Construct the whole of (18,10) sign indicating number generator matrix and (16,10) sign indicating number generator matrix or each by (20,10) sign indicating number generator matrix is punched, make that the quantity of the public punching pattern between two sign indicating numbers (that is, (18,10) sign indicating number and (20,10) yard) is variable at every turn.
To specifically introduce more detailed description below.The sum of punching pattern that is used for (20,10) sign indicating number of (18,10) sign indicating number generator matrix can be used
Represent.Maximum d in 68400 punching patterns
MinValue is 4.The sum of optimum (18,10) sign indicating number generator matrix is 700.Each optimum (18,10) sign indicating number generator matrix generate minimum number, have and following d
MinValue (that is maximum d,
Min=4) code word of identical Hamming weights is at this d
MinThe value place, the optimum Hamming weights that obtained (18,10) sign indicating number distribute.The Hamming weights of above-mentioned optimum (18,10) sign indicating number generator matrix distribute and are represented by following equation 6.
[equation 6]
A
B，18(x)＝x
15+5x
14+44x
13+87x
12+112x
11+163x
10+200x
9+163x
8+112x
7+87x
6+44x
5+5x
4+1
At this moment, (10*20) generator matrix that is used to construct (10*18) generator matrix that Hamming weights with equation 6 distribute has two Hamming weights shown in following equation 7 and 8 and distributes.
[equation 7]
A
A2，20(x)＝x
20+94x
14+239x
12+356x
10+239x
8+94x
6+1
[equation 8]
A
A3，20(x)＝x
20+98x
14+223x
12+380x
10+223x
8+98x
6+1
Under the situation of (16,10) sign indicating number generator matrix, can use based on the sum of punching pattern of (20,10) sign indicating number
Represent.Maximum d in 1744200 punching patterns
MinValue is 4.The sum of optimum (16,10) sign indicating number generator matrix is 40.Each optimum (16,10) sign indicating number generator matrix generate minimum number, have and following d
MinValue (that is maximum d,
Min=4) code word of identical Hamming weights is at this d
MinThe value place, the optimum Hamming weights that obtained (16,10) sign indicating number distribute.The Hamming weights of above-mentioned optimum (16,10) sign indicating number generator matrix distribute and are represented by following equation 9.
[equation 9]
A
B，16(x)＝x
16+60x
12+256x
10+390x
8+256x
6+60x
4+1
At this moment, (10*20) generator matrix that is used to construct (16*10) sign indicating number generator matrix that Hamming weights with equation 9 distribute has the Hamming weights shown in the equation 10 and distributes.
[equation 10]
A
A2，20(x)＝x
20+94x
14+239x
12+356x
10+239x
8+94x
6+1
Following table 22 shows an example of equation 6 (10*18) generator matrix.Following table 23 shows the example based on (10*16) generator matrix of the Hamming weights distribution of equation 9.
[table 22]
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | |
| g 10by18[1] | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 |
| g 10by18[2] | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 |
| g 10by18[3] | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 1 |
| g 10by18[4] | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
| g 10by18[5] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by18[6] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| g 10by18[7] | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 |
| g 10by18[8] | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 |
| g 10by18[9] | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |
| g 10by18[10] | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
[table 23]
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | |
| g 10by16[1] | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
| g 10by16[2] | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 |
| g 10by16[3] | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 |
| g 10by16[4] | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
| g 10by16[5] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by16[6] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| g 10by16[7] | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 |
| g 10by16[8] | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 |
| g 10by16[9] | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 |
| g 10by16[10] | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 |
The matrix that all punching patterns that distributed by the Hamming weights with equation 6 or 9 generate has identical error correcting capability aspect the minimum range.To be specifically introduced this below.All punching patterns that distributed by the Hamming weights with equation 6 generate (10*18) matrix and have identical error correcting capability, make the matrix that can use all categories without any problem ground arbitrarily.All punching patterns that distributed by the Hamming weights with equation 9 generate (10*16) matrix and have identical error correcting capability, make to use in (10*16) matrix any one arbitrarily without any problem ground.
Then, will specifically introduce the generator matrix of the Hamming weights distribution that is used for indication (18,10) or (16,10) sign indicating number and the punching pattern that is used to indicate above-mentioned generator matrix.More particularly, will introduce generator matrix and the punching pattern that distributes according to each Hamming weights below.When utilizing exhaustive search to search for the punching pattern, the punching pattern that searches is as follows.
The quantity of the punching pattern that the Hamming weights of expression equation 6 distribute in (18,10) sign indicating number generator matrix is 700.At U.S. Provisional Application No.61/016, each punching pattern is disclosed in 492 the appendix.In this case, the value of table 3 " 0 " the expression row corresponding with the position reset are perforated.
In this case, should be mentioned that by (20,10) sign indicating number generator matrix is punched to generate (18,10) sign indicating number generator matrix, and by the generator matrix punching of (32,10) sign indicating number is generated (20,10) yard generator matrix.Therefore, at first the punching of execution (32,10) sign indicating number generator matrix is handled with structure (20,10) sign indicating number generator matrix, and the punching of execution (20,10) sign indicating number generator matrix is handled with structure (18,10) sign indicating number generator matrix.
Simultaneously, (16,10) sign indicating number generator matrix comprises 40 punching patterns of the Hamming weights distribution of indicating equation 9.At U.S. Provisional Application No.61/016, this 40 punching patterns are disclosed in 492 the appendix.
In this case, should be mentioned that by (20,10) sign indicating number generator matrix is punched to generate (16,10) sign indicating number generator matrix, and by the generator matrix punching of (32,10) sign indicating number is generated (20,10) yard generator matrix.Therefore, at first the punching of execution (32,10) sign indicating number generator matrix is handled with structure (20,10) sign indicating number generator matrix, and the punching of execution (20,10) sign indicating number generator matrix is handled with structure (16,10) sign indicating number generator matrix.
Below, to specifically introduce the 4th kind of method: by to (20,10) the sign indicating number generator matrix punches and generates (16,10) sign indicating number generator matrix is selected 2 row in 4 row that are perforated from above-mentioned in order to obtain (16,10) sign indicating number generator matrix, add selected 2 row to (16,10) sign indicating number generator matrix, thus (18,10) sign indicating number generator matrix generated.
At first, by the generator matrix punching of (32,10) sign indicating number is generated (20,10) generator matrix.Method by disclosed Fig. 1 in the above-mentioned first aspect of the present invention obtains optimum (20,10) sign indicating number generator matrix, and existence has maximum d
MinThe sum of (20,10) sign indicating number generator matrix of=6 values.4 row punchings of optimum (20,10) sign indicating number generator matrix are fallen, thereby generated (16,10) sign indicating number generator matrix.From 4 row that punching is fallen, select 2 row, and add selected 2 row to (16,10) sign indicating number generator matrix, thereby generate (18,10) sign indicating number generator matrix.
Specifically being described below of above method.For according to 360 maximum d
MinValue is 6 (that is d,
Min(16,10) of (10*20) matrix=6) sign indicating number, the method for a first aspect of the present invention can generate and amount to 40 optimums (16,10) sign indicating number generator matrix, this optimum (16,10) yard generator matrix generation minimum number, have and following d
MinThe code word that is worth identical Hamming weights is at this d
MinThe value place, optimum Hamming weights distribute and are illustrated in the equation 9.These 40 (16,10) generator matrixes have maximum d
Min=4 values and optimum Hamming weights distribute.
Can from 40 top (10*16) matrixes, generate optimum (18,10) sign indicating number generator matrix.More particularly, when from 4 row that from (20,10) sign indicating number generator matrix, are perforated in order to generate (10*16) matrix, having selected 2 row, and with selected 2 row add (16 to, 10) during the right side of sign indicating number generator matrix, generated optimum (18,10) sign indicating number generator matrix.For convenience of explanation, the rightmost side of adding these 2 row to (16,10) sign indicating number generator matrix.But, in fact, can at random add these 2 row any position of to (16,10) sign indicating number generator matrix and can not produce difference on the performance.Therefore, can obtain various modified examples according to the position of adding.Simultaneously, from
The combination of individual interpolation (that is,
The interpolation combination) selects to generate 2 row of (10*18) matrix of the optimum Hamming weights distribution with (18,10) sign indicating number in.At this moment, optimum Hamming weights distribute indication exist minimum number, have and d
MinThe code word that is worth identical Hamming weights.In this manner, has maximum d amounting to 240
MinThe generator matrix of=4 values (that is,
Individual generator matrix) in, the quantity with matrix of optimum Hamming weights distribution is 160.The Hamming weights that obtain from above-mentioned optimum generator matrix distribute and can represent with following equation 11.
[equation 11]
A
C，18(x)＝x
18+8x
14+34x
13+94x
12+120x
11+153x
10+204x
8+153x
8+120x
7+94x
6+34x
5+8x
4+1
At this moment, being used to construct the Hamming weights that upper strata (10*20) generator matrix of (18,10) sign indicating number generator matrix that Hamming weights with equation 11 distribute has by equation 12 expressions distributes.
[equation 12]
A
C，20(x)＝x
20+94x
14+239x
12+356x
10+239x
8+94x
6+1
160 (18,10) sign indicating number generator matrixes with Hamming weights distribution of equation 11 are arranged.Following table 24 shows the example of 160 (18,10) sign indicating number generator matrix.
[table 24]
| 1 | 2 | 3 | 4 | 5 | 8 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | |
| g 10by18[1] | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 0 |
| g 10by18[2] | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 |
| g 10by18[3] | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 0 |
| g 10by18[4] | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
| g 10by18[5] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
| g 10by18[6] | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| g 10by18[7] | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
| g 10by18[8] | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 |
| g 10by18[9] | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 0 |
| g 10by18[10] | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 |
The matrix that all punching patterns that distributed by the Hamming weights with equation 11 generate has identical error correcting capability aspect the minimum range.Therefore, (10*18) matrix that all punching patterns that distributed by the Hamming weights with equation 11 generate has identical error correcting capability, thereby can use the matrix of all types without a doubt arbitrarily.
In fact, there are a plurality of generator matrixes that identical Hamming weights distribute that have.Needing the sum of the punching pattern of expression optimum (16,10) sign indicating number generator matrix is 40.Above 40 punching patterns equal the punching pattern of above-mentioned second method.
Simultaneously, this example considers that the reason of the row of punching/interpolation generator matrix is: must at first consider to have maximum d
MinThe generation of (16,10) sign indicating number of=4 values.
As introducing in above-mentioned third party's method, at first punching falls to have maximum d
Min2 row of 360 (10*20) matrixes of=6 values, and additionally 2 row of 700 optimums (18,10) sign indicating number generator matrix are fallen in punching, thus generate (16,10) sign indicating number generator matrix.At this moment, this 700 optimums (18,10) sign indicating number generator matrix generate minimum number, have and d
MinThe code word that is worth identical Hamming weights, and this 700 optimums (18,10) sign indicating number generator matrix satisfies and comprises maximum d
MinThe equation 9 that=4 values and optimum Hamming weights distribute.At this moment, the maximum d of (16,10) sign indicating number
MinValue is 3.Has maximum d
MinIn whole (16,10) sign indicating number generator matrix of=3 values, generated d minimum number, that have and represent optimum Hamming weights distribution
MinThe quantity of optimum (16,10) sign indicating number generator matrix that is worth the code word of identical Hamming weights is 2180.At this moment, the Hamming weights distribute and can represent with equation 13.
[equation 13]
A
D，16(x)＝x
16+2x
13+40x
12+74x
11+112x
10+180x
9+206x
8+180x
7+112x
6+74x
5+40x
4+2x
3+1
As mentioned above, the maximum d of (16, the 10) sign indicating number that generates by third party's method
MinValue is 3 (to be d
Min=3).For passing through to increase maximum d
MinValue and generate and to have maximum d
Min(16,10) sign indicating number generator matrixes of=4 values, 2 row that must will have the rightmost side of 160 (18,10) sign indicating number generator matrix that the Hamming weights of equation 11 distribute punch.If systematically present this method, then the result who is presented is expressed as cubic method.
Specifying of cubic method is as follows.Second method requires independently generator matrix under each situation of (20,10) sign indicating number, (18,10) sign indicating number and (16,10) sign indicating number.Cubic method can obtain (10*16) and (10*18) matrix from single (10*20) matrix.
Then, based on above-mentioned notion, will specifically introduce below disclosed in a first aspect of the present invention (20, A) sign indicating number generator matrix.
For convenience of explanation, the generator matrix (referring to table 2) that is used as the basic generated matrix of (32,10) form also can be represented with following table 25.In other words, following table 25 only is the form of the perpendicular shape of table 2, and it is identical with table 2 in fact.
[table 25]
To specifically introduce the actual coding of utilizing the above-mentioned fact below handles.If use a
0, a
1, a
2, a
3, a
4..., a
K-1Represent " k " individual information bit (that is, " k " individual information bit), utilize the sign indicating number generator matrix of above-mentioned execution mode of the present invention to come information bit is encoded, thus output b
iIndividual bit.This b
iIndividual bit structure code word.At this moment, the b behind the coding
iIndividual bit can be represented with following equation 14.
[equation 14]
Then, will be described herein-after and be used for coded-bit of forming by 20 bits and both optimum code generator matrixes of other coded-bit of forming by 18 bits.When the quantity of coded-bit is variable, designed the coded-bit of above-mentioned 20 bits or 18 bits.More particularly, introduce a kind of in (10*20) that utilize said method to search and (10*18) method of search (20,10) and (18,10) yard generator matrix in the matrix.(20,10) and (18,10) sign indicating number generator matrix has maximum d
MinValue and optimum Hamming weights distribute, and generate the code word of the minimum number with identical Hamming weights.This searching method is based on above-mentioned cubic method.At this moment, the minimum range of (20, the 10) sign indicating number that is generated is 6, and the Hamming weights distribute and represented by equation 15.The minimum range of (18, the 10) sign indicating number that is generated is 4, and minimum weights distribute and represented by equation 16.
[equation 15]
A
A2，20(x)＝x
20+94x
14+239x
12+356x
10+239x
8+94x
6+1
[equation 16]
A
B，18(x)＝x
18+5x
14+44x
13+87x
12+112x
10+163x
10+200x
9+163x
8+112x
7+87x
6+44x
5+5x
4+1
Following table 26 shows and can satisfy the exemplary optimum code that above-mentioned Hamming weights distribute.The punching pattern that is used for (20,10) sign indicating number is disclosed in the table 6.For convenience of explanation, the punching pattern of table 6 also can be represented with following table 26.
[table 26]
| 10 * 32 |
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 |
| Table 25 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
In other words, table 26 shows the punching pattern.When 12 row are fallen in punching from 32 row altogether of table 25, obtained the punching pattern of table 26.In table 26, the row that " 0 " expression punching is fallen, and mouthful 1 " row that uses of expression.Simultaneously, following table 27 shows the punching pattern that is used for (18,10) sign indicating number.
[table 27]
In other words, table 27 shows the punching pattern.When further 2 row are fallen in punching with generation (18,10) sign indicating number from 20 row altogether of table 26, obtained the punching pattern of table 27.Therefore, the generator matrix of table 26 comprises the generator matrix of table 27,, thereby has realized nested structure that is.In table 27, the row that " 0 " expression punching is fallen, and the row that " 1 " expression is used.Table 26 comprises table 27, makes table 26 and table 27 to be bonded to each other to as shown in table 28 below.
[table 28]
Simultaneously, the row order of table 28 is slightly different with the order of 3GPP TFCI encoder matrix.Therefore, if the row order of table 28 is adjusted into as the order in the TFCI sign indicating number matrix, then adjusted result is represented by following table 29.
[table 29]
Table 29 has only the row order to be different from table 28, and residue factor and table 28 except the row order are identical.In this case, according to coding theory, table 28 has identical encoding characteristics with table 29.But the advantage of the method for table 29 is: at last 2 bits that punch from (20,10) yard punching time durations to (128,10) sign indicating number.More particularly, if after having constructed (20,10) sign indicating number, from 20 coded-bits, last 2 bits are punched, then can generate (18,10) sign indicating number immediately.In other words, because (20,10) sign indicating number comprises (18,10) sign indicating number, therefore can easily generate these (18,10) sign indicating number.
Simultaneously, second step is according to a first aspect of the invention added 4 row of (20,10) sign indicating number generator matrix, thereby (20,10) sign indicating number generator matrix is expanded to (20,14) sign indicating number generator matrix.According to this execution mode, the invention provides generator matrix as the table 11 of (20,14) sign indicating number generator matrix.Simultaneously, as previously mentioned, identical with table 10 based on the maximum/minimum range feature of each information bit length.In addition, if the structure of table 11 is used to the code length of 20 bits and another code length of 18 bits, then represent following maximum/minimum range feature by following table 30.
[table 30]
Simultaneously, the sign indicating number based on table 11 has following performance in the actual channel.It specifies as follows.
Fig. 6 and Fig. 7 show respectively according to of the present invention (20, A) and (18, coding efficiency A).
The AWGN performance of (20,10) sign indicating number and (18,10) sign indicating number particularly, has been shown among Fig. 6.Fig. 7 show length with various information bits (20, k) Ma performance.
Simultaneously, third step according to a first aspect of the invention, table 19 show amended generator matrix.In amended generator matrix, the basic sequence of being made up of whole components " 1 " is positioned at the leftmost side of table 19.Therefore, the generator matrix of (18,14) structure can also be revised as shown in following table 31.
[table 31]
| i | M i，0 | ?M i，1 | ?M i，2 | ?M i，3 | ?M i，4 | ?M i，5 | M i，6 | ?M i，7 | M i，8 | M i，9 | M i，10 | M i，11 | M i，12 | M i，13 | (18，k) |
| 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 0 | 0 |
| 2 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | |
| 3 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | |
| 4 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | |
| 5 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | |
| 6 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | |
| 7 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | |
| 8 | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | |
| 9 | 1 | 0 | 1 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | |
| 10 | 1 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | |
| 11 | 1 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | |
| 12 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | |
| 13 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | |
| 14 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | |
| 15 | 1 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 0 | 1 | 1 | |
| 16 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | |
| 17 | 1 | 0 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | |
| 18 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | Punching |
| 19 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | Punching |
In other words, when the last 2 row punchings of the generator matrix of table 19 are fallen, generated (18,14) sign indicating number generator matrix.
If it is shown in table 19 that (20,14) generator matrix is used as, and (18,14) generator matrix is used as shown in table 31ly, then can represent minimum range characteristic based on information bit with following table 32.
[table 32]
When generating (20,10) sign indicating number by (32,10) sign indicating number is punched, channel coding method according to the present invention is designed to all have best performance in (20,10), (18,10) and (16,10) sign indicating number.By only to advance line replacement and (32,10) sign indicating number of formation table 28 of (32,10) TFCI sign indicating number of 3GPP version 99, thereby aspect coding theory, (32,10) TFCI sign indicating number of (32,10) of table 28 sign indicating number and 3GPP version 99 is equal to each other.But, from the viewpoint that punching is handled, the index difference of the index of (32,10) of table 28 sign indicating number and (32,10) TFCI sign indicating number of 3GPP version 99, it the results are shown in following table 33,34 and 35.
[table 33]
[table 34]
[table 35]
Table 33 shows the punch position based on the optimum performance (20,10) of the line index of (32,10) TFCI sign indicating number of 3GPP version 99, (18,10) and (16,10) sign indicating number.Table 34 shows the punch position based on (18,10) and (16,10) sign indicating number of the index of (20,10) sign indicating number.Table 35 shows the punching pattern based on (32,10) form index of table 28.
Simultaneously, the conventional sequence table of optimum punch position has been indicated in following table 36 expressions.
[table 36]
Can find out that from table 36 punch position of (18,10) and (16,10) is crossover each other substantially.Simultaneously, following table 37 shows the performance of minimum range.
[table 37]
In table 37, " 20 " expression (20, k) sign indicating number, " 18 latter two " expression by to (20, k) the last two row punchings of sign indicating number and form (18, k) sign indicating number.And " 18 in the middle of " expression based on table 36 (20, k) the sign indicating number punching fall the 5th and the 18th row and form another (18, k) sign indicating number." 16 last four " expression by to (20, k) the last four lines punching of sign indicating number and form (16, k) sign indicating number." 16 in the middle of " expression based on table 36 (20, k) the sign indicating number punching fall the 5th, the 7th, the 14th and the 18th row and form (16, k) sign indicating number." 16 (preceding two+latter two) " expression fall that preceding two row and last two row form by punching another (16, k) yard.
Simultaneously, following mask body introduction when (18, k) and (16, (n, k) yard (wherein, n=20,18,16k≤14) that form when k) Ma row change in proper order.
Following table 38 is as the tenth basic sequence M
I, 10By another basic sequence M
I, 11Replace so that the basic sequence table that the performance of sign indicating number forms when improving.
[table 38]
Based on above-mentioned table 38, following table 39 shows the minimum range performance.
[table 39]
From table 39 as can be seen, the minimum range of (16,11) sign indicating number is increased to " 2 " from " 1 ".
Simultaneously, will specifically introduce below when (18, k) and (16, (n, k) yard (wherein, n=20,18,16k≤15) that form when k) Ma row change in proper order.
Following table 40 shows has added single basic sequence to support (20,15) generator matrix of 15 information bits.
[table 40]
From above-mentioned table 40 as can be seen, the 15th basic sequence is added to table 38.Though the 15th basic sequence is added to other form of expression (20,14) generator matrix, shows identical performance.Any method in all methods of introducing in the above-mentioned execution mode also can be used for coded-bit is punched.At this moment, if use some part in all methods, then can provide following example.
In the example of table 40, table 41 shows the minimum range characteristic.
[table 41]
Should be noted in the discussion above that among the present invention that disclosed most of term considered function of the present invention and define, and can determine separately according to those skilled in the art's intention or common practice.Therefore, preferably, should understand above-mentioned term based on full content disclosed by the invention.It will be apparent to those skilled in the art that, can under the situation that does not break away from the spirit or scope of the present invention, make various modifications and variations the present invention.Therefore, the present invention is intended to contain these modifications and variations of the present invention that fall in claims and the equivalency range thereof.
That is to say that the execution mode that the present invention is not limited only to introduce also comprises and the widest scope that discloses principle and feature equivalence here here.
Industrial usability
From the above description obviously as can be known be can easily be applied to send in CQI information other chnnel coding to the 3GPP LTE system of up-link via the PUSCH channel according to chnnel coding method of the present invention. Yet above-mentioned method is not limited only to above 3GPP LTE system, and they can also be applied to each multiple communication plan of information of variable-length being carried out block encoding.
Claims (14)
1. a utilization comprises that the sign indicating number generator matrix of 20 row and A row comes information bit is carried out the method for chnnel coding, and described A said method comprising the steps of corresponding to the length of described information bit:
Utilize to be listed as the basic sequence corresponding, that length is 20 bits with each of described sign indicating number generator matrix length is carried out chnnel coding for the described information bit of A,
Wherein, when described A value was " 10 ", each basic sequence of described sign indicating number generator matrix was corresponding to the sequence of first matrix or the second matrix column direction, wherein
Described first matrix comprises 20 row and 10 row, by selecting 20 going and construct described first matrix except the 2nd, the 5th, the 8th, the 11st, the 15th, the 16th, the 21st, the 22nd, the 25th, the 29th, the 30th and the 31st row from the sign indicating number matrix that is used for transport format combination indicator TFCI information is encoded, forms by 32 row and 10 row, and
Obtain described second matrix by carrying out displacement at least one in the position between the position in the ranks of described first matrix and row.
2. method according to claim 1, wherein, when described A value during greater than " 10 ", each basic sequence of described sign indicating number generator matrix is corresponding to the sequence of the 3rd matrix column direction, wherein
By being added in described first matrix or described second matrix as the sequence of column direction, (A-10) individual other basic sequence generates described the 3rd matrix, and
The length of each described other basic sequence is " 20 ", and the value that satisfies smallest hamming distance is 4 predetermined condition.
3. method according to claim 1, wherein, when described A value during greater than " 10 ", each basic sequence of described sign indicating number generator matrix is corresponding to the sequence of the 3rd matrix column direction, wherein
By being added in described first matrix or described second matrix as the sequence of column direction, (A-10) individual other basic sequence generates described the 3rd matrix, and
The length of each described other basic sequence is " 20 ", and comprises 4 " 0 " values.
4. method according to claim 3, wherein, described other basic sequence comprises at least one in following:
[1，1，1，1，1，1，1，1，1，1，1，1，1，1，1，1，0，0，0，0]，
[1，1，1，1，1，1，1，1，1，1，1，1，1，1，0，0，1，1，0，0]，
[0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0] and
[0，0，1，1，1，0，0，1，1，1，1，1，1，1，1，1，1，1，1，1]。
5. method according to claim 4, wherein, described A value be equal to or less than " 14 " and
The described basic sequence of described sign indicating number generator matrix sequentially corresponding to the sequence of the A that begins from the left side column direction of the 4th matrix, represented by following table by described the 4th matrix:
[table]
6. method according to claim 4, wherein, described A value is equal to or less than " 13 ", and
The described basic sequence of described sign indicating number generator matrix sequentially corresponding to the sequence of the A that begins from the left side column direction of the 5th matrix, represented by following table by described the 5th matrix:
[table]
7. method according to claim 1, wherein, described information bit comprises at least one in following: channel quality information CQI bit, precoding matrix indicators PMI, channel sequence designator RI and ACK/NACK data.
8. method according to claim 1 wherein, is come information bit behind the transmitting channel coding via Physical Uplink Control Channel PUCCH.
9. a utilization comprises that the sign indicating number generator matrix of 20 row and A row comes information bit is carried out the method for chnnel coding, and described A said method comprising the steps of corresponding to the length of described information bit:
Utilize to be listed as the basic sequence corresponding, that length is 20 bits with each of described sign indicating number generator matrix length is carried out chnnel coding for the described information bit of A,
Wherein, when described A value was " 10 ", each basic sequence of described sign indicating number generator matrix was corresponding to the sequence of first matrix or the second matrix column direction, wherein
Described first matrix is represented by following table:
[table]
And,
Obtain described second matrix by carrying out displacement at least one in the position between the position in the ranks of described first matrix and row.
10. method according to claim 9, wherein, when described A value during greater than " 10 ", each basic sequence of described sign indicating number generator matrix is corresponding to the sequence of the 3rd matrix column direction, wherein
By being added in described first matrix or described second matrix as the sequence of column direction, (A-10) individual other sequence generates described the 3rd matrix, and
Described other sequence comprises at least one in following:
[1，1，1，1，1，1，1，1，1，1，1，1，1，1，1，1，0，0，0，0]，
[1，1，1，1，1，1，1，1，1，1，1，1，1，1，0，0，1，1，0，0]，
[0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0] and
[0，0，1，1，1，0，0，1，1，1，1，1，1，1，1，1，1，1，1，1]。
11. method according to claim 10, wherein, described A value is equal to or less than " 14 ", and
The described basic sequence of described sign indicating number generator matrix sequentially corresponding to the sequence of the A that begins from the left side column direction of the 4th matrix, represented by following table by described the 4th matrix:
[table]
12. method according to claim 10, wherein, described A value is equal to or less than " 13 ", and
Described each basic sequence of described sign indicating number generator matrix sequentially corresponding to the sequence of the A that begins from the left side column direction of the 4th matrix, represented by following table by described the 4th matrix:
[table]
13. method according to claim 9, wherein, described information bit comprises at least one in following: channel quality information CQI bit, precoding matrix indicators PMI, channel sequence designator RI and ACK/NACK data.
14. method according to claim 9 wherein, is come information bit behind the transmitting channel coding via Physical Uplink Control Channel PUCCH.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310145699.6A CN103259626B (en) | 2007-12-24 | 2008-12-22 | Use block code the information of variable-length to be carried out to the method for chnnel coding |
Applications Claiming Priority (13)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US1649207P | 2007-12-24 | 2007-12-24 | |
| US61/016,492 | 2007-12-24 | ||
| US2101808P | 2008-01-14 | 2008-01-14 | |
| US61/021,018 | 2008-01-14 | ||
| US2133708P | 2008-01-16 | 2008-01-16 | |
| US61/021,337 | 2008-01-16 | ||
| US2646408P | 2008-02-05 | 2008-02-05 | |
| US61/026,464 | 2008-02-05 | ||
| US2801608P | 2008-02-12 | 2008-02-12 | |
| US61/028,016 | 2008-02-12 | ||
| KR1020080074681A KR100983282B1 (en) | 2007-12-24 | 2008-07-30 | Channel Coding Method of Variable Length Information Using Block Code |
| KR10-2008-0074681 | 2008-07-30 | ||
| PCT/KR2008/007575 WO2009082146A2 (en) | 2007-12-24 | 2008-12-22 | Channel coding method of variable length information using block code |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310145699.6A Division CN103259626B (en) | 2007-12-24 | 2008-12-22 | Use block code the information of variable-length to be carried out to the method for chnnel coding |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101911498A true CN101911498A (en) | 2010-12-08 |
| CN101911498B CN101911498B (en) | 2013-06-05 |
Family
ID=40996431
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008801226741A Active CN101911498B (en) | 2007-12-24 | 2008-12-22 | Channel coding method of variable length information using block code |
| CN201310145699.6A Active CN103259626B (en) | 2007-12-24 | 2008-12-22 | Use block code the information of variable-length to be carried out to the method for chnnel coding |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310145699.6A Active CN103259626B (en) | 2007-12-24 | 2008-12-22 | Use block code the information of variable-length to be carried out to the method for chnnel coding |
Country Status (3)
| Country | Link |
|---|---|
| JP (1) | JP5174177B2 (en) |
| KR (1) | KR100983282B1 (en) |
| CN (2) | CN101911498B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009082146A2 (en) | 2007-12-24 | 2009-07-02 | Lg Electronics Inc. | Channel coding method of variable length information using block code |
| HUE038989T2 (en) | 2007-12-24 | 2018-12-28 | Lg Electronics Inc | Channel coding using a (32,11) block code and a (20,O) block code with variable length O |
| KR100970645B1 (en) | 2007-12-24 | 2010-07-15 | 엘지전자 주식회사 | Channel Coding Method of Variable Length Information Using Block Code |
| CN102077470B (en) * | 2009-05-25 | 2013-02-27 | 华为技术有限公司 | Method and device for encoding by linear block code, and method and device for generating linear block code |
| WO2011126330A2 (en) * | 2010-04-07 | 2011-10-13 | 엘지전자 주식회사 | Method for transmitting information, and transmitter |
| EP2569865B1 (en) | 2010-05-11 | 2016-06-29 | LG Electronics Inc. | Enhanced block coding method based on small size block code |
| CN105337686B (en) * | 2014-07-31 | 2019-02-12 | 展讯通信（上海）有限公司 | A kind of CQI code device and method |
| WO2018129695A1 (en) * | 2017-01-12 | 2018-07-19 | Qualcomm Incorporated | Puncturing and repetition for data encoding |
| KR102328268B1 (en) * | 2017-03-23 | 2021-11-18 | 삼성전자 주식회사 | Apparatus and method of encoding and decoding of short length block codes in wireless communication system |
| CN111211793B (en) * | 2020-02-10 | 2023-08-04 | 成都烨软科技有限公司 | Parallel TPC coding method based on Hamming code |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100393618B1 (en) * | 2000-08-18 | 2003-08-02 | 삼성전자주식회사 | Channel coding/decoding apparatus and method for a cdma mobile communication system |
| EP1195934A3 (en) * | 2000-10-09 | 2006-05-24 | Samsung Electronics Co., Ltd. | Apparatus and method for coding/decoding TFCI bits in an asynchronous CDMA communication system |
| RU2233025C1 (en) * | 2001-02-15 | 2004-07-20 | Самсунг Электроникс Ко., Лтд. | Method for coding/decoding channels in mobile communication system |
| KR100879942B1 (en) * | 2002-02-16 | 2009-01-22 | 엘지전자 주식회사 | CQI coding method using various basis sequences |
| US7934137B2 (en) | 2006-02-06 | 2011-04-26 | Qualcomm Incorporated | Message remapping and encoding |
-
2008
- 2008-07-30 KR KR1020080074681A patent/KR100983282B1/en active IP Right Grant
- 2008-12-22 CN CN2008801226741A patent/CN101911498B/en active Active
- 2008-12-22 CN CN201310145699.6A patent/CN103259626B/en active Active
- 2008-12-22 JP JP2010529885A patent/JP5174177B2/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| JP2011501557A (en) | 2011-01-06 |
| CN103259626A (en) | 2013-08-21 |
| CN103259626B (en) | 2016-05-25 |
| KR100983282B1 (en) | 2010-09-24 |
| CN101911498B (en) | 2013-06-05 |
| KR20090069126A (en) | 2009-06-29 |
| JP5174177B2 (en) | 2013-04-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101911498B (en) | Channel coding method of variable length information using block code | |
| CN101868920B (en) | Channel coding method of variable length information using block code | |
| JP5560362B2 (en) | Downlink control information transmission method and codeword generation method therefor | |
| CN103152135B (en) | Feedback method in wireless transmit receive unit (WTRU) and WTRU | |
| JP5179551B2 (en) | Encoding / decoding method and apparatus using low density parity check code in wireless communication system | |
| CN101969361B (en) | Method and device for transmitting cycle feedback report | |
| CN100418311C (en) | Apparatus and method for sign mapping transmission format combined indicating sign bit | |
| CN101807974A (en) | System and method for transferring ascending control signals on physical upstream sharing channel | |
| CN104518847A (en) | Signaling coding method and signaling coding system based on BCH code and short LDPC code cascading | |
| CN102007722B (en) | Block encoding with a variable rate block code | |
| CN104618072A (en) | Method for encoding and modulating logical frame signaling channel in NGB-W system | |
| CN104618067A (en) | Method for encoding and modulating physical frame signaling channel in NGB-W system | |
| CN101741512A (en) | Coding method and device | |
| US20230119736A1 (en) | Channel coding method of variable length information using block code | |
| CN108471340B (en) | Code rate compatible QC-LDPC code construction and channel coding method and system | |
| WO2018149389A1 (en) | Data processing method, device, and transmitting terminal | |
| TWI419478B (en) | Channel coding method of variable length information using block code |
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 |