CN104796160B - Interpretation method and device - Google Patents

Interpretation method and device Download PDF

Info

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
decoding
decoding result
biting convolutional
initial state
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
Application number
CN201410028585.8A
Other languages
Chinese (zh)
Other versions
CN104796160A (en
Inventor
费德林·谢尔盖
特雷菲洛夫·米哈伊尔
魏岳军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201410028585.8A priority Critical patent/CN104796160B/en
Priority to PCT/CN2014/080310 priority patent/WO2015109741A1/en
Publication of CN104796160A publication Critical patent/CN104796160A/en
Application granted granted Critical
Publication of CN104796160B publication Critical patent/CN104796160B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Decoding method and device
Technical Field
The present invention relates to the field of communications, and more particularly, to a decoding method and apparatus.
Background
From the viewpoint of whether tail bits are added before the information sequence is encoded, the methods for encoding the information sequence to obtain the convolutional code can be divided into two types: return to zero convolutional codes and tail-biting convolutional codes.
The return-to-zero convolutional code adds a certain number of known bits (for example, the value of the known bits is zero) behind the information sequence, so that the value of the information bits in the shift register of the return-to-zero convolutional code encoder is returned to zero after the information sequence is encoded, and it can also be considered that the initial state and the ending state of the return-to-zero convolutional code encoder are both zero states after the return-to-zero convolutional code encoder is encoded. Return-to-zero convolutional codes are widely used in Universal Mobile Telecommunications Systems (UMTS).
The tail-biting convolutional code is a coding mode without adding tail bits behind an information sequence, and the coding mode firstly fills the last M bits of the information sequence into a shift register of a tail-biting convolutional code coder in sequence and then codes, so that the initial state and the tail state of the tail-biting convolutional code coder are ensured to be the same. The value of M corresponds to the number of registers of the tail-biting convolutional code encoder. Because tail bits are not added, the extra transmission overhead and the loss of code rate caused by the tail bits are avoided, and therefore, when the code length is shorter, the performance is better than that of the return-to-zero convolutional code with the tail bits. Tail-biting convolutional codes are widely used in Long Term Evolution (LTE), Worldwide Interoperability for microwave Access (WiMAX), and other communication systems.
The two convolutional codes generally use coding or decoding methods based on the Viterbi (Viterbi) algorithm, which is an algorithm based on the maximum likelihood criterion. Listing Viterbi Algorithm (List Viterbi Algorithm, LVA) is an enhanced Viterbi Algorithm, that is, l global preferred paths and corresponding decoding information sequences are obtained by the Viterbi Algorithm, and then correct decoding information sequences are obtained by an error checking method, such as Cyclic Redundancy Check (CRC). When l =1, the LVA algorithm is equivalent to the Viterbi algorithm. Since the LVA selects a plurality of global preferred paths, its decoding performance is better than that of the Viterbi algorithm.
For the return-to-zero convolutional code, since the initial state and the end state of the encoder are zero states, in the LVA decoding process, decoding can be forced to start from the zero state no matter decoding based on constructing a grid graph (calculating a path metric value) or decoding based on backtracking. For tail-biting convolutional codes, since the initial state and the end state of the encoder are unknown (only the two are known to be the same), the decoding performance is greatly affected.
Disclosure of Invention
The embodiment of the invention provides a decoding method and a decoding device, which can improve decoding performance.
In a first aspect, a decoding method is provided, including:
determining initial states in all states of all moments of a tail-biting convolutional code, wherein the number of all the moments is determined by the sequence length K of an original information sequence of the tail-biting convolutional code, the number of all the states is determined by the number of shift registers of an encoder, the tail-biting convolutional code is obtained by encoding the original information sequence through the encoder, and K is a positive integer;
performing LVA decoding on the tail-biting convolutional code according to the initial state to obtain LcIndividual code word, LcIs a positive integer, the initial state corresponds to the Lth of the original information sequenceBits, L is an integer;
subjecting the L tocEach code word is circularly shifted to the right by L bits or circularly shifted to the left by K-L bits;
and obtaining a decoding result according to the code word after the cyclic shift.
In a first possible implementation, determining an initial state in all states at all time instants of the tail-biting convolutional code includes:
carrying out soft-input soft-output SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
and determining the initial state in all states of all moments of the tail-biting convolutional code according to the SISO decoding result.
With reference to the first possible implementation manner of the first aspect, in a second possible implementation manner, determining the initial state in all states at all times of the tail-biting convolutional code according to a SISO decoding result includes:
determining L according to the soft information in the SISO decoding result, wherein L is j corresponding to the maximum value in sigma (j) or j corresponding to a plurality of values in sigma (j), and sigma (j) represents that the encoder of the tail-biting convolution code is in the process of decoding the original information sequence d0,d1,d2,...,dK-1D in (1)jJ =0,1,2,. and K-1, which is the sum of absolute values of soft information in the SISO decoding result corresponding to the value in each shift register of the encoder during encoding;
and determining the initial state according to the hard decision information and L in the SISO decoding result.
With reference to the second possible implementation manner of the first aspect, in a third possible implementation manner,for the original information sequence d0,d1,d2,...,dK-1D in (1)iCorresponding to the soft information in the SISO decoding result, M is the codeThe number of shift registers of the device, i =0,1,2,. and K-1;
the initial state isWherein bin () represents a binary form, which is the original information sequence d0,d1,d2,...,dK-1D in (1)iCorrespond toHard decision information in the SISO decoding result.
With reference to the first aspect or any one of the first to third possible implementation manners of the first aspect, in a fourth possible implementation manner, obtaining a decoding result according to a code word after cyclic shift includes:
and performing Cyclic Redundancy Check (CRC) on the code word subjected to cyclic shift to determine a correct decoding result.
With reference to the first aspect or any one of the first to the third possible implementation manners of the first aspect, in a fifth possible implementation manner, obtaining a decoding result according to a code word after cyclic shift includes:
selecting a code word with the maximum corresponding path accumulated metric value from the code words after the cyclic shift;
and performing CRC on the selected code word to determine a correct decoding result.
In a second aspect, a decoding apparatus is provided, including:
a determining module, configured to determine an initial state in all states at all times of a tail-biting convolutional code, where the number of all times is determined by a sequence length K of an original information sequence of the tail-biting convolutional code, the number of all states is determined by the number of shift registers of an encoder, the tail-biting convolutional code is obtained by encoding the original information sequence by the encoder, and K is a positive integer;
an LVA decoding module for performing enumeration Viterbi on the tail-biting convolutional code according to the initial stateRatio algorithm LVA decoding obtaining LcIndividual code word, LcIs a positive integer, the initial state corresponds to the L-th bit of the original information sequence, and L is an integer;
a shift module for shifting the LcEach code word is circularly shifted to the right by L bits or circularly shifted to the left by K-L bits;
and the obtaining module is used for obtaining a decoding result according to the code word after the cyclic shift.
In a first possible implementation manner, the determining module is specifically configured to:
carrying out soft-input soft-output SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
and determining the initial state in all states of all moments of the tail-biting convolutional code according to the SISO decoding result.
With reference to the second aspect or the first possible implementation manner of the second aspect, in a second possible implementation manner, the determining module is specifically configured to:
carrying out soft-input soft-output SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
determining L according to the soft information in the SISO decoding result, wherein L is j corresponding to the maximum value in sigma (j) or j corresponding to a plurality of values in sigma (j), and sigma (j) represents that the encoder of the tail-biting convolution code is applied to the original information sequence d0,d1,d2,...,dK-1D in (1)jJ =0,1,2,. and K-1, which is the sum of absolute values of soft information in the SISO decoding result corresponding to the value in each shift register of the encoder during encoding;
and determining the initial state according to the hard decision information and L in the SISO decoding result.
With reference to the second possible implementation manner of the second aspect, in a third possible implementation manner,Lapp(i) for the original information sequence d0,d1,d2,...,dK-1D in (1)iCorresponding soft information in the SISO decoding result, wherein M is the number of shift registers of the encoder, and i =0,1, 2.
The initial state isWherein bin () represents a binary form, which is the original information sequence d0,d1,d2,...,dK-1D in (1)iCorrespond toHard decision information in the SISO decoding result.
With reference to the second aspect or any one possible implementation manner of the first to the third possible implementation manners of the second aspect, in a fourth possible implementation manner, the obtaining module is specifically configured to perform cyclic redundancy check CRC on the code word after the cyclic shift, and determine a correct decoding result.
With reference to the second aspect or any one of the first to the third possible implementation manners of the second aspect, in a fifth possible implementation manner, the obtaining module is specifically configured to select, from the code words after the cyclic shift, a code word with a largest path cumulative metric value, perform CRC on the selected code word, and determine a correct decoding result.
Based on the technical scheme, the decoding method and the decoding device in the embodiment of the invention can determine the initial state in all the states of the tail-biting convolutional code at all the moments, perform LVA decoding on the tail-biting convolutional code according to the initial state, circularly shift the obtained code word, and determine the correct decoding result in the code word after circular shift, so that the initial state can be found more accurately, the decoding complexity is reduced, and the decoding performance can be improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments of the present invention will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a schematic flow diagram of a decoding method according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of encoding tail-biting convolutional codes in an LTE system.
Fig. 3 is a schematic diagram of a trellis diagram of a convolutional code.
Fig. 4 is a schematic diagram of the state of a convolutional code.
Fig. 5 is a schematic diagram of the state transition of tail-biting convolutional codes in head-to-tail succession.
Fig. 6 is a schematic diagram of SISO decoding.
FIG. 7 is a schematic block diagram of a coding device according to an embodiment of the present disclosure.
FIG. 8 is a block diagram of a decoding apparatus according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be understood that the technical solutions of the embodiments of the present invention can be applied to various communication systems, for example: a Global System for Mobile communications (GSM) System, a Code Division Multiple Access (CDMA) System, a Wideband Code Division Multiple Access (WCDMA) System, a General Packet Radio Service (GPRS), a Long Term Evolution (Long Term Evolution, LTE) System, an LTE Frequency Division Duplex (FDD) System, an LTE Time Division Duplex (TDD), a Universal Mobile Telecommunications System (UMTS), a Worldwide Interoperability for Microwave Access (WiMAX) communication System, and the like.
The decoding apparatus of the embodiment of the present invention may be a User Equipment (UE) or a base station, or may be located in the UE or the base station. For example, the decoding method in the embodiment of the present invention may be executed by the UE or the base station, or may be executed by a processor located in the UE or the base station.
User Equipment (UE), which may be referred to as a Terminal (Terminal), a Mobile Station (MS), a Mobile Terminal (Mobile Terminal), etc., may communicate with one or more core networks via a Radio Access Network (RAN), such as a Mobile phone (or referred to as a "cellular phone"), a computer with a Mobile Terminal, etc., and may also be a portable, pocket, hand-held, computer-included, or vehicle-mounted Mobile device that exchanges voice and/or data with the RAN.
The Base Station may be a Base Transceiver Station (BTS) in GSM or CDMA, a Base Station (NodeB, NB) in WCDMA, or an evolved Node B (ENB or e-NodeB) in LTE, and the present invention is not limited thereto.
Fig. 1 shows a schematic flow diagram of a decoding method 100 according to an embodiment of the invention. The method of fig. 1 is performed by a decoding device. As shown in fig. 1, the method 100 includes:
s110, determining initial states in all states of all moments of a tail-biting convolutional code, wherein the number of all the moments is determined by the sequence length K of an original information sequence of the tail-biting convolutional code, the number of all the states is determined by the number of shift registers of an encoder, the tail-biting convolutional code is obtained by encoding the original information sequence through the encoder, and K is a positive integer;
s120, according to the initial state, performing LVA decoding on the tail-biting convolutional code to obtain LcIndividual code word, LcIs a positive integer, the initial state corresponds to the L-th bit of the original information sequence, and L is an integer;
s130, mixing the LcEach code word is circularly shifted to the right by L bits or circularly shifted to the left by K-L bits;
and S140, acquiring a decoding result according to the code word after the cyclic shift.
In the embodiment of the present invention, the state of the tail-biting convolutional code can be understood as the state of the shift register of the encoder when the original information sequence of the tail-biting convolutional code is encoded. In other words, the state of the tail-biting convolutional code can be determined by the information bits in the shift register. For example, if there are M shift registers, there are 2 corresponding to the M shift registersMThe state of tail-biting convolutional codes. Fig. 2 is a schematic diagram of encoding tail-biting convolutional codes in an LTE system. Taking the tail-biting convolutional code shown in fig. 2 as an example, when an original information sequence is encoded, every time an information bit is input to a shift register, the information bit sequence in the shift register changes, and correspondingly, the state of the shift register changes once. Thus, for an original information sequence of length K (denoted d)0,d1,d2,...,dK-1K is a positive integer), there will be K state transitions, a total of K +1 states before and after the K state transitions. Each of the K +1 states may correspond to a time point, which may be referred to as a time point of tail biting convolutional codes, because the time points of generation are different. The first K states respectively correspond to the corresponding bit d0,d1,d2,...,dK-1The time when the encoding is performed sequentially can also be expressed asThe K states respectively correspond to the corresponding bit d0,d1,d2,...,dK-1. The last state is a bit dK-1A state after encoding, which is the same as the first state. In an embodiment of the present invention, bits d are represented by times 0,1,20,d1,d2,...,dK-1The encoding time instant of (2). For example, time 0 is bit d0Time K-1 is a bit dK-1The encoding time instant of (2).
In the embodiment of the present invention, when decoding the tail-biting convolutional code, the decoding device determines the decoding initial state among all possible states corresponding to all times of the tail-biting convolutional code. That is, in the embodiment of the present invention, the initial state is not only the initial state of the encoder, but may be a state corresponding to any time, i.e., time 0 to time K-1. And the decoding device performs LVA decoding on the tail-biting convolutional code according to the initial state.
The reason why the LVA decoding can be performed using the state corresponding to any time as the initial state is that the uniform decoding result can be obtained by performing the viterbi decoding or the LVA decoding using any time as the initial time, which will be described in detail below.
As mentioned above, the (coding) decoding process of tail-biting convolutional codes is actually a state transition process of an original information sequence, and can be represented by a state transition diagram. FIG. 3 is an example of a grid map. A total of 8 states (states 0-7) are shown in FIG. 3, showing 7 times (0-6). For the LVA algorithm of tail-biting convolutional codes, how to accurately find the initial state is crucial to the decoding performance. Fig. 4 shows a state transition diagram corresponding to tail-biting convolutional codes of K information lengths. Due to the "tail-biting" nature, the state transitions of tail-biting convolutional codes are cyclic in nature. For example, it may be represented in the form of fig. 5. As shown in fig. 5, in the state transition of the trellis diagram, the state corresponding to any time point from 0 to K-1 actually starts, and after K times of state transitions, the state corresponding to the time point still returns. That is, the viterbi decoding or the LVA decoding is performed using an arbitrary time as an initial time, and a uniform decoding result can be obtained. The decoding result differs from the decoding result with the true 0 time as the initial time by only one cyclic shift. And performing corresponding cyclic shift on the decoding result to obtain a real result.
Based on the above analysis, it can be known that the codeword obtained by performing LVA decoding according to the initial state in the embodiment of the present invention can obtain a true result after performing corresponding cyclic shift. If the initial state corresponds to the L-th bit of the original information sequence, i.e. bit dLAnd L is one of 0 to K-1, the codeword obtained by LVA decoding needs to be circularly right-shifted by L bits. Specifically, when the L-th bit of the original information sequence, i.e. bit d, is selectedLWhen encoding, represents d0,d1,...,dL-1Coded, dLFor the next bit entering the shift register, and thus the codeword corresponding sequence d obtained by decoding in the initial stateL,dL+1,...,dK-1,d0,d1,...,dL-1. The code word obtained by decoding according to the initial state is circularly right-shifted by L bits to correspond to the original information sequence d0,d1,d2,...,dK-1。
It should be understood that the above "right shift" is for the original information sequence arranged sequentially from left to right, i.e. the original information sequence is denoted d0,d1,d2,...,dK-1(ii) a If the original information sequence is arranged in other orders, the direction of the cyclic shift is changed accordingly. For example, if the original information sequence is denoted dK-1,dK-2,...,d0Then the "loop right shift" is changed to "loop left shift". For convenience of description, in the embodiments of the present invention, the expression of the cyclic shift direction refers to the order of the original information sequence from left to right.
It should also be understood that in embodiments of the present invention, a circular right shift by L bits may also be transformed into a circular left shift by K-L bits. Since shifting the K-L bits left in the loop is essentially the same as shifting the L bits right in the loop, in other words, shifting the K-L bits left in the loop is an equivalent transformation of shifting the L bits right in the loop.
And finally, the decoding device determines a decoding result according to the code word after the cyclic shift. The embodiment of the invention determines the initial state of decoding in all states at all times of tail-biting convolutional codes, can accurately find the initial state of decoding, and has better decoding performance.
Therefore, the decoding method of the embodiment of the present invention determines the initial state in all states of the tail-biting convolutional code at all times, performs LVA decoding on the tail-biting convolutional code according to the initial state, circularly shifts the obtained codeword, and determines a correct decoding result in the circularly shifted codeword, so that the initial state can be found more accurately, the decoding complexity is reduced, and the decoding performance can be improved.
In S110, the decoding apparatus determines an initial state among all states at all times of the tail-biting convolutional code.
When the sequence length of the original information sequence of the tail-biting convolutional code is K, the decoding device can determine the initial state in all states corresponding to the time 0 to the time K-1. That is, embodiments of the present invention are not limited to determining the initial state from the states at the true initial (or end) time of the tail-biting convolutional code, but determine the initial state from the states at all times.
It should be understood that in embodiments of the present invention, there may be one or more of the initial states. In the case of an initial state, the decoding device performs LVA decoding according to the initial state, in which case the decoding complexity is relatively low. In the case of a plurality of initial states, the decoding device performs LVA decoding according to each initial state, in which case the decoding complexity is higher, but the accuracy of the initial state is higher.
In this embodiment of the present invention, optionally, determining the initial state in all states at all times of the tail-biting convolutional code includes:
carrying out SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
and determining the initial state in all states of all moments of the tail-biting convolutional code according to the SISO decoding result.
In this embodiment, the initial state is determined based on a Soft In Soft Out (SISO) algorithm. The SISO Algorithm may use different algorithms such as Maximum A Posteriori (MAP), Log-domain Maximum a Posteriori (Log-MAP), Max-Log-MAP (mlm), Soft Output Viterbi Algorithm (SOVA), and the like, which is not limited in the present invention.
Fig. 6 is a diagram illustrating SISO decoding. Obtaining soft information L by SISO decoding of tail-biting convolutional codesapp(also called decoding soft values) and hard decision information(which may also be referred to as decoded bits or hard decision results). For example,
i =0,1,2,. and K-1, where K is the information length corresponding to the tail-biting convolutional code,for signals received by the decoder, u (i) represents the i-th information bit, i.e. the original information sequence d0,d1,d2,...,dK-1D in (1)i，Is the ith hard decisionA bit.
In the formula (1)Indicates receipt ofA probability of u (i) =1,indicates receipt ofProbability of u (i) = 0. Formula (1) represents Lapp(i) Is the log-likelihood ratio of u (i). L isapp(i)>0, representing a probabilityGreater than probabilityThus, it is possible to provideThe judgment is 1; l isapp(i)<0, representing a probabilityLess than probability The judgment is 0; l isapp(i) =0, representing probabilityEqual to probability A decision can be made as 1 or 0, which is equation (2).
Take tail-biting convolutional codes in LTE systems as an example. As shown in fig. 2, the state of tail-biting convolutional codes in the LTE system is actually determined by M consecutive time information bits, where M is the number of shift registers of the encoder of the tail-biting convolutional codes. For example, for bit dkThe state of the time k at which the encoding is performed is the information bit (d) corresponding to M times before the time kk-M,dk-M+1,...,dk-1) And (6) determining. For tail-biting convolutional codes in LTE system, here SISO decoding result LappAndi.e., in effect, the decoded soft values of the information bits input to the encoder and their hard decision results.
After SISO decoding, the output decoding soft value LappAnd is typically more accurate than the incoming received signal, and the decoded bits are also typically more accurate. The purpose of SISO decoding is to obtain more accurate soft values and more accurate decoded bits. In general, the soft value LappThe larger the absolute value of (c) indicates that it is more accurate (or that its signal-to-noise ratio is higher).
The decoding device determines the initial state according to the SISO decoding result after SISO decoding is carried out on the tail-biting convolutional code. Optionally, determining the initial state in all states at all times of the tail-biting convolutional code according to the SISO decoding result includes:
determining L according to the soft information in the SISO decoding result, wherein L is j corresponding to the maximum value in sigma (j) or j corresponding to a plurality of values in sigma (j), and sigma (j) represents that the encoder of the tail-biting convolution code is in the process of decoding the original information sequence d0,d1,d2,...,dK-1D in (1)jJ =0,1,2,. and K-1, which is the sum of absolute values of soft information in the SISO decoding result corresponding to the value in each shift register of the encoder during encoding;
and determining the initial state according to the hard decision information and L in the SISO decoding result.
In the present embodiment, the initial state is determined by the sum of the absolute values of the soft information in the SISO decoding result corresponding to the value in each shift register. Σ (j) can be expressed as the following formula,
represents a pair djAnd soft information in the SISO decoding result corresponding to the value in the mth shift register of the encoder of the tail-biting convolutional code during encoding, wherein M =1, 2. For example,
Sj(m) represents a pair djThe value in the mth shift register at the time of encoding,is the signal received by the decoder.
Taking tail-biting convolutional codes of the LTE system as an example, the following formula can be specifically adopted for Σ (j),
Lapp(i) is diThe corresponding soft information in SISO decoding result can be obtained by applying formula (1), where K is the information length corresponding to the tail-biting convolutional code, and M is the shift of the encoder of the tail-biting convolutional codeThe number of registers.
In the range of j =0,1, 2.,. K-1, j corresponding to the maximum value of Σ (j) or j corresponding to a plurality of values of Σ (j) is found. The value of L corresponding to the initial state to be determined is j. If only one initial state is determined, j corresponding to the maximum value of sigma (j) is determined. And if a plurality of initial states need to be determined, determining a plurality of j corresponding to the maximum value of sigma (j) arranged in sequence from the maximum value. In the following, the following description will be given by taking an example of finding only the numerical value corresponding to the maximum value, and the manner of finding the plurality of numerical values corresponding to the maximum value arranged in order from the maximum value to the minimum value is similar to this. When L is j corresponding to the maximum value of Σ (j),
after determining L, based on hard decision information in SISO decoding resultAnd L determines the initial state. The initial state corresponds to the L-th bit (d) of the original information sequenceL) I.e. at the time d corresponding to the initial state0,d1,...,dL-1Coded, i.e. the initial state corresponds to a time dLThe encoding time instant of (2). This initial state may be expressed as:
wherein,m =1,2,. multidot.m, is pair dLHard decision information after SISO decoding corresponding to the mth shift register during encoding; bin () represents a binary form, e.g., M =6, with binary (0,0,1,1,0,1) equal to 13 decimal, i.e., state 13.
Taking tail-biting convolutional codes of the LTE system as an example, the initial state is:
is diThe hard decision information in the corresponding SISO decoding result,can be obtained by applying the formula (2)And (4) obtaining.
It should be understood that, in the embodiment of the present invention, the formula (3) and the formula (7) are Σ (j) and Σ (j), respectivelyEquation (5) and equation (8) are respectively Σ (j) andthe specific expression of (1). For tail-biting convolutional codes in other systems, sum (j)The specific expression of (a) can be obtained according to the formula (3) and the formula (7), and is not listed here.
In the embodiment of the present invention, the state determined by formula (7) is used as the initial state, specifically, for the LTE systemThe tail-biting convolutional code of (1) can be expressed by equation (8). Taking tail-biting convolutional codes in LTE systems as an example, the initial shape is according to equation (8)The state being after hard decision by SISO decodingThese are M consecutive determinations. It should be noted that since all state transitions of tail-biting convolutional codes are continuously cyclic (as shown in figure 5),therefore, in the state searching process, the operation of taking the modulus of K is adopted, andcyclicity is taken into account.
In S120, the decoding device performs LVA decoding on the tail-biting convolutional code according to the initial state to obtain LcA code word.
After the initial state is determined, the decoding device performs LVA decoding on the tail-biting convolutional code according to the initial state, namely, the time corresponding to the initial state is the starting time, and performs LVA decoding on the tail-biting convolutional code to obtain LcA code word.
In S130, the decoding apparatus decodes the LcThe code words are circularly shifted to the right by L bits or circularly shifted to the left by K-L bits.
In this step, the decoding apparatus cyclically shifts the codeword obtained in S120 by L bits cyclically shifted to the right or by K-L bits cyclically shifted to the left. L is the position of the bit of the original information sequence corresponding to the initial state. D in the original bit sequence when the number of coded bits is L0,d1,...,dL-1Coded, dLFor the next bit entering the shift register, and thus the codeword corresponding sequence d obtained by decoding in the initial stateL,dL+1,...,dK-1,d0,d1,...,dL-1. The code word obtained by decoding according to the initial state is circularly right-shifted by L bits to correspond to the original information sequence d0,d1,d2,...,dK-1。
It should be understood that when L is 0, i.e., the initial state corresponds to d0The number of coded bits is 0, indicating that coding is started, i.e., corresponding to time 0. For example, the time 0 corresponds to the initial state of the tail-biting convolutional code or can be understood as the initial state of the shift register of the encoder. In this case, the code word obtained by decoding does not need to be circularly shifted, i.e. circularly shifted by 0 bit to the right.
In S140, the decoding apparatus obtains a decoding result according to the code word after the cyclic shift.
The decoding device selects the decoding result in the code word after the cyclic shift. The correct codeword is selected, for example, by an error checking method (e.g., CRC). The error check can be directly performed on all code words subjected to cyclic shift to select the correct code word, or a part of code words can be selected from all code words subjected to cyclic shift first, and then the error check is performed on the selected code word to obtain the correct code word.
Therefore, optionally, in an embodiment of the present invention, obtaining a decoding result according to the code word after the cyclic shift includes:
and performing CRC on the code word after the cyclic shift to determine a correct decoding result.
In this embodiment, all code words after cyclic shift are error-checked, and the correct decoding result is selected from the error-checked code words.
Optionally, in another embodiment of the present invention, obtaining a decoding result according to the code word after the cyclic shift includes:
selecting a code word with the maximum corresponding path accumulated metric value from the code words after the cyclic shift;
and performing CRC on the selected code word to determine a correct decoding result.
In this embodiment, a part of code words is selected from the code words after cyclic shift, and then the selected code words are subjected to error check, so as to select a correct decoding result. Alternatively, the code word may be selected according to the size of the path accumulated metric value corresponding to the code word, for example, a part of the code word with the largest corresponding path accumulated metric value is selected from the code words after cyclic shift.
The decoding method of the embodiment of the invention determines the initial state in all the states of the tail-biting convolutional code at all the moments based on the SISO algorithm, and performs LVA decoding on the tail-biting convolutional code according to the initial state, so that the initial state can be found more accurately, the decoding complexity is reduced, and the decoding performance can be improved.
It should be understood that, in various embodiments of the present invention, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
The decoding method according to the embodiment of the present invention is described in detail above with reference to fig. 1 to 6, and the decoding apparatus according to the embodiment of the present invention will be described below with reference to fig. 7 and 8.
Fig. 7 shows a schematic block diagram of a decoding apparatus 700 according to an embodiment of the present invention. As shown in fig. 7, the apparatus 700 includes:
a determining module 710, configured to determine an initial state in all states at all times of a tail-biting convolutional code, where the number of all times is determined by a sequence length K of an original information sequence of the tail-biting convolutional code, the number of all states is determined by the number of shift registers of an encoder, the tail-biting convolutional code is obtained by encoding the original information sequence by the encoder, and K is a positive integer;
an LVA decoding module 720, configured to perform LVA decoding on the tail-biting convolutional code according to the initial state to obtain L by using an enumerative viterbi algorithmcIndividual code word, LcIs a positive integer, the initial state corresponds to the L-th bit of the original information sequence, and L is an integer;
a shift module 730 for shifting the LcEach code word is circularly shifted to the right by L bits or circularly shifted to the left by K-L bits;
an obtaining module 740, configured to obtain a decoding result according to the code word after the cyclic shift.
In the embodiment of the present invention, when the decoding apparatus 700 decodes the tail-biting convolutional code, the determining module 710 determines an initial state in all states of all time points of the tail-biting convolutional code; the LVA decoding module 720 performs LVA decoding on the tail-biting convolutional code according to the initial state, that is, the time corresponding to the initial state is the start time, and performs LVA decoding on the tail-biting convolutional code to obtain LcA code word. Since it is an initial state determined among all the states at all the times, the initial stateThe time at which the state corresponds may no longer be 0. Therefore, the shift module 730 shifts the LcThe code words are circularly shifted to the right by L bits or circularly shifted to the left by K-L bits. Finally, the obtaining module 740 obtains the decoding result according to the code word after the cyclic shift. The embodiment of the invention determines the initial state in all states at all moments of tail-biting convolutional codes, can accurately find the initial state of decoding, and has better decoding performance.
Therefore, the decoding device according to the embodiment of the present invention determines the initial state in all states at all times of the tail-biting convolutional code, performs LVA decoding on the tail-biting convolutional code according to the initial state, cyclically shifts the obtained codeword, and determines a correct decoding result in the cyclically shifted codeword, so that the initial state can be found more accurately, the decoding complexity is reduced, and the decoding performance can be improved.
In this embodiment of the present invention, optionally, the determining module 710 is specifically configured to:
carrying out soft-input soft-output SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
and determining the initial state in all states of all moments of the tail-biting convolutional code according to the SISO decoding result.
In the present embodiment, the initial state is determined based on the SISO algorithm. Obtaining soft information L by SISO decoding of tail-biting convolutional codesappAnd hard decision informationThen according to the soft information LappAnd hard decision informationAn initial state is determined.
In this embodiment of the present invention, optionally, the determining module 710 is specifically configured to:
carrying out SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
determining L according to the soft information in the SISO decoding result, wherein L is j corresponding to the maximum value in sigma (j) or j corresponding to a plurality of values in sigma (j), and sigma (j) represents that the encoder of the tail-biting convolution code is applied to the original information sequence d0,d1,d2,...,dK-1D in (1)jJ =0,1,2,. and K-1, which is the sum of absolute values of soft information in the SISO decoding result corresponding to the value in each shift register of the encoder during encoding;
and determining the initial state according to the hard decision information and L in the SISO decoding result.
In embodiments of the present invention, the first and second electrodes may, optionally,Lapp(i) for the original information sequence d0,d1,d2,...,dK-1D in (1)iCorresponding soft information in the SISO decoding result, wherein M is the number of shift registers of the encoder, and i =0,1, 2.
The initial state isWherein bin () represents a binary form, which is the original information sequence d0,d1,d2,...,dK-1D in (1)iCorrespond toHard decision information in the SISO decoding result.
In this embodiment of the present invention, optionally, the obtaining module 740 is specifically configured to perform cyclic redundancy check CRC on the code word after the cyclic shift, so as to determine a correct decoding result.
In this embodiment, all code words after cyclic shift are error-checked, and the correct decoding result is selected from the error-checked code words.
In this embodiment of the present invention, optionally, the obtaining module 740 is specifically configured to select, from the code words after the cyclic shift, a code word with a largest path accumulation metric, perform CRC on the selected code word, and determine a correct decoding result.
In this embodiment, a part of code words is selected from the code words after cyclic shift, and then the selected code words are subjected to error check, so as to select a correct decoding result. Alternatively, a part of the code words may be selected according to the size of the path accumulated metric value corresponding to the code word, for example, a part of the code words after cyclic shift with the largest path accumulated metric value is selected.
The decoding apparatus 700 according to the embodiment of the present invention may correspond to an execution body of the decoding method according to the embodiment of the present invention, and the above and other operations and/or functions of each module in the apparatus 700 are respectively for implementing the corresponding processes of the foregoing method embodiments, and are not described herein again for brevity.
The decoding device of the embodiment of the invention determines the initial state in all the states of the tail-biting convolutional code at all the moments based on the SISO algorithm, and performs LVA decoding on the tail-biting convolutional code according to the initial state, so that the initial state can be found more accurately, the decoding complexity is reduced, and the decoding performance can be improved.
Fig. 8 shows a structure of a decoding apparatus provided in another embodiment of the present invention, which includes at least one processor 802 (e.g., a CPU), at least one network interface 805 or other communication interface, a memory 806, and at least one communication bus 803 for implementing connection communication among these components. The processor 802 is operable to execute executable modules, such as computer programs, stored in the memory 806. The memory 806 may comprise a high-speed Random Access Memory (RAM) and may also comprise a non-volatile memory, such as at least one disk memory. The communication connection with at least one other network element is realized through at least one network interface 805 (which may be wired or wireless).
In some embodiments, the memory 806 stores a program 8061, and the processor 802 executes the program 8061 to perform the following operations:
determining initial states in all states of all moments of a tail-biting convolutional code, wherein the number of all the moments is determined by the sequence length K of an original information sequence of the tail-biting convolutional code, the number of all the states is determined by the number of shift registers of an encoder, the tail-biting convolutional code is obtained by encoding the original information sequence through the encoder, and K is a positive integer;
performing LVA decoding on the tail-biting convolutional code according to the initial state to obtain LcIndividual code word, LcIs a positive integer, the initial state corresponds to the L-th bit of the original information sequence, and L is an integer;
subjecting the L tocEach code word is circularly shifted to the right by L bits or circularly shifted to the left by K-L bits;
and obtaining a decoding result according to the code word after the cyclic shift.
Optionally, the processor 802 is specifically configured to perform soft-in soft-out SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result, and determine the initial state in all states of all times of the tail-biting convolutional code according to the SISO decoding result.
Optionally, the processor 802 is specifically configured to determine L according to the soft information in the SISO decoding result, where L is j corresponding to a maximum value in Σ (j) or j corresponding to multiple values in Σ (j), and Σ (j) represents that the encoder of the tail-biting convolutional code is applying to the original information sequence d0,d1,d2,...,dK-1D in (1)jAnd j =0,1,2,.. and K-1, which are the sum of absolute values of soft information in the SISO decoding result corresponding to the value in each shift register of the encoder during encoding, and the initial state is determined according to the hard decision information and L in the SISO decoding result.
Alternatively,Lapp(i) for the original information sequence d0,d1,d2,...,dK-1D in (1)iCorresponding soft information in the SISO decoding result, wherein M is the number of shift registers of the encoder, and i =0,1, 2.
The initial state isWherein bin () represents a binary form, which is the original information sequence d0,d1,d2,...,dK-1D in (1)iCorrespond toHard decision information in the SISO decoding result.
Optionally, the processor 802 is specifically configured to perform cyclic redundancy check CRC on the code word after the cyclic shift, and determine a correct decoding result.
Optionally, the processor 802 is specifically configured to select a codeword with the largest path accumulation metric value from the cyclically shifted codewords, perform CRC on the selected codeword, and determine a correct decoding result.
It can be seen from the above technical solutions provided in the embodiments of the present invention that, in the embodiments of the present invention, by determining an initial state in all states at all times of the tail-biting convolutional code, performing LVA decoding on the tail-biting convolutional code according to the initial state, circularly shifting the obtained codeword, and determining a correct decoding result in the circularly shifted codeword, the initial state can be found more accurately, the decoding complexity is reduced, and thus the decoding performance can be improved.
It should be understood that, in the embodiment of the present invention, the term "and/or" is only one kind of association relation describing an associated object, and means that three kinds of relations may exist. For example, a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (12)

