CN102077469A - Method and device for linear block code coding - Google Patents

Method and device for linear block code coding Download PDF

Info

Publication number
CN102077469A
CN102077469A CN2009801237702A CN200980123770A CN102077469A CN 102077469 A CN102077469 A CN 102077469A CN 2009801237702 A CN2009801237702 A CN 2009801237702A CN 200980123770 A CN200980123770 A CN 200980123770A CN 102077469 A CN102077469 A CN 102077469A
Authority
CN
China
Prior art keywords
linear block
sequence
block codes
row
matrix
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
Application number
CN2009801237702A
Other languages
Chinese (zh)
Other versions
CN102077469B (en
Inventor
徐鹰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Publication of CN102077469A publication Critical patent/CN102077469A/en
Application granted granted Critical
Publication of CN102077469B publication Critical patent/CN102077469B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/033—Theoretical methods to calculate these checking 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/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
    • H03M13/13—Linear codes

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

A method and a device for the linear block code coding are provided, which involve to the wireless communication technology field. The method includes: coding an inputted information sequence by using the (32,11) linear block code matrix, and outputting a coded sequence with the length of 32, wherein the minimum code distance of the outputted coded sequence is 12, when the length of the information bits is 11. The present invention enables the minimum code distance of the {11, 32} code word to reach the theoretic minimum code distance by means of replacing the 11th columns of existing (32,11) and (20,13) linear block code matrixes simultaneously, at the same time, does not make any influence to the minimum code distance of the existing {11,20}, {12,20} and {13,20} code word, and dose not change the existing coding/decoding method. The system performance after the linear block code coding is promoted.

Description

Method and device for linear block code coding
A kind of method and apparatus of linear block codes coding
Technical field
The present invention relates to wireless communication technology field, the method for more particularly to a kind of linear block codes coding and
Background technology
Mostly encoded in Modern Communication System using linear block codes come the control information shorter to length, such as WCDMA (Wideband Code Division Multiple Access, WCDMA）(Transport Format Combination Indicator, transformat combination is indicated TFCI in system）Coding, LTE (Long Term Evolution, Long Term Evolution）PUCCH (Physical Uplink Control channel, Physical Uplink Control Channel in system）With PUSCH (Physical Uplink Shared channel, Physical Uplink Shared Channel）Coding.For the shorter linear block codes of code length, its minimum distance is to influence the immediate cause of its error-correcting performance, therefore people typically make its minimum distance reach the maximum of theory, the performance of linear block codes now is also optimal as far as possible when linear block codes is designed.PUSCH and PUCCH coding is carried out, two matrixes difference are as shown in Figures 1 and 2.Wherein, theory most d, the code distance upper limit and actual minimum distance of two linear block codes of (32,11) and (20,13) under different information bit lengths are respectively as shown in table 1-1 and table 1-2.
Table 1-1:(32,11) minimum distance of linear block codes
Table 1-2:(20,13) minimum distance of linear block codes
As can be seen that the linear block codes employed in existing LTE system exists from table 1-1 and table 1-2 The minimum distance upper limit of theory, such as code word are not reached in the case of some information bit lengths
{ 7,32 }, { 11,32 }, { 11,20 } etc..It should be noted that in the embodiment of the present invention, code word { 7,32 } represent information bit it is a length of 7 when, use（32,11) linear block codes encode obtained sequence；Code word { 11,32 } represent information bit it is a length of 11 when, use（32,11) linear block codes encode obtained sequence；Code word { 11,20 } represent information bit it is a length of 11 when, use（20,11) linear block codes encode obtained sequence.
The present inventor has found during the present invention is realized, in the case of information bit a length of 11, using existing（32,11) linear block codes matrix is encoded, and the actual minimum distance of resulting { 11,32 } code word causes systematic function to incur loss due to being not reaching to theoretical minimum distance.The content of the invention
In consideration of it, the embodiment of the present invention provides a kind of method and apparatus of linear block codes coding, the systematic function after linear block codes coding can be lifted.
A kind of method of linear block codes coding provided in an embodiment of the present invention, including：One input message sequence is used（32,11) linear block codes matrix is encoded, the coded sequence that output length is 32；Wherein, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12.
The method of another linear block codes coding provided in an embodiment of the present invention, including：One input message sequence is used（20,13) linear block codes matrix is encoded, the coded sequence that output length is 20；Wherein, it is described（20,13) sequence of the 11st row of linear block codes matrix is { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 }.
A kind of device of linear block codes coding provided in an embodiment of the present invention, including：Coding unit, for using an input message sequence（32,11) linear block codes matrix is encoded, the coded sequence that output length is 32；Wherein, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12.
The device of another linear block codes coding provided in an embodiment of the present invention, including：Coding unit, is used for the input message sequence to a length of m of an information bit（20,13) linear block codes matrix is encoded, the coded sequence that output length is 20；Wherein, the of the linear block codes matrix of described (20,13) 11 bad ' J 々 sequences bad ' J is { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 }.
The above technical scheme provided according to embodiments of the present invention is understood, by using an input message sequence（32,11) linear block codes matrix is encoded, export the coded sequence that length is 32, wherein, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12 so that { 11,32 } minimum distance of code word has reached theoretic minimum distance, therefore improves the systematic function after linear block codes coding.
The accompanying drawing that brief description of the drawings is used required for applying in example or description of the prior art is briefly described, apparently, drawings in the following description are only some embodiments of the present invention, for those of ordinary skill in the art, without having to pay creative labor, other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is (32,11) linear block codes matrix for using in existing LTE system；
Fig. 2 is (20,13) linear block codes matrix for using in existing LTE system；
Fig. 3 is one kind (32,13) the linear block codes matrix used in the prior art；
Fig. 4 is a kind of matrix of (32,13) linear block codes provided in an embodiment of the present invention；
Fig. 5 is a kind of (32,11) linear block codes matrix used in LTE system provided in an embodiment of the present invention；
Fig. 6 is a kind of (20,13) linear block codes matrix used in LTE system provided in an embodiment of the present invention；
Figure is that figure is compared in the performance change emulation of { 11,32 } code word provided in an embodiment of the present invention；Fig. 8 compares figure for the performance change emulation of { 11,20 } code word provided in an embodiment of the present invention；Fig. 9 compares figure for the performance change emulation of { 12,20 } code word provided in an embodiment of the present invention；Figure 10 compares figure for the performance change emulation of { 13,20 } code word provided in an embodiment of the present invention；Figure 11 is 1024 different sequence tables used in (32,11) linear block codes matrix the 11st provided in an embodiment of the present invention row. Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out
/ mesh Shu, it is fully described by, it is clear that described embodiment is only a part of embodiment of the invention, the embodiment being not all of.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art are obtained under the premise of creative work is not made belongs to the scope of protection of the invention.
The linear block codes matrix of (32,11) and (20,13) that are used in existing LTE systems is really to be obtained by a size for the matrix interception of (32,13)：（32,11) matrix is interception（32,13) preceding the 11 of matrix bad ' J, (20,13) matrix is interception（32,13) preceding 20 row of matrix.It is somebody's turn to do the matrix of (32,13) as shown in Figure 3.
Will should (32,13) matrix the 11st row by
{ 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,1,1,1,1,0,1,0,0,0,0,1,0 } are replaced with
{ 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0 }, (32,13) matrix after replacement is as shown in Figure 4.
Because (32,11) matrix is obtained by preceding 11 row of (32,13) matrix interception,（20,13) matrix is by (32,13) matrix intercepts preceding 20 row and obtained, therefore existing (32 are replaced, 13) after the 11st row in matrix, the linear block codes matrix of (32,11) and (20,13) after corresponding replacement is respectively as shown in accompanying drawing 5 and accompanying drawing 6.
It is blunt obvious after such replace it, except { 11,32 }, { 11,20 }, { 12,20 } and { 13,20 } outside this four code words, remaining code word does not have any change, therefore only needs to study the situation of change of this four code words.The minimum distance change of this four code words is respectively as shown in table 1-3 and table 1-4.
Table 1-3: {11,32Code word minimum distance change
Table 1-4:{ 11,20 }, { 12,20 }, the minimum distance change of { 13,20 } code word It can be seen that from table 1-3 and table 1-4, (32 after replacement, 11) minimum distance of the linear block codes in the case of information bit a length of 11 has increased to 12 from 10, theoretially optimum value is reached, simultaneously not to (32,11) minimum distance with other code words of the linear block codes of (20,13) causes any destruction.
Verify that minimum distance increases the influence to performance by emulating, in AWGN (Additive white Gaussian noise, additive white Gaussian noise）Under channel, using QPSK (Quaternary Phase Shift Keying, quaternary PSK）Modulation system, simulates { 11,32 }, { 11,20 }, { 12,20 }, { 13,20 } performance of this four code words before and after the linear block codes matrix change of (32,11), comparative result is respectively as shown in accompanying drawing 7 to accompanying drawing 10.
In accompanying drawing 7 into accompanying drawing 10, the comparison of the bit error rate-signal to noise ratio and FER-signal to noise ratio has been carried out respectively." raw Bit-Error-Rate " of the accompanying drawing 7 into accompanying drawing 10 represents the simulation result encoded using the linear block codes matrix used in the existing LTE system shown in accompanying drawing 1 and accompanying drawing 2；" the invention bit error rate " represents the simulation result encoded using the linear block codes matrix shown in accompanying drawing 5 provided in an embodiment of the present invention and accompanying drawing 6., it is apparent that for { 11,32 } code word from simulation result, minimum distance is lifted to 12 from 10,0.2dB obvious performance gain is brought, simultaneously for { 11,20 }, { 12,20 }, { 13,20 } code word, because minimum distance does not change, therefore on its performance also without any influence.As long as in other words replacing the 11st row of (32, the 11) matrix used in existing LTE system and (20,13) matrix simultaneously, other change without any, you can obtain performance boost.
It should be noted that in length in 32 sequence space, one has 232Individual different sequences, wherein can be by { the 11 of (32,11) linear block codes, 32 } minimum distance of code word is promoted to 12 and one has 1024, specifically, reference can be made to accompanying drawing 11, accompanying drawing 11 lists the different sequences of all this 1024.Wherein, in addition to the above-mentioned sequence provided, remaining 1023 sequence can pass through the above-mentioned sequence { 1,1,1,1 provided, 1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0 } any n with preceding 10 row in existing (32,11) matrix is arranged（1≤≤ combination 10) is done linear mould 2 plus obtained.Certainly, this 1024 sequences can also be obtained by way of traversal.Therefore, for the linear block codes matrix of (32,11), this 1024 sequence practical functions are equivalent, therefore the sequence that provides of the present invention is actual covers 1024 all sequences. Analyzed with reference to more than, a kind of method of linear block codes coding provided in an embodiment of the present invention, including：One input message sequence is used（32,11) linear block codes matrix is encoded, the coded sequence that output length is 32；Wherein, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12.
The sequence of 11st row of the linear block codes matrix of (32,11) that are provided in the present embodiment can be any one of 1024 sequences shown in accompanying drawing 11.One of example is：
{i,i, ι,ι, ι,ι, ι,ι, ι,ι, ι,ο,ο,ο,ι, 1,0,1,0,0,0,1,0,1,0,1,0,0,1, 1, 1,0}„
Preceding 10 row of the linear block codes matrix of (32,11) that are provided in the present embodiment are as shown in tables 1 to 5.
Table 1-5
For a length of m of information bit input message sequence X, the coded sequence that length is 32 is obtained after coding y;Wherein, input message sequence x^x^x^.x^ }, m≤ll;Coded sequence y={ y^ywy, y,=§ (x-Min) mod2 ,=0,1,2 ..., 31, for the linear block codes matrix column of (32,11).The method for the linear block codes coding that the present embodiment is provided, by optimizing used in existing LTE system (32,11) the 11st row in linear block codes matrix, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12, theoretic minimum distance has been reached, has not also changed existing decoding method, therefore improve the systematic function after linear block codes coding.
It will be understood by those skilled in the art that doing arbitrary line replacement to the linear block codes matrix of these (32,11) cited in the present embodiment or column permutation is impacted all without to coding efficiency.Therefore, the linear block codes matrix real to this is belonged within the scope of the present invention.
The method that the embodiment of the present invention also provides another linear block codes coding, including：
One input message sequence is used（20,13) linear block codes matrix is encoded, the coded sequence that output length is 20；Wherein, the sequence that the sequence of the 11st row of the linear block codes matrix of described (20,13) can constitute for first 20 of any one sequence in the sequence of 1024 32 shown in Figure 11.Such as, { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0
Preceding 10 row of the linear block codes matrix of (20,13) that the present embodiment is provided and the 12nd row, 13 row are as shown in table 1-6：
Table 1-6
i Mi;0 Mu Mi,2 Mi Mi;4 M Mi,6 Mi,7 Mi,8 Mi,9 MU1 U2
0 1 1 0 0 0 0 0 0 0 0 1 0
1 1 1 1 0 0 0 0 0 0 1 1 0
2 1 0 0 1 0 0 1 0 1 1 1 1
3 1 0 1 1 0 0 0 0 1 0 1 1
4 1 1 1 1 0 0 0 1 0 0 1 1
5 1 1 0 0 1 0 1 1 1 0 1 1
6 1 0 1 0 1 0 1 0 1 1 1 1
7 1 0 0 1 1 0 0 1 1 0 1 1
8 1 1 0 1 1 0 0 1 0 1 1 1
9 1 0 1 1 1 0 1 0 0 1 1 1
10 1 0 1 0 0 1 1 1 0 1 1 1
11 1 1 1 0 0 1 1 0 1 0 1 1
12 1 0 0 1 0 1 0 1 1 1 1 1
13 1 1 0 1 0 1 0 1 0 1 1 1
14 1 0 0 0 1 1 0 1 0 0 0 1 15 1 1 0 0 1 1 1 1 0 1 0 1
16 1 1 1 0 1 1 1 0 0 1 1 1
17 1 0 0 1 1 1 0 0 1 0 1 1
18 1 1 0 1 1 1 1 1 0 0 0 0
19 100001100000 it is understood that the sequence of the 11st row is bad in the linear block codes matrix of (20,13) that are provided in the present embodiment ' J can also be by ^！Seek sequence it is bad ' combine for any η row in preceding 10 row of J { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 } and (20,13) the 々 linear block codes matrixes do linear mould 2 and add any one in obtained sequence；Wherein, 1≤"≤10.
For a length of m of information bit input message sequence X, the coded sequence y that length is 20 is obtained after coding;Wherein, input message sequence x^x^x^.x^ }, m≤13;Coded sequence y=., ...9}, yi = g(xB.Min)mod2, = 0, 1,2, 19,Mi,nFor the bad l of the linear block codes matrix of (20,13).It will be understood by those skilled in the art that doing arbitrary line replacement to the linear ^ i groups code matrix of these (20,13) cited in the present embodiment or column permutation is impacted all without to coding efficiency.Therefore, to this
To linear block codes matrix belong within the scope of the present invention.
It should be noted that above-mentioned input message sequence can be the control information transmitted on the physical channel in the follow-up evolution systems of LTE or LTE.Such as, (32,11) and (20,13) provided in an embodiment of the present invention linear block codes matrix can be used to indicate respectively the channel quality transmitted on PUSCH in LTE system and PUCCH（CQI, Channel Quality Indication) encoded.
The method of linear block codes coding provided in an embodiment of the present invention, by optimizing used in existing LTE system (32,11) with (20,13) the 11st row in linear block codes matrix, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12, theoretic minimum distance is reached, simultaneously to existing { 11,20 }, { 12,20 }, { 13,20 } minimum distance of code word does not cause any impact, does not also change existing decoding method, therefore improve the systematic function after linear block codes coding.The device encoded corresponding to the embodiment of the method for the present invention, a kind of linear block codes that the present invention is provided, including：
Coding unit, for using an input message sequence（32,11) linear block codes matrix is compiled Code, the coded sequence that output length is 32；Wherein, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12.
Wherein, preceding 10 row of linear block codes matrix of (32,11) are somebody's turn to do as shown in above-mentioned table 1-5.The sequence for being somebody's turn to do the 11st row of the linear block codes matrix of (32,11) can be any one of 1024 sequences shown in accompanying drawing 11.One of example is：
{i,i, ι,ι, ι,ι, ι,ι, ι,ι, ι,ο,ο,ο,ι, ι,ο,ι,ο,ο,ο,ι,ο,ι,ο,ι,ο,ο,ι, 1, 1,0}„
Specifically, the coding unit can be used for, for a length of m of information bit input message sequence X, and the coded sequence y that length is 32 is obtained after coding;Wherein, input message sequence χ ^^, χ ^., χ ^ }, m≤ll;Coded sequence y=., ..31}, y,. =§(xB-Min)mod2 , = 0, 1, 2, ..., 31,
Ml5nFor the linear block codes matrix column of (32,11).
The device encoded corresponding to the embodiment of the method for the present invention, another linear block codes that the present invention is provided, including：
Coding unit, is used for the input message sequence to a length of m of an information bit（20,13) linear block codes matrix is encoded, the coded sequence that output length is 20；Wherein, the sequence of the 11st row of the linear block codes matrix of described (20,13) can constitute ^ for first 20 of any one sequence of 32 shown in Figure 11;Sequence is bad ' J.T an ancient type of spoons mouthful, { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 }.
Preceding 10 row and the 12nd row, 13 row of the linear block codes matrix of (20,13) are somebody's turn to do as shown in above-mentioned table 1-6.
It is understood that should in the linear block codes matrix of (20,13) the 11st row sequence can with can also by the way that sequence is bad, 1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 } with should (20,13) linear block codes matrix preceding 10 row in the combinations of any n row do linear mould 2 and add any one in obtained sequence；Wherein, 1≤≤ 10.
Specifically, the coding unit is used for, for a length of m of information bit input message sequence X, and the coded sequence y that length is 20 is obtained after coding;Wherein, input message sequence χ ^^, χ ^., χ ^ }, m≤13;Coded sequence y={ γ., ^ .. γ19}, = 0, 1,2, ..., 19, Mi,nFor this (20,13) linear block codes matrix column.
It should be noted that above-mentioned input message sequence can be the control information transmitted on the physical channel in the follow-up evolution systems of LTE or LTE.Such as, (32,11) and (20,13) provided in an embodiment of the present invention linear block codes matrix can be used to indicate respectively the channel quality transmitted on PUSCH in LTE system and PUCCH（CQI, Channel Quality Indication) encoded.
The device for the linear block codes coding that the present invention is provided, by optimizing existing (32,11) with (20,13) the 11st row in linear block codes matrix, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12, theoretic minimum distance is reached, simultaneously to existing { 11,20 }, { 12,20 }, the minimum distance of { 13,20 } code word do not cause any impact, do not change existing decoding method, therefore improve the systematic function after linear block codes coding yet.
Professional will be further appreciated that, the unit and algorithm steps of each example described with reference to the embodiments described herein, it can be realized with electronic hardware, computer software or the combination of the two, in order to clearly demonstrate the interchangeability of hardware and software, the composition and step of each example are generally described according to function in the above description.These functions are performed with hardware or software mode actually, depending on the application-specific and design constraint of technical scheme.Professional and technical personnel can realize described function to each specific application using distinct methods, but this realization is it is not considered that beyond the scope of this invention.
The step of method or algorithm for being described with reference to the embodiments described herein, can be implemented with hardware, the software module of computing device, or the combination of the two.Software module can be placed in random access memory (RAM), internal memory, read-only storage（ROM), in electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or any other form of storage mediums.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, any modifications, equivalent substitutions and improvements made within the spirit and principles of the invention etc., should be included in the scope of the protection.

Claims (6)

  1. Claims
    1st, a kind of method of linear block codes coding, it is characterised in that including：
    One input message sequence is used（32,11) linear block codes matrix is encoded, the coded sequence that output length is 32；Wherein, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12.
    2nd, the method as described in claim 1, it is characterised in that the linear block codes matrix of (32,11) the 11st row sequence be：
    {i,i, ι,ι, ι,ι, ι,ι, ι,ι, ι,ο,ο,ο,ι, ι,ο,ι,ο,ο,ο,ι,ο,ι,ο,ι,ο,ο,ι, 1, 1,0}„
    3rd, method as claimed in claim 2, it is characterised in that preceding 10 row of the linear block codes matrix of (32,11) are as shown in table 2-1.
    Table 2-1
    i Mi;0 M Mi,2 My Mi;4 M Mi,6 Mi,7 Mi,8 Mi,9
    0 1 1 0 0 0 0 0 0 0 0
    1 1 1 1 0 0 0 0 0 0 1
    2 1 0 0 1 0 0 1 0 1 1
    3 1 0 1 1 0 0 0 0 1 0
    4 1 1 1 1 0 0 0 1 0 0
    5 1 1 0 0 1 0 1 1 1 0
    6 1 0 1 0 1 0 1 0 1 1
    7 1 0 0 1 1 0 0 1 1 0
    8 1 1 0 1 1 0 0 1 0 1
    9 1 0 1 1 1 0 1 0 0 1
    10 1 0 1 0 0 1 1 1 0 1
    1 1 1 1 1 0 0 1 1 0 1 0
    12 1 0 0 1 0 1 0 1 1 1
    13 1 1 0 1 0 1 0 1 0 1
    14 1 0 0 0 1 1 0 1 0 0
    15 1 1 0 0 1 1 1 1 0 1
    16 1 1 1 0 1 1 1 0 0 1
    17 1 0 0 1 1 1 0 0 1 0
    18 1 1 0 1 1 1 1 1 0 0
    19 1 0 0 0 0 1 1 0 0 0
    20 1 0 1 0 0 0 1 0 0 0
    21 1 1 0 1 0 0 0 0 0 1
    22 1 0 0 0 1 0 0 1 1 0
    23 1 1 1 0 1 0 0 0 1 1
    24 1 1 1 1 1 0 1 1 1 1
    25 1 1 0 0 0 1 1 1 0
    26 1 0 1 1 0 1 0 0 1 1
    27 1 1 1 1 0 1 0 1 1 1
    28 1 0 1 0 1 1 1 0 1 0
    29 1 0 1 1 1 1 1 1 1 0
    30 1 1 1 1 1 1 1 1 1 1 31 1 0 0 0 0 0 0 0 0 0
    4th, method as claimed in claim 3, it is characterised in that the sequence of the 11st row of the linear block codes matrix of (32,11) includes：
    By sequence { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0 } linear mould 2 is done with the combination of any n row in preceding 10 row of the linear block codes matrix of (32,11) and adds any one in obtained sequence, wherein, 1≤"≤10.
    5th, the method as described in claim 1-4 any one, it is characterised in that
    For a length of m of information bit input message sequence X, the coded sequence y that length is 32 is obtained after coding;Wherein, the input message sequence x^xc, ^..^^ }, m≤ll;The coded sequence y={ y., yl ..y31}, y. = §(x„ ·Μίη)ηιοά2 , = 0, 1, 2, ··., 31,
    Ml5nFor the linear block codes matrix column of (32,11).
    6th, a kind of method of linear block codes coding, it is characterised in that including：
    One input message sequence is used（20,13) linear block codes matrix is encoded, the coded sequence that output length is 20；Wherein, the sequence of the 11st row of the linear block codes matrix of described (20,13) is { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 }.
    7th, method as claimed in claim 6, it is characterised in that preceding 10 row of the linear block codes matrix of (20,13) and the 12nd row, 13 row are as shown in table 2-2：
    Table 2-2
    i Mi;0 Mu Mi,2 My Mi;4 Mi,5 Mi,6 Mi,7 Mi,8 Mi,9 MU1 U2
    0 1 1 0 0 0 0 0 0 0 0 1 0
    1 1 1 1 0 0 0 0 0 0 1 1 0
    2 1 0 0 1 0 0 1 0 1 1 1 1
    3 1 0 1 1 0 0 0 0 1 0 1 1
    4 1 1 1 1 0 0 0 1 0 0 1 1
    5 1 1 0 0 1 0 1 1 1 0 1 1
    6 1 0 1 0 1 0 1 0 1 1 1 1
    7 1 0 0 1 1 0 0 1 1 0 1 1
    8 1 1 0 1 1 0 0 1 0 1 1 1
    9 1 0 1 1 1 0 1 0 0 1 1 1
    10 1 0 1 0 0 1 1 1 0 1 1 1
    11 1 1 1 0 0 1 1 0 1 0 1 1
    12 1 0 0 1 0 1 0 1 1 1 1 1
    13 1 1 0 1 0 1 0 1 0 1 1 1
    14 1 0 0 0 1 1 0 1 0 0 0 1
    15 1 1 0 0 1 1 1 1 0 1 0 1 16 1 1 1 0 1 1 1 0 0 1 1 1
    17 1 0 0 1 1 1 0 0 1 0 1 1
    18 1 1 0 1 1 1 1 1 0 0 0 0
    19 1 0 0 0 0 1 1 0 0 0 0 0
    8th, method as claimed in claim 7, it is characterised in that the sequence of the 11st row also includes in the linear block codes matrix of (20,13)：
    By sequence it is bad ' combine for any n row in preceding 10 row of J { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 } and the linear block codes matrix of (20,13) do linear mould 2 and add any one in obtained sequence；Wherein, 1≤≤ 10.
    9th, the method as described in claim 6-8 any one, it is characterised in that
    For a length of m of information bit input message sequence X, the coded sequence y that length is 20 is obtained after coding;Wherein, the input message sequence x^xc, ^..^^ }, m≤13;The coded sequence y=., " ..^9}, , = 0, 1,2, ··., 19,
    M,nFor the linear block codes matrix column of (20,13).
    10th, a kind of device of linear block codes coding, it is characterised in that including：
    Coding unit, for using an input message sequence（32,11) linear block codes matrix is encoded, the coded sequence that output length is 32；Wherein, input information bit it is a length of 11 when, the minimum distance of the coded sequence of output is 12.
    11st, device as claimed in claim 10, it is characterised in that the linear block codes matrix of (32,11) the 11st row sequence be：
    {i,i, ι,ι, ι,ι, ι,ι, ι,ι, ι,ο,ο,ο,ι, ι,ο,ι,ο,ο,ο,ι,ο,ι,ο,ι,ο,ο,ι, 1, 1,0}„
    12nd, device as claimed in claim 11, it is characterised in that preceding 10 row of the linear block codes matrix of (32,11) are as shown in table 2-3.
    Table 2-3
    i Mi;0 M Mi,2 My Mi;4 M Mi,6 Mi,7 Mi,8 Mi,9
    0 1 1 0 0 0 0 0 0 0 0
    1 1 1 1 0 0 0 0 0 0 1
    2 1 0 0 1 0 0 1 0 1 1
    3 1 0 1 1 0 0 0 0 1 0
    4 1 1 1 1 0 0 0 1 0 0
    5 1 1 0 0 1 0 1 1 1 0 6 1 0 1 0 1 0 1 0 1 1
    7 1 0 0 1 1 0 0 1 1 0
    8 1 1 0 1 1 0 0 1 0 1
    9 1 0 1 1 1 0 1 0 0 1
    10 1 0 1 0 0 1 1 1 0 1
    11 1 1 1 0 0 1 1 0 1
    12 1 0 0 1 0 1 0 1 1 1
    13 1 1 0 1 0 1 0 1 0 1
    14 1 0 0 0 1 1 0 1 0
    15 1 1 0 0 1 1 1 1 0 1
    16 1 1 1 0 1 1 1 0 0 1
    17 1 0 0 1 1 1 0 0 1 0
    18 1 1 0 1 1 1 1 1 0 0
    19 1 0 0 0 0 1 1 0 0 0
    20 1 0 1 0 0 0 1 0 0 0
    21 1 1 0 1 0 0 0 0 0 1
    22 1 0 0 0 1 0 0 1 1 0
    23 1 1 1 0 1 0 0 0 1 1
    24 1 1 1 1 1 0 1 1 1 1
    25 1 1 0 0 0 1 1 1 0
    26 1 0 1 1 0 1 0 0 1 1
    27 1 1 1 1 0 1 0 1 1 1
    28 1 0 1 0 1 1 1 0 1 0
    29 1 0 1 1 1 1 1 1 1 0
    30 1 1 1 1 1 1 1 1 1 1
    31 1 0 0 0 0 0 0 0 0 0
    13rd, device as claimed in claim 12, it is characterised in that the sequence of the 11st row of the linear block codes matrix of (32,11) also includes：
    By sequence { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0 } linear mould 2 is done with the combination of any n row in preceding 10 row of the linear block codes matrix of (32,11) and adds any one in obtained sequence, wherein, 1≤≤ 10.
    14th, the device as described in claim 10-13 any one, it is characterised in that the coding unit is specifically for for a length of m of information bit input message sequence X, obtaining the coded sequence y that length is 32 after coding;Wherein, the input message sequence x={ x.,Xl , . . . xm} , m≤ 11；The coded sequence y={ y., yl . . y31 } , y. = ¾(Xb . Mi n )mod2 , = 0, 1, 2, · · ., 31 ,
    Ml5nFor the linear block codes matrix column of (32,11).
    15th, a kind of device of linear block codes coding, it is characterised in that including：
    Coding unit, is used for the input message sequence to a length of m of an information bit（20,13) linear block codes matrix is encoded, the coded sequence that output length is 20；Wherein, the Linear codes of described (20,13) Code VLA ^;11st bad ' J 々 sequences bad ' J is { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 }.
    16th, device as claimed in claim 15, it is characterised in that preceding 10 row of the linear block codes matrix of (20,13) and the 12nd row, 13 row are as shown in Table 2-4：
    Table 2-4
    17th, device as claimed in claim 16, it is characterised in that the sequence of the 11st row also includes in the linear block codes matrix of (20,13)：
    By sequence it is bad ' combine for any n row in preceding 10 row of J { 1,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,0,1,0,0 } and the linear block codes matrix of (20,13) do linear mould 2 and add any one in obtained sequence；Wherein, 1≤≤ 10.
    18th, the device as described in claim 15-17 any one, it is characterised in that the coding unit is specifically for for a length of m of information bit input message sequence X, obtaining the coded sequence y that length is 20 after coding;Wherein, the input message sequence ^, ^ ... ^ m≤13;The coded sequence y=., " ..^9}, y, =£(xB-Min)mod2 , = 0, 1,2, ··., 19, M,nFor the linear block codes matrix column of (20,13).
CN200980123770.2A 2009-03-19 2009-03-19 Method and device for linear block code coding Expired - Fee Related CN102077469B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2009/070886 WO2010105426A1 (en) 2009-03-19 2009-03-19 Method and device for linear block code coding

Publications (2)

Publication Number Publication Date
CN102077469A true CN102077469A (en) 2011-05-25
CN102077469B CN102077469B (en) 2013-09-11

Family

ID=42739127

Family Applications (1)

Application Number Title Priority Date Filing Date
CN200980123770.2A Expired - Fee Related CN102077469B (en) 2009-03-19 2009-03-19 Method and device for linear block code coding

Country Status (2)

Country Link
CN (1) CN102077469B (en)
WO (1) WO2010105426A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014059780A1 (en) * 2012-10-17 2014-04-24 华为技术有限公司 Encoding method, decoding method, encoding device, decoding device, encoding system, and decoding system
CN109873647A (en) * 2019-03-01 2019-06-11 桂林理工大学 One kind being based on the strong error correction/encoding method of [255,16,112] cyclic code
CN109921805A (en) * 2019-03-01 2019-06-21 桂林理工大学 One kind being based on the error correction/encoding method of [63,12,24] cyclic code

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AR088941A1 (en) 2011-11-23 2014-07-16 Bayer Ip Gmbh ANTI-FGFR2 ANTIBODIES AND THEIR USES
CN105337686B (en) * 2014-07-31 2019-02-12 展讯通信（上海）有限公司 A kind of CQI code device and method
CN110350924B (en) * 2019-08-06 2022-08-30 江西理工大学 Construction of (72,36,14) linear quasi-cyclic code

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1437340A (en) * 2002-02-06 2003-08-20 华为技术有限公司 Mapping method from the calculated value of transmission format combination to the indication of transmission format combination
US20070094582A1 (en) * 2005-10-07 2007-04-26 Sony Corporation Encoding method to QC code
CN101242220A (en) * 2008-02-05 2008-08-13 中兴通讯股份有限公司 Joint coding method and coding device in physical control channel multiplexing
US20080320370A1 (en) * 2007-06-22 2008-12-25 Sony Corporation CRC generator polynomial select method, CRC coding method and CRC coding circuit

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101391725B1 (en) * 2007-07-24 2014-05-07 삼성전자주식회사 Device and method structuring generation matrix for a linear block coding, coding and decoding devices using the matrix

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1437340A (en) * 2002-02-06 2003-08-20 华为技术有限公司 Mapping method from the calculated value of transmission format combination to the indication of transmission format combination
US20070094582A1 (en) * 2005-10-07 2007-04-26 Sony Corporation Encoding method to QC code
US20080320370A1 (en) * 2007-06-22 2008-12-25 Sony Corporation CRC generator polynomial select method, CRC coding method and CRC coding circuit
CN101242220A (en) * 2008-02-05 2008-08-13 中兴通讯股份有限公司 Joint coding method and coding device in physical control channel multiplexing

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014059780A1 (en) * 2012-10-17 2014-04-24 华为技术有限公司 Encoding method, decoding method, encoding device, decoding device, encoding system, and decoding system
CN103780329A (en) * 2012-10-17 2014-05-07 华为技术有限公司 Method, device and system for encoding and decoding
CN103780329B (en) * 2012-10-17 2018-05-04 华为技术有限公司 The method, apparatus and system of a kind of coding and decoding
US10103752B2 (en) 2012-10-17 2018-10-16 Huawei Technologies Co., Ltd. Encoding/decoding method, device, and system
CN108809512A (en) * 2012-10-17 2018-11-13 华为技术有限公司 A kind of method, apparatus and system of coding and decoding
CN108809512B (en) * 2012-10-17 2019-05-07 华为技术有限公司 A kind of method, apparatus and system of coding and decoding
US10536171B2 (en) 2012-10-17 2020-01-14 Huawei Technologies Co., Ltd. Encoding/decoding method, device, and system
US10998921B2 (en) 2012-10-17 2021-05-04 Huawei Technologies Co., Ltd. Encoding/decoding method, device, and system
US11463111B2 (en) 2012-10-17 2022-10-04 Huawei Technologies Co., Ltd. Encoding/decoding method, device, and system
CN109873647A (en) * 2019-03-01 2019-06-11 桂林理工大学 One kind being based on the strong error correction/encoding method of [255,16,112] cyclic code
CN109921805A (en) * 2019-03-01 2019-06-21 桂林理工大学 One kind being based on the error correction/encoding method of [63,12,24] cyclic code

