CN102130747A - Dynamic allocation method for decoding iteration of transmission block of topological code of long term evolution (LTE) system - Google Patents
Dynamic allocation method for decoding iteration of transmission block of topological code of long term evolution (LTE) system Download PDFInfo
- Publication number
- CN102130747A CN102130747A CN2011101101773A CN201110110177A CN102130747A CN 102130747 A CN102130747 A CN 102130747A CN 2011101101773 A CN2011101101773 A CN 2011101101773A CN 201110110177 A CN201110110177 A CN 201110110177A CN 102130747 A CN102130747 A CN 102130747A
- Authority
- CN
- China
- Prior art keywords
- decoding
- transmission block
- block
- encoding block
- iterative 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
Images
Abstract
The invention provides a dynamic allocation method for decoding iteration of a transmission block of a topological code of a third generation partnership project (3GPP) long term evolution (LTE) system. According to the method, within the maximum processing time delay of the transmission block, the remained iterative decoding time delay of encoding blocks which are decoded successfully in advance is re-allocated to the encoding blocks which cannot be successfully decoded temporarily by effectively utilizing decoder hardware resources and the processing time delay allocated to the current transmission block, so that the decoding performance of the whole transmission block is improved. The method mainly comprises the following steps of: limiting the processing time delay of the transmission block by setting the maximum iterations of each encoding block, wherein the each encoding block of the transmission block in the LTE adopts an iterative decoding algorithm based on maximum posterior probability; firstly, carrying out iterative decoding on the encoding blocks sequentially, carrying out cyclic redundancy check simultaneously, and counting the iterations for dynamic allocation according to a check result; and when decoding of all of the encoding blocks is finished, averagely allocating the counted iterations to the encoding blocks which are not decoded successfully, and continuing carrying out the iterative decoding on the encoding blocks according to the iterations obtained by allocation.
Description
Technical field
The present invention has provided a kind of dynamic allocation method of topological code transmission block decoding iteration of long evolving system, belongs to the digital communications data link-layer technologies field in the Communication and Information Systems.
Background technology
One, the physical layer transmission piece of LTE (3GPP Long Term Evolution, Long Term Evolution) system
LTE (3GPP Long Term Evolution, Long Term Evolution) the topological encode scheme has been used in data service in, data arrive coding unit with the form of transmission block, obtain a transmission block (except under the space division multiplexing pattern) in each Transmission Time Interval (TTI).The code length of topology sign indicating number is long more, code word is more near random code, performance is good more, but the complexity that coder is realized is also high more, is not suitable for practical application more, therefore, LTE is 6144 bits with the length restriction of single topological encode piece, if the length of transmission block is worth greater than this, then be divided into a plurality of encoding blocks, coding and cascade output successively.Consider problems such as data error detection and transfer resource distribution, also comprise steps such as CRC check and rate-matched in the binary encoding scheme of topology sign indicating number among the LTE.May further comprise the steps:
1) transmission block adds CRC: in length is the transmission block a of A bit
0, a
1, a
2, a
3..., a
A-1Afterbody adds the CRC check position of L bit, and obtaining length is the bit sequence b of B
0, b
1, b
2, b
3..., b
B-1, B=A+L wherein.Wherein the CRC check generator polynomial of transmission block is g
CRC24A(D)=[D
24+ D
23+ D
18+ D
17+ D
14+ D
11+ D
10+ D
7+ D
6+ D
5+ D
4+ D
3+ D+1].
2) code block is cut apart, and each code block adds CRC: if B＞6144 then need the size according to the B value, with b
0, b
1, b
2, b
3..., b
B-1Be divided into N encoding block CB
1, CB
2..., CB
N, wherein
And the CRC check position of adding the L bit respectively, the length that finally obtains each encoding block is K
i, i ∈ [1, N].Wherein, the CRC check generator polynomial of each encoding block (CB) is g
CRC24B(D)=[D
24+ D
23+ D
6+ D
5+ D+1].
3) each encoding block topological encode: use the topological encode device that N encoding block carried out topological encode respectively, obtain that N organizes, every group three tunnel length is D
iCoded bit stream
J=1,2 or 3, D
i=K
i+ 4, i ∈ [1, N].
4) rate-matched: three circuit-switched data flow points of each encoding block Jing Guo sub-block interleaving, bit is selected, and exports one tunnel transfer sequence e through rate-matched at last respectively
I0, e
I1, e
I2, e
I3...,
I ∈ [1, N], wherein E
iBe the bit number of i code block after rate-matched.
5) code block cascade: the output after N the encoding block rate-matched is linked to each other successively, and the bit sequence that obtains exporting is f
k, k=0 wherein ..., G-1, G are except that the bit of control information transmission, the coded-bit sum that is used to transmit.
Two, Turbo code encoding and decoding technique
Wherein Turbo code (topology sign indicating number) was proposed by people such as C.Berrou early than 1993, and is very fast because of its good characteristic that approaches the Shannon limit obtains to pay close attention to widely, and is widely used in the various 3G system this year.The Turbo encoding scheme that data service is used among the LTE, short then tens bits of the transport block length of support reach a hundreds of thousands bit.Turbo coding in the LTE standard has still adopted the form of Parallel Concatenated Convolutional Code (PCCC), is made up of component coder and an interleaver of two 8 states.The transfer function of component coder is as follows:
Wherein, g
0(D)=1+D
2+ D
3, g
1(D)=1+D+D
3
Interleaver is being brought into play key effect in the topology sign indicating number, the performance of directly influence topology sign indicating number.The interleaver that adopts among the LTE is twice replaced polynomial (QPP) interleaver.The expression formula of QPP interleaver is ∏ (i)=(f
1I+f
2I
2) mod K, the bit sequence before and after wherein ∏ (i), i are respectively and interweave.And the coefficient f that interweaves
1And f
2Can be according to the acquisition of tabling look-up of the length K of interleaved bitstream.The QPP interleaver is not only realized simpler, and supports the parallel decoding of topology sign indicating number, thereby can satisfy the requirement of the descending 100Mbps peak rate of LTE.
The Turbo code decoder has improved the drawback of traditional cascaded code, has introduced the method for iterative decoding, makes that the amount of information between the two-stage decoder can circulating transfer improve information utilization, strengthens error correcting capability.The conceptual model of Turbo code decoder as shown in Figure 3.
Sys represents the sequence of systematic of decoder input, and Par0 and Par1 represent the check bit sequence, the output of respectively corresponding two component coders.Adopt two component decoder DEC0 and DEC1 to come iterative decoding, both are by interweaving and the outer cover letter breath of deinterleaving transmission Le.Common decoding flow process is first DEC0 decoding, the outer cover letter breath Le0 that obtains is woven into prior information La0 passes to DEC1; DEC1 decoding then becomes prior information La1 to pass to DEC0 the outer cover letter breath Le1 deinterleaving that obtains.Finish iteration like this one time.Through after the iteration repeatedly, obtain the likelihood ratio LLR of each bit at last by the output of DEC1, finally obtain decode results D through deinterleaving and hard decision.
The algorithm that adopts among component decoder DEC0 and the DEC1 is usually based on MAP algorithm (maximal posterior probability algorithm) or SOVA algorithm (soft output Viterbi algorithm).The MAP algorithm has been realized soft input/soft output and recursion iterative decoding, makes the coding and decoding process realize pseudorandom permutation, and final decoding performance approaches the Shannon limit.And SOVA algorithm and improvement algorithm thereof, though operand is lower than the MAP algorithm, because it is based on the sequence maximum-likelihood criterion, relative MAP criterion, the reliability of its soft output value must descend, and relatively practicality also descends.
Three, CRC check
(Cyclic Redundancy Check CRC) is a kind of very important error detection code to cyclic redundancy check (CRC) code, and it is not only encoded simply, and probability of miscarriage of justice is very low.It is the list entries of N that CRC is exactly in fact length, produces the check code (CRC sign indicating number) that length is L according to certain rule, the back of adding original series to, and the sequence that to constitute a new length be N+L sends.Receiving terminal is tested receiving sequence according to identical rule, just can find whether transfer of data makes mistakes.This rule is called in the error control theory " generator polynomial ".The main effect of CRC is to be used for detecting whether error code is arranged in the transmission data block, but does not have the ability of correcting for error code itself.Implementation step is as follows:
If list entries length is N, be expressed as binary system multinomial a (x)=a
N-1x
N-1+ a
N-2x
N-2+ K+a
1X+a
0The generator polynomial of cyclic redundancy check (CRC) is expressed as g (x)=g
Lx
L+ g
L-1x
L-1+ K+g
1X+g
0The coding step of transmitting terminal can be expressed as:
Step 1: it is individual zero to add L at the list entries afterbody, and corresponding binary system polynomial repressentation is exactly x
LA (x);
Step 2: remove x with generator polynomial g (x)
LA (x) obtains residue p (x), and the length of this formula correspondence is that the binary sequence of L is CRC;
Step 3: associating x
LA (x) and p (x) obtain code polynomial x
LA (x)+p (x), the length of this formula correspondence is that the binary sequence of N+L is the coded sequence that has added CRC.
Receiving terminal only need remove the binary system multinomial of receiving sequence correspondence with identical g (x) when decoding.If residue is zero, representing does not have mistake in the data transmission procedure, the last L position of receiving sequence is removed promptly obtain original list entries; Otherwise the expression transfer of data is made mistakes.
Summary of the invention
Technical problem: the dynamic allocation method that the purpose of this invention is to provide the topology sign indicating number coding transmission block decoding iteration of a kind of LTE of being applicable to system, by fully and efficient scheduling hardware resource and the processing delay that can use, under the condition that satisfies whole transmission block iterative decoding processing delay, in conjunction with decoding and CRC check, iterations to each decode encoded blocks is dynamically adjusted and distribution, and the decoding that improves transmission block receives percent of pass.This method is suitable for the encoding block that all kinds of employings receive to be handled based on iteration, and the transmission block of forming with a plurality of encoding blocks is as the communication system of transmission frame-form substantially, working robust height.
Technical scheme: the dynamic allocation method of the topological code transmission block decoding iteration of a kind of long evolving system of the present invention is: basic transmission block TB is divided into N topology sign indicating number encoding block CB in the Long Term Evolution LTE system physical layer
1, CB
2..., CB
N, wherein
Expression rounds up, and A is the contained bit number of transmission block, to the iterative decoding algorithm of each topology sign indicating number encoding block employing based on maximum a posteriori probability, is T by setting each encoding block maximum iteration time, limits the processing delay to whole transmission block; CB in the first run decoding of transmission block
1, CB
2..., CB
NCarry out iterative decoding successively, each encoding block CB
i, i ∈ [1, N] carries out successively: if i encoding block CB
i, t is carried out in the decoding of i ∈ [1, N]
i, t
iThe inferior iteration of ∈ [1, T], the cyclic redundancy check (CRC) of decoding dateout detects and passes through, and then sets CB
iDecoding sign Z
i=0, and stop CB
iIterative decoding, if until t
i=T time the iterative decoding dateout still can't detect by CRC, then sets CB
iDecoding sign Z
i=1, and stop CB
iIterative decoding; After the iterative decoding of N encoding block of transmission block first run decoding traversal is handled, but can add up the iterations that obtains dynamic assignment
And still undecoded successful mistake encoding block number
Again successively to M flag bit Z
i=1 mistake encoding block CB '
1, CB '
2..., CB '
M, carry out successively
Inferior iterative decoding, wherein
Expression rounds downwards, and each encoding block is carried out: encoding block CB '
i, t is carried out in the decoding of i ∈ [1, M]
i, t
iThe inferior iteration of ∈ [1, T '], the cyclic redundancy check (CRC) of decoding dateout detects and passes through, and then stops CB '
iIterative decoding, if until t
iThe inferior iterative decoding dateout of=T ' still can't detect by CRC, then CB '
iDecoding failure, and stop CB '
iIterative decoding; When transmission block second is taken turns M encoding block CB ' of decoding traversal
1, CB '
2..., CB '
MBehind the iterative decoding, transmission block is carried out cyclic redundancy check (CRC), if verification is passed through, then transmission block is successfully decoded, otherwise decoding failure, the dynamic allocation method of transmission block decoding iteration is finished.
Each topology sign indicating number encoding block CB
i, the interpretation method of i ∈ [1, N] all is based on the decoding algorithm of iteration mechanism, adopts the maximum posteriori decoding MAP algorithm of standard, the processing method Log-MAP or the approximate iterative decoding algorithm Max-Log-MAP that revises of maximum of log-domain.
At each topology sign indicating number encoding block CB
i, the t of i ∈ [1, N]
iIn the inferior iterative decoding process, along with the output of decoding dateout serial bit-by-bit, the verification of CRC is calculated and is also begun simultaneously to calculate, to t
iLast Bit data output of inferior iteration, the check results of CRC obtains subsequently immediately, and the decoding that this encoding block is set then is masked as Z
i, the iterations W=W+ (T-t that adds up assignable
i).
After the iterative decoding processing of N encoding block of transmission block first run decoding traversal, but dynamic assignment generation number is added up thereupon and is finished, paginal translation code mark Z once more
i=1 encoding block continues iterative decoding, sign Z
i=1 a M encoding block all is fixing the execution
Inferior iterative decoding.
Beneficial effect: beneficial effect of the present invention is mainly reflected in the following aspects:
1) for the arbitrary encoding block CB in the transmission block
i, t is carried out in the decoding of i ∈ [1, N]
i, t
iThe inferior iteration of ∈ [1, T], T represents the greatest iteration decoding number of times of each encoding block, iterative decoding and cyclic redundancy check (CRC) are carried out simultaneously, if CB
iBy this cyclic redundancy check (CRC), then stop CB
iIterative decoding, can save CB like this
iThe hardware resource that takies also reduces CB
iDecoding delay.
2) after the iterative decoding that travels through for the first time N encoding block is handled, but the dynamic assignment generation number that statistics obtains is distributed to as yet not encoding block by cyclic redundancy check (CRC), make it to proceed iterative decoding, can make full use of decoder hardware resource and the decoding delay of distributing to this transmission block, and improve the decoding performance of whole transmission block.
Description of drawings
Fig. 1 is the whole coding flow chart of LTE (Long Term Evolution) system transmissions piece.
Fig. 2 is a topological encode device block diagram in LTE (Long Term Evolution) system.
Fig. 3 is a topological decoder model in LTE (Long Term Evolution) system.
Fig. 4 is the coding circuit of CRC (cyclic redundancy check (CRC)) sign indicating number.
Fig. 5 is the dynamic assignment flow chart of topology sign indicating number coding transmission block decoding iteration of the present invention.
Fig. 6 is the dynamic assignment specific embodiments schematic diagram of topology sign indicating number coding transmission block decoding iteration of the present invention.
Fig. 7 is under AWGN (white Gaussian noise) channel, Dynamic Assignment and traditional decoding scheme emulation frame error rate comparative graph of topological code transmission block decoding iteration of the present invention.Concrete simulation parameter is as described below.
Fig. 8 is under ETU300 (Doppler expands to the typical city model of 300 hertz the expansion) channel of LTE (Long Term Evolution) standard employing, Dynamic Assignment and traditional decoding scheme emulation frame error rate comparative graph of topological code transmission block decoding iteration of the present invention.Concrete simulation parameter is as described below.
Embodiment
For the decoder resource that the LTE system assignment is given topological encode transmission block TB, the present invention proposes a kind of dynamic allocation method of transmission block decoding iteration.The decoder resource that this invention will shift to an earlier date in maximum iteration time under the successfully decoded encoding block saving is redistributed to other encoding block, thereby has improved the decoding performance of whole transmission block TB.As shown in Figure 5, concrete steps are as follows:
Step 1: travel through N the topology sign indicating number encoding block CB that transmission block TB comprises for the first time
1, CB
2..., CB
N, wherein
A is the contained bit number of transmission block, adopts and deciphers based on the iterative decoding algorithm of maximum a posteriori probability, carries out CRC check simultaneously, and the iterations W that adds up assignable.Setting each encoding block maximum iteration time is T, limits the maximum of each transmission block thus and handles time-delay.
1.1) to encoding block CB
i, i ∈ [1, N] carries out t
i, t
iThe inferior iterative decoding of ∈ [1, T] is along with the decoding bit is exported encoding block CB one by one
iT
i, t
iThe inferior CRC check of ∈ [1, T] is calculated and is also begun simultaneously to calculate.
1.2) if encoding block CB
iT
i, t
iThe inferior CRC check of ∈ [1, T] is passed through, and then the decoding of this encoding block is masked as Z
i=0, the iterations W=W+ (T-t that adds up assignable
i), if i＜N, then and to next encoding block CB
I+1Carry out step 1.1), if i=N then jumps to step 2; Otherwise, if t
i＜T is then according to step 1.1) to CB
iCarry out t
iIf+1 iterative decoding is t
i=T and i＜N, then Z
i=1, and to next encoding block CB
I+1Carry out step 1.1), if t
i=T and i=N, then Z
i=1, and jump to step 2.
Step 2: all Z among the traversal transmission block TB
i=1 topology sign indicating number encoding block is established total
Individual, be respectively CB '
1, CB '
2..., CB '
M, proceed successively
Inferior iterative decoding, wherein
And carry out CRC check.
2.1) to each encoding block CB '
i, i ∈ [1, M] carries out t
i, t
iThe inferior iterative decoding of ∈ [1, T '] is along with the output one by one of decoding bit, encoding block CB '
iT
i, t
iThe inferior CRC check of ∈ [1, T '] is calculated and is also begun simultaneously to calculate.
2.2) if encoding block CB '
iT
i, t
iThe inferior CRC check of ∈ [1, T '] is passed through, and then the decoding of this encoding block is masked as Z '
i=0, if i＜M, then and to next encoding block CB '
I+1Carry out step 2.1), if i=M then jumps to step 3; Otherwise, if t
i＜T ' is then according to step 2.1) to CB '
iCarry out t
iIf+1 iterative decoding is t
i=T ' and i＜M, then Z '
i=1, and to next encoding block CB '
I+1Carry out step 2.1), if t
i=T ' and i=M, then Z '
i=1, and jump to step 3.
Step 3: with N topology sign indicating number encoding block CB
1, CB
2..., CB
NDecode results be cascaded as the decode results of whole transmission block TB, and carry out CRC and detect, pass through if CRC detects, then this transport block transmission success, otherwise, then require to retransmit.
The present invention proposes a kind of LTE (3GPP Long Term Evolution, Long Term Evolution) dynamic allocation method of the topological code transmission block decoding iteration of system, as shown in Figure 6, when receiving terminal was deciphered the transmission block that receives, specific embodiments was as described below:
S01: initialization, the encoding block number N that the transmission block that calculating receives comprises, the greatest iteration that each encoding block is set is deciphered number of times T, is provided for the iterations W=0 of dynamic assignment, and all encoding block number consecutivelies are CB
1, CB
2..., CB
N
S02: to current encoding block CB
i, i ∈ [1, N] carries out t
i, t
iThe inferior iterative decoding of ∈ [1, T] carries out cyclic redundancy check (CRC) simultaneously.
S03: judge whether this encoding block cyclic redundancy check (CRC) is passed through, if, then carry out S04, otherwise, S05 carried out.
S04: this encoding block is successfully decoded, adds up its remaining iterations, upgrades W=W+ (T-t
i).
S05: the iterative decoding failure this time of this encoding block, judge whether it reaches maximum iteration time, if then carry out S06, otherwise carry out S07.
S06: this encoding block decoding failure.
S07: the iterations of this encoding block upgrades t
i=t
i+ 1.
S08: judge whether all encoding block CB
1, CB
2..., CB
NIterative decoding finishes, if then claim the decoding of the transmission block first run to finish, and carry out S009, otherwise next encoding block is carried out S002.
S09: the iterations W that can be used for dynamic assignment according to first run iterative decoding obtains does not temporarily have successfully decoded mistake encoding block to renumber to all and is CB '
1, CB '
2..., CB '
M, and redistribute respectively
Inferior iterative decoding, wherein
Expression rounds downwards.
S10: to the temporary transient not successful mistake encoding block CB ' of current transmission block first run decoding
i, i ∈ [1, N] carries out t '
i, t '
iThe inferior iterative decoding of ∈ [1, T] carries out cyclic redundancy check (CRC) simultaneously.
S11: whether judge current mistake encoding block by cyclic redundancy check (CRC), if then carry out S15, otherwise carry out S12.
S12: judge whether current mistake encoding block reaches the maximum iteration time T ' that redistributes, if then carry out S13, otherwise carry out S14.
S13: indicate this mistake encoding block decoding failure.
S14: the iterations of this mistake encoding block upgrades t '
i=t '
i+ 1.
S15: judge whether wrong encoding block CB '
1, CB '
2..., CB '
MIterative decoding finishes, if second of this transmission block is taken turns decoding and finished, and carries out S16, otherwise next one mistake encoding block is carried out S10.
S16: whether iterative decoding finishes, and whole transmission block is carried out cyclic redundancy check (CRC), indicate this transmission block successfully decoded according to check results, if detect by transmission block is successfully decoded, otherwise decoding failure.
Embodiment of the present invention gives the Dynamic Assignment of topology sign indicating number coding transmission block decoding iteration more of the present invention and the frame error rate curve comparison diagram of traditional decoding scheme decoding performance.
Wherein Fig. 7 is under AWGN (white Gaussian noise) channel, Dynamic Assignment and traditional decoding scheme emulation frame error rate comparative graph of topological code transmission block decoding iteration of the present invention.Concrete simulation parameter is as described below.
Table 1 is under AWGN (white Gaussian noise) channel, the Dynamic Assignment of topology sign indicating number coding transmission block decoding iteration more of the present invention and the simulation parameter of traditional decoding scheme frame error rate performance, code check is 3/4 64QAM modulation, this moment, each transmission block TB can be divided into 5 encoding blocks under the 10MHz bandwidth.Fig. 7 has provided the frame error rate curve chart under this simulated conditions, and wherein, that signal to noise ratio adopts is bit signal to noise ratio (E
b/ N
0).Dynamic Assignment by simulation curve topology sign indicating number coding transmission of the present invention as can be seen block decoding iteration is compared with traditional decoding scheme, performance improvement 0.1～0.2dB.
| Simulation parameter | Parameter value |
| Bandwidth | ?10MHz |
| Channel | ?AWGN |
| The modulating-coding strategy | ?64QAM，R＝3/4 |
| Each transmission block comprises the encoding block number | ?5 |
Table 1
Wherein Fig. 8 is under ETU300 (Doppler expands to the typical city model of 300 hertz the expansion) channel of LTE (Long Term Evolution) standard employing, Dynamic Assignment and traditional decoding scheme emulation frame error rate comparative graph of topological code transmission block decoding iteration of the present invention.Concrete simulation parameter is as described below.
Table 2 is the typical city models that expand to 300 hertz expansion the ETU300 Doppler that the LTE standard adopts) under the channel, the Dynamic Assignment of topology more of the present invention yard coding transmission block decoding iteration and the simulation parameter of traditional decoding scheme frame error rate performance.Here having adopted code check is 3/4 64QAM modulation, and this moment, each transmission block can be divided into 5 encoding blocks under the 10MHz bandwidth, and wherein number of transmit antennas is 1, and the reception antenna number is 2, and the antenna space correlation is for low relevant.Fig. 8 has provided the frame error rate curve chart under this simulated conditions, and wherein, that signal to noise ratio adopts is bit signal to noise ratio (E
b/ N
0).Dynamic Assignment by simulation curve topology sign indicating number of the present invention as can be seen coding transmission block decoding iteration is compared performance improvement 0.2dB with traditional decoding scheme.
| Simulation parameter | Parameter value |
| Bandwidth | 10MHz |
| Channel | ETU300 |
| The modulating-coding strategy | 64QAM?R＝3/4 |
| The antenna space correlation | Low |
| Antenna configurations | 1x2 |
| Channel estimating | Perfect estimation |
| Each transmission block comprises the encoding block number | 5 |
Table 2
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (4)
1. the topological code transmission block of a long evolving system is deciphered the dynamic allocation method of iteration, it is characterized in that: basic transmission block TB is divided into N topology sign indicating number encoding block CB in the Long Term Evolution LTE system physical layer
1, CB
2..., CB
N, wherein
Expression rounds up, and A is the contained bit number of transmission block, to the iterative decoding algorithm of each topology sign indicating number encoding block employing based on maximum a posteriori probability, is T by setting each encoding block maximum iteration time, limits the processing delay to whole transmission block; CB in the first run decoding of transmission block
1, CB
2..., CB
NCarry out iterative decoding successively, each encoding block CB
i, i ∈ [1, N] carries out successively: if i encoding block CB
i, t is carried out in the decoding of i ∈ [1, N]
i, t
iThe inferior iteration of ∈ [1, T], the cyclic redundancy check (CRC) of decoding dateout detects and passes through, and then sets CB
iDecoding sign Z
i=O, and stop CB
iIterative decoding, if until t
i=T time the iterative decoding dateout still can't detect by CRC, then sets CB
iDecoding sign Z
i=1, and stop CB
iIterative decoding; After the iterative decoding of N encoding block of transmission block first run decoding traversal is handled, but can add up the iterations that obtains dynamic assignment
And still undecoded successful mistake encoding block number
Again successively to M flag bit Z
i=1 mistake encoding block CB '
1, CB '
2..., CB '
M, carry out successively
Inferior iterative decoding, wherein
Expression rounds downwards, and each encoding block is carried out: encoding block CB '
i, t is carried out in the decoding of i ∈ [1, M]
i, t
iThe inferior iteration of ∈ [1, T '], the cyclic redundancy check (CRC) of decoding dateout detects and passes through, and then stops CB '
iIterative decoding, if until t
iThe inferior iterative decoding dateout of=T ' still can't detect by CRC, then CB '
iDecoding failure, and stop CB '
iIterative decoding; When transmission block second is taken turns M encoding block CB ' of decoding traversal
1, CB '
2..., CB '
MBehind the iterative decoding, transmission block is carried out cyclic redundancy check (CRC), if verification is passed through, then transmission block is successfully decoded, otherwise decoding failure, the dynamic allocation method of transmission block decoding iteration is finished.
2. the dynamic allocation method of the topological code transmission block decoding iteration of a kind of long evolving system according to claim 1 is characterized in that: each topology sign indicating number encoding block CB
i, the interpretation method of i ∈ [1, N] all is based on the decoding algorithm of iteration mechanism, adopts the maximum posteriori decoding MAP algorithm of standard, the processing method Log-MAP or the approximate iterative decoding algorithm Max-Log-MAP that revises of maximum of log-domain.
3. the dynamic allocation method of the topological code transmission block decoding iteration of a kind of long evolving system according to claim 1 is characterized in that: at each topology sign indicating number encoding block CB
i, the t of i ∈ [1, N]
iIn the inferior iterative decoding process, along with the output of decoding dateout serial bit-by-bit, the verification of CRC is calculated and is also begun simultaneously to calculate, to t
iLast Bit data output of inferior iteration, the check results of CRC obtains subsequently immediately, and the decoding that this encoding block is set then is masked as Z
i, the iterations W=W+ (T-t that adds up assignable
i).
4. the topological code transmission block of a kind of long evolving system according to claim 1 is deciphered the dynamic allocation method of iteration, it is characterized in that: after the iterative decoding of N encoding block of transmission block first run decoding traversal is handled, but dynamic assignment generation number is added up thereupon and is finished, once more paginal translation code mark Z
i=1 encoding block continues iterative decoding, sign Z
i=1 a M encoding block all is fixing the execution
Inferior iterative decoding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110110177 CN102130747B (en) | 2011-04-29 | 2011-04-29 | Dynamic allocation method for decoding iteration of transmission block of topological code of long term evolution (LTE) system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110110177 CN102130747B (en) | 2011-04-29 | 2011-04-29 | Dynamic allocation method for decoding iteration of transmission block of topological code of long term evolution (LTE) system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102130747A true CN102130747A (en) | 2011-07-20 |
| CN102130747B CN102130747B (en) | 2013-05-01 |
Family
ID=44268648
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110110177 Active CN102130747B (en) | 2011-04-29 | 2011-04-29 | Dynamic allocation method for decoding iteration of transmission block of topological code of long term evolution (LTE) system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102130747B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102571272A (en) * | 2011-12-14 | 2012-07-11 | 展讯通信（上海）有限公司 | Method and device for receiving service data in communication system, and baseband chip |
| CN103843253A (en) * | 2011-10-05 | 2014-06-04 | 瑞典爱立信有限公司 | Method and device for decoding a transport block of a communication signal |
| US8977913B2 (en) | 2012-12-31 | 2015-03-10 | Spreadtrum Communications | Method, device and baseband chip for receiving service data in a communication system |
| CN106027072A (en) * | 2016-05-30 | 2016-10-12 | 联想(北京)有限公司 | Decoding processing method and electronic apparatus |
| CN112152636A (en) * | 2020-09-08 | 2020-12-29 | Oppo广东移动通信有限公司 | Decoding method and device, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1780152A (en) * | 2004-11-17 | 2006-05-31 | 松下电器产业株式会社 | Interative encode method and system |
| CN101557234A (en) * | 2009-05-18 | 2009-10-14 | 北京天碁科技有限公司 | Dynamic iterative decoding method of Turbo codes and device thereof |
| CN101771423A (en) * | 2010-01-22 | 2010-07-07 | 京信通信系统（中国）有限公司 | Method and device for improving efficiency of decoding Turbo code |
| CN101820542A (en) * | 2010-03-04 | 2010-09-01 | 上海大学 | Video transmission method for effectively controlling unequal power consumption |
-
2011
- 2011-04-29 CN CN 201110110177 patent/CN102130747B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1780152A (en) * | 2004-11-17 | 2006-05-31 | 松下电器产业株式会社 | Interative encode method and system |
| CN101557234A (en) * | 2009-05-18 | 2009-10-14 | 北京天碁科技有限公司 | Dynamic iterative decoding method of Turbo codes and device thereof |
| CN101771423A (en) * | 2010-01-22 | 2010-07-07 | 京信通信系统（中国）有限公司 | Method and device for improving efficiency of decoding Turbo code |
| CN101820542A (en) * | 2010-03-04 | 2010-09-01 | 上海大学 | Video transmission method for effectively controlling unequal power consumption |
Non-Patent Citations (1)
| Title |
|---|
| 吴江等: "WCDMA中Turbo码算法及质数交织器的研究", 《信息技术》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103843253A (en) * | 2011-10-05 | 2014-06-04 | 瑞典爱立信有限公司 | Method and device for decoding a transport block of a communication signal |
| US9692553B2 (en) | 2011-10-05 | 2017-06-27 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and device for decoding a transport block of a communication signal |
| CN103843253B (en) * | 2011-10-05 | 2018-06-05 | 瑞典爱立信有限公司 | For the method and apparatus of the transmission block of decoding communication signals |
| CN102571272A (en) * | 2011-12-14 | 2012-07-11 | 展讯通信（上海）有限公司 | Method and device for receiving service data in communication system, and baseband chip |
| CN102571272B (en) * | 2011-12-14 | 2015-07-15 | 展讯通信（上海）有限公司 | Method and device for receiving service data in communication system, and baseband chip |
| US8977913B2 (en) | 2012-12-31 | 2015-03-10 | Spreadtrum Communications | Method, device and baseband chip for receiving service data in a communication system |
| CN106027072A (en) * | 2016-05-30 | 2016-10-12 | 联想(北京)有限公司 | Decoding processing method and electronic apparatus |
| CN112152636A (en) * | 2020-09-08 | 2020-12-29 | Oppo广东移动通信有限公司 | Decoding method and device, equipment and storage medium |
| CN112152636B (en) * | 2020-09-08 | 2023-09-29 | Oppo广东移动通信有限公司 | Decoding method and device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102130747B (en) | 2013-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102355341B (en) | Network coding method of hybrid automatic request retransmission for long-term evolution system | |
| Wu et al. | User-specific chip-level interleaver design for IDMA systems | |
| CN101601188B (en) | Method and apparatus for encoding and decoding data | |
| CN102130747B (en) | Dynamic allocation method for decoding iteration of transmission block of topological code of long term evolution (LTE) system | |
| CN101636914A (en) | Method and apparatus for encoding and decoding data | |
| CN101309086A (en) | Systematical interpretation method of Reed-Solomon code cascade feedback systematic convolution code | |
| MXPA01010239A (en) | A system and method employing a modular decoder for decoding turbo and turbo-like codes in a communications network. | |
| CN106961319A (en) | A kind of method and apparatus of data processing | |
| CN104579369A (en) | Turbo iterative decoding method and device | |
| CN100571046C (en) | A kind of apparatus and method that in the SCDMA system, realize Turbo coding and decoding scheme | |
| CN102904668A (en) | Rapid PBCH (physical broadcast channel) decoding method for LTE (long term evolution) | |
| CN102904667A (en) | Method for decoding tail biting convolution codes of PBCH (physical broadcast channel) decoding in LTE (long term evolution) | |
| Chenghai et al. | The shifting interleaver design based on PN sequence for IDMA systems | |
| CN101753261B (en) | Coder, decoder and coding and decoding methods | |
| CN102394662A (en) | Method for decoding broadcast channel (BCH) codes | |
| CN100581089C (en) | Woven convolutional code error detection and correction coder, and encoder in TD-SCDMA system | |
| Oda et al. | Polar coding with enhanced channel polarization under frequency selective fading channels | |
| CN1773867B (en) | Method for decoding Turbo code | |
| CN101431340A (en) | Fast self-adapting confidence degree propagation interpretation method for Reed-Solomon code | |
| CN108476027A (en) | TURBO (WI-TURBO) code that window interweaves | |
| JP5567216B2 (en) | Method and iterative turbo decoder for stopping iteration in an iterative turbo decoder | |
| Wang et al. | Improved ORB-GRAND for PAC Codes | |
| Janvars et al. | Hard decision decoding of single parity turbo product code with N-level quantization | |
| Chen et al. | Path Metric Range Based Iterative Construction Method for Polar Codes | |
| CN111130572B (en) | Turbo code quick realizing method |
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 |