1. A decoding method, comprising:
determining initial states in all states of all moments of a tail-biting convolutional code, wherein the number of all the moments is determined by the sequence length K of an original information sequence of the tail-biting convolutional code, the number of all the states is determined by the number of shift registers of an encoder, the tail-biting convolutional code is obtained by encoding the original information sequence through the encoder, and K is a positive integer;
enumerating Viterbi for the tail-biting convolutional code according to the initial stateAlgorithm LVA decoding obtaining LcA code word, said LcThe initial state corresponds to the L-th bit of the original information sequence, and L is an integer;
subjecting said L tocEach code word is circularly shifted to the right by L bits or circularly shifted to the left by K-L bits;
and obtaining a decoding result according to the code word after the cyclic shift.
2. The method of claim 1, wherein determining the initial state from all states at all time instants of the tail-biting convolutional code comprises:
carrying out soft-input soft-output SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
and determining the initial state in all states of all moments of the tail-biting convolutional code according to the SISO decoding result.
3. The method according to claim 2, wherein said determining the initial state in all states at all time instants of the tail-biting convolutional code according to the SISO decoding result comprises:
determining the L according to soft information in the SISO decoding result, wherein the L is j corresponding to a maximum value in sigma (j) or j corresponding to a plurality of values in sigma (j), and sigma (j) represents the encoder is in the process of decoding the original information sequence d0,d1,d2,...,dK-1D in (1)jWhen encoding, j is 0,1,2, a.
And determining the initial state according to the hard decision information in the SISO decoding result and the L.
4. The method of claim 3, wherein:
Lapp(i) for the original information sequence d0,d1,d2,...,dK-1D in (1)iCorresponding soft information in the SISO decoding result, wherein M is the number of shift registers of the encoder, and i is 0,1, 2.
The initial state isWherein bin () represents a binary form,for the original information sequence d0,d1,d2,...,dK-1D in (1)iAnd hard decision information in the corresponding SISO decoding result.
5. The method according to any one of claims 1 to 4, wherein the obtaining the decoding result according to the code word after the cyclic shift comprises:
and performing Cyclic Redundancy Check (CRC) on the code word subjected to the cyclic shift to determine a correct decoding result.
6. The method according to any one of claims 1 to 4, wherein the obtaining the decoding result according to the code word after the cyclic shift comprises:
selecting a code word with the maximum corresponding path accumulated metric value from the code words after the cyclic shift;
and performing CRC on the selected code word to determine a correct decoding result.
7. A decoding apparatus, comprising:
a determining module, configured to determine an initial state in all states at all times of a tail-biting convolutional code, where the number of all times is determined by a sequence length K of an original information sequence of the tail-biting convolutional code, the number of all states is determined by the number of shift registers of an encoder, the tail-biting convolutional code is obtained by encoding the original information sequence by the encoder, and K is a positive integer;
a decoding module for performing an enumeration Viterbi algorithm (LVA) decoding on the tail-biting convolutional code according to the initial state to obtain LcA code word, said LcThe initial state corresponds to the L-th bit of the original information sequence, and L is an integer;
a shift module for shifting the LcEach code word is circularly shifted to the right by L bits or circularly shifted to the left by K-L bits;
and the obtaining module is used for obtaining a decoding result according to the code word after the cyclic shift.
8. The apparatus of claim 7, wherein the determining module is specifically configured to:
carrying out soft-input soft-output SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
and determining the initial state in all states of all moments of the tail-biting convolutional code according to the SISO decoding result.
9. The apparatus of claim 8, wherein the determining module is specifically configured to:
carrying out SISO decoding on the tail-biting convolutional code to obtain a SISO decoding result;
determining the L according to soft information in the SISO decoding result, wherein the L is j corresponding to a maximum value in sigma (j) or j corresponding to a plurality of values in sigma (j), and sigma (j) represents the encoder is in the process of decoding the original information sequence d0,d1,d2,...,dK-1D in (1)jWhen encoding, j is 0,1,2, a.
And determining the initial state according to the hard decision information in the SISO decoding result and the L.
10. The apparatus of claim 9, wherein:
Lapp(i) for the original information sequence d0,d1,d2,...,dK-1D in (1)iCorresponding soft information in the SISO decoding result, wherein M is the number of shift registers of the encoder, and i is 0,1, 2.
The initial state isWherein bin () represents a binary form,for the original information sequence d0,d1,d2,...,dK-1D in (1)iAnd hard decision information in the corresponding SISO decoding result.
11. The apparatus according to any one of claims 7 to 10, wherein the obtaining module is specifically configured to:
and performing Cyclic Redundancy Check (CRC) on the code word subjected to the cyclic shift to determine a correct decoding result.
12. The apparatus according to any one of claims 7 to 10, wherein the obtaining module is specifically configured to:
selecting a code word with the maximum corresponding path accumulated metric value from the code words after the cyclic shift;
and performing CRC on the selected code word to determine a correct decoding result.
CN201410028585.8A 2014-01-22 2014-01-22 Interpretation method and device Active CN104796160B (en)

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)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017050377A1 (en) 2015-09-24 2017-03-30 Huawei Technologies Co., Ltd. Tail-biting convolutional codes with very short information blocks
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)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
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

Patent Citations (9)

* Cited by examiner, † Cited by third party
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
US10886950B2 (en) Method and apparatus for generating a code word
JP6817452B2 (en) Rate matching method, encoding device, and communication device
US11025278B2 (en) Polar coding encoding/decoding method and apparatus
US9214958B2 (en) Method and decoder for processing decoding
CN103368583B (en) The interpretation method of polar code and code translator
CN108574561B (en) Method and device for coding polarization code
EP2599228B1 (en) Decoding techniques for tail-biting codes
CN104796160B (en) Interpretation method and device
WO2019206136A1 (en) Method and device for rate matching and de-rate matching polar code
KR102547476B1 (en) Method for controlling decoding process based on path metric value and computing apparatus and mobile device for controlling the same
US10084486B1 (en) High speed turbo decoder
CN112737600B (en) Decoding method and decoder
CN109004939A (en) Polarize decoder and method
JP5169771B2 (en) Decoder and decoding method
CN110324111B (en) Decoding method and device
CN105356893A (en) Tail code configurable Viterbi decoding method and decoder
EP2605410A1 (en) Channel decoding method and tail biting convolutional decoder
EP1587218B1 (en) Data receiving method and apparatus
WO2021001037A1 (en) Sliding window and subblock-wise encoding and decoding of polar codes
CN110784283A (en) Method, device and decoding system for determining forward error correction frame boundary
CN113162633B (en) Method and device for decoding polarization code, decoder, equipment and storage medium
JP5567216B2 (en) Method and iterative turbo decoder for stopping iteration in an iterative turbo decoder
TWI491178B (en) Tail-biting convolutional decoder and decoding method
CN111614363B (en) Method for improving Viterbi algorithm and receiving device
CN106533453B (en) Decoding method and decoder

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