Also Published As

Publication number Publication date
WO2010105426A1 (en) 2010-09-23
CN102077469B (en) 2013-09-11

Similar Documents

Publication Publication Date Title
US10673462B2 (en) Coding method and coding device
CN106230489B (en) Polarization code encoding modulation method suitable for any high order modulation
CN102077469A (en) Method and device for linear block code coding
US9240807B2 (en) Radio transmitting/receiving device, communication system, and channel coding processing method used thereby
CN101710850B (en) Convolution Turbo encoding method and device for realizing encoding method
US9954696B2 (en) Method and apparatus for encoding uplink control information
CN111670543B (en) Multi-component encoding for signal shaping
TW200926614A (en) Method for encoding a bit sequence and encoding circuit
CN116506074B (en) Combined source channel coding method and system based on block fading channel
EP2894804B1 (en) Apparatus and method for adaptively selecting channel code based on non-gaussianity of channel in wireless communication system
CN107733562B (en) Method and device for encoding and decoding polarization code
JP2011515979A (en) Block coding with variable rate block codes
CN102104444A (en) Rapid encoding and decoding method for channel quality indication in LTE (Long Term Evolution) system
CN103516465A (en) Coded modulation and demodulation and demodulation and decoding method, device and system
CN101483441A (en) Device for adding cyclic redundancy check in communication system
JP5357250B2 (en) System and method for preventing non-uniform errors using embedded coding
CN101262307A (en) A serial cascaded compiling and decoding system including rotary modulation mode of constellation map
KR102203607B1 (en) Method for optimizing the resources of a data transmission at the level of the mac layer and device implementing the method
CN102832954B (en) Turbo code iterative decoding stopping method based on soft information average minimum value
JP4469261B2 (en) Digital signal transmission device
CN106603087B (en) Based on the fountain codes increment decoding algorithm that can translate collection under a kind of wireless channel
US20150244496A1 (en) Bit coding device, bit decoding device, transmission device, reception device, bit coding method, bit decoding method, transmission method, reception method, and program
WO2018149389A1 (en) Data processing method, device, and transmitting terminal
JP2015133677A (en) Modulator and demodulator using spatially-coupled ldpc code
CN104168083A (en) Interleaved mapping method for coded modulation of protograph LDPC 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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20130911

CF01 Termination of patent right due to non-payment of annual fee