CN104796160B - Interpretation method and device - Google Patents
Interpretation method and device Download PDFInfo
- Publication number
- CN104796160B CN104796160B CN201410028585.8A CN201410028585A CN104796160B CN 104796160 B CN104796160 B CN 104796160B CN 201410028585 A CN201410028585 A CN 201410028585A CN 104796160 B CN104796160 B CN 104796160B
- Authority
- CN
- China
- Prior art keywords
- tail
- siso
- decoding
- code
- code word
- 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
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/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
-
- 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/4115—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors list output Viterbi decoding
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a kind of interpretation method and devices.This method comprises: the stateful middle determining original state of institute at all moment in tail-biting convolutional code, the number at all moment is determined by the sequence length K of the original information sequence of the tail-biting convolutional code, the stateful number is determined that the tail-biting convolutional code is encoded via the encoder by the original information sequence and obtained by the shift register number of encoder；LVA decoding is carried out to the tail-biting convolutional code according to the original state and obtains LcA code word, the original state correspond to the l-th bit of the original information sequence；By the LcA code word distinguishes ring shift right L or ring shift left K-L；Decoding result is obtained according to the code word after cyclic shift.The interpretation method and device of the embodiment of the present invention can more accurately find original state, decoding complexity be reduced, so as to improve decoding performance.
Description
Technical field
The present invention relates to the communications fields, and more particularly, to interpretation method and device.
Background technique
From the point of view of whether adding tail bit before being encoded to information sequence, coding is carried out to information sequence and obtains convolutional code
Mode can be divided into two classes: zero convolutional code and tail-biting convolutional code.
By adding a certain number of known bits after information sequence, (for example the value of the known bits is zero convolutional code
Zero), so that after the completion of to above- mentioned information sequential coding, the value of the information bit in the shift register for the encoder for convolution codes that is zeroed
Zero, it is also assumed that encoder for convolution codes is zeroed after the completion of coding, the original state and ending of the encoder for convolution codes that is zeroed
State is all nought state.Zero convolutional code is widely used in Universal Mobile Communication System (Universal Mobile
Telecommunication System, UMTS) in.
Tail-biting convolutional code is the coding mode for not needing to add tail bit after information sequence, which first will letter
The last M bit of breath sequence sequentially inserts the shift register of tail-biting convolutional code encoder, is then encoded, to guarantee
The original state of tail-biting convolutional code encoder is identical with ending state.The value of above-mentioned M corresponds to the deposit of tail-biting convolutional code encoder
Device number.Because not adding tail bit, so as to avoid the loss of tail bit bring additional transmissions expense and code rate, therefore work as
When code length is shorter, the zero convolution code performance than adding tail bit is more preferable.Tail-biting convolutional code is widely used in drilling for a long time
Into (Long Term Evolution, LTE), global interconnection inserting of microwave (Worldwide Interoperability for
Microwave Access, WiMAX) etc. in communication systems.
Above two convolutional code generallys use coding or decoded mode based on Viterbi (Viterbi) algorithm, Viterbi
Algorithm is a kind of algorithm based on maximum-likelihood criterion.Enumerating viterbi algorithm (List Viterbi Algorithm, LVA) is
A kind of Viterbi algorithm of enhancing as obtains l global preferred path and corresponding decoding information by viterbi algorithm
Then sequence is obtained just by error-checking method such as cyclic redundancy check (Cyclic Redundancy Check, CRC)
True decoding information sequence.As l=1, LVA algorithm is just equivalent to Viterbi algorithm.Since LVA has chosen a plurality of overall situation preferably
Path, therefore its decoding performance is better than Viterbi algorithm.
For zero convolutional code, since the original state and ending state of encoder are all nought states, so in LVA
During decoding, the either decoding based on building grid chart (calculating path metric value), or the decoding based on backtracking all may be used
To force to be decoded since nought state.And for tail-biting convolutional code, due to the original state and ending shape of encoder
State is unknown (only knowing that the two is identical), can largely influence decoding performance.
Summary of the invention
The embodiment of the invention provides a kind of interpretation method and devices, can be improved decoding performance.
In a first aspect, providing a kind of interpretation method, comprising:
In the stateful middle determining original state of institute at all moment of tail-biting convolutional code, the number at all moment is stung by this
The sequence length K of the original information sequence of tail convolutional code determines that the stateful number is a by the shift register of encoder
Number determines that the tail-biting convolutional code is encoded via the encoder by the original information sequence and obtained, which is positive integer；
The tail-biting convolutional code is carried out according to the original state to enumerate viterbi algorithm LVA decoding acquisition LcA code word, LcFor
Positive integer, the original state correspond to the l-th bit of the original information sequence, and L is integer；
By the LcA code word distinguishes ring shift right L or ring shift left K-L；
Decoding result is obtained according to the code word after cyclic shift.
In the first possible implementation, in the stateful middle determining initial shape of institute at all moment of tail-biting convolutional code
State, comprising:
Soft-output coding SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
Stateful middle determination original state of institute as a result, all moment in the tail-biting convolutional code is decoded according to SISO.
The possible implementation of with reference to first aspect the first, in the second possible implementation, according to SISO
Decoding is as a result, the stateful middle determination original state of institute at all moment in the tail-biting convolutional code, comprising:
The Soft Inform ation in result is decoded according to the SISO and determines L, wherein L is the corresponding j of maximum value or ∑ in ∑ (j)
(j) the corresponding j of multiple values in, ∑ (j) indicate the encoder of the tail-biting convolutional code to original information sequence d0,d1,
d2,...,dK-1In djIt is soft in the corresponding SISO decoding result of value when coding in each shift register of the encoder
The sum of absolute value of information, j=0,1,2 ..., K-1；
According to the SISO decode result in hard decision information and L determine the original state.
The possible implementation of second with reference to first aspect, in the third possible implementation,For original information sequence d0,d1,d2,...,dK-1In diIt is corresponding
The SISO decoding result in Soft Inform ation, M be the encoder shift register number, i=0,1,2 ..., K-1；
The original state is
Wherein, bin () indicates binary form, for original information sequence d0,d1,d2,...,dK-1In diIt is corresponding to be somebody's turn to do
SISO decodes the hard decision information in result.
Any possible realization with reference to first aspect or in the first to three kind of possible implementation of first aspect
Mode obtains decoding result according to the code word after cyclic shift in the fourth possible implementation, comprising:
Cyclic redundancy check (CRC) is carried out to the code word after the cyclic shift, determines correctly decoding result.
Any possible realization with reference to first aspect or in the first to three kind of possible implementation of first aspect
Mode obtains decoding result according to the code word after cyclic shift in a fifth possible implementation, comprising:
The corresponding maximum code word of path accumulated metric value is selected in the code word after the cyclic shift；
CRC is carried out to the code word of selection, determines correctly decoding result.
Second aspect provides a kind of code translator, comprising:
Determining module, for the stateful middle determining original state of institute at all moment in tail-biting convolutional code, the institute is sometimes
The number at quarter is determined that the stateful number is by encoder by the sequence length K of the original information sequence of the tail-biting convolutional code
Shift register number determine that the tail-biting convolutional code is encoded via the encoder by the original information sequence and obtained, which is positive
Integer；
LVA decoding module enumerates viterbi algorithm LVA decoding for carrying out according to the original state to the tail-biting convolutional code
Obtain LcA code word, LcFor positive integer, which corresponds to the l-th bit of the original information sequence, and L is integer；
Shift module is used for the LcA code word distinguishes ring shift right L or ring shift left K-L；
Module is obtained, for obtaining decoding result according to the code word after cyclic shift.
In the first possible implementation, which is specifically used for:
Soft-output coding SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
Stateful middle determination original state of institute as a result, all moment in the tail-biting convolutional code is decoded according to SISO.
In conjunction with the possible implementation of the first of second aspect or second aspect, in second of possible implementation
In, which is specifically used for:
Soft-output coding SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
Root according to the SISO decode result in Soft Inform ation determine L, wherein L be ∑ (j) in the corresponding j of maximum value or
The corresponding j of multiple values in ∑ (j), ∑ (j) indicate the encoder of the tail-biting convolutional code to original information sequence d0,d1,
d2,...,dK-1In djIt is soft in the corresponding SISO decoding result of value when coding in each shift register of the encoder
The sum of absolute value of information, j=0,1,2 ..., K-1；
According to the SISO decode result in hard decision information and L determine the original state.
In conjunction with second of possible implementation of second aspect, in the third possible implementation,LappIt (i) is original information sequence d0,d1,d2,...,dK-1In diIt is corresponding
The SISO decoding result in Soft Inform ation, M be the encoder shift register number, i=0,1,2 ..., K-1；
The original state is
Wherein, bin () indicates binary form, for original information sequence d0,d1,d2,...,dK-1In diIt is corresponding to be somebody's turn to do
SISO decodes the hard decision information in result.
In conjunction with any possible realization in the first to three kind of possible implementation of second aspect or second aspect
Mode, in the fourth possible implementation, the acquisition module are specifically used for recycling the code word after the cyclic shift
Redundancy check CRC determines correctly decoding result.
In conjunction with any possible realization in the first to three kind of possible implementation of second aspect or second aspect
Mode, in a fifth possible implementation, the acquisition module are specifically used for the selection pair in the code word after the cyclic shift
The maximum code word of path accumulated metric value answered carries out CRC to the code word of selection, determines correctly decoding result.
Based on the above-mentioned technical proposal, the interpretation method and device of the embodiment of the present invention, by all of tail-biting convolutional code
The stateful middle determining original state of institute at moment carries out LVA decoding to tail-biting convolutional code according to the original state, and will obtain
Code word cyclic shift determines correctly decoding in the code word after cyclic shift as a result, original state can more accurately be found, drops
Low decoding complexity, so as to improve decoding performance.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, will make below to required in the embodiment of the present invention
Attached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for
For those of ordinary skill in the art, without creative efforts, it can also be obtained according to these attached drawings other
Attached drawing.
Fig. 1 is the schematic flow chart of interpretation method according to an embodiment of the present invention.
Fig. 2 is the coding schematic diagram of the tail-biting convolutional code in LTE system.
Fig. 3 is the schematic diagram of convolutional code grid chart.
Fig. 4 is convolutional code status diagram.
Fig. 5 is the continuous state transfer schematic diagram of tail-biting convolutional code head and the tail.
Fig. 6 is the schematic diagram of SISO decoding.
Fig. 7 is the schematic block diagram of code translator according to an embodiment of the present invention.
Fig. 8 is the structural schematic diagram of code translator according to an embodiment of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiment is a part of the embodiments of the present invention, rather than whole embodiments.Based on this hair
Embodiment in bright, those of ordinary skill in the art's every other reality obtained without creative labor
Example is applied, all should belong to the scope of protection of the invention.
It should be understood that the technical solution of the embodiment of the present invention can be applied to various communication systems, and such as: global system for mobile telecommunications
(Global System of Mobile communication, GSM) system, CDMA (Code Division
Multiple Access, CDMA) system, wideband code division multiple access (Wideband Code Division Multiple
Access, WCDMA) it system, General Packet Radio Service (General Packet Radio Service, GPRS), drills for a long time
Into (Long Term Evolution, LTE) system, LTE frequency division duplex (Frequency Division Duplex, FDD) system
System, LTE time division duplex (Time Division Duplex, TDD), Universal Mobile Communication System (Universal Mobile
Telecommunication System, UMTS), global interconnection inserting of microwave (Worldwide Interoperability
For Microwave Access, WiMAX) communication system etc..
The code translator of the embodiment of the present invention can be user equipment (User Equipment, UE) or base station, can also
To be located in UE or base station.For example, the interpretation method in the embodiment of the present invention can be executed by UE or base station, it can also be by position
Processor in UE or base station executes.
User equipment (User Equipment, UE) can be referred to as terminal (Terminal), mobile station (Mobile
Station, MS), mobile terminal (Mobile Terminal) etc., which can be through wireless access network (Radio
Access Network, RAN) communicated with one or more core nets, for example, user equipment can be mobile phone (or
Referred to as " cellular phone "), the computer with mobile terminal etc., for example, user equipment can also be portable, pocket, hand
Hold formula, built-in computer or vehicle-mounted mobile device, they exchange voice and/or data with wireless access network.
Base station can be the base station (Base Transceiver Station, BTS) in GSM or CDMA, be also possible to
Base station (NodeB, NB) in WCDMA can also be evolved base station (Evolutional Node B, ENB or e- in LTE
NodeB), the present invention does not limit.
Fig. 1 shows the schematic flow chart of interpretation method 100 according to an embodiment of the present invention.The method of Fig. 1 is by decoding
Device executes.As shown in Figure 1, this method 100 includes:
S110, in the stateful middle determining original state of institute at all moment of tail-biting convolutional code, the number at all moment
It is determined by the sequence length K of the original information sequence of the tail-biting convolutional code, which is posted by the displacement of encoder
Storage number determines that the tail-biting convolutional code is encoded via the encoder by the original information sequence and obtained, and K is positive integer；
S120 carries out LVA decoding to the tail-biting convolutional code according to the original state and obtains LcA code word, LcIt, should for positive integer
Original state corresponds to the l-th bit of the original information sequence, and L is integer；
S130, by the LcA code word distinguishes ring shift right L or ring shift left K-L；
S140 obtains decoding result according to the code word after cyclic shift.
In embodiments of the present invention, the state of tail-biting convolutional code is understood that the original information sequence of pairs of tail-biting convolutional code
The state of the shift register of encoder when being encoded.In other words, the state of above-mentioned tail-biting convolutional code can be by above-mentioned shifting
Information bit in bit register is determined.For example, if there is M shift register, 2 are corresponding withMKind tail-biting convolutional code
State.Fig. 2 is the coding schematic diagram of the tail-biting convolutional code in LTE system.By taking tail-biting convolutional code shown in Fig. 2 as an example, right
When original information sequence is encoded, one information bit of every input to shift register, the information in above-mentioned shift register
Bit sequence can change, and corresponding is exactly that the state of shift register can occur once to shift or change.Therefore, for length
Degree is that the original information sequence of K (is expressed as d0,d1,d2,...,dK-1, K is positive integer) for, it has K next state and shifts, K times
State transfer has K+1 state altogether.Each state in above-mentioned K+1 state, therefore can be with because the opportunity of generation is different
A moment is respectively corresponded, at the time of which can be referred to as tail-biting convolutional code.Preceding K state is respectively corresponded to bit d0,
d1,d2,...,dK-1At the time of successively coding, this K state can also be expressed as and respectively corresponded to bit d0,d1,
d2,...,dK-1.The last one state is to bit dK-1State after coding, the state are identical as first state.At this
In inventive embodiments, bit d is respectively indicated with moment 0,1,2 ..., K-10,d1,d2,...,dK-1The coding moment.For example, when
Carving 0 is bit d0The coding moment, moment K-1 be bit dK-1The coding moment.
In embodiments of the present invention, code translator is when decoding tail-biting convolutional code, in all of tail-biting convolutional code
Decoding original state is determined in all possible state corresponding to moment.That is, in embodiments of the present invention, initial shape
State is more than the original state of encoder, and can be state corresponding to any moment i.e. moment 0 to moment K-1.Decoding dress
It sets and LVA decoding is carried out to tail-biting convolutional code according to the original state.
Why LVA decoding can be carried out using the state corresponding to any moment as original state, be because with any
Moment is that initial time carries out Viterbi decoding or LVA decoding, can obtain consistent decoding as a result, below to this progress
Detailed analysis.
As described above, the state that the (eds.) decoding process of tail-biting convolutional code is actually an original information sequence shifted
Journey can be indicated by state transition diagram.Fig. 3 is the example of a grid chart.In Fig. 3 one share 8 kinds of states (state 0~
7) 7 moment (0~6), are shown.For the LVA algorithm of tail-biting convolutional code, original state how is accurately found to decoding
Performance influences most important.Fig. 4 shows the transfer schematic diagram of state corresponding to the tail-biting convolutional code of K message length.Due to
The state transfer of the characteristic of " tail biting ", tail-biting convolutional code is actually to recycle continuously.For example, the form of Fig. 5 can be expressed as.
As can be seen from Figure 5, from the point of view of the transfer of the state of grid chart, actually go out from 0 to any one moment corresponding state in K-1
Hair returns still to the moment corresponding state after the transfer of K next state.That is, we with any time be it is initial when
It carves and carries out Viterbi decoding or LVA decoding, consistent decoding result can be obtained.When the decoding result is with real 0
Carving is that the result that initial time decodes is compared, and has only differed a cyclic shift.The decoding result is followed accordingly again
Ring shifts to arrive real result.
Based on above-mentioned analysis it is found that the original state according to embodiments of the present invention carries out the code word that LVA decoding obtains, then
Real result can be obtained after carrying out corresponding cyclic shift.If the original state corresponds to the l-th ratio of original information sequence
Spy, i.e. bit dL, L is 0 value into K-1, then needs LVA decoding code word ring shift right L obtained.It is specific and
Speech, when the l-th bit to original information sequence, i.e. bit dL, when being encoded, indicate d0,d1,...,dL-1It is encoded, dL
For next bit into shift register, therefore, the code word corresponding sequence d decoded with the original stateL,
dL+1,...,dK-1,d0,d1,...,dL-1.It will can be corresponded to after code word ring shift right L decoded according to the original state
Original information sequence d0,d1,d2,...,dK-1。
It should be understood that above-mentioned " moving to right " be for original information sequence from left to right sequential, i.e. raw information sequence
List is shown as d0,d1,d2,...,dK-1；If original information sequence is arranged using other sequences, cyclic shift direction is also corresponding
Ground changes.For example, if original information sequence is expressed as dK-1,dK-2,...,d0, then above-mentioned " ring shift right " just becomes " circulation a left side
It moves ".For ease of description, in the various embodiments of the invention, original information sequence is all directed to the statement in cyclic shift direction
From left to right for the sequence of sequential.
It should also be understood that in embodiments of the present invention, ring shift right L can also be transformed to ring shift left K-L.Because following
Ring move to left K-L with ring shift right L be substantially, in other words, ring shift left K-L are ring shift right L
Equivalence transformation.
Finally, code translator determines decoding result according to the code word after cyclic shift.The embodiment of the present invention is in tail biting convolution
The original state of the stateful middle determining decoding of the institute at all moment of code, can accurately find the original state of decoding, have more preferably
Decoding performance.
Therefore, the interpretation method of the embodiment of the present invention, by all moment in tail-biting convolutional code institute it is stateful in really
Determine original state, LVA decoding, and the code word cyclic shift that will be obtained are carried out to tail-biting convolutional code according to the original state, followed
Correctly decoding is determined in code word after ring displacement as a result, original state can more accurately be found, and reduces decoding complexity, thus
It can be improved decoding performance.
In S110, institute stateful middle determining original state of the code translator at all moment of tail-biting convolutional code.
When the sequence length of the original information sequence of tail-biting convolutional code is K, code translator can be 0~K-1 pairs at the moment
The stateful middle determining original state of institute answered.That is, the embodiment of the present invention be not limited to tail-biting convolutional code really just
Determining original state in the state at (or ending) moment that begins, but original state is determined from the state at all moment.
It should be understood that in embodiments of the present invention, original state can have one or more.The original state the case where
Under, code translator carries out LVA decoding according to an original state, and decoding complexity is relatively low in this case.Multiple initial
In the case where state, code translator carries out LVA decoding according to each original state respectively, in this case decoding complexity compared with
It is higher, but the accuracy of original state is some higher.
In embodiments of the present invention, optionally, in the stateful middle determining initial shape of institute at all moment of tail-biting convolutional code
State, comprising:
SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
Stateful middle determination original state of institute as a result, all moment in the tail-biting convolutional code is decoded according to SISO.
In the present embodiment, original state is determined based on soft-output coding (Soft In Soft Out, SISO) algorithm.
SISO algorithm can use maximum a posteriori probability (Maximum A Posteriori, MAP), the maximum a posteriori probability of log-domain
(Log-MAP), Max-Log-MAP(MLM), soft output Viterbi algorithm (Soft Output Viterbi Algorithm,
) etc. SOVA algorithms of different, the present invention do not limit this.
Fig. 6 is the schematic diagram of SISO decoding.By carrying out SISO decoding to tail-biting convolutional code, Soft Inform ation L is obtainedappIt (can also
To be known as decoding soft value) and hard decision information(being referred to as decoding bit or hard decision result).For example,
I=0,1,2 ..., K-1, K are the corresponding message length of the tail-biting convolutional code,For decoder received signal, u
(i) i-th of information bit, i.e. original information sequence d are indicated0,d1,d2,...,dK-1In di,For i-th of hard decision ratio
It is special.
In formula (1)Expression receivesWhen, the probability of u (i)=1,Expression receivesWhen, the probability of u (i)=0.Formula (1) indicates Lapp(i) be u (i) LLR ratio.Lapp(i) > 0 probability, is indicatedGreater than probabilityThereforeJudgement is 1；Lapp(i) < 0 probability, is indicatedLess than probability Judgement is 0；Lapp(i)=0 probability, is indicated
Equal to probability Can adjudicate is 1 or 0, and here it is formula (2).
By taking the tail-biting convolutional code in LTE system as an example.As shown in Fig. 2, the state of the tail-biting convolutional code in LTE system is practical
It is to be determined by the information bit at continuous N moment, M is the shift register number of the encoder of tail-biting convolutional code.For example, comparison
Special dkThe state of k is the information bit (d as corresponding to the M moment before the moment at the time of codingk-M,
dk-M+1,...,dk-1) determine.For the tail-biting convolutional code in LTE system, SISO here decodes result LappWithIt is practical
On be namely input to encoder information bit decoding soft value and its hard decision result.
After SISO is decoded, the decoding soft value L of outputappReception signal usually than inputting is more acurrate, decodes bit
It is usually relatively more accurate.The purpose for doing SISO decoding is to obtain more accurate soft value and more accurately decoding bit.In general, soft
Value LappAbsolute value it is bigger, illustrate its more accurate (its signal-to-noise ratio is higher in other words).
Code translator decodes result according to SISO and determines original state after carrying out SISO decoding to tail-biting convolutional code.It can
Selection of land decodes stateful middle determination original state of institute as a result, all moment in the tail-biting convolutional code, packet according to SISO
It includes:
The Soft Inform ation in result is decoded according to the SISO and determines L, wherein L is the corresponding j of maximum value or ∑ in ∑ (j)
(j) the corresponding j of multiple values in, ∑ (j) indicate the encoder of the tail-biting convolutional code to original information sequence d0,d1,
d2,...,dK-1In djIt is soft in the corresponding SISO decoding result of value when coding in each shift register of the encoder
The sum of absolute value of information, j=0,1,2 ..., K-1；
According to the SISO decode result in hard decision information and L determine the original state.
In the present embodiment, the exhausted of the Soft Inform ation in result is decoded by the corresponding SISO of value in each shift register
Original state is determined to the sum of value.∑ (j) can be expressed as formula,
It indicates to djValue when coding in m-th of shift register of the encoder of tail-biting convolutional code is corresponding
SISO decoding result in Soft Inform ation, wherein m=1,2 ..., M, M are encoder shift register number.For example,
Sj(m) it indicates to djValue when coding in m-th of shift register,For decoder received signal.
By taking the tail-biting convolutional code of LTE system as an example, ∑ (j) can specifically use following formula,
LappIt (i) is diSoft Inform ation in corresponding SISO decoding result, can apply formula (1), and K is the tail biting convolution
The corresponding message length of code, M are the shift register number of the encoder of the tail-biting convolutional code.
In j=0,1,2 ..., K-1 range, the multiple values institute for finding j corresponding to the maximum value of ∑ (j) or ∑ (j) is right
The j answered.The j is the value of the corresponding L of original state to be determined.If only determining an original state, it is determined that ∑ (j) is most
The corresponding j of big value.If desired multiple original states are determined, it is determined that the arrogant and small sequential of the maximum value of ∑ (j)
Corresponding multiple j.It is illustrated, is looked for arrogant and small sequentially by maximum value for only looking for numerical value corresponding to maximum value below
The mode of the corresponding multiple numerical value of arrangement is similar.As the corresponding j of the maximum value that L is ∑ (j),
After L has been determined, further according to the hard decision information in SISO decoding resultOriginal state is determined with L.The initial shape
State corresponds to the l-th bit (d of the original information sequenceL), i.e. the d at the time of original state corresponds to0,d1,...,dL-1It has compiled
Code, that is to say, that be d at the time of the original state corresponds toLThe coding moment.The original state can indicate are as follows:
Wherein,M=1,2 ..., M, for dLAfter SISO when coding corresponding to m-th of shift register is decoded
Hard decision information；Bin () indicates binary form, for example, M=6, binary (0,0,1,1,0,1) is equal to metric
13, i.e. state is 13.
By taking the tail-biting convolutional code of LTE system as an example, the original state are as follows:
For diHard decision information in corresponding SISO decoding result,It can be obtained using formula (2)
It arrives.
It should be understood that in embodiments of the present invention, formula (3) and formula (7) be respectively ∑ (j) withGeneral formula, it is public
Formula (5) and formula (8) be respectively for the tail-biting convolutional code in LTE system, ∑ (j) andSpecific expression
Mode.For the tail-biting convolutional code in other systems, ∑ (j) andSpecific representation can be according to formula
(3) it obtains with formula (7), will not enumerate herein.
In embodiments of the present invention, using formula (7) determining state as original state, specifically, in LTE system
Tail-biting convolutional code, formula (8) can be used.By taking the tail-biting convolutional code in LTE system as an example, according to formula (8), the initial shape
State is after decoding hard decision by SISO
What this continuous N determined.It should be noted that by tail-biting convolutional code it is stateful transfer be (as shown in Figure 5) continuously recycled,
So, using the operation to K modulus, cyclicity is taken into account during state here is found.
In S120, code translator carries out LVA decoding to the tail-biting convolutional code according to the original state and obtains LcA code word.
After original state has been determined, code translator carries out LVA decoding to the tail-biting convolutional code according to the original state, i.e.,
It is start time at the time of the original state is corresponding, LVA decoding is carried out to tail-biting convolutional code, obtains LcA code word.
In S130, code translator is by the LcA code word distinguishes ring shift right L or ring shift left K-L.
In this step, code word obtained in S120 is carried out cyclic shift by code translator, and ring shift right L or circulation are left
Move K-L.L is the position of the bit of the corresponding original information sequence of the original state.When the number of bits of coding is L,
D in original bit sequence0,d1,...,dL-1It is encoded, dLIt is therefore, first with this for next bit into shift register
The code word corresponding sequence d that beginning state decodesL,dL+1,...,dK-1,d0,d1,...,dL-1.It will be decoded according to the original state
Original information sequence d can be corresponded to after obtained code word ring shift right L0,d1,d2,...,dK-1。
It should be understood that is, the original state corresponds to d when L is 00, the bit number of coding is 0, and expression just starts to encode, i.e.,
The corresponding moment 0.For example, the moment 0 corresponds to the original state of tail-biting convolutional code or can be understood as the shift register of encoder
Original state.In this case, the code word decoded is no longer needed for cyclic shift, that is, ring shift right 0.
In S140, code translator obtains decoding result according to the code word after cyclic shift.
The device of decoding selects decoding result in the code word after cyclic shift.For example, (such as by error-checking method
CRC correct code word) is selected.Error checking directly can be carried out to the code word after whole cyclic shifts and select correct code word,
A part of code word can also be first selected from the code word after all cyclic shifts, then error checking is carried out to the code word of selection and is obtained
Correct code word.
Therefore, optionally, in one embodiment of the invention, according to after cyclic shift code word obtain decoding as a result,
Include:
CRC is carried out to the code word after the cyclic shift, determines correctly decoding result.
In the present embodiment, error checking is carried out to the code word after all cyclic shifts, therefrom selects correctly decoding knot
Fruit.
Optionally, in another embodiment of the present invention, decoding is obtained according to the code word after cyclic shift as a result, packet
It includes:
The corresponding maximum code word of path accumulated metric value is selected in the code word after the cyclic shift；
CRC is carried out to the code word of selection, determines correctly decoding result.
In the present embodiment, a part of code word is first selected from the code word after cyclic shift, then the code word of selection is carried out
Correctly decoding result is therefrom selected in error checking.It is alternatively possible to according to the size of the corresponding path accumulated metric value of code word
Code word is selected, for example, selecting the corresponding maximum a part of code word of path accumulated metric value in the code word after cyclic shift.
The interpretation method of the embodiment of the present invention, based on SISO algorithm in the institute at all moment of tail-biting convolutional code is stateful
It determines original state, LVA decoding is carried out to tail-biting convolutional code according to the original state, original state can be more accurately found, drop
Low decoding complexity, so as to improve decoding performance.
It should be understood that in various embodiments of the present invention, magnitude of the sequence numbers of the above procedures are not meant to execute suitable
Sequence it is successive, the execution of each process sequence should be determined by its function and internal logic, the implementation without coping with the embodiment of the present invention
Process constitutes any restriction.
Above in conjunction with Fig. 1 to Fig. 6, interpretation method according to an embodiment of the present invention is described in detail, below in conjunction with Fig. 7
And Fig. 8, code translator according to an embodiment of the present invention is described.
Fig. 7 shows the schematic block diagram of code translator 700 according to an embodiment of the present invention.As shown in fig. 7, the device
700 include:
Determining module 710, for the stateful middle determining original state of institute at all moment in tail-biting convolutional code, this is all
The number at moment is determined that the stateful number is by encoding by the sequence length K of the original information sequence of the tail-biting convolutional code
The shift register number of device determines that the tail-biting convolutional code is encoded via the encoder by the original information sequence and obtained, which is
Positive integer；
LVA decoding module 720 enumerates viterbi algorithm LVA for carrying out according to the original state to the tail-biting convolutional code
Decoding obtains LcA code word, LcFor positive integer, which corresponds to the l-th bit of the original information sequence, and L is integer；
Shift module 730 is used for the LcA code word distinguishes ring shift right L or ring shift left K-L；
Module 740 is obtained, for obtaining decoding result according to the code word after cyclic shift.
In embodiments of the present invention, when decoding to tail-biting convolutional code, determining module 710 exists the device 700 of decoding
The stateful middle determining original state of institute at all moment of tail-biting convolutional code；LVA decoding module 720 is according to the original state to this
Tail-biting convolutional code carries out LVA decoding, i.e., is start time at the time of the original state is corresponding, carries out to tail-biting convolutional code
LVA decoding, obtains LcA code word.By be all moment stateful middle determination original state, the original state pair
It may no longer be 0 at the time of answering.Therefore, shift module 730 is by the LcA code word distinguishes ring shift right L or ring shift left K-L
Position.Decoding result is obtained according to the code word after cyclic shift finally, obtaining module 740.The embodiment of the present invention is in tail-biting convolutional code
All moment the stateful middle determining original state of institute, can accurately find the original state of decoding, there is preferably decoding property
Energy.
Therefore, the code translator of the embodiment of the present invention, by all moment in tail-biting convolutional code institute it is stateful in really
Determine original state, LVA decoding, and the code word cyclic shift that will be obtained are carried out to tail-biting convolutional code according to the original state, followed
Correctly decoding is determined in code word after ring displacement as a result, original state can more accurately be found, and reduces decoding complexity, thus
It can be improved decoding performance.
In embodiments of the present invention, optionally, which is specifically used for:
Soft-output coding SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
Stateful middle determination initial shape of institute as a result, all moment in the tail-biting convolutional code is decoded according to the SISO
State.
In the present embodiment, original state is determined based on SISO algorithm.By carrying out SISO decoding to tail-biting convolutional code, obtain
To Soft Inform ation LappWith hard decision informationFurther according to Soft Inform ation LappWith hard decision informationDetermine original state.
In embodiments of the present invention, optionally, which is specifically used for:
SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
Root according to the SISO decode result in Soft Inform ation determine L, wherein L be ∑ (j) in the corresponding j of maximum value or
The corresponding j of multiple values in ∑ (j), ∑ (j) indicate the encoder of the tail-biting convolutional code to original information sequence d0,d1,
d2,...,dK-1In djIt is soft in the corresponding SISO decoding result of value when coding in each shift register of the encoder
The sum of absolute value of information, j=0,1,2 ..., K-1；
According to the SISO decode result in hard decision information and L determine the original state.
In embodiments of the present invention, optionally,LappIt (i) is the original letter
Cease sequence d0,d1,d2,...,dK-1In diSoft Inform ation in corresponding SISO decoding result, M are that the displacement of the encoder is posted
Storage number, i=0,1,2 ..., K-1；
The original state is
Wherein, bin () indicates binary form, for original information sequence d0,d1,d2,...,dK-1In diIt is corresponding to be somebody's turn to do
SISO decodes the hard decision information in result.
In embodiments of the present invention, optionally, which is specifically used for carrying out the code word after the cyclic shift
Cyclic redundancy check (CRC) determines correctly decoding result.
In the present embodiment, error checking is carried out to the code word after all cyclic shifts, therefrom selects correctly decoding knot
Fruit.
In embodiments of the present invention, optionally, which is specifically used for selecting in the code word after the cyclic shift
The corresponding maximum code word of path accumulated metric value is selected, CRC is carried out to the code word of selection, determines correctly decoding result.
In the present embodiment, a part of code word is first selected from the code word after cyclic shift, then the code word of selection is carried out
Correctly decoding result is therefrom selected in error checking.It is alternatively possible to according to the size of the corresponding path accumulated metric value of code word
A part of code word is selected, for example, selecting corresponding maximum a part of path accumulated metric value in the code word after cyclic shift
Code word.
Code translator 700 according to an embodiment of the present invention can correspond to the execution of interpretation method according to an embodiment of the present invention
Main body, and above and other operation and/or function of the modules in device 700 is respectively in order to realize aforementioned each method
The corresponding process of embodiment, for sake of simplicity, details are not described herein.
The code translator of the embodiment of the present invention, based on SISO algorithm in the institute at all moment of tail-biting convolutional code is stateful
It determines original state, LVA decoding is carried out to tail-biting convolutional code according to the original state, original state can be more accurately found, drop
Low decoding complexity, so as to improve decoding performance.
Fig. 8 shows the structure of the code translator of another embodiment of the present invention offer, including at least one processor 802
(such as CPU), at least one network interface 805 or other communication interfaces, memory 806 and at least one communication bus
803, for realizing the connection communication between these components.Processor 802 is for executing the executable mould stored in memory 806
Block, such as computer program.Memory 806 may include high-speed random access memory (RAM:Random Access
Memory), it is also possible to further include non-labile memory (non-volatile memory), a for example, at least disk is deposited
Reservoir.Can be by least one network interface 805(wired or wireless) it realizes between at least one other network element
Communication connection.
In some embodiments, memory 806 stores program 8061, and processor 802 executes program 8061, for holding
The following operation of row:
In the stateful middle determining original state of institute at all moment of tail-biting convolutional code, the number at all moment is stung by this
The sequence length K of the original information sequence of tail convolutional code determines that the stateful number is a by the shift register of encoder
Number determines that the tail-biting convolutional code is encoded via the encoder by the original information sequence and obtained, which is positive integer；
The tail-biting convolutional code is carried out according to the original state to enumerate viterbi algorithm LVA decoding acquisition LcA code word, LcFor
Positive integer, the original state correspond to the l-th bit of the original information sequence, and L is integer；
By the LcA code word distinguishes ring shift right L or ring shift left K-L；
Decoding result is obtained according to the code word after cyclic shift.
Optionally, processor 802 is specifically used for carrying out soft-output coding SISO decoding to the tail-biting convolutional code to obtain
SISO decoding is as a result, decode result in the stateful middle determination initial shape of institute at all moment of the tail-biting convolutional code according to SISO
State.
Optionally, processor 802 is specifically used for determining L according to the Soft Inform ation in SISO decoding result, wherein L is ∑
(j) the corresponding j of maximum value in or the corresponding j of multiple values in ∑ (j), ∑ (j) indicate that the encoder of the tail-biting convolutional code exists
To original information sequence d0,d1,d2,...,dK-1In djValue when coding in each shift register of the encoder is corresponding
SISO decoding result in the sum of the absolute value of Soft Inform ation, j=0,1,2 ..., K-1 are decoded in result according to the SISO
Hard decision information and L determine the original state.
Optionally,LappIt (i) is original information sequence d0,d1,
d2,...,dK-1In diSoft Inform ation in corresponding SISO decoding result, M are the shift register number of the encoder, i=
0,1,2,...,K-1；
The original state is
Wherein, bin () indicates binary form, for original information sequence d0,d1,d2,...,dK-1In diIt is corresponding to be somebody's turn to do
SISO decodes the hard decision information in result.
Optionally, processor 802 is specifically used for carrying out cyclic redundancy check (CRC) to the code word after the cyclic shift, determines
Correctly decoding result.
Optionally, processor 802 is specifically used for selecting corresponding path accumulated metric in the code word after the cyclic shift
It is worth maximum code word, CRC is carried out to the code word of selection, determines correctly decoding result.
It can be seen that the embodiment of the present invention from above technical scheme provided in an embodiment of the present invention to pass through in tail-biting convolutional code
All moment the stateful middle determining original state of institute, LVA decoding is carried out to tail-biting convolutional code according to the original state, and will
Obtained code word cyclic shift determines correctly decoding in the code word after cyclic shift as a result, can more accurately find initial
State reduces decoding complexity, so as to improve decoding performance.
It should be understood that in embodiments of the present invention, term "and/or" is only a kind of incidence relation for describing affiliated partner,
Indicate may exist three kinds of relationships.For example, A and/or B, can indicate: individualism A exists simultaneously A and B, individualism B this
Three kinds of situations.In addition, character "/" herein, typicallys represent the relationship that forward-backward correlation object is a kind of "or".
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware
With the interchangeability of software, each exemplary composition and step are generally described according to function in the above description.This
A little functions are implemented in hardware or software actually, the specific application and design constraint depending on technical solution.Specially
Industry technical staff can use different methods to achieve the described function each specific application, but this realization is not
It is considered as beyond the scope of this invention.
It is apparent to those skilled in the art that for convenience of description and succinctly, foregoing description is
The specific work process of system, device and unit, can refer to corresponding processes in the foregoing method embodiment, details are not described herein.
In several embodiments provided herein, it should be understood that disclosed systems, devices and methods, it can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.In addition, shown or beg for
Opinion mutual coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING of device or unit
Or communication connection, it is also possible to electricity, mechanical or other form connections.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.Some or all of unit therein can be selected to realize the embodiment of the present invention according to the actual needs
Purpose.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, is also possible to two or more units and is integrated in one unit.It is above-mentioned integrated
Unit both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including some instructions are used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) executes the complete of each embodiment the method for the present invention
Portion or part steps.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey
The medium of sequence code.
The above description is merely a specific embodiment, but scope of protection of the present invention is not limited thereto, any
Those familiar with the art in the technical scope disclosed by the present invention, can readily occur in various equivalent modifications or replace
It changes, these modifications or substitutions should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with right
It is required that protection scope subject to.
Claims (12)
1. a kind of interpretation method characterized by comprising
In the stateful middle determining original state of institute at all moment of tail-biting convolutional code, the number at all moment is stung by described
The sequence length K of the original information sequence of tail convolutional code determines, described the stateful number by encoder shift register
Number determines that the tail-biting convolutional code is encoded via the encoder by the original information sequence and obtained, and the K is positive whole
Number；
The tail-biting convolutional code is carried out according to the original state to enumerate viterbi algorithm LVA decoding acquisition LcA code word, it is described
LcFor positive integer, the original state corresponds to the l-th bit of the original information sequence, and the L is integer；
By the LcA code word distinguishes ring shift right L or ring shift left K-L；
Decoding result is obtained according to the code word after cyclic shift.
2. the method according to claim 1, wherein the institute at all moment in tail-biting convolutional code is stateful
Middle determining original state, comprising:
Soft-output coding SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
The stateful middle determination initial shape of institute as a result, all moment in the tail-biting convolutional code is decoded according to the SISO
State.
3. according to the method described in claim 2, it is characterized in that, described decode according to the SISO as a result, in the tail biting
The stateful middle determination original state of institute at all moment of convolutional code, comprising:
The Soft Inform ation in result is decoded according to the SISO and determines the L, wherein the L is that the maximum value in ∑ (j) is corresponding
The corresponding j of multiple values in j or ∑ (j), ∑ (j) indicate the encoder to the original information sequence d0,d1,d2,...,
dK-1In djThe soft letter in the corresponding SISO decoding result of value when coding in each shift register of the encoder
The sum of absolute value of breath, j=0,1,2 ..., K-1；
According to the SISO decode result in hard decision information and the L determine the original state.
4. according to the method described in claim 3, it is characterized by:
LappIt (i) is the original information sequence d0,d1,d2,...,dK-1In di
Soft Inform ation in corresponding SISO decoding result, M are the shift register number of the encoder, i=0,1,2 ...,
K-1；
The original state is
Wherein, bin () indicates binary form,For the original information sequence d0,d1,d2,...,dK-1In diCorresponding institute
State the hard decision information in SISO decoding result.
5. method according to claim 1 to 4, which is characterized in that the code word according to after cyclic shift
Obtain decoding result, comprising:
Cyclic redundancy check (CRC) is carried out to the code word after the cyclic shift, determines correctly decoding result.
6. method according to claim 1 to 4, which is characterized in that the code word according to after cyclic shift
Obtain decoding result, comprising:
The corresponding maximum code word of path accumulated metric value is selected in the code word after the cyclic shift；
CRC is carried out to the code word of selection, determines correctly decoding result.
7. a kind of code translator characterized by comprising
Determining module, for the stateful middle determining original state of institute at all moment in tail-biting convolutional code, all moment
Number determine that described the stateful number is by encoding by the sequence length K of the original information sequence of the tail-biting convolutional code
The shift register number of device determines that the tail-biting convolutional code is obtained by the original information sequence via encoder coding
It takes, the K is positive integer；
Decoding module is obtained for enumerate viterbi algorithm LVA decoding to the tail-biting convolutional code according to the original state
Take LcA code word, the LcFor positive integer, the original state corresponds to the l-th bit of the original information sequence, and the L is
Integer；
Shift module is used for the LcA code word distinguishes ring shift right L or ring shift left K-L；
Module is obtained, for obtaining decoding result according to the code word after cyclic shift.
8. device according to claim 7, which is characterized in that the determining module is specifically used for:
Soft-output coding SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
The stateful middle determination initial shape of institute as a result, all moment in the tail-biting convolutional code is decoded according to the SISO
State.
9. device according to claim 8, which is characterized in that the determining module is specifically used for:
SISO decoding is carried out to the tail-biting convolutional code to obtain SISO decoding result；
The Soft Inform ation in result is decoded according to the SISO and determines the L, wherein the L is that the maximum value in ∑ (j) is corresponding
The corresponding j of multiple values in j or ∑ (j), ∑ (j) indicate the encoder to the original information sequence d0,d1,d2,...,
dK-1In djThe soft letter in the corresponding SISO decoding result of value when coding in each shift register of the encoder
The sum of absolute value of breath, j=0,1,2 ..., K-1；
According to the SISO decode result in hard decision information and the L determine the original state.
10. device according to claim 9, it is characterised in that:
LappIt (i) is the original information sequence d0,d1,d2,...,dK-1In di
Soft Inform ation in corresponding SISO decoding result, M are the shift register number of the encoder, i=0,1,2 ...,
K-1；
The original state is
Wherein, bin () indicates binary form,For the original information sequence d0,d1,d2,...,dK-1In diCorresponding institute
State the hard decision information in SISO decoding result.
11. device according to any one of claims 7 to 10, which is characterized in that the acquisition module is specifically used for:
Cyclic redundancy check (CRC) is carried out to the code word after the cyclic shift, determines correctly decoding result.
12. device according to any one of claims 7 to 10, which is characterized in that the acquisition module is specifically used for:
The corresponding maximum code word of path accumulated metric value is selected in the code word after the cyclic shift；
CRC is carried out to the code word of selection, determines correctly decoding result.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410028585.8A CN104796160B (en) | 2014-01-22 | 2014-01-22 | Interpretation method and device |
| PCT/CN2014/080310 WO2015109741A1 (en) | 2014-01-22 | 2014-06-19 | Decoding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410028585.8A CN104796160B (en) | 2014-01-22 | 2014-01-22 | Interpretation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104796160A CN104796160A (en) | 2015-07-22 |
| CN104796160B true CN104796160B (en) | 2019-04-12 |
Family
ID=53560712
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410028585.8A Active CN104796160B (en) | 2014-01-22 | 2014-01-22 | Interpretation method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN104796160B (en) |
| WO (1) | WO2015109741A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108028667A (en) * | 2015-09-24 | 2018-05-11 | 华为技术有限公司 | Tail-biting convolutional code with very short block |
| CN106301391B (en) * | 2016-08-08 | 2019-07-16 | 西安电子科技大学 | A kind of improved soft output tail-biting convolutional code interpretation method |
| CN107872232B (en) * | 2017-08-11 | 2019-10-22 | 东莞理工学院 | Novel convolutional code maximum likelihood decoding algorithm of closing behind |
| CN110278055B (en) * | 2019-06-03 | 2021-11-23 | 京信网络系统股份有限公司 | Tail-biting convolutional coding processing method and device and communication equipment |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6199186B1 (en) * | 1998-04-03 | 2001-03-06 | Lucent Technologies Inc. | Screening for undetected errors in data transmission systems |
| CN101867379A (en) * | 2010-06-24 | 2010-10-20 | 东南大学 | Cyclic redundancy check-assisted convolutional code decoding method |
| CN102142848A (en) * | 2010-01-28 | 2011-08-03 | 中兴通讯股份有限公司 | Decoding method and decoder of tail-biting convolutional code |
| WO2011144112A2 (en) * | 2011-05-27 | 2011-11-24 | 华为技术有限公司 | Speech signal processing method and device, and access network system |
| CN102291198A (en) * | 2010-06-18 | 2011-12-21 | 中兴通讯股份有限公司 | channel decoding method and device |
| WO2012013211A1 (en) * | 2010-07-30 | 2012-02-02 | Telefonaktiebolaget L M Ericsson (Publ) | Decoding technique for tail-biting codes |
| CN102377438A (en) * | 2010-08-11 | 2012-03-14 | 中兴通讯股份有限公司 | Channel decoding method and tail biting convolutional decoder |
| CN102624404A (en) * | 2011-01-31 | 2012-08-01 | 中兴通讯股份有限公司 | Tail-biting convolutional code decoding checking method and apparatus thereof |
| CN102891690A (en) * | 2011-07-19 | 2013-01-23 | 上海无线通信研究中心 | Tail-biting convolution code decoding method |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100544213C (en) * | 2005-04-25 | 2009-09-23 | 中兴通讯股份有限公司 | A kind of interpretation method of tail-biting convolutional code and decoder thereof |
| US8548102B2 (en) * | 2010-05-12 | 2013-10-01 | Qualcomm Incorporated | Tail-biting convolutional decoding |
| CN102857242B (en) * | 2011-06-28 | 2016-03-02 | 联芯科技有限公司 | Tail-biting convolutional code interpretation method and device |
-
2014
- 2014-01-22 CN CN201410028585.8A patent/CN104796160B/en active Active
- 2014-06-19 WO PCT/CN2014/080310 patent/WO2015109741A1/en active Application Filing
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6199186B1 (en) * | 1998-04-03 | 2001-03-06 | Lucent Technologies Inc. | Screening for undetected errors in data transmission systems |
| CN102142848A (en) * | 2010-01-28 | 2011-08-03 | 中兴通讯股份有限公司 | Decoding method and decoder of tail-biting convolutional code |
| CN102291198A (en) * | 2010-06-18 | 2011-12-21 | 中兴通讯股份有限公司 | channel decoding method and device |
| CN101867379A (en) * | 2010-06-24 | 2010-10-20 | 东南大学 | Cyclic redundancy check-assisted convolutional code decoding method |
| WO2012013211A1 (en) * | 2010-07-30 | 2012-02-02 | Telefonaktiebolaget L M Ericsson (Publ) | Decoding technique for tail-biting codes |
| CN102377438A (en) * | 2010-08-11 | 2012-03-14 | 中兴通讯股份有限公司 | Channel decoding method and tail biting convolutional decoder |
| CN102624404A (en) * | 2011-01-31 | 2012-08-01 | 中兴通讯股份有限公司 | Tail-biting convolutional code decoding checking method and apparatus thereof |
| WO2011144112A2 (en) * | 2011-05-27 | 2011-11-24 | 华为技术有限公司 | Speech signal processing method and device, and access network system |
| CN102891690A (en) * | 2011-07-19 | 2013-01-23 | 上海无线通信研究中心 | Tail-biting convolution code decoding method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104796160A (en) | 2015-07-22 |
| WO2015109741A1 (en) | 2015-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11689220B2 (en) | Method and device for interleaving data | |
| CN104124979B (en) | The interpretation method and code translator of polar code | |
| CN110113132B (en) | Coding and decoding method and terminal | |
| CN103368583B (en) | The interpretation method of polar code and code translator | |
| EP3562071B1 (en) | Polar code encoding and decoding method and device | |
| CN107342843A (en) | Speed matching method, code device and communicator | |
| CN108574561B (en) | Method and device for coding polarization code | |
| CN104796160B (en) | Interpretation method and device | |
| CN101635611B (en) | Channel decoding method and channel decoding device | |
| EP3614701A1 (en) | Polar code transmission method and device | |
| CN110326221A (en) | A method of for generating ordered sequence for polarization code | |
| CN109547034B (en) | Decoding method and device, decoder | |
| CN109257140B (en) | Polarized channel reliability sequencing method, polarized code encoding method and polarized code encoding device | |
| CN103117753A (en) | Tail-biting convolutional decoding apparatus and decoding method | |
| CN110326342A (en) | A kind of device and method of the ordered sequence for prescribed coding subchannel | |
| CN1756138A (en) | Decoding apparatus and decoding method | |
| CN110247730A (en) | Blind checking method and equipment based on polarization code | |
| CN1401177A (en) | Receiver | |
| KR102547476B1 (en) | Method for controlling decoding process based on path metric value and computing apparatus and mobile device for controlling the same | |
| CN110391817A (en) | The interpretation method and device of polarization code | |
| CN110391874B (en) | Rate matching and rate de-matching method and device for polar code | |
| CN103856218B (en) | Decoding process method and decoder | |
| CN110324111B (en) | Decoding method and device | |
| JP2013078092A (en) | Iterative decoding method for encoded signal and iterative decoding apparatus for encoded signal | |
| CN108880565B (en) | Coding and decoding method of polarization code and communication equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |