CN109639395A - It is a kind of to encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code - Google Patents
It is a kind of to encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code Download PDFInfo
- Publication number
- CN109639395A CN109639395A CN201811487982.6A CN201811487982A CN109639395A CN 109639395 A CN109639395 A CN 109639395A CN 201811487982 A CN201811487982 A CN 201811487982A CN 109639395 A CN109639395 A CN 109639395A
- Authority
- CN
- China
- Prior art keywords
- bit
- code
- length
- transmission
- decoding
- 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
Classifications
-
- 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
- H04L1/0058—Block-coded modulation
-
- 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
-
- 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/0045—Arrangements at the receiver end
- H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
-
- 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/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- 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/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
- H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Artificial Intelligence (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention discloses a kind of method of reseptances that incremental code length retransmission scheme is encoded suitable for polarization code, retransmission frame is merged into before a long code decoding by receiving end with frame has been passed every time, independent decoding is carried out to retransmission frame, reduce the number for calling length code decoder, reduce reception complexity, and efficiently solve when having passed frame in mobile communication system and can not utilize, the problem of later retransmission frame performance decline, transmission resource waste.Simulation result shows decoding performance when each transmission frame in the method for the present invention retransmission processes can approach transmission for the first time, while also maintaining incremental code length and merging the ability solved.
Description
Technical field
The invention belongs to wireless communication technology fields, are related to method of reseptance, more particularly to a kind of polarization code that is suitable for encodes
It is incremented by the method for reseptance of code length retransmission scheme.
Background technique
Error Correction of Coding is one of key technology of mobile communication system.Error Correction of Coding is a kind of superfluous by increasing in the information
It is remaining, improve the technology of transmission reliability.Polarization code is uniquely theoretically to be proven to by what E.Arikan was proposed for 2009
Enough reach the Error Correction of Coding of binary system discrete memoryless channel(DMC) capacity.Its principle is to be split and merged channel by channel
Polarization, so that the capacity of a part of channel tends to 0 (i.e. the channel of noise infinity), another part when code length tends to be infinite
The capacity of channel then tends to 1 (i.e. muting channel completely), and the information to be transmitted is placed on complete muting channel
On transmitted to reach system performance.
With further expanding for radio communication service range, the coding gain of single transmission is difficult to fight noisy channels item
Error probability under part, and simple simple retransmission performance is not superior enough.Hybrid automatic repeat-request is that one kind combines channel
The technology of coding and automatic repeat request, receiving end can both have been obtained again by by retransmission frame and having passed frame and merging decoding
Pass gain, it is also possible to obtain coding gain substantially increases the efficiency and resource utilization of re-transmission.It is automatic in the mixing of polarization code
In retransmission mechanism, tracking merges retransmits identical frame information in transmitting terminal every time, and receiving end by by received retransmission frame and
It has passed frame and has carried out simple addition acquisition 3dB diversity gain, and without recompiling.This method algorithm is simple, but limited capacity.
It is incremented by the polarization code for freezing to retransmit and recompiling by the information bit for choosing a part transmission failure and obtaining a low bit- rate, connects
Receiving end first solves retransmission frame, will send successful information bit after successfully decoded in retransmission frame and gives and has passed frame as freezing at bit
Reason.It is incremented by and freezes to retransmit the gain for considering channel coding, therefore the performance combined better than tracking can be obtained, but still not
The optimal performance of existing code rate can be approached.
Being incremented by code length re-transmission is a kind of for the efficient mixed automatic retransferring method of polarization code, and transmitting terminal passes through construction polarization
Code length code simultaneously sends redundancy section, and retransmission frame is merged decoding with frame has been passed by receiving end, and acquisition can approach current code rate most
Excellent gain.It is incremented by code length and retransmits existing re-transmission gain, and has the decoded gain of long code.Although the retransmission scheme superior performance,
It is that receiving end decoding needs to be decoded by being merged into long code, expands network size, increase the complexity of receiving device.
The unserviceable situation of frame has been passed moreover, existing in the application scenarios of mobile communication, has still remained defect.
Summary of the invention
To solve the above problems, the invention discloses a kind of receptions for encoding incremental code length retransmission scheme suitable for polarization code
Method.The polarization code coding result of a composite signal sequence can be regarded as since incremental code length retransmits each receiving frame,
The frame is slightly corrected to the information of available source code block, therefore receiving end of the present invention by the information sequence obtained after decoder
It by retransmission frame and has passed before frame is merged into the decoding of long code every time, independent decoding is carried out to retransmission frame.
In order to achieve the above object, the invention provides the following technical scheme:
It is a kind of to encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, include the following steps:
(1) etc. the t times transmission to be received, length are the reception sub-frame signals Y of Nt；
(2) to t-th of sub-frame signals YtIt carries out the polarization code that length is N independently to decode, obtains candidate transmission sequence Ot,
Sending sequence includes to freeze bit and CRC；
(3) it if t > 1, executes (4)；Otherwise (5) are executed；
(4) the t times transmission, 2n-1<t≤2n, n is natural number, and it is as follows to be decoded amendment to candidate's transmission sequence:
It enables
Si=(i-1) * N+1, (i-1) * N+2 ..., i*N }, i=1,2 ... 2n-1；
Wherein symbolIndicate Kronecker product；Remember preceding 2 in matrix G (n)n- 1 row, the 2ndnIt is not 0 row in-t+1 column
Mark collection is combined into A；For the element a in A, b=2 is enabledn+ 1-a,Wherein symbolExpression rounds up；Note collection
It closesFor RdIn subframe XbInterior location sets part, i.e.,And meetNote
ForCorresponding to frame X1The transmission bit duplicating position set at place, note set
Every a pair is determined by the element a in ARemember that i-th of element is hi,ci, whereinIt indicates
The number of middle element, successively by OtIn hiA bitWith corresponding ciA bitIt carries out mould two to add, and replaces OtIn
hiA bitI.e.
To obtain completing candidate sequence OtUpdate amendment；
(5) candidate sequence carries out CRC check, if verification passes through, terminates decoding, exports result；Otherwise (6) are executed；
(6) it if t > 1, executes (7), otherwise sets t=t+1, return (1)；
(7) to all received t (2n-1<t≤2n) a subframe sequentially splices, constitute 2n* N length, information bit set
ForPolarization code decoding, wherein not received 2n- t subframes are handled according to punching bit, obtain candidate transmission sequence Vn,
Sending sequence includes to freeze bit and CRC；
(8) CRC check is carried out to candidate sequence, if CRC check failure and t < T, set t=t+1, returned (1)；Otherwise it terminates
Decoding exports result.
Further, the received data in the receiving end are constructed and are sent by transmitting terminal, and transmitting terminal is according to maximum transmitted time
Number T is constructed and is incremented by the received transmission sub-frame set { X of code length re-transmissiont；T=1,2 ..., T }, wherein T=2m；M is positive integer, often
Secondary transmission subframe lengths are N；Information bit location sets can be obtained according to polarization code constructing methodWith freeze bit position
SetTransmission (t=1) for the first time is encoded using the polarization code of standard, the data bit before coding by
K information bit (including cyclic redundancy check (CRC)) and N-K a complete zero freeze bit composition, respectively according to polarization code construction side
The information bit location sets I that method obtains1With freeze bit position set F1Configuration codes input, and length is N after Polarization Coding；
Current 2n-1It, will when (n > 0) secondary transmission failsIn all elements add 2n-1* N, and by 2n-1Complete zero number that a length is N
According to block and preceding 2n-1The data block of biography that a length is N synthesizes one 2n* the data block of N-bit length, and will be formerIn set
(this partial bit position is denoted as set to the information bit being removed) copy toInformation bit position (this increased newly in set
Partial bit position is denoted as set), then passing through length is 2n* the polarization code coder of N chooses preceding 2n-1A length is N's
Newly-increased coded data block, is successively used as subsequent 2n-1The re-transmission subframe of secondary transmission.
Further, information bit set when polarization code independently decodes in the step (2) is always I1, and it is current
Number of retransmissions is unrelated.Independent decoding is suitable for any decoding algorithm for polarization code.
Further, the step (2) specifically includes following sub-step:
S21, i=0, existing route number L'=1 are enabled, it is L that setting, which can hold survivor path number,；
S22, to existing all L' decoding paths, calculate the LLR value of each path current bit；
S23, judge whether i ∈ I1, it is to execute S24；Otherwise S25 is jumped to；
S24, be extended to L' item: L' decoding path copies as 2*L' item, translates the current bit of preceding L' paths
Code result sets 0, sets 1 to the current bit decoding result of rear L' paths, updates 2*L' paths metric；If 2*L' > L,
Cut off the higher excess path of path metric value；Existing route number L' is updated, S26 is turned；
S25,0 is set to the current bit decoding bit of all L' paths, updates L' paths metric；
S26, judge whether i < N, that is, judge whether still have code word undecoded, if then enabling i=i+1, execute S22, otherwise
Decoding terminates, and obtains candidate transmission sequence Ot。
Further, it is handled in the step (7) according to punching bit are as follows: the initial likelihood ratio of punching bit is set 0.
Further, decoding process in the step (7) are as follows:
ForNote set When decodingAs freezing bit process when bit at position, so that forIn j-th of element pj,qj, candidate's transmission sequence VnMeet pthjA elementWith qjA elementIt is equal, it may be assumed that
Further, described to freeze bit process are as follows: willBit value at position is placed directly withinAt position.
Compared with prior art, the invention has the advantages that and the utility model has the advantages that
The present invention first carries out independent decoding before merging decoding, reduces the number for calling length code decoder, reduces and set
Standby complexity, improves decoding validity, efficiently solves and has passed frame in existing mobile communication system method of reseptance and can not utilize
When, later retransmission frame performance decline, the problem of transmission resource waste.Simulation result shows in the present invention in method retransmission processes
Each transmission frame can approach decoding performance when transmission for the first time, while also maintaining incremental code length and merging the ability solved.
Detailed description of the invention
Fig. 1 is the incremental code length construction subframe schematic diagram of polarization code, wherein (a) is schematic diagram before encoding, it (b) is to show before encoding
It is intended to.
Fig. 2 is receiving algorithm flow chart of the invention.
Fig. 3 is initial code length N=128, and the polarization code of code rate R=0.75 utilizes the independent decoding in receiving algorithm of the present invention
Frame error rate curve.
Fig. 4 is initial code length N=256, and the polarization code of code rate R=0.5 utilizes the independent decoding in receiving algorithm of the present invention
Frame error rate curve.
Fig. 5 is initial code length N=128, and the polarization code of code rate R=0.75 is decoded using the merging in receiving algorithm of the present invention
Frame error rate curve.
Specific embodiment
Technical solution provided by the invention is described in detail below with reference to specific embodiment, it should be understood that following specific
Embodiment is only illustrative of the invention and is not intended to limit the scope of the invention.
Present embodiment discloses a kind of method of reseptances that incremental code length retransmission scheme is encoded suitable for polarization code, and receiving end exists
Receive received vector YtWhen, primary independent decoding is carried out first.If decoding failure, to all received t (2n-1<t≤
2n) a subframe merges, constitute 2n* the polarization code decoding (not received 2 of N lengthn- t subframes according to punching bit at
Reason).Specifically, with T=4, for decoding algorithm continuously deletes decoding (CA-SCL) for the list of cyclic redundancy check auxiliary,
As shown in Figure 1, transmitting terminal constructs first sends frame set { X1,X2,X3,X4, method is as follows:
(1) X is constructed1:
Construction code length is the polarization code of N and chooses information bit set I1With freeze bit set F1, information bit is placed in I1
Place, complete zero, which freezes bit, is placed in set F1Place, which is formed, sends sequence, carries out the polarization code that code length is N and encodes to obtain subframe X1。
(2) X is constructed2:
(a)I1In all elements add N；
(b) the full zero data blocks that length is N are synthesized into a 2*N bit length with the data block of biography that length before is N
Data block, construction code length be 2*N polarization code and choose information bit set I2With freeze bit set F2；
(c) I is found out1In be not belonging to I2Element, be denoted as C2；Find out I2In be not belonging to I1Element, be denoted as R2；
(d) by source code block C2On bit successively copy to R2On；
(e) the polarization code coding for carrying out code length 2*N to obtained source code block chooses the newly-increased encoding block that first length is N
Obtain subframe X2。
(3) X is constructed3,X4:
(a)I2In all elements add 2*N；
(b) the full zero data blocks that length is 2*N are synthesized into a 4*N bit with the data block of biography that length before is 2*N
The data block of length, construction code length are the polarization code of 4*N and choose information bit set I4With freeze bit set F4；
(c) I is found out2In be not belonging to I4Element, be denoted as C4；Find out I4In be not belonging to I2Element, be denoted as R4；
(d) by source code block C4On bit successively copy to R4On；
(e) polarization code for carrying out code length 4*N to obtained source code block encodes, and obtains the newly-increased coding that first length is N
Section is subframe X4, the newly-increased coding section that second length is N is subframe X3
Transmission subframe X every timetAfter channel, in receiving end, as shown in Fig. 2, the present embodiment specifically executes following operation:
S1, etc. it is to be received the t times transmission, length be N reception sub-frame signals Yt。
S2, to t-th of sub-frame signals YtProgress length is N, and information bit collection is combined into I1Polarization code independently decode, obtain
Candidate transmission sequence Ot(comprising freezing bit and CRC), independent decoding are suitable for any decoding algorithm for polarization code, solution
Information bit set when code is always I1And it is unrelated with the value of t.Specifically include following sub-step:
S21, i=0, existing route number L'=1 are enabled, it is L that setting, which can hold survivor path number,.
S22, to existing all L' decoding paths, calculate the LLR value of each path current bit.
S23, judge whether i ∈ I1, it is to execute S24；Otherwise S25 is jumped to.
S24, be extended to L' item: L' decoding path copies as 2*L' item, translates the current bit of preceding L' paths
Code result sets 0, sets 1 to the current bit decoding result of rear L' paths, updates 2*L' paths metric；If 2*L' > L,
Cut off the higher excess path of path metric value；Existing route number L' is updated, S26 is turned.
S25,0 is set to the current bit decoding bit of all L' paths, updates L' paths metric.
S26, judge whether i < N, that is, judge whether still have code word undecoded, if then enabling i=i+1, execute S22, otherwise
Decoding terminates, and obtains candidate transmission sequence Ot。
If S3, t > 1, S4 is executed；Otherwise S5 is executed.
S4, the t times transmission (2≤t≤4) send sequence to candidate and are decoded amendment, institute's selection operation ratio in decoding amendment
It is special related with current number of retransmissions t:
(a) as t=2, because 20<t≤21, therefore n=1,It is not 0 row in the preceding column of 1 row the 1st
It marks set A={ 1 }；As a=1, b=2, d=2 can be obtained, can further be obtainedSuccessively by O2In hiA bitWith it is right
The c answerediA bitIt carries out mould two to add, and replaces o2In hiA bitI.e.
WhereinIt indicatesThe number of middle element, to obtain completing candidate sequence O2Update amendment.
(b) as t=3, because 21<t≤22, therefore n=2, it can similarly obtain A={ 2 }；
As a=2, b=3, d=4 can be obtained, can further be obtainedSuccessively by O3In hiA bitWith it is corresponding
CiA bitIt carries out mould two to add, and replaces O3In hiA bitI.e.
To obtain completing candidate sequence O3Update amendment.
(c) as t=4, because 21<t≤22, therefore n=2, it can similarly obtain A={ 1,2,3 }；
As a=1, b=4, d=4 can be obtained, can further be obtainedSuccessively by O4In hiA bitWith it is corresponding
CiA bitIt carries out mould two to add, and replaces o4In hiA bitI.e.
As a=2, b=3, d=4 can be obtained, can further be obtainedSuccessively by O4In hiA bitWith it is corresponding
CiA bitIt carries out mould two to add, and replaces O4In hiA bitI.e.
As a=3, b=2, d=2 can be obtained, can further be obtainedSuccessively by O4In hiA bitWith it is corresponding
CiA bitIt carries out mould two to add, and replaces O4In hiA bitI.e.
To obtain completing candidate sequence O4Update amendment.
S5, CRC check is carried out to candidate sequence, if CRC check passes through, terminates decoding, exports result；Otherwise S6 is executed.
If S6, t > 1, S7 is executed, otherwise sets t=t+1, returns to S1.
S7, a subframe of all received t (2≤t≤4) is sequentially spliced, constitutes 2n* N length, information bit collection are combined intoPolarization code decoding (not received 2n- t subframes are handled according to punching bit, 0) initial likelihood ratio is set,
(a) as t=2, P2As bit process is freezed when bit at position, i.e., by Q2Bit value at position is direct
It is placed in P2At position, obtain candidate transmission sequence (comprising freezing bit and CRC).
(b) work as t=3, when 4, P2,P4As bit process is freezed when bit at position, i.e., by Q2,Q4Ratio at position
Paricular value is placed directly within P2,P4At position, obtain candidate transmission sequence (comprising freezing bit and CRC).
S8, CRC check is carried out to candidate sequence, if CRC check failure and t < T, set t=t+1, returns to S1；Otherwise it terminates
Decoding exports result.
When being illustrated in figure 3 maximum transmission times T=4, when initial code length N=128, code rate R=0.75 of the invention only
Vertical decoding performance, when Fig. 4 show maximum transmission times T=4, when initial code length N=256, code rate R=0.5 of the invention only
Vertical decoding performance.It can be seen that independent decoding algorithm of the invention not from the frame error rate curve of two figure difference initial bit rates, code length
By the number of transmissions the optimal decoding performance under current code rate can be approached close to the frame error rate performance transmitted for the first time.Fig. 5 is first
The polarization code of beginning code length N=128, code rate R=0.75 using in receiving algorithm of the present invention the decoded frame error rate curve of merging and
The comparison simply retransmitted, it can be found that there are about 2dB or so increasings compared with simple retransmit for the merging decoding in the case of this in present invention
Benefit.
The technical means disclosed in the embodiments of the present invention is not limited only to technological means disclosed in above embodiment, further includes
Technical solution consisting of any combination of the above technical features.It should be pointed out that for those skilled in the art
For, various improvements and modifications may be made without departing from the principle of the present invention, these improvements and modifications are also considered as
Protection scope of the present invention.
Claims (7)
1. a kind of encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, which comprises the steps of:
(1) etc. the t times transmission to be received, length are the reception sub-frame signals Y of Nt；
(2) to t-th of sub-frame signals YtIt carries out the polarization code that length is N independently to decode, obtains candidate transmission sequence Ot, send
Sequence includes to freeze bit and CRC；
(3) it if t > 1, executes (4)；Otherwise (5) are executed；
(4) the t times transmission, 2n-1<t≤2n, n is natural number, and it is as follows to be decoded amendment to candidate's transmission sequence:
It enables
Si=(i-1) * N+1, (i-1) * N+2 ..., i*N }, i=1,2 ... 2n-1；
Wherein symbolIndicate Kronecker product；Remember preceding 2 in matrix G (n)n- 1 row, the 2ndnIt is not 0 rower collection in-t+1 column
It is combined into A；For the element a in A, b=2 is enabledn+ 1-a,Wherein symbolExpression rounds up；Note set
For RdIn subframe XbInterior location sets part, i.e.,And meetNoteFor
Corresponding to frame X1The transmission bit duplicating position set at place, note set
Every a pair is determined by the element a in ARemember that i-th of element isWherein
It indicatesThe number of middle element, successively by OtIn hiA bitWith corresponding ciA bitIt carries out mould two to add, and replaces
Change OtIn hiA bitI.e.
To obtain completing candidate sequence OtUpdate amendment；
(5) candidate sequence carries out CRC check, if verification passes through, terminates decoding, exports result；Otherwise (6) are executed；
(6) it if t > 1, executes (7), otherwise sets t=t+1, return (1)；
(7) to all received t (2n-1<t≤2n) a subframe sequentially splices, constitute 2n* N length, information bit collection are combined into
Polarization code decoding, wherein not received 2n- t subframes are handled according to punching bit, obtain candidate transmission sequence Vn, send
Sequence includes to freeze bit and CRC；
(8) CRC check is carried out to candidate sequence, if CRC check failure and t < T, set t=t+1, returned (1)；Otherwise it terminates and translates
Code exports result.
2. according to claim 1 encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, feature exists
In the received data in receiving end are constructed and sent by transmitting terminal, and transmitting terminal constructs according to maximum transmission times T and is incremented by code
It is long to retransmit received transmission sub-frame set { Xt；T=1,2 ..., T }, wherein T=2m；M is positive integer, transmits subframe lengths every time
For N；Information bit location sets can be obtained according to polarization code constructing methodGather with bit position is freezed Transmission for the first time is encoded using the polarization code of standard, and the data bit before coding is by K information bit and N-K
Complete zero freezes bit composition, wherein K information bit includes cyclic redundancy check (CRC)；It is obtained respectively according to polarization code constructing method
Information bit location sets I out1With freeze bit position set F1Configuration codes input, and length is N after Polarization Coding；Currently
2n-1It, will when secondary transmission failureIn all elements add 2n-1* N, and by 2n-1The full zero data blocks that a length is N are with before
2n-1The data block of biography that a length is N synthesizes one 2n* the data block of N-bit length, and will be formerIt is removed in set
Information bitIt copies toThe information bit position increased newly in setIt is again 2 by lengthn* the polarization code coder of N, choosing
Take preceding 2n-1A length is the newly-increased coded data block of N, is successively used as subsequent 2n-1The re-transmission subframe of secondary transmission.
3. according to claim 1 encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, feature exists
In information bit set when polarization code independently decodes in the step (2) is always I1, unrelated with current number of retransmissions.
4. according to claim 3 encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, feature exists
In the step (2) specifically includes following sub-step:
S21, i=0, existing route number L'=1 are enabled, it is L that setting, which can hold survivor path number,；
S22, to existing all L' decoding paths, calculate the LLR value of each path current bit；
S23, judge whether i ∈ I1, it is to execute S24；Otherwise S25 is jumped to；
S24, be extended to L' item: L' decoding path copies as 2*L' item, decodes knot to the current bit of preceding L' paths
Fruit sets 0, sets 1 to the current bit decoding result of rear L' paths, updates 2*L' paths metric；If 2*L' > L is cut off
The higher excess path of path metric value；Existing route number L' is updated, S26 is turned；
S25,0 is set to the current bit decoding bit of all L' paths, updates L' paths metric；
S26, judge whether i < N, that is, judge whether still have code word undecoded, if then enabling i=i+1, execute S22, otherwise decode
Terminate, obtains candidate transmission sequence Ot。
5. according to claim 1 encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, feature exists
In being handled in the step (7) according to punching bit are as follows: the initial likelihood ratio of punching bit is set 0.
6. according to claim 1 encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, feature exists
In decoding process in the step (7) are as follows:
ForNote set When decodingAs freezing bit process when bit at position, so that forIn j-th of element pj,qj, candidate's transmission sequence VnMeet pthjA elementWith qjA elementIt is equal, it may be assumed that
7. according to claim 6 encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code, feature exists
In described to freeze bit process are as follows: willBit value at position is placed directly withinAt position.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811487982.6A CN109639395B (en) | 2018-12-06 | 2018-12-06 | Receiving method suitable for polar code coding incremental code length retransmission scheme |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811487982.6A CN109639395B (en) | 2018-12-06 | 2018-12-06 | Receiving method suitable for polar code coding incremental code length retransmission scheme |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109639395A true CN109639395A (en) | 2019-04-16 |
| CN109639395B CN109639395B (en) | 2021-02-02 |
Family
ID=66071699
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811487982.6A Active CN109639395B (en) | 2018-12-06 | 2018-12-06 | Receiving method suitable for polar code coding incremental code length retransmission scheme |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109639395B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112152754A (en) * | 2019-06-28 | 2020-12-29 | 华为技术有限公司 | Method and device for retransmitting polarization code |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281166A (en) * | 2013-05-15 | 2013-09-04 | 北京邮电大学 | Hybrid automatic repeat request transmission method based on polarization code |
| CN106027068A (en) * | 2015-03-25 | 2016-10-12 | 三星电子株式会社 | Harq rate-compatible polar codes for wireless channels |
| CN107612561A (en) * | 2017-09-30 | 2018-01-19 | 北京北方烽火科技有限公司 | One kind coding, interpretation method and device |
| CN108092742A (en) * | 2017-12-17 | 2018-05-29 | 华中科技大学 | A kind of communication means based on polarization code |
| US20180205395A1 (en) * | 2017-01-17 | 2018-07-19 | At&T Intellectual Property I, L.P. | Adaptive downlink control channel structure for 5g or other next generation networks |
| WO2018201481A1 (en) * | 2017-05-05 | 2018-11-08 | Huawei Technologies Co., Ltd. | Method and device for incremental redundancy hybrid automatic repeat request (ir-harq) re-transmission |
-
2018
- 2018-12-06 CN CN201811487982.6A patent/CN109639395B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103281166A (en) * | 2013-05-15 | 2013-09-04 | 北京邮电大学 | Hybrid automatic repeat request transmission method based on polarization code |
| CN106027068A (en) * | 2015-03-25 | 2016-10-12 | 三星电子株式会社 | Harq rate-compatible polar codes for wireless channels |
| US20180205395A1 (en) * | 2017-01-17 | 2018-07-19 | At&T Intellectual Property I, L.P. | Adaptive downlink control channel structure for 5g or other next generation networks |
| WO2018201481A1 (en) * | 2017-05-05 | 2018-11-08 | Huawei Technologies Co., Ltd. | Method and device for incremental redundancy hybrid automatic repeat request (ir-harq) re-transmission |
| CN107612561A (en) * | 2017-09-30 | 2018-01-19 | 北京北方烽火科技有限公司 | One kind coding, interpretation method and device |
| CN108092742A (en) * | 2017-12-17 | 2018-05-29 | 华中科技大学 | A kind of communication means based on polarization code |
Non-Patent Citations (2)
| Title |
|---|
| HUAWEI, HISILICON: "R1-1611255", 《3GPP TSG RAN WG1 MEETING #87》 * |
| HUAWEI, HISILICON: "R1-167210", 《3GPP TSG RAN WG1 MEETING #86》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112152754A (en) * | 2019-06-28 | 2020-12-29 | 华为技术有限公司 | Method and device for retransmitting polarization code |
| CN112152754B (en) * | 2019-06-28 | 2021-12-28 | 华为技术有限公司 | Method and device for retransmitting polarization code |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109639395B (en) | 2021-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103684680B (en) | Decoding a coded data block | |
| EP1994669B1 (en) | Method and apparatus for transmitting and receiving a data block in a wireless communication system | |
| CN102638331B (en) | Wireless reliable broadcasting method based on random linear network code | |
| CN102694636B (en) | Adopt sending, receiving method and the system of the HARQ technology of fountain codes | |
| CN101938334B (en) | Adaptive error control method combining random network coding and automatic repeat request | |
| WO2017215382A1 (en) | Data transmission method, device and system | |
| CN101237310B (en) | A method for enhanced self-adapted data retransfer | |
| WO2003098810A1 (en) | Reliability-based hybrid arq scheme | |
| JPH09238125A (en) | Error control method and its device | |
| CN102037671A (en) | Selection of retransmission settings for HARQ in WCDMA and LTE networks | |
| TWI352552B (en) | Relay station and method for enabling reliable dig | |
| CN101667904A (en) | All-in-one feedback retransmission method based on fountain codes | |
| CN106936548A (en) | A kind of mixed automatic retransmission request method and its device based on polarization code | |
| CN102013966A (en) | Data packet retransmission method based on network coding | |
| CN101826935B (en) | Low-density parity check code-based relay cooperative transmission method | |
| CN101420291A (en) | Combined decoding method for network and channel code in relay system | |
| JP2010147755A (en) | Transmitter, receiver and communication system | |
| US7099405B2 (en) | Communication systems with hybrid automatic repeat requests (HARQ) and rate matching | |
| CN102420617A (en) | Overlapped RM (Reed-Muller) code decoding method and system | |
| CN102244561B (en) | Relay transmission method applied to multiple access relay network | |
| CN109088701A (en) | A kind of LDPC code serial transmission method based on online fountain codes | |
| CN103078716A (en) | Distributed 3-D Turbo code-based relay transmission method | |
| CN109639395A (en) | It is a kind of to encode the method for reseptance for being incremented by code length retransmission scheme suitable for polarization code | |
| Liang et al. | Efficient design of multi-packet hybrid ARQ transmission scheme based on polar codes | |
| CN107248904B (en) | LDPC code error control method based on joint coding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |