CN107911195A - A kind of tail-biting convolutional code channel decoding method based on CVA - Google Patents
A kind of tail-biting convolutional code channel decoding method based on CVA Download PDFInfo
- Publication number
- CN107911195A CN107911195A CN201710979858.0A CN201710979858A CN107911195A CN 107911195 A CN107911195 A CN 107911195A CN 201710979858 A CN201710979858 A CN 201710979858A CN 107911195 A CN107911195 A CN 107911195A
- Authority
- CN
- China
- Prior art keywords
- mrow
- decoding
- state
- tail
- munderover
- 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/0059—Convolutional 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/23—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory 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/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
- H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
- H03M13/413—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors tail biting Viterbi decoding
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
Abstract
A kind of tail-biting convolutional code channel decoding method based on CVA is claimed in the present invention, is related to mobile communication technology field.To reduce decoding complexity, improve decoding efficiency, the present invention proposes a kind of based on circulation viterbi algorithm (Circular Viterbi Algorithm, CVA decoding algorithm), the highest decoding initial position of reliability is determined according to the likelihood ratio information for receiving information sequence, modified Viterbi decoding is proceeded by from the initial position, pass through Gabi selection process, delete impossible state position, after iterative search several times, survivor path can converge to less survival state, the state of maximal metric value is selected as the initial position finally decoded, decoding result is estimated according to its corresponding survivor path.The algorithm has faster convergence rate, and decoding efficiency is further improved, and reduces decoding delay.
Description
Technical field
The invention belongs to the channel decoding technical field of mobile communication, is related specifically to the decoded tail bitings of PBCH in LTE
Coding method of convolution code.
Background technology
With the development of the communication technology, digital communication progressively substitutes mainstream of the analogue communication as the communication technology.However, number
When word information is transmitted in the channel, it can be disturbed be subject to noise, the generation of error code is always inevitable.In order in known noise
Reach certain error rate index than in the case of, rationally design baseband signal, selection modulation, demodulation mode, and use frequency
Domain is balanced or time domain equalization measure on the basis of, should also use the channel coding technologies such as error control coding, make the bit error rate into
One step reduces.Convolutional code and block code are two kinds of principal modes of error control coding, in the identical situation of encoder complexity
Under, the performance of convolutional code is better than block code, therefore convolutional code is used in the standard of many wireless communications.
Since convolutional code is by invention, it is always as a kind of efficient channel coding technology using in a communications system.
The radio open technological evolvement that LTE system is proposed as 3GPP standardization bodies, currently obtains energetically in global range
Development and deployment, the system need to realize the bandwidth of higher, the capacity of bigger, the message transmission rate of higher, lower transmission
Time delay, lower operation cost while to meet high-speed demand of the user for broadcast and the real time business such as multicast service,
LTE system employs Turbo codings according to different transmission channels in channel coding process and tail-biting convolutional code encodes, wherein stinging
Tail convolutional encoding is mainly used for broadcast channel PBCH, control channel information DCI, the UCI cataloged procedure of uplink and downlink, and for not
The encoding scheme and code rate that the transmission channel and control channel of same type use are also different.Tail-biting convolutional code is encoded
Cheng Shouxian can use tail biting technology, that is, ensure trellis starting and end up in same state, this is just needed data encoded
Original state of the last several bits of block as register.
The convolutional code encoded using tail biting mode not only eliminates the error code caused by with known bits initialization encoder
Rate is lost, while tail biting structure can provide all information bits identical protective capability.Exactly because tail-biting convolutional code
These advantages, it is widely used in various communication systems, the coding mode as control signaling.For shorter information
Sequence, protection of the tail biting codes to code check are very considerable, such as broadcast channels in LTE, are adding cyclic redundancy check bit
40 bits are shared afterwards, if the information sequence of this 40 bit does not have to tail biting codes technology, code check loss is up to 13%.At present
Had using system of the tail-biting convolutional code as control channel coding mode communication standard：EDGE, WIMAX and LTE etc..
Although tail-biting convolutional code has many good qualities, but for decoder, due to not knowing the initial state of decoding
And final state, the optimal decoding scheme based on viterbi algorithm realize excessively complexity, and based on circulation viterbi coding method
Before maximum iteration is reached, optimal tail biting path may have been detected, unnecessary iteration causes the lengthening of decoding delay
With the waste of resource.There is presently no the practical optimal decoding scheme based on circulation viterbi algorithm, based on problem above, sheet
Invention have devised a kind of tail-biting convolutional code channel decoding method based on CVA, be adapted to practical implementation.
The content of the invention
Present invention seek to address that above problem of the prior art.Proposing one kind can realize that tail biting is rolled up under low complex degree
The tail-biting convolutional code channel decoding method based on CVA of the optimal decoding of product code.Technical scheme is as follows：
A kind of tail-biting convolutional code channel decoding method based on CVA, it comprises the following steps：
101st, input traffic, according to the likelihood ratio information for receiving traffic flow information sequence, determines reliability highest
Decoding initial position, proceed by modified Viterbi decoding from the initial position；
102nd, ith iteration decoding is performed, reaching each state there are 2 paths, calculates reach each state 2 respectively
Branched measurement value between branch, selects optimal one, this process operates as Gabi selection.By Gabi selection process and update
Parameter is decoded, deletes impossible state, starts next iterative decoding.
103rd, after iterative search several times, according to iteration stopping criterion, the state of maximal metric value is selected as final
The initial position of decoding, according to final initial position and corresponding trellis paths, estimates decoding result.
Further, the step 101 is docked received information and is handled at the beginning of decoding, and selection is reliable
The highest position l of propertyoptInitial position as decoding.The symbol received isLikelihood ratio information is calculatedDefine loptCalculation formula be
In formula (l+Q)L=(l+Q) modL, wherein Q are amounts to be determined, in a particular application by according to different code words
The suitable value of selection, when the length that Q is receiving sequence, the reliability of each position is just the same at this time, then from the beginning decoding is opened
Begin.
Further, the step of step 101 further includes initialization, i=0, Wherein,Represent in ith iteration, state sjMetric, j is decoder state number, j=1,2,
3...2v, v is the number of shift register,Represent the metric of optimal path,After representing to perform once decoding
State sjMetric the amount of having a net increase of.
Further, the step 102 specifically includes step：Operated by Gabi selection, each shape of each sequence location of stepping
The metric of state, circulation update the metric and likelihood path of each state, detect maximal metric value after a weekWith corresponding tail biting path
Viterbi Viterbi algorithm, as estimated sequence, is used using the maximum of the product of receiving symbol conditional probability
Log-likelihood function is expressed asWherein, y represents that codeword sequence is reflected by transmission
It is penetrating as a result, r represents the obtained sequence of receiving terminal, simplify the logarithmic function summation operation in above formula, can be defined as follows symbol
MeasurementWherein, make
In such cases, the symbol metric in Viterbi algorithm be exactly on coding grid selection with receiving sequence r it
Between Hamming distance minimum code word as decoding export.
Further, the step 102 performs ith iteration decoding, if the state amount of having a net increase of that current iteration is drawn is most
Big valueMore than the maximal metric value of storageI.e.Then update maximal metric valueWith corresponding maximum tail biting path
Advantages of the present invention and have the beneficial effect that：
The present invention devises a kind of iteration stopping criterion, and each state measurement value has a net increase of when being completed by counting current iteration
AmountMore than the maximal metric value of storageQuantity num (i), if num (i) ＜=num (i-1), stopping change
Generation；Otherwise iteration is continued until reaching maximum iteration.So when decoding is fulfiled ahead of schedule, decoding delay is reduced, is improved
Decoding efficiency.
Brief description of the drawings
Fig. 1 is the tail-biting convolutional code decoding flow chart of the present invention；
Fig. 2 generator polynomials are the convolution code coding/decoding trellis figure of (7,5).
Embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, detailed
Carefully describe.Described embodiment is only the part of the embodiment of the present invention.
The present invention solve above-mentioned technical problem technical solution be：
A kind of tail-biting convolutional code channel decoding method based on CVA of the present invention is suitable for existing mobile communication system
(such as EDGE, LTE, WIMAX), is also applied for tail-biting convolutional code in next generation mobile communication system and decodes.According to the letter received
Sequence is ceased, impossible initial state is excluded one by one by iteration, finally searches out optimal tail biting path.It is of the present invention to translate
Code method is by effective convergence rate for handling, accelerating decoder to loophole, while algorithm is simple, is easily achieved,
There is significant application value.
A kind of tail-biting convolutional code channel decoding method based on CVA, it is characterised in that comprise the following steps：
Step1. at the beginning of decoding, dock received information and handled, select the highest position l of reliabilityopt
Initial position as decoding.The symbol received isLikelihood ratio information is calculatedDefine lopt
Calculation formula be
In formula (l+Q)L=(l+Q) modL, wherein Q are amounts to be determined, in a particular application by according to different code words
The suitable value of selection.When Q values are smaller, the effect of reliability is more obvious；Due to receiving sequence Normal Distribution, work as Q
When value is bigger, the reliability for each position being calculated by formula is closer；Limiting case is the length that Q is receiving sequence, this
When each position reliability it is just the same, then decoding from the beginning.
Step2. initialize, i=0,
Wherein,Represent in ith iteration, state sjMetric, j be decoder status number, j=1,2,
3...2v, v is the number of shift register.Represent the metric of optimal path.After representing to perform once decoding
State sjMetric the amount of having a net increase of.
Step3. Viterbi decoding is performed, is operated by Gabi selection, the metric of each state of each sequence location of stepping, is followed
Ring updates the metric and likelihood path of each state after a week, detects maximal metric valueWith sting accordingly
Tail path
Viterbi algorithm using the maximum of the product of receiving symbol conditional probability as estimated sequence, using logarithm seemingly
Right function is expressed asWherein, y represents knot of the codeword sequence Jing Guo transmission map
Fruit, r represent the sequence that receiving terminal obtains.Simplify the logarithmic function summation operation in above formula, can be defined as follows symbol measurementWherein, make
In such cases, the symbol metric in Viterbi algorithm be exactly on coding grid selection with receiving sequence r it
Between Hamming distance minimum code word as decoding export.
Step4. ith iteration decoding is performed, if the net maximum of increments of state that current iteration is drawnMore than the maximal metric value of storageI.e.Then update maximal metric valueWith corresponding maximum tail biting path
Step5. the shape that each state measurement value amount of having a net increase of of ith iteration is more than the net maximum of increments of last iteration state is counted
State quantity num (i), i.e.,If num (i) ＜=num (i-1), stop iteration, output is maximum
The tail biting path of likelihoodCorresponding decoding result；Otherwise, the state continuation iteration for maximal metric value being more than from the amount of having a net increase of is translated
Code, other initial states are cast out.
Step6. next iteration is performed, repeats Step3,4,5.
Tail-biting convolutional code refers to the tail bit initialization register of the information sequence with input, the original state so encoded
It is identical with done state, by reducing redundant bit so as to improving code efficiency, usually with octal system come presentation code device (n,
K, m) generator polynomial, (n, k, m) represent input k bits, export n-bit, shift register number is m.As shown in Fig. 2,
The grid chart of (2,1,2) convolutional code is given, production multinomial is (7,5), and 1 bit of input generates the coding information of 2 bits, code
Rate is 1/2, and each position of trellis figure has 2mKind state, it is upper branch that state transfer is corresponding when inputting 0, state when inputting 1
It is lower branch to shift corresponding, and the coding result of output is shown on the right of Fig. 2.
Examples of implementation：
S1. at the beginning of decoding, dock received information and handled, reliability is calculated most by formula (1)
High position loptAs the initial position of decoding, even position loptTo decode starting position l.The symbol received isMeter
Calculation obtains likelihood ratio information
S2. as i=1, i.e., decode for the first time, the stateful metric of initializationOptimal path is measured
ValueThe metric amount of having a net increase of of each stateState set { sjComprising institute it is stateful.
S3. start to perform Viterbi decoding, operated by stepping Gabi selection, each condition selecting metric of each position is most
State where big value, and corresponding routing information is preserved, after decoding, check the tail biting path of metric maximum, and
Its metric is set to optimal path metric, its corresponding path is set to optimal tail biting path, and by the measurement of each state
Value is set to the initial metric value of next iteration.
S4. ith iteration is performed, the metric of more each state after decodingWith the maximal metric value of storageIf in the presence ofSituation, then update maximal metric value, i.e.,And will's
State is deleted, with new state set { sj, next time is only from set { sjThe state that includes starts iterative decoding.
S5. after each iterative decoding, each state measurement value amount of having a net increase of is detected more than the last iteration state amount of having a net increase of most
The number of states num (i) being worth greatly, i.e.,Status number.If num (i) ＞ num (i-1), after
It is continuous to be iterated decoding process, otherwise, stop iteration, the state where maximal metric value at this time is maximum tail biting path
Initial state, goes out coding sequence according to corresponding tail biting path estimation.
Since circulation Viterbi decoding may just have been detected by optimal tail biting road before maximum iteration is reached
Footpath, iteration afterwards is all unnecessary, and a kind of tail-biting convolutional code channel decoding method based on CVA of the present invention changes
It can be very good to avoid this loophole for stopping criterion, improve decoding efficiency.
The above embodiment is interpreted as being merely to illustrate the present invention rather than limits the scope of the invention.
After the content for having read the record of the present invention, technical staff can make various changes or modifications the present invention, these equivalent changes
Change and modification equally falls into the scope of the claims in the present invention.
Claims (5)
1. a kind of tail-biting convolutional code channel decoding method based on CVA, it is characterised in that comprise the following steps：
101st, input traffic, according to the likelihood ratio information for receiving traffic flow information sequence, determines that reliability is highest and translates
Code initial position, modified Viterbi decoding is proceeded by from the initial position.
102nd, ith iteration decoding is performed, reaching each state there are 2 paths, calculates 2 branches for reaching each state respectively
Between branched measurement value, select optimal one, this process operates as Gabi selection, by Gabi selection process and updates decoding
Parameter, deletes impossible state, starts next iterative decoding.
103rd, after iterative search several times, according to iteration stopping criterion, the state of maximal metric value is selected as final decoding
Initial position, according to final initial position and corresponding trellis paths, estimate decoding result.
2. the tail-biting convolutional code channel decoding method according to claim 1 based on CVA, it is characterised in that the step
101 at the beginning of decoding, docks received information and is handled, and selects the highest position l of reliabilityoptAs decoding
Initial position.The symbol received is rl (j), likelihood ratio information is calculatedDefine loptCalculation formula
For
<mrow>
<mtable>
<mtr>
<mtd>
<mrow>
<msub>
<mi>l</mi>
<mrow>
<mi>o</mi>
<mi>p</mi>
<mi>t</mi>
</mrow>
</msub>
<mo>=</mo>
<mi>arg</mi>
<munder>
<mi>max</mi>
<mi>l</mi>
</munder>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>q</mi>
<mo>=</mo>
<mi>l</mi>
</mrow>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>+</mo>
<mi>Q</mi>
<mo>)</mo>
</mrow>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>0</mn>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<mi>a</mi>
<mi>b</mi>
<mi>s</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>&lambda;</mi>
<mi>l</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mi>arg</mi>
<munder>
<mi>max</mi>
<mi>l</mi>
</munder>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>q</mi>
<mo>=</mo>
<mi>l</mi>
</mrow>
<msub>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>+</mo>
<mi>Q</mi>
<mo>)</mo>
</mrow>
<mi>L</mi>
</msub>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>0</mn>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<mi>a</mi>
<mi>b</mi>
<mi>s</mi>
<mrow>
<mo>(</mo>
<mn>4</mn>
<msubsup>
<mi>r</mi>
<mi>l</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
</msubsup>
<mo>/</mo>
<msub>
<mi>N</mi>
<mn>0</mn>
</msub>
<mo>)</mo>
</mrow>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mi>arg</mi>
<munder>
<mi>max</mi>
<mi>l</mi>
</munder>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>q</mi>
<mo>=</mo>
<mi>l</mi>
</mrow>
<msub>
<mrow>
<mo>(</mo>
<mi>l</mi>
<mo>+</mo>
<mi>Q</mi>
<mo>)</mo>
</mrow>
<mi>L</mi>
</msub>
</munderover>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>=</mo>
<mn>0</mn>
</mrow>
<mrow>
<mi>c</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</munderover>
<mi>a</mi>
<mi>b</mi>
<mi>s</mi>
<mrow>
<mo>(</mo>
<msubsup>
<mi>r</mi>
<mi>l</mi>
<mrow>
<mo>(</mo>
<mi>j</mi>
<mo>)</mo>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mn>0</mn>
<mo>&le;</mo>
<mi>l</mi>
<mo>&le;</mo>
<mi>L</mi>
</mrow>
</mtd>
</mtr>
</mtable>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
In formula (l+Q)L=(l+Q) modL, wherein Q are amounts to be determined, in a particular application by according to different codeword selection conjunctions
Suitable value, when the length that Q is receiving sequence, the reliability of each position is just the same at this time, then decoding is from the beginning.
3. the tail-biting convolutional code channel decoding method according to claim 1 or 2 based on CVA, it is characterised in that the step
Rapid 101 the step of further including initialization,Wherein,Represent
In ith iteration, state sjMetric, j be decoder status number, j=1,2,3...2v, v is of shift register
Number,Represent the metric of optimal path,Represent to perform state s after an iteration decodesjMetric have a net increase of
Amount.
4. the tail-biting convolutional code channel decoding method according to claim 3 based on CVA, it is characterised in that the step
102 specifically include step：Operated by Gabi selection, the metric of each state of each sequence location of stepping, circulation updates after a week
The metric and likelihood path of each state, detect maximal metric valueWith corresponding tail biting path
Viterbi Viterbi algorithm uses the maximum of the product of receiving symbol conditional probability as estimated sequence, using logarithm
Likelihood function is expressed asWherein, y represents codeword sequence by transmission map
As a result, r represents the sequence that receiving terminal obtains, simplify the logarithmic function summation operation in above formula, can be defined as follows symbol measurementWherein, makeB=-log ε, in such cases,
Symbol metric in Viterbi algorithm is exactly the code of the Hamming distance minimum between selection and receiving sequence r on coding grid
Word is exported as decoding.
5. the tail-biting convolutional code channel decoding method according to claim 3 based on CVA, it is characterised in that the step
102 perform ith iteration decoding, if the net maximum of increments of state that current iteration is drawnMore than storage
Maximal metric valueI.e.Then update maximal metric valueWith it is corresponding
Maximum tail biting path
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710979858.0A CN107911195B (en) | 2017-10-19 | 2017-10-19 | CVA-based tail-biting convolutional code channel decoding method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710979858.0A CN107911195B (en) | 2017-10-19 | 2017-10-19 | CVA-based tail-biting convolutional code channel decoding method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107911195A true CN107911195A (en) | 2018-04-13 |
| CN107911195B CN107911195B (en) | 2020-03-17 |
Family
ID=61840656
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710979858.0A Active CN107911195B (en) | 2017-10-19 | 2017-10-19 | CVA-based tail-biting convolutional code channel decoding method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107911195B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109861695A (en) * | 2019-02-22 | 2019-06-07 | 北京芯盾集团有限公司 | The method for carrying out convolutional code decoding using code book |
| CN110278055A (en) * | 2019-06-03 | 2019-09-24 | 京信通信系统（中国）有限公司 | Tail biting convolutional encoding processing method, device and communication equipment |
| CN110798231A (en) * | 2018-08-02 | 2020-02-14 | 北京松果电子有限公司 | Decoding method, device and storage medium for tail-biting convolutional code |
| CN111510160A (en) * | 2020-05-13 | 2020-08-07 | 中国人民解放军军事科学院战争研究院 | Truncation convolutional coding optimization construction method |
| CN112217609A (en) * | 2020-10-14 | 2021-01-12 | 紫光展锐(重庆)科技有限公司 | Communication decoding method, device, apparatus and storage medium |
| CN112290957A (en) * | 2020-10-24 | 2021-01-29 | 西北工业大学 | Orthogonal time-frequency expanded tail-biting Turbo coding and decoding communication method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5881075A (en) * | 1996-03-18 | 1999-03-09 | Samsung Electronics Co., Ltd. | Viterbi decoder |
| CN1832390A (en) * | 2005-03-07 | 2006-09-13 | 松下电器产业株式会社 | Retransmit method based on reliability estimation in multi-antenna adaptive transmit |
| CN102638277A (en) * | 2011-02-11 | 2012-08-15 | 联芯科技有限公司 | Tail-biting convolutional code decoding method and device |
| CN102891690A (en) * | 2011-07-19 | 2013-01-23 | 上海无线通信研究中心 | Tail-biting convolution code decoding method |
| CN102904668A (en) * | 2011-07-27 | 2013-01-30 | 杰脉通信技术(上海)有限公司 | Rapid PBCH (physical broadcast channel) decoding method for LTE (long term evolution) |
-
2017
- 2017-10-19 CN CN201710979858.0A patent/CN107911195B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5881075A (en) * | 1996-03-18 | 1999-03-09 | Samsung Electronics Co., Ltd. | Viterbi decoder |
| CN1832390A (en) * | 2005-03-07 | 2006-09-13 | 松下电器产业株式会社 | Retransmit method based on reliability estimation in multi-antenna adaptive transmit |
| CN102638277A (en) * | 2011-02-11 | 2012-08-15 | 联芯科技有限公司 | Tail-biting convolutional code decoding method and device |
| CN102891690A (en) * | 2011-07-19 | 2013-01-23 | 上海无线通信研究中心 | Tail-biting convolution code decoding method |
| CN102904668A (en) * | 2011-07-27 | 2013-01-30 | 杰脉通信技术(上海)有限公司 | Rapid PBCH (physical broadcast channel) decoding method for LTE (long term evolution) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110798231A (en) * | 2018-08-02 | 2020-02-14 | 北京松果电子有限公司 | Decoding method, device and storage medium for tail-biting convolutional code |
| CN110798231B (en) * | 2018-08-02 | 2024-01-30 | 北京小米松果电子有限公司 | Decoding method, device and storage medium of tail biting convolutional code |
| CN109861695A (en) * | 2019-02-22 | 2019-06-07 | 北京芯盾集团有限公司 | The method for carrying out convolutional code decoding using code book |
| CN109861695B (en) * | 2019-02-22 | 2023-06-20 | 北京芯盾集团有限公司 | Method for decoding convolutional code by using codebook |
| CN110278055A (en) * | 2019-06-03 | 2019-09-24 | 京信通信系统（中国）有限公司 | Tail biting convolutional encoding processing method, device and communication equipment |
| CN111510160A (en) * | 2020-05-13 | 2020-08-07 | 中国人民解放军军事科学院战争研究院 | Truncation convolutional coding optimization construction method |
| CN112217609A (en) * | 2020-10-14 | 2021-01-12 | 紫光展锐(重庆)科技有限公司 | Communication decoding method, device, apparatus and storage medium |
| CN112290957A (en) * | 2020-10-24 | 2021-01-29 | 西北工业大学 | Orthogonal time-frequency expanded tail-biting Turbo coding and decoding communication method |
| CN112290957B (en) * | 2020-10-24 | 2023-06-09 | 西北工业大学 | Orthogonal time-frequency expansion tail biting Turbo coding and decoding communication method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107911195B (en) | 2020-03-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107911195A (en) | A kind of tail-biting convolutional code channel decoding method based on CVA | |
| TWI758295B (en) | Encoding and decoding of control signaling with sectional redundancy check | |
| CN100355201C (en) | Reduced soft output information packet selection | |
| CA2710773C (en) | Decoding scheme using multiple hypotheses about transmitted messages | |
| EP3364542A1 (en) | Error correction coding method based on cascading of polar codes and repetition codes or multi-bit parity check codes | |
| CN107342843A (en) | Speed matching method, code device and communicator | |
| CN110278002A (en) | Polarization code belief propagation list decoding method based on bit reversal | |
| EP2599228B1 (en) | Decoding techniques for tail-biting codes | |
| WO2005006564A1 (en) | Decoding device and decoding method | |
| KR102547476B1 (en) | Method for controlling decoding process based on path metric value and computing apparatus and mobile device for controlling the same | |
| US8843811B2 (en) | Apparatus and method for decoding in communication system | |
| US11398842B2 (en) | Convolutional precoding and decoding of polar codes | |
| KR20160031781A (en) | Method and apparatus for decoding in a system using binary serial concatenated code | |
| CN101969308B (en) | Method and device for decoding tail-biting convolutional codes | |
| US9160399B2 (en) | System and apparatus for decoding tree-based messages | |
| CN102891690A (en) | Tail-biting convolution code decoding method | |
| CN102291198B (en) | Channel decoding method and device | |
| CN113556135B (en) | Polarization code belief propagation bit overturn decoding method based on frozen overturn list | |
| CN110730007B (en) | Polarization code SSCL decoding path splitting method, storage medium and processor | |
| CN113541871A (en) | Method for generating code words and coder-decoder | |
| CN105721104A (en) | Viterbi decoding realizing method | |
| KR102338852B1 (en) | Apparatus and method for decoding a signal in wireless communication system | |
| CN106953647B (en) | Adaptive Chase decoding method for algebraic geometric code | |
| CN115642924B (en) | Efficient QR-TPC decoding method and decoder | |
| US9118480B2 (en) | Frame quality estimation during viterbi decoding |
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 |