CN103856218B - Decoding process method and decoder - Google Patents
Decoding process method and decoder Download PDFInfo
- Publication number
- CN103856218B CN103856218B CN201210516029.6A CN201210516029A CN103856218B CN 103856218 B CN103856218 B CN 103856218B CN 201210516029 A CN201210516029 A CN 201210516029A CN 103856218 B CN103856218 B CN 103856218B
- Authority
- CN
- China
- Prior art keywords
- row
- likelihood ratio
- log
- posterior probability
- ratio sequences
- 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.)
- Active
Links
Landscapes
- Error Detection And Correction (AREA)
Abstract
The embodiment of the present invention provides a kind of decoding process method and decoder, and this method includes：Receive the log-likelihood ratio sequences that decoding demodulator is sent；Pre-decode is carried out to the log-likelihood ratio sequences, at least two row posterior probability log-likelihood ratio sequences are obtained；At least two row posterior probability log-likelihood ratio sequences are entered with row decoding, decoding result, decoding process method and decoder provided in an embodiment of the present invention, it is possible to increase the performance gain of decoding is obtained.
Description
Technical field
The present invention relates to decoding technique, more particularly to a kind of decoding process method and decoder.
Background technology
In Modern Communication System, in order to ensure the reliable and effective transmission in the channel of various data, generally require to utilize
Error correction coding.Development and various high-speeds, the appearance of sudden strong business especially as radio digital communication, to entangling
Error code technology proposes higher and higher requirement.What Turbo code was realized be exactly in communication system channel coding to channel decoding this
The content in one stage, its bit error rate plays a decisive role to whole system
The conventional Turbo code decoder of prior art is by two identical soft-output coding component decoders, interleavers
With corresponding deinterleaver composition.The input of the Soft output information of one-component decoder as next component decoder is believed
Breath, in order to obtain more preferable decoding performance, by this process iteration for several times, obtains the final Soft output information of component decoder, will
The Soft output information carries out hard decision and deinterleaving, obtains decoding result.
However, when Turbo decoding process methods of the prior art are used for long evolving system, its decoding performance gain is simultaneously
It is not high.
The content of the invention
The embodiment of the present invention provides a kind of decoding process method and decoder, the gain performance to improve decoding.
In a first aspect, the embodiment of the present invention provides a kind of decoding process method, including：
Receive the log-likelihood ratio sequences that decoding demodulator is sent；
Pre-decode is carried out to the log-likelihood ratio sequences, at least two row posterior probability log-likelihood ratio sequences are obtained；
At least two row posterior probability log-likelihood ratio sequences are entered with row decoding, decoding result is obtained.
The first possible implementation, according in a first aspect, being implemented as：It is described to the log-likelihood ratio sequences
Pre-decode is carried out, at least two row posterior probability log-likelihood ratio sequences are obtained, including：
Pre-decode is carried out to the log-likelihood ratio sequences using SOVA decoder algorithm, obtained after at least two row
Test probability log-likelihood ratio sequences.
In second of possible implementation, according in a first aspect, being implemented as：It is described to the log-likelihood ratio
Sequence carries out pre-decode, obtains at least two row posterior probability log-likelihood ratio sequences, including：
Pre-decode is carried out to the log-likelihood ratio sequences using maximum posteriori decoding algorithm, obtained after at least two row
Test probability log-likelihood ratio sequences.
In the third possible implementation, according in a first aspect, being implemented as：It is described to the log-likelihood ratio
Sequence carries out pre-decode, obtains at least two row posterior probability log-likelihood ratio sequences, including：
The log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row log-likelihood
Compare sequence；
SOVA decoder algorithm is carried out to the sub- log-likelihood ratio sequences in each window or maximum a posteriori is general
Rate decoding algorithm, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window；
Obtain any sub- posterior probability log-likelihood ratio sequences in each window and recombinated, then obtained in each window
To at least two row posterior probability log-likelihood ratio sequences.
In the 4th kind of possible implementation, according to the third possible implementation of first aspect, implement
For：Any sub- posterior probability log-likelihood ratio sequences obtained in each window are simultaneously recombinated, then are obtained in each window
To before at least two row posterior probability log-likelihood ratio sequences, in addition to：
At least two row, which are obtained, according to the described at least two sub- posterior probability log-likelihood ratio sequences of row sentences sequence firmly；
It is determined that the hard wantonly hard different bit numbers sentenced between sequence of two row sentenced in sequence of at least two row, if the difference
Bit number is less than predetermined bit number, then retains wantonly two row and sentence the sub- posterior probability logarithm of corresponding wantonly two row of sequence firmly seemingly
So than the either rank in sequence, then at least one sub- posterior probability log-likelihood ratio sequences of row are obtained in each window.
In the 5th kind of possible implementation, according to the third possible implementation of first aspect, implement
For：Any sub- posterior probability log-likelihood ratio sequences obtained in each window are simultaneously recombinated, then are obtained in each window
To before at least two row posterior probability log-likelihood ratio sequences, in addition to：
It is determined that wantonly two in the sub- posterior probability log-likelihood ratio sequences of at least two row arrange sub- log-likelihood ratio sequences
Euclidean distance, if the Euclidean distance is less than default Euclidean distance, retains the sub- posterior probability log-likelihood ratio of wantonly two row
At least one sub- posterior probability log-likelihood ratio sequences of row are obtained in either rank in sequence, each window.
In the 6th kind of possible implementation, according to first aspect and first aspect the first to the 5th kind it is possible
Implementation, is implemented as：It is described that row decoding is entered at least two row posterior probability log-likelihood ratio sequences, decoded
As a result, including：
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using Turbo decodings, decoding knot is obtained
Really；Or
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using low density parity check coding, obtained
Result must be decoded.
In the 7th kind of possible implementation, according to the 6th of first aspect the kind of possible implementation, implement
For：Row decoding is entered in the use Turbo decodings at least two row posterior probability log-likelihood ratio sequences, obtains decoding knot
Really, including：
First is carried out at least two row posterior probability log-likelihood ratio sequences to decode, obtain extremely using Turbo decodings
Few two row first decoding result；
CRC check is carried out at least two row first decoding result, if verification passes through, the correct decoding result of output,
If inspection does not pass through, the output decoding result of first row first.
Second aspect, the embodiment of the present invention provides a kind of decoder, including：
Receiving module：For receiving the log-likelihood ratio sequences that decoding demodulator is sent；
Soft output listing generation module：For carrying out pre-decode to the log-likelihood ratio sequences, obtain after at least two row
Test probability log-likelihood ratio sequences；
Decoding module：For at least two row posterior probability log-likelihood ratio sequences to be entered with row decoding, decoding knot is obtained
Really.
The first possible implementation, according to second aspect, is implemented as：The soft output listing generation module tool
Body is used for：
Pre-decode is carried out to the log-likelihood ratio sequences using SOVA decoder algorithm, obtained after at least two row
Test probability log-likelihood ratio sequences.
In second of possible implementation, according to second aspect, it is implemented as：The soft output listing generation mould
Block specifically for：
Pre-decode is carried out to the log-likelihood ratio sequences using maximum posteriori decoding algorithm, obtained after at least two row
Test probability log-likelihood ratio sequences.
In the third possible implementation, according to second aspect, it is implemented as：The soft output listing generation mould
Block specifically for：
The log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row log-likelihood
Compare sequence；
SOVA decoder algorithm is carried out to the sub- log-likelihood ratio sequences in each window or maximum a posteriori is general
Rate decoding algorithm, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window；
Obtain any sub- posterior probability log-likelihood ratio sequences in each window and recombinated, then obtained in each window
To at least two row posterior probability log-likelihood ratio sequences.
In the 4th kind of possible implementation, according to the third possible implementation of second aspect, implement
For：Any sub- posterior probability log-likelihood ratio sequences obtained in each window are simultaneously recombinated, then are obtained in each window
To before at least two row posterior probability log-likelihood ratio sequences, the soft output listing generation module also particularly useful for：
At least two row, which are obtained, according to the described at least two sub- posterior probability log-likelihood ratio sequences of row sentences sequence firmly；
It is determined that the hard wantonly hard different bit numbers sentenced between sequence of two row sentenced in sequence of at least two row, if the difference
Bit number is less than predetermined bit number, then retains wantonly two row and sentence the sub- posterior probability logarithm of corresponding wantonly two row of sequence firmly seemingly
So than the either rank in sequence, then at least one sub- posterior probability log-likelihood ratio sequences of row are obtained in each window.
In the 5th kind of possible implementation, according to the third possible implementation of second aspect, implement
For：Any sub- posterior probability log-likelihood ratio sequences obtained in each window are simultaneously recombinated, then are obtained in each window
To before at least two row posterior probability log-likelihood ratio sequences, the soft output listing generation module also particularly useful for：
It is determined that wantonly two in the sub- posterior probability log-likelihood ratio sequences of at least two row arrange sub- log-likelihood ratio sequences
Euclidean distance, if the Euclidean distance is less than default Euclidean distance, retains the sub- posterior probability log-likelihood ratio of wantonly two row
At least one sub- posterior probability log-likelihood ratio sequences of row are obtained in either rank in sequence, each window.
In the 6th kind of possible implementation, according to second aspect and second aspect the first to the 5th kind it is possible
Implementation, is implemented as：The decoding module specifically for：
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using Turbo decodings, decoding knot is obtained
Really；Or
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using low density parity check coding, obtained
Result must be decoded.
In the 7th kind of possible implementation, according to the 6th of second aspect the kind of possible implementation, implement
For：The decoding module specifically for：
First is carried out at least two row posterior probability log-likelihood ratio sequences to decode, obtain extremely using Turbo decodings
Few two row first decoding result；
CRC check is carried out at least two row first decoding result, if verification passes through, the correct decoding result of output,
If inspection does not pass through, the output decoding result of first row first.
Decoding process method and decoder provided in an embodiment of the present invention, this method to log-likelihood ratio sequences by carrying out
Pre-decode, obtains at least two row posterior probability log-likelihood ratio sequences, it would be desirable to which the log-likelihood ratio sequences for entering row decoding are changed into
The revised posterior probability log-likelihood ratio sequences of multiple row；The revised posterior probability log-likelihood ratio sequences of multiple row are translated
Code, can increase the correct probability of decoding, improve the performance gain of decoding.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, without having to pay creative labor, may be used also
To obtain other accompanying drawings according to these accompanying drawings.
Fig. 1 is the schematic flow sheet of decoding process method of embodiment of the present invention embodiment one；
Fig. 2 is the schematic flow sheet of decoding process method of embodiment of the present invention embodiment two；
Fig. 3 divides window schematic diagram for decoding process method of embodiment of the present invention embodiment three；
Fig. 4 is the schematic flow sheet shown in decoding process method example IV of the embodiment of the present invention；
Fig. 5 is the schematic flow sheet shown in decoding process method of embodiment of the present invention embodiment five；
Fig. 6 is to delete schematic diagram shown in decoding process method of embodiment of the present invention embodiment six；
Fig. 7 is the schematic flow sheet shown in decoding process method of embodiment of the present invention embodiment seven；
Fig. 8 is the structural representation of decoder implementation of embodiment of the present invention example one.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than whole embodiments.It is based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made
Embodiment, belongs to the scope of protection of the invention.
In a communications system, due to the influence of the factors such as channel and noise, data in transmitting procedure inevitably
Make a mistake.In order to reduce the bit error rate in the case of identical signal to noise ratio, transmitting terminal need to use suitable channel coding, receiving terminal
Then need to carry out corresponding decoding to recover normal data.Decoding process method in the embodiment of the present invention, may apply to communication
The decoding of receiving terminal in system.
Fig. 1 is the schematic flow sheet of decoding process method of embodiment of the present invention embodiment one, as shown in figure 1, the present invention is real
The executive agent for applying example is decoder, and decoding process method provided in an embodiment of the present invention comprises the following steps：
S101：Receive the log-likelihood ratio sequences that decoding demodulator is sent.
During the coding and decoding to information source, information source after source encoder, channel encoder and coding demodulator,
It is converted into being suitable for the signal of transmission.And data signal runs into various interference in transmitting procedure, always and loses signal
Very, this distorted signal is transferred to the receiver of receiving terminal, it is necessary to by the demodulation of decoding demodulator, become binary system or enter more
Information sequence processed.In embodiments of the present invention, decoding demodulator by the signal of distortion be demodulated into log-likelihood ratio sequences enter
Information sequence processed, wherein, log-likelihood ratio sequences are Soft Inform ation, are a likelihood probability values, rather than the binary system after judgement
Sequence 0 and 1.In the present embodiment, before decoding, decoder first receives the log-likelihood ratio sequences that decoding demodulator is sent.
S102：Pre-decode is carried out to log-likelihood ratio sequences, at least two row posterior probability log-likelihood ratio sequences are obtained.
Log-likelihood ratio sequences are subjected to pre-decode, multiple row posterior probability log-likelihood ratio sequences are obtained.The multiple row posteriority
Probability log-likelihood ratio sequences are the amendments of the log-likelihood ratio sequences received to decoder.
During implementing, also a kind of decoding process method of equal value with the step is specially：To log-likelihood
Pre-decode is carried out than sequence, multiple external information sequences of the log-likelihood ratio sequences are obtained, by each external information sequence and this pair
Number likelihood ratio sequence constitutes a row posterior probability log-likelihood ratio sequences, finally available at least two row posterior probability log-likelihoods
Compare sequence.
S103：At least two row posterior probability log-likelihood ratio sequences are entered with row decoding, decoding result is obtained.
After multiple row posteriority log-likelihood ratio sequences are obtained, row decoding is entered to multiple row posteriority log-likelihood ratio sequences, obtained
Result must be decoded.
The embodiment of the present invention enters row decoding to multiple row posteriority log-likelihood ratio sequences, obtains decoding result, specifically can be with
Decoded using Turbo, it would however also be possible to employ low density parity check code（Low Density ParityCheck Code, referred to as
LDPC）., can be in iterative decoding process for Turbo decodings, the hard decision result that front and rear iteration twice is exported is compared
Compared with thinking that decoding is correct if completely the same, output decoding result.For LDPC decodings, using soft-output coding
LDPC is decoded, specifically can using belief propagation algorithm or and product decoding algorithm etc., directly output decodes result.The present invention is implemented
Example can also use other iterative decodings based on soft-output coding, such as Reed-Muller（Reed-Muller）Code etc., this
Inventive embodiments are not particularly limited herein.
Decoding process method provided in an embodiment of the present invention, by log-likelihood ratio sequences carry out pre-decode, obtain to
Few two row posterior probability log-likelihood ratio sequences, it would be desirable to enter row decoding log-likelihood ratio sequences be changed into multiple row it is revised after
Test probability log-likelihood ratio sequences；Row decoding is entered to the revised posterior probability log-likelihood ratio sequences of multiple row, can increase and translate
The correct probability of code, improves the performance gain of decoding.
On the basis of embodiment illustrated in fig. 1, in above-mentioned step S102, log-likelihood ratio sequences are translated in advance
Code, obtains at least two row posterior probability log-likelihood ratio sequences, can specifically include following possible implementation：
A kind of possible implementation：Log-likelihood ratio sequences are translated in advance using SOVA decoder algorithm
Code, obtains at least two row posterior probability log-likelihood ratio sequences.
In this kind of implementation, SOVA decoder algorithm, which is specifically as follows, enumerates Viterbi decoding algorithm
（List Viterbi Algorithm, referred to as：LVA）, log-likelihood ratio sequences are carried out by enumerating Viterbi decoding algorithm
Decoding, can export the optimal posterior probability log-likelihood ratio sequences of the path of a plurality of candidate of global optimum, i.e. multiple row.
The embodiment of the present invention can complete soft value generation, output at least two by using SOVA decoder algorithm
Row posterior probability log-likelihood ratio sequences.
Alternatively possible implementation：The log-likelihood ratio sequences are carried out using maximum posteriori decoding algorithm
Pre-decode, obtains at least two row posterior probability log-likelihood ratio sequences.
The present embodiment can specifically use maximum a posteriori probability（Maximum A Posteriori, abbreviation MAP）Decoding is calculated
Method and its improved form, in the hope of obtaining optimal performance.Conventional MAP algorithms include simplifying MAP algorithms, Log-MAP algorithms, Max-
Log-MAP algorithms etc..By taking MAP algorithms as an example, this method produces N row hard decision results first, then to every column decoding result base
The log-likelihood ratio sequences of each column hard decision result are exported in MAP algorithms, so as to obtain at least two row posterior probability log-likelihoods
Compare sequence.
The embodiment of the present invention can complete soft value generation, output at least two by using maximum posteriori decoding algorithm
Row posterior probability log-likelihood ratio sequences.
Another possible implementation, as shown in Fig. 2 specifically including following steps：
S201：Log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row logarithm seemingly
So compare sequence.
Log-likelihood ratio sequences are divided at least two windows, can be two during implementing, or it is multiple.
Log-likelihood ratio sequences are divided into after multiple windows, a row log-likelihood ratio sequences can be obtained in corresponding each window.I.e.
Log-likelihood ratio sequences are divided into multiple row, each window obtains a row.
S202：SOVA decoder algorithm is carried out to the sub- log-likelihood ratio sequences in each window or maximum a posteriori is general
Rate decoding algorithm, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window.
The columns of the sub- posterior probability log-likelihood ratio sequences obtained in specific each window, can be carried out according to actual needs
It is determined that, the embodiment of the present invention is not particularly limited herein.Specific SOVA decoder algorithm or maximum a posteriori probability are translated
Code algorithm, can refer to above method embodiment, and the present invention is not particularly limited herein.
S203：Obtain any sub- posterior probability log-likelihood ratio sequences in each window and recombinated, then in each window
Obtain at least two row posterior probability log-likelihood ratio sequences.
Obtained in each window after at least two sub- posterior probability log-likelihood ratio sequences of row, optional row is right in each window
Number likelihood ratio sequence, each optional log-likelihood ratio sequences are recombinated, at least two row posterior probability log-likelihood ratios are obtained
Sequence.
Step S201 to step S203 is described in detail with a specific embodiment.It is of the invention for convenience of describing
Embodiment obtains two row posterior probability log-likelihood ratio sequences to have in step S201 in two windows, step S202 in each window
Exemplified by, specifically as shown in figure 3, the implementation is described, but the embodiment of the present invention is not limited thereto.
Log-likelihood ratio sequences are divided into two windows, then a row log-likelihood ratio sequences are obtained in each window, to every
The sub- log-likelihood ratio sequences of row in individual window carry out SOVA decoder algorithm or maximum posteriori decoding algorithm, often
Two row posterior probability log-likelihood ratio sequences are obtained in individual window.By the two sub- posterior probability log-likelihood ratio sequences of row in each window
Any sub- log-likelihood ratio sequences in either rank in row, with other windows are recombinated, then can export altogether 4 it is complete
Posterior probability log-likelihood ratio sequences, i.e. 1-1-2-1,1-1-2-2,1-2-2-1,1-2-2-2.
The embodiment of the present invention is by way of dividing window, relative to simple use SOVA decoder algorithm or most
Big posteriori decoding algorithm, can obtain multiple row posterior probability log-likelihood ratio sequences, add the probability of correct decoding.Hair
A person of good sense has found that the Turbo code in Long Term Evolution (Long TermEvolution, abbreviation LTE) communication system enters by research
Row emulation.Turbo code block length=168, window length 42（It is divided into 4 windows）, 4 way posterior probability log-likelihood ratio sequences are exported per window,
Its decoding performance is relative to common turbo decoding liftings 0.3dB or so.
Fig. 4 is the schematic flow sheet shown in decoding process method example IV of the embodiment of the present invention, as shown in figure 4, this hair
Bright embodiment carries out pre-decode to log-likelihood ratio sequences, obtains at least two row posteriority general on the basis of embodiment illustrated in fig. 2
Rate log-likelihood ratio sequences specifically may comprise steps of：
S401：Log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row logarithm seemingly
So compare sequence；
S402：SOVA decoder algorithm is carried out to the sub- log-likelihood ratio sequences in each window or maximum a posteriori is general
Rate decoding algorithm, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window；
S403：At least two row, which are obtained, according at least two sub- posterior probability log-likelihood ratio sequences of row sentences sequence firmly；
S404：It is determined that the hard wantonly hard different bit numbers sentenced between sequence of two row sentenced in sequence of at least two row, if not year-on-year
Special number is less than predetermined bit number, then retains wantonly two row and sentence the sub- posterior probability log-likelihood ratio sequence of corresponding wantonly two row of sequence firmly
Either rank in row, then obtain at least one sub- posterior probability log-likelihood ratio sequences of row in each window；
S405：Obtain any sub- posterior probability at least two sub- posterior probability log-likelihood ratio sequences of row in each window
Log-likelihood ratio sequences are simultaneously recombinated, and obtain at least two row posterior probability log-likelihood ratio sequences.
Above-mentioned steps S401, S402 are similar with the step S201 to S203 in Fig. 2 embodiments with S405, and the present embodiment is herein
Repeat no more.
In step S402, at least two sub- posterior probability log-likelihood ratio sequences of row in each window, it is understood that there may be phase
As sequence, and during decoding, log-likelihood ratio sequences are more similar, then diversity gain is smaller, therefore, can be by each window
At least two sub- posterior probability log-likelihood ratio sequences of row in similar log-likelihood ratio sequences deleted, it is similar it is sub after
Test in probability log-likelihood ratio sequences, only retain the sub- posterior probability log-likelihood ratio sequences of row.
At least two sub- posterior probability log-likelihood ratio sequences of row in each window have been described in detail in step S403 and step S404
Delete process.
During implementing, it first can obtain at least two according at least two sub- posterior probability log-likelihood ratio sequences of row and arrange
Sentence sequence firmly.It is not the binary system after judgement because log-likelihood ratio sequences export for soft amount during implementing, but
One likelihood probability value, therefore can carry out hard decision to each sub- posterior probability log-likelihood ratio, obtains corresponding sentencing sequence firmly
Row.The detailed process of hard decision is, if log-likelihood ratio is more than or equal to 0, and the corresponding hard information bit sentenced in sequence is
1, if log-likelihood ratio is less than 0, the corresponding hard information bit sentenced in sequence is 0., can according to above-mentioned hard decision process
Obtain at least two row and sentence sequence firmly.
It is determined that the hard wantonly hard different bit numbers sentenced in sequence of two row sentenced in sequence of at least two row, for example, when two
Row sentence sequence firmly（011001）With（111110）When, i.e., second is identical with the 3rd bit, is 1, and other bits
Difference, therefore the hard different bit numbers for sentencing sequence of two row are 4.If the different bit numbers are less than predetermined bit number, i.e.,
Illustrate two row it is hard to sentence the corresponding log-likelihood ratio sequences of sequence similar, then retaining wantonly two row, to sentence the corresponding sub- posteriority of sequence firmly general
At least two sub- posterior probability log-likelihood ratio sequences of row are obtained in either rank in rate log-likelihood ratio sequences, each window.
The embodiment of the present invention is by the difference of the bit number of wantonly two row hard decision sequence, to the sub- posterior probability in each window
Log-likelihood ratio sequences are deleted, and can not only reduce the number of posterior probability log-likelihood ratio sequences, reduce answering for decoding
Miscellaneous degree, can also increase diversity gain.
Fig. 5 is the schematic flow sheet shown in decoding process method of embodiment of the present invention embodiment five, as shown in figure 5, this hair
Bright embodiment carries out pre-decode to log-likelihood ratio sequences, obtains at least two row posteriority general on the basis of embodiment illustrated in fig. 2
Rate log-likelihood ratio sequences specifically may comprise steps of：
S501：Log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row logarithm seemingly
So compare sequence；
S502：SOVA decoder algorithm is carried out to the sub- log-likelihood ratio sequences in each window or maximum a posteriori is general
Rate decoding algorithm, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window；
S503：It is determined that wantonly two at least two sub- posterior probability log-likelihood ratio sequences of row arrange sub- log-likelihood ratio sequences
Euclidean distance, if Euclidean distance is less than default Euclidean distance, retains in the sub- posterior probability log-likelihood ratio sequences of wantonly two row
At least two sub- posterior probability log-likelihood ratio sequences of row are obtained in either rank, each window；
S504：Obtain any sub- posterior probability log-likelihood ratio sequences in each window and recombinated, then in each window
Obtain at least two row posterior probability log-likelihood ratio sequences.
Above-mentioned steps S501, S502 are similar with the step S201 to S203 in Fig. 2 embodiments with S504, and the present embodiment is herein
Repeat no more.
The present embodiment and the main distinction of Fig. 4 embodiments be, the present embodiment is by comparing after the method for Euclidean distance, antithetical phrase
Probability likelihood ratio sequence is tested, is deleted, the main method deleted is as shown in step S503.This method is mainly by calculating wantonly two
The Euclidean distance of sub- posterior probability log-likelihood ratio sequences is arranged, if calculating obtained Euclidean distance is less than default Euclidean distance,
Show that this sub- posterior probability log-likelihood ratio sequences of two row is similar sub- posterior probability log-likelihood ratio sequences, then retain this two
Arrange and at least one sub- posterior probability log-likelihood ratio of row is obtained in the either rank in sub- posterior probability log-likelihood ratio sequences, each window
Sequence.
The embodiment of the present invention passes through the Euclidean distance and default Euclidean to the wantonly two sub- posterior probability log-likelihood ratio sequences of row
Sub- posterior probability log-likelihood ratio sequences in each window are deleted, can not only reduce posterior probability by the comparison of distance
The number of log-likelihood ratio sequences, reduces the complexity of decoding, can also increase diversity gain.
Fig. 6 is to delete schematic diagram shown in decoding process method of embodiment of the present invention embodiment six.Signal shown in Fig. 6
Figure, is specifically to delete the signal of process in implementing to Fig. 4 and Fig. 5, as shown in fig. 6, log-likelihood ratio sequences are divided into three
In individual window, each window after SOVA decoder algorithm or maximum posteriori decoding algorithm, 2 row are obtained in each window
Sub- posterior probability log-likelihood ratio sequences.Wherein, 1-1 and 1-2 is the sub- posterior probability log-likelihood ratio sequences of window 1,2-1 and 2-
2 be the sub- posterior probability log-likelihood ratio sequences of window 2, and 3-1 and 3-2 is the sub- posterior probability log-likelihood ratio sequences of window 3.By
When method shown in Fig. 4 or Fig. 5 embodiments is deleted, determine that 1-1 bit numbers different from 1-2's are less than predetermined bit number
When, or 1-1 and 1-2 Euclidean distance when being less than default Euclidean distance, then the two is similar sub- posterior probability log-likelihood ratio
Sequence, therefore, can retain 1-1, delete 1-2.By same process, it is similar sub- posterior probability logarithm to 3-2 to determine 3-1
Likelihood ratio sequence, then retain 3-1, deletes 3-2.And 2-1 and 2-2 is deleted by the method shown in Fig. 4 or Fig. 5 embodiments
When, determine that 2-1 bit numbers different from 2-2's are more than predetermined bit number, or 2-1 and 2-2 Euclidean distance is more than default Europe
Family name apart from when, then the two is dissimilar sub- posterior probability log-likelihood ratio sequences, so the two retains.Now, each
The sub- posterior probability log-likelihood ratio sequences of an optional row are recombinated in window, then can form two row posterior probability log-likelihood ratios
Sequence 1-1-2-1-3-1 and 1-1-2-2-3-1.As can be seen here, relative to the combination do not deleted, it can be reduced to by original 23 row
Two row, greatly reducing amount of calculation and computation complexity.It will be understood by those skilled in the art that predetermined bit number is with presetting
The concrete numerical value of Euclidean distance can determine according to actual needs, but purpose is that to ensure finally obtain at least two row posteriority general
Rate log-likelihood ratio sequences.
Fig. 7 is the schematic flow sheet shown in decoding process method of embodiment of the present invention embodiment seven, as shown in fig. 7, this hair
The decoding process method that bright embodiment is provided comprises the following steps：
S701：Receive the log-likelihood ratio sequences that decoding demodulator is sent；
S702：Pre-decode is carried out to log-likelihood ratio sequences, at least two row posterior probability log-likelihood ratio sequences are obtained；
S703：First is carried out at least two row posterior probability log-likelihood ratio sequences to decode, obtain extremely using Turbo decodings
Few two row first decoding result；
S704：CRC check is carried out at least two row first decoding result, if verification passes through, the correct decoding result of output,
If inspection does not pass through, the output decoding result of first row first.
Step S701 in the present embodiment is similar with the step S101 shown in Fig. 1 embodiments, and the present embodiment is no longer gone to live in the household of one's in-laws on getting married herein
State.Step S702 is similar with embodiment of the method shown in above-mentioned Fig. 2 to Fig. 6, reference can be made to above method embodiment, the present embodiment is herein
Repeat no more.
For step S703 and step S704, using Turbo decodings at least two row posterior probability log-likelihood ratio sequences
First is carried out to decode, wherein, Turbo decodings can select the decoded mode of serial or parallel, obtain at least two row first and decode
As a result.
Obtain after at least two row first decoding result, result is decoded at least two row first by CRC and carries out CRC respectively
Verification, the correct first decoding result of selection CRC check is as final decoding result output, if all first decoding results are all
The first decoding result of first row by CRC check, then can not be exported as final decoding result.
It will be understood by those skilled in the art that being decoded for Turbo, CRC check can not be also used, and selects above-mentioned pair
Hard decision result makes decisions, and obtains decoding result.The Turbo interpretation methods of CRC check are used to be decoded for preferred Turbo.
For LDPC decodings, LDPC decodings have self-checking function, without passing through CRC check, you can output decoding result, for example,
LDPC and product decoding algorithm in, each variable node passes to its corresponding log-likelihood ratio all verifications being attached thereto
Node, is iterated decoding, after each iteration terminates, and carries out hard decision, when hard decision sequence meets check matrix, stops iteration
And decoding result is exported, otherwise continue iteration to maximum iteration.
Decoding process method provided in an embodiment of the present invention, by being verified to the code word in decoding result, energy
Enough export correct code word.
Fig. 8 is the structural representation of decoder implementation of embodiment of the present invention example one, as shown in figure 8, the embodiment of the present invention is carried
The decoder of confession, including receiving module 81, soft output listing generation module 82, decoding module 83.Wherein, receiving module 81 is used for
The log-likelihood ratio sequences that decoding demodulator is sent are received, soft output listing generation module 82 is used for the log-likelihood ratio sequence
Row carry out pre-decode, obtain at least two row posterior probability log-likelihood ratio sequences, and decoding module 83 is used to arrange described at least two
Posterior probability log-likelihood ratio sequences enter row decoding, obtain decoding result.
The decoder of the present embodiment can be used for the technical scheme for performing embodiment of the method shown in above-mentioned Fig. 1, and it realizes former
Reason is similar with technique effect, and here is omitted.
Further, the soft output listing generation module 82 is specifically for using SOVA decoder algorithm to institute
State log-likelihood ratio sequences and carry out pre-decode, obtain at least two row posterior probability log-likelihood ratio sequences.
Further, the soft output listing generation module 82 is specifically for using maximum posteriori decoding algorithm to institute
State log-likelihood ratio sequences and carry out pre-decode, obtain at least two row posterior probability log-likelihood ratio sequences.
The decoder of the present embodiment can be used for the technical scheme for performing above method embodiment, its realization principle and technology
Effect is similar, and here is omitted.
Further, the soft output listing generation module 82 specifically for：
The log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row log-likelihood
Compare sequence；
SOVA decoder algorithm is carried out to the sub- log-likelihood ratio sequences in each window or maximum a posteriori is general
Rate decoding algorithm, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window；
Obtain any sub- posterior probability log-likelihood ratio sequences in each window and recombinated, then obtained in each window
To at least two row posterior probability log-likelihood ratio sequences.
The decoder of the present embodiment can be used for the technical scheme for performing embodiment of the method shown in above-mentioned Fig. 2, and it realizes former
Reason is similar with technique effect, and here is omitted.
Further, any sub- posterior probability log-likelihood ratio sequences obtained in each window and weight is carried out
Group, then before obtaining at least two row posterior probability log-likelihood ratio sequences in each window, the soft output listing generation module 82
Also particularly useful for：
At least two row, which are obtained, according to the described at least two sub- posterior probability log-likelihood ratio sequences of row sentences sequence firmly；
It is determined that the hard wantonly hard different bit numbers sentenced between sequence of two row sentenced in sequence of at least two row, if the difference
Bit number is less than predetermined bit number, then retains wantonly two row and sentence the sub- posterior probability logarithm of corresponding wantonly two row of sequence firmly seemingly
So than the either rank in sequence, then at least one sub- posterior probability log-likelihood ratio sequences of row are obtained in each window.
The decoder of the present embodiment can be used for the technical scheme for performing embodiment of the method shown in above-mentioned Fig. 4, and it realizes former
Reason is similar with technique effect, and here is omitted.
Further, any sub- posterior probability log-likelihood ratio sequences obtained in each window and weight is carried out
Group, then before obtaining at least two row posterior probability log-likelihood ratio sequences in each window, the soft output listing generation module 82
Also particularly useful for：
It is determined that wantonly two in the sub- posterior probability log-likelihood ratio sequences of at least two row arrange sub- log-likelihood ratio sequences
Euclidean distance, if the Euclidean distance is less than default Euclidean distance, retains the sub- posterior probability log-likelihood ratio of wantonly two row
At least one sub- posterior probability log-likelihood ratio sequences of row are obtained in either rank in sequence, each window.
The decoder of the present embodiment can be used for the technical scheme for performing embodiment of the method shown in above-mentioned Fig. 5, and it realizes former
Reason is similar with technique effect, and here is omitted.
Further, the decoding module 83 is general at least two row posteriority specifically for being decoded using Turbo
Rate log-likelihood ratio sequences enter row decoding, obtain decoding result；Or
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using low density parity check coding, obtained
Result must be decoded.
Further, the decoding module 83 specifically for：
First is carried out at least two row posterior probability log-likelihood ratio sequences to decode, obtain extremely using Turbo decodings
Few two row first decoding result；
CRC check is carried out at least two row first decoding result, if verification passes through, the correct decoding result of output,
If inspection does not pass through, the output decoding result of first row first.
The decoder of the present embodiment can be used for the technical scheme for performing embodiment of the method shown in above-mentioned Fig. 7, and it realizes former
Reason is similar with technique effect, and here is omitted.
One of ordinary skill in the art will appreciate that：Realizing all or part of step of above-mentioned each method embodiment can lead to
The related hardware of programmed instruction is crossed to complete.Foregoing program can be stored in a computer read/write memory medium.The journey
Sequence upon execution, performs the step of including above-mentioned each method embodiment；And foregoing storage medium includes：ROM, RAM, magnetic disc or
Person's CD etc. is various can be with the medium of store program codes.
Finally it should be noted that：Various embodiments above is merely illustrative of the technical solution of the present invention, rather than its limitations；To the greatest extent
The present invention is described in detail with reference to foregoing embodiments for pipe, it will be understood by those within the art that：Its according to
The technical scheme described in foregoing embodiments can so be modified, or which part or all technical characteristic are entered
Row equivalent substitution；And these modifications or replacement, the essence of appropriate technical solution is departed from various embodiments of the present invention technology
The scope of scheme.
Claims (10)
1. a kind of decoding process method, it is characterised in that including：
Receive the log-likelihood ratio sequences that decoding demodulator is sent；
Pre-decode is carried out to the log-likelihood ratio sequences, at least two row posterior probability log-likelihood ratio sequences are obtained；
At least two row posterior probability log-likelihood ratio sequences are entered with row decoding, decoding result is obtained；
Wherein, it is described that pre-decode is carried out to the log-likelihood ratio sequences, obtain at least two row posterior probability log-likelihood ratio sequences
Row, including：
The log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row log-likelihood ratio sequence
Row；
Sub- log-likelihood ratio sequences in each window are carried out with SOVA decoder algorithm or maximum posteriori decoding is calculated
Method, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window；
Obtain any sub- posterior probability log-likelihood ratio sequences in each window and recombinated, then obtain at least two in each window
Row posterior probability log-likelihood ratio sequences.
2. according to the method described in claim 1, it is characterised in that any sub- posterior probability obtained in each window
Log-likelihood ratio sequences are simultaneously recombinated, then obtain before at least two row posterior probability log-likelihood ratio sequences, go back in each window
Including：
At least two row, which are obtained, according to the described at least two sub- posterior probability log-likelihood ratio sequences of row sentences sequence firmly；
It is determined that the hard wantonly hard different bit numbers sentenced between sequence of two row sentenced in sequence of at least two row, if the different bits
Number is less than predetermined bit number, then retains wantonly two row and sentence the sub- posterior probability log-likelihood ratio of corresponding wantonly two row of sequence firmly
Either rank in sequence, then obtain at least one sub- posterior probability log-likelihood ratio sequences of row in each window.
3. according to the method described in claim 1, it is characterised in that any sub- posterior probability obtained in each window
Log-likelihood ratio sequences are simultaneously recombinated, then obtain before at least two row posterior probability log-likelihood ratio sequences, go back in each window
Including：
It is determined that the Euclidean of the sub- log-likelihood ratio sequences of wantonly two row in the sub- posterior probability log-likelihood ratio sequences of at least two row
Distance, if the Euclidean distance is less than default Euclidean distance, retains the sub- posterior probability log-likelihood ratio sequences of wantonly two row
In either rank, at least one sub- posterior probability log-likelihood ratio sequences of row are obtained in each window.
4. the method according to claim any one of 1-3, it is characterised in that described at least two row posterior probability pair
Number likelihood ratio sequence is decoded, and obtains decoding result, including：
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using Turbo decodings, decoding result is obtained；Or
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using low density parity check coding, translated
Code result.
5. method according to claim 4, it is characterised in that the use Turbo decodings are at least two row posteriority
Probability log-likelihood ratio sequences enter row decoding, obtain decoding result, including：
First is carried out at least two row posterior probability log-likelihood ratio sequences to decode, obtain at least two using Turbo decodings
Row first decode result；
CRC check is carried out at least two row first decoding result, if verification passes through, the correct decoding result of output, if inspection
Test and do not pass through, then export the decoding result of first row first.
6. a kind of decoder, it is characterised in that including：
Receiving module：For receiving the log-likelihood ratio sequences that decoding demodulator is sent；
Soft output listing generation module：For carrying out pre-decode to the log-likelihood ratio sequences, at least two row posteriority are obtained general
Rate log-likelihood ratio sequences；
Decoding module：For at least two row posterior probability log-likelihood ratio sequences to be entered with row decoding, decoding result is obtained；
The soft output listing generation module specifically for：
The log-likelihood ratio sequences are divided at least two windows, corresponding each window and obtain a row log-likelihood ratio sequence
Row；
SOVA decoder algorithm is carried out to the sub- log-likelihood ratio sequences in each window or maximum a posteriori probability is translated
Code algorithm, then obtain at least two sub- posterior probability log-likelihood ratio sequences of row in each window；
Obtain any sub- posterior probability log-likelihood ratio sequences in each window and recombinated, then obtained in each window to
Few two row posterior probability log-likelihood ratio sequences.
7. decoder according to claim 6, it is characterised in that any sub- posteriority in acquisition each window is general
Rate log-likelihood ratio sequences are simultaneously recombinated, then before obtaining at least two row posterior probability log-likelihood ratio sequences in each window,
The soft output listing generation module also particularly useful for：
At least two row, which are obtained, according to the described at least two sub- posterior probability log-likelihood ratio sequences of row sentences sequence firmly；
It is determined that the hard wantonly hard different bit numbers sentenced between sequence of two row sentenced in sequence of at least two row, if the different bits
Number is less than predetermined bit number, then retains wantonly two row and sentence the sub- posterior probability log-likelihood ratio of corresponding wantonly two row of sequence firmly
Either rank in sequence, then obtain at least one sub- posterior probability log-likelihood ratio sequences of row in each window.
8. decoder according to claim 6, it is characterised in that any sub- posteriority in acquisition each window is general
Rate log-likelihood ratio sequences are simultaneously recombinated, then before obtaining at least two row posterior probability log-likelihood ratio sequences in each window,
The soft output listing generation module also particularly useful for：
It is determined that the Euclidean of the sub- log-likelihood ratio sequences of wantonly two row in the sub- posterior probability log-likelihood ratio sequences of at least two row
Distance, if the Euclidean distance is less than default Euclidean distance, retains the sub- posterior probability log-likelihood ratio sequences of wantonly two row
In either rank, at least one sub- posterior probability log-likelihood ratio sequences of row are obtained in each window.
9. the decoder according to claim any one of 6-8, it is characterised in that the decoding module specifically for：
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using Turbo decodings, decoding result is obtained；Or
Row decoding is entered at least two row posterior probability log-likelihood ratio sequences using low density parity check coding, translated
Code result.
10. decoder according to claim 9, it is characterised in that the decoding module specifically for：
First is carried out at least two row posterior probability log-likelihood ratio sequences to decode, obtain at least two using Turbo decodings
Row first decode result；
CRC check is carried out at least two row first decoding result, if verification passes through, the correct decoding result of output, if inspection
Test and do not pass through, then export the decoding result of first row first.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210516029.6A CN103856218B (en) | 2012-12-05 | 2012-12-05 | Decoding process method and decoder |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210516029.6A CN103856218B (en) | 2012-12-05 | 2012-12-05 | Decoding process method and decoder |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103856218A CN103856218A (en) | 2014-06-11 |
| CN103856218B true CN103856218B (en) | 2017-07-21 |
Family
ID=50863480
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210516029.6A Active CN103856218B (en) | 2012-12-05 | 2012-12-05 | Decoding process method and decoder |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103856218B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105790882B (en) * | 2014-12-17 | 2019-04-30 | 深圳市中兴微电子技术有限公司 | A kind of method and device reducing false detection rate |
| WO2017107937A1 (en) * | 2015-12-22 | 2017-06-29 | 深圳超级数据链技术有限公司 | Decoding method and apparatus, and system therefor |
| JP6753931B2 (en) * | 2016-06-21 | 2020-09-09 | 日本電信電話株式会社 | Methods for optical receivers, optical transmitters and optical receivers |
| CN107733446B (en) * | 2016-08-12 | 2019-06-07 | 华为技术有限公司 | Interpretation method and equipment, decoder |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1411235A (en) * | 2002-12-06 | 2003-04-16 | 清华大学 | Method for enhancing product code decoding speed and decoding device |
| CN101753152A (en) * | 2008-12-02 | 2010-06-23 | 大唐移动通信设备有限公司 | Turbo code decoder and decoding method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4131680B2 (en) * | 2003-06-09 | 2008-08-13 | 松下電器産業株式会社 | Turbo decoder |
-
2012
- 2012-12-05 CN CN201210516029.6A patent/CN103856218B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1411235A (en) * | 2002-12-06 | 2003-04-16 | 清华大学 | Method for enhancing product code decoding speed and decoding device |
| CN101753152A (en) * | 2008-12-02 | 2010-06-23 | 大唐移动通信设备有限公司 | Turbo code decoder and decoding method |
Non-Patent Citations (1)
| Title |
|---|
| 《List Viterbi Decoding Algorithms with Applications》;Nambirajan Seshadri，Carl-Erik W.Sundberg;《IEEE Transactions on Communications》;19940430;第42卷(第234期);第317页左栏第3部分，图6 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103856218A (en) | 2014-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| AU2005225107B2 (en) | Method and apparatus for decoding low density parity check code using united node processing | |
| CN103220001B (en) | The interpretation method of polar code and code translator with cyclic redundancy check (CRC) cascade | |
| CN101026439B (en) | Decoding method for increasing Turbo code decoding rate | |
| US7657819B2 (en) | Method and apparatus for termination of iterative turbo decoding | |
| CN109842418A (en) | A kind of polarization code belief propagation interpretation method based on bit reversal | |
| CN104025459A (en) | Decoding processing method and decoder | |
| US8650451B2 (en) | Stochastic stream decoding of binary LDPC codes | |
| CN104242957B (en) | Decoding process method and decoder | |
| CN103856218B (en) | Decoding process method and decoder | |
| RU2571597C2 (en) | Turbocode decoding method and device | |
| CN109547034A (en) | Interpretation method and equipment, decoder | |
| CN108833052B (en) | Channel polarization decoding path metric value sorting method | |
| CN110661533B (en) | Method for optimizing decoding performance of decoder for storing polarization code | |
| CN111654291B (en) | Polarization code rapid serial offset list decoding algorithm based on bit flipping | |
| US20130007568A1 (en) | Error correcting code decoding device, error correcting code decoding method and error correcting code decoding program | |
| Ortega et al. | Optimizing the co‐design of message structure and channel coding to reduce the TTD for a Galileo 2nd generation signal | |
| CN102835062B (en) | Initializing decoding metrics | |
| CN109672498B (en) | Decoding method and device | |
| US7587004B2 (en) | Method for decoding data using windows of data | |
| US7236591B2 (en) | Method for performing turbo decoding in mobile communication system | |
| CN102832954B (en) | Turbo code iterative decoding stopping method based on soft information average minimum value | |
| US6256764B1 (en) | Method and system for decoding tailbiting convolution codes | |
| CN110324111B (en) | Decoding method and device | |
| CN110022158B (en) | Decoding method and device | |
| Ortega Espluga et al. | New solutions to reduce the time-to-CED and to improve the CED robustness of the Galileo I/NAV message |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |