CN103905065A - Convolutional code decoding method and device - Google Patents
Convolutional code decoding method and device Download PDFInfo
- Publication number
- CN103905065A CN103905065A CN201210586891.4A CN201210586891A CN103905065A CN 103905065 A CN103905065 A CN 103905065A CN 201210586891 A CN201210586891 A CN 201210586891A CN 103905065 A CN103905065 A CN 103905065A
- Authority
- CN
- China
- Prior art keywords
- metric
- current state
- path
- last current
- decoding
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
The invention relates to the field of channel coding and decoding and discloses a convolutional code decoding method and device. In a Viterbi decoding process, information in the decoding process is used, CRC verifying information is combined for secondary verifying, error detection is not carried out only through CRC verifying, and accordingly the false alarm probability of convolutional code decoding is lowered.
Description
Technical field
The present invention relates to channel decoding field, particularly a kind of coding method of convolution code and device.
Background technology
Convolution code is a kind of conventional channel coding technology, in 2G, 3G, 4G mobile communication system, has use, and conventional convolution coder structure as shown in Figure 1.In LTE, in order further to improve code efficiency, adopt a kind of tail-biting convolutional code, require the initial condition of encoder identical with last current state, and traditional convolution coder initial condition has been all 0.
Convolution code is a kind of error correction coding, conventionally also can combine use with error detection code, and conventional error detection code is cyclic redundancy check (CRC) code (being called for short " CRC check code "), and they combine the block diagram of use as shown in 2.First add the CRC check code of certain length at data end, and then carry out convolutional encoding.Contrary when reception, as shown in Figure 3, advanced convolution code decoding, then carries out CRC check, if CRC check is passed through, thinks that convolution code decoding is correct, otherwise thinks convolution code decoding error.
There is certain probability of miscarriage of justice (false alarm probability) in CRC check code, likely decoding is incorrect, and CRC check also can be passed through, and on this probability theory, equals 1/2^L, the length that wherein L is CRC.Normal conditions think that the probability of this erroneous judgement is very low, can ignore, and then in practical application, find can not ignore in some cases.
For example, for the Physical Downlink Control Channel (PDCCH) of Long Term Evolution LTE system, terminal need to be carried out blind Detecting to PDCCH, obtain possible Downlink Control Information (DCI), simply by LTE terminal 1ms(1 subframe) in need to carry out to sting tail folding coding 44 times, then judge that according to CRC whether these 44 decode results are correct, if correct, think that corresponding DCI information is correct.LTE terminal 1s clock need to carry out stinging tail folding coding and CRC check 44000 times, like this according to the probability of miscarriage of justice of CRC through calculating, within average tens seconds, just there will be one time flase drop, once and there is flase drop, may cause terminal to occur some unpredictable mistakes.That is to say, only rely on the result of CRC check to judge that whether convolution code decoding is correct, can cause probability of false detection higher.
Summary of the invention
The object of the present invention is to provide a kind of coding method of convolution code and device, make carrying out in convolution code decode procedure, is not only to rely on CRC check to carry out error detection, thereby reduces the false alarm probability of convolution code decoding.
For solving the problems of the technologies described above, embodiments of the present invention provide a kind of coding method of convolution code, comprise following steps:
A. carrying out in Viterbi Viterbi decode procedure, preserve decoding average information;
B. the data that described Viterbi decoding obtained, carry out cyclic redundancy check (CRC) code CRC check;
If C. CRC check is correct, in conjunction with described decoding average information, the data that described CRC check is obtained, carry out secondary verification;
If D. the result of described secondary verification meets the condition setting in advance, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
Embodiments of the present invention also provide a kind of convolution code code translator, comprise: Viterbi decoding module, decoding average information memory module, CRC check module and secondary correction verification module;
Described Viterbi decoding module carries out Viterbi Viterbi decoding;
Described decoding average information memory module is kept at the decoding average information producing in described Viterbi decoding module decode procedure;
The data that described CRC check module obtains described Viterbi decoding module, carry out cyclic redundancy check (CRC) code CRC check; Whether and it is correct in described secondary correction verification module to export CRC check;
Described secondary correction verification module is in the time that described CRC check module output CRC check is correct, and in conjunction with described decoding average information, the data that described CRC check module is obtained, carry out secondary verification; And in the time that the result of described secondary verification meets the condition setting in advance, judge that convolution code decoding is correct; In the time that the result of described secondary verification does not meet the condition setting in advance, judgement is flase drop.
Embodiment of the present invention in terms of existing technologies, carrying out, in Viterbi decode procedure, utilizing the information in decode procedure, carry out secondary verification in conjunction with CRC check information, not only to rely on CRC check to carry out error detection, thereby reduced the false alarm probability of convolution code decoding.
In addition, carrying out in Viterbi decode procedure, the decoding average information of preserving can comprise: retain the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state ratio, retain metric corresponding to the last current state in path, retain in path any one in last current state maximal metric value and time ratio of large metric or combine; Correspondingly, in the time carrying out secondary verification, described in the condition that sets in advance be: metric corresponding to last current state that the ratio of the metric that metric corresponding to the last current state in described retention path is corresponding with initial equilibrium state is greater than the first threshold value, described retention path is greater than last current state maximal metric value and time ratio of large metric in the second threshold value, described retention path and is greater than in the 3rd threshold value and corresponding any one of described decoding average information or combination in any; Wherein, in the time that the described condition setting in advance is the combination of two kinds or two kinds above conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
By preservation retain the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state ratio, retain metric corresponding to the last current state in path, retain last current state maximal metric value and time these decoding average informations of ratio of large metric in path, be used for judging flase drop, can make the present invention realize simply, substantially can not increase the complexity of convolution code decoding.
In addition, carrying out in Viterbi decode procedure, if what adopt is tail-biting convolutional code, described decoding average information can be: retain ratio that whether initial equilibrium state in path and last current state are the metrics that metric corresponding to same state, the last current state of retaining path is corresponding with initial equilibrium state, retain metric corresponding to the last current state in path, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric; Correspondingly, in the time carrying out secondary verification, described in the condition that sets in advance be that the initial equilibrium state in described retention path and last current state are that metric corresponding to last current state that the ratio of the metric that metric corresponding to the last current state in same state, described retention path is corresponding with initial equilibrium state is greater than the first threshold value, described retention path is greater than last current state maximal metric value and time ratio of large metric in the second threshold value, described retention path and is greater than in the 3rd threshold value and corresponding any one of described decoding average information or combination in any; Wherein, in the time that the described condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
In tail-biting convolutional code decoding, the initial equilibrium state and the last current state that make full use of retention path are that this feature of same state judges flase drop, can further reduce the false alarm probability of convolution code decoding.
In addition, in Viterbi decode procedure, comprise following sub-step:
If described Viterbi is decoded as the channel decoding of the Physical Downlink Control Channel LTEPDCCH in long evolving system, judges under same Downlink Control Information DCI configuration and whether detect and exceed a DCI configuration;
In this way, the metric corresponding to last current state in the final retention path of the lower all DCI configuration correspondences that detect of directly more same DCI configuration, metric corresponding to last current state that retains maximum retention path is described decoding average information; Or, more finally retain the ratio of path last current state metric and initial equilibrium state metric, the ratio that retains the metric that metric corresponding to the last current state in maximum retention path is corresponding with initial equilibrium state is described decoding average information.
For LTE PDCCH, being defined in lower of some identical configuration and may having a kind of DCI configuration according to standard, if there is flase drop, cause detecting and exceed DCI configuration, corresponding decoding average information also there will be multiple, occurs the situation that some cannot be judged, by retaining maximum average information while making secondary verification, be conducive to secondary verification, thereby further reduce the false alarm probability of convolution code decoding.
Accompanying drawing explanation
Fig. 1 is conventional convolution coder structural representation;
Fig. 2 is conventional convolution code is combined use coding schematic diagram with CRC code;
Fig. 3 is conventional convolution code is combined use decoding schematic diagram with CRC code;
Fig. 4 is according to the flow chart of the coding method of convolution code of first embodiment of the invention;
Fig. 5 is according to the structural representation of the convolution code code translator of four embodiment of the invention.
Embodiment
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the embodiments of the present invention are explained in detail.But, persons of ordinary skill in the art may appreciate that in the each execution mode of the present invention, in order to make reader understand the application better, many ins and outs are proposed.But, even without these ins and outs and the many variations based on following execution mode and modification, also can realize the each claim of the application technical scheme required for protection.
The first execution mode of the present invention relates to a kind of coding method of convolution code, and flow process as shown in Figure 4, specifically comprises following steps:
The most frequently used folding coding algorithm is all Viterbi decoding algorithm at present, the algorithm basic thought of this decoding is the possible state transitions metric of step-by-step calculation, each state of every one-level only retains larger branch, after afterbody, start to recall (Traceback) from the state of metric maximum, rule out the original coding bit in maximal metric value respective path.This method is a kind of interpretation method of maximum likelihood, and the final path retaining is maximum likelihood path.
When Viterbi algorithm has successfully solved searching maximum likelihood path, amount of calculation is with this problem of length coding length N exponential increase.This algorithm adopts the mode iterating to seek most probable path.It is divided into N step and iterates, and in each step, it first calculates the path metric in all paths that enter each state, then compares, and preserves path and the path metric thereof that optimal path is measured, and abandon other path.Be saved the path of getting off and be called as retention path.And after in the end a step iterates, from the retention path of each state, choose the information bit having on the retention path that maximum path measures as decode results, this path is exactly maximum likelihood path.
Conventionally convolution code is all used as channel error correction, analyze some INFORMATION DISCOVERYs that obtain in decode procedure, decoding average information in decode procedure also can be for judging flase drop, and these packets of information contain: retain metric corresponding to the last current state in path, retain the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state ratio, retain in path last current state maximal metric value and time large ratio of metric.Utilize above-mentioned information, after CRC check, can do again further judgement, be i.e. secondary verification (DoubleCheck).Below take the decoding average information of preserving as the ratio of retaining the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state as example is specifically described, step 402 to 407 in, carry out CRC check and secondary verification, to judge that whether convolution code decoding is correct.
Specifically, in step 402, the data that decoding obtains to Viterbi, carry out CRC check;
In step 406, the first threshold value can be determined in the following way: input different training sequences and carry out convolution code decoding, preserve the ratio of the metric that metric corresponding to the last current state in the retention path in each convolution code decode procedure is corresponding with initial equilibrium state, between ratio when ratio that can be in the time of correct decoding and wrong decoding, determine a representative value or scope, as the first threshold value.
In addition, if decoding average information comprises: retain the metric corresponding to last current state in path, so, in the time of secondary verification, the condition setting in advance is: metric corresponding to last current state of retaining path is greater than the second threshold value.Definite method of the second threshold value can be similar with definite method of the first threshold value herein, do not repeat them here.
Or, if decoding average information comprises: retain last current state maximal metric value and time ratio of large metric in path, so, in the time of secondary verification, the condition setting in advance is: retain last current state maximal metric value in path and be greater than the 3rd threshold value with time ratio of large metric.Definite method of the 3rd threshold value can be similar with definite method of the first threshold value herein, do not repeat them here.
Or, decoding average information also can comprise: metric corresponding to last current state of retaining path, retain the ratio of the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state, two kinds or the combination of three kinds in retention path in the ratio of last current state maximal metric value and time large metric, correspondingly, in the time of secondary verification, the condition setting in advance is: the ratio of retaining the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state is greater than the first threshold value, metric corresponding to last current state of retaining path is greater than the second threshold value, retain last current state maximal metric value in path and time large ratio of metric and be greater than in the 3rd threshold value two kind or the combination of three kind corresponding with decoding average information, wherein, in the time that the condition setting in advance is the combination of two kinds or three kinds conditions, if all conditions all meets, judge that convolution code decoding is correct, otherwise judge it is flase drop.Such as, if decoding average information is the ratio of the metric that metric corresponding to the last current state in metric corresponding to the last current state in retention path, retention path is corresponding with initial equilibrium state, so, in the time of secondary verification, the condition setting in advance is: the ratio of retaining the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state is greater than the first threshold value, and the metric corresponding to last current state in retention path is greater than the second threshold value.
By preservation retain the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state ratio, retain metric corresponding to the last current state in path, retain last current state maximal metric value and time these decoding average informations of ratio of large metric in path, be used for judging flase drop, can make present embodiment realize simple, substantially can not increase the complexity of convolution code decoding.
Compared with prior art, present embodiment, carrying out, in Viterbi decode procedure, utilizing the information in decode procedure, is carried out secondary verification in conjunction with CRC check information, is not only to rely on CRC check to carry out error detection, thereby has reduced the false alarm probability of convolution code decoding.
The second execution mode of the present invention relates to a kind of coding method of convolution code.The second execution mode has done further improvement on the first execution mode basis, main improvements are: in second embodiment of the invention, if in convolution code decode procedure, what adopt is tail-biting convolutional code, so, can also preserve and retain whether initial equilibrium state and the last current state in path is that same state is as decoding average information; In the time carrying out secondary verification, be same state if retain initial equilibrium state and the last current state in path, think that decode results is correct, otherwise think flase drop.
In addition, the decoding average information of preservation can be also: retain ratio that whether initial equilibrium state in path and last current state are the metrics that metric corresponding to same state, the last current state of retaining path is corresponding with initial equilibrium state, retain metric corresponding to the last current state in path, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric; Correspondingly, in the time of secondary verification, the condition setting in advance is that to retain the initial equilibrium state in path and last current state be that the ratio of the metric that metric corresponding to same state, the last current state of retaining path is corresponding with initial equilibrium state is greater than the first threshold value, or metric corresponding to last current state of retaining path is greater than the second threshold value, retains last current state maximal metric value and the inferior ratio of metric greatly in path and be greater than in the 3rd threshold value corresponding any one or combination in any with decoding average information; Wherein, in the time that the condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
In tail-biting convolutional code decoding, the initial equilibrium state and the last current state that make full use of retention path are that this feature of same state judges flase drop, can further reduce the false alarm probability of convolution code decoding.
The 3rd execution mode of the present invention relates to a kind of coding method of convolution code.The 3rd execution mode has done further improvement on the first execution mode or the second execution mode basis, main improvements are: in third embodiment of the invention, for LTE PDCCH, being defined in lower of some identical configuration and may having a kind of DCI configuration according to standard, if there is flase drop, cause detecting and exceed DCI configuration, the directly metrics corresponding to last current state in final retention paths corresponding to more several configurations, only retain maximum; Or more finally retain the ratio of path last current state metric and initial equilibrium state metric, only reservation maximum.
Specifically, if Viterbi is decoded as the channel decoding of the Physical Downlink Control Channel LTEPDCCH in long evolving system, judges under same DCI configuration and whether detect and exceed a Downlink Control Information DCI configuration; In this way, the metric corresponding to last current state in the final retention path of the lower all DCI configuration correspondences that detect of directly more same DCI configuration, metric corresponding to last current state that retains maximum retention path is decoding average information; Or, more finally retain the ratio of path last current state metric and initial equilibrium state metric, the ratio that retains the metric that metric corresponding to the last current state in maximum retention path is corresponding with initial equilibrium state is decoding average information.
For LTE PDCCH, being defined in lower of some identical configuration and may having a kind of DCI configuration according to standard, if there is flase drop, cause detecting exceeding to detect and exceed a DCI configuration, corresponding decoding average information also there will be multiple, occurs the situation that some cannot be judged, by retaining maximum average information while making secondary verification, be conducive to secondary verification, thereby further reduce the false alarm probability of convolution code decoding.
The step of the whole bag of tricks is divided above, just in order being described clearly, can to merge into a step or some step is split while realization, is decomposed into multiple steps, as long as comprise identical logical relation, all in the protection range of this patent; To adding inessential modification in algorithm or in flow process or introducing inessential design, but the core design that does not change its algorithm and flow process is all in the protection range of this patent.
Four embodiment of the invention relates to a kind of convolution code code translator, as shown in Figure 5, comprises: Viterbi decoding module, decoding average information memory module, CRC check module and secondary correction verification module.
Viterbi decoding module carries out Viterbi Viterbi decoding.
Decoding average information memory module is kept at the decoding average information producing in Viterbi decoding module decode procedure; Decoding average information comprises: retain metric corresponding to the last current state in path, retain the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state ratio, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric.
The data that CRC check module obtains Viterbi decoding module, carry out cyclic redundancy check (CRC) code CRC check; And whether export CRC check correctly to secondary correction verification module.
Secondary correction verification module is in the time that CRC check module output CRC check is correct, and in conjunction with decoding average information, the data that CRC check module is obtained, carry out secondary verification; And in the time that the result of secondary verification meets the condition setting in advance, judge that corresponding decode results is correct; Otherwise judge it is flase drop.The Conditional Include that this sets in advance: metric corresponding to last current state that the ratio of retaining the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state is greater than the first threshold value, retain path be greater than the second threshold value, retain last current state maximal metric value in path and time large ratio of metric is greater than in the 3rd threshold value and corresponding any one of decoding average information or combination in any; Wherein, in the time that the condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
Be not difficult to find, present embodiment is the system embodiment corresponding with the first execution mode, present embodiment can with the enforcement of working in coordination of the first execution mode.The correlation technique details of mentioning in the first execution mode is still effective in the present embodiment, in order to reduce repetition, repeats no more here.Correspondingly, the correlation technique details of mentioning in present embodiment also can be applicable in the first execution mode.
It is worth mentioning that, each module involved in present embodiment is logic module, and in actual applications, a logical block can be a physical location, can be also a part for a physical location, can also realize with the combination of multiple physical locations.In addition, for outstanding innovation part of the present invention, in present embodiment, the unit not too close with solving technical problem relation proposed by the invention do not introduced, but this does not show not exist in present embodiment other unit.
Fifth embodiment of the invention relates to a kind of convolution code code translator.The 5th execution mode has done further improvement on the 4th execution mode basis, main improvements are: in the 5th execution mode, adopt when tail-biting convolutional code at Viterbi decoding module, decoding average information comprises: retain ratio that whether initial equilibrium state in path and last current state are the metrics that metric corresponding to same state, the last current state of retaining path is corresponding with initial equilibrium state, retain metric corresponding to the last current state in path, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric.
The condition setting in advance in secondary correction verification module is: metric corresponding to last current state that the ratio of retaining the initial equilibrium state in path and last current state and be the metric that metric corresponding to same state, the last current state of retaining path is corresponding with initial equilibrium state is greater than the first threshold value, retain path be greater than the second threshold value, retain last current state maximal metric value in path and time large ratio of metric is greater than in the 3rd threshold value and corresponding any one of decoding average information or combination in any; Wherein, in the time that the condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
Because the second execution mode is mutually corresponding with present embodiment, therefore present embodiment can with the enforcement of working in coordination of the second execution mode.The correlation technique details of mentioning in the second execution mode is still effective in the present embodiment, and the technique effect that can reach in the second execution mode can be realized in the present embodiment too, in order to reduce repetition, repeats no more here.Correspondingly, the correlation technique details of mentioning in present embodiment also can be applicable in the second execution mode.
Sixth embodiment of the invention relates to a kind of convolution code code translator.The 6th execution mode has done further improvement on the 4th execution mode or the 5th execution mode basis, main improvements are: in the 6th execution mode, for LTE PDCCH, Viterbi decoding module comprises: DCI configuration determination submodule, comparison sub-module.
Whether DCI configuration determination submodule, in the time that Viterbi decoding module is applied to the channel decoding of the Physical Downlink Control Channel LTE PDCCH in long evolving system, judges under same DCI configuration and detects and exceed a Downlink Control Information DCI configuration.
Comparison sub-module detects under same DCI configuration in the judgement of DCI configuration determination submodule while exceeding a DCI configuration, more same DCI configures lower all metrics corresponding to last current state that detect final retention paths corresponding to DCI configuration, or more finally retains the ratio of path last current state metric and initial equilibrium state metric.
The maximum that decoding average information memory module preservation comparison sub-module obtains is retained the metric corresponding to last current state in path; Or preserve the maximum that obtains of comparison sub-module and retain the ratio of the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state.
Because the 3rd execution mode is mutually corresponding with present embodiment, therefore present embodiment can with the enforcement of working in coordination of the 3rd execution mode.The correlation technique details of mentioning in the 3rd execution mode is still effective in the present embodiment, and the technique effect that can reach in the 3rd execution mode can be realized in the present embodiment too, in order to reduce repetition, repeats no more here.Correspondingly, the correlation technique details of mentioning in present embodiment also can be applicable in the 3rd execution mode.
Persons of ordinary skill in the art may appreciate that the respective embodiments described above are to realize specific embodiments of the invention, and in actual applications, can do various changes to it in the form and details, and without departing from the spirit and scope of the present invention.
Claims (8)
1. a coding method of convolution code, is characterized in that, comprises following steps:
A. carrying out in Viterbi Viterbi decode procedure, preserve decoding average information;
B. the data that described Viterbi decoding obtained, carry out cyclic redundancy check (CRC) code CRC check;
If C. CRC check is correct, in conjunction with described decoding average information, the data that described CRC check is obtained, carry out secondary verification;
If D. the result of described secondary verification meets the condition setting in advance, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
2. coding method of convolution code according to claim 1, it is characterized in that, in described steps A, described decoding average information comprises: retain metric corresponding to the last current state in path, retain the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state ratio, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric;
In described step D, described in the condition that sets in advance be: metric corresponding to last current state that the ratio of the metric that metric corresponding to the last current state in described retention path is corresponding with initial equilibrium state is greater than the first threshold value, described retention path is greater than last current state maximal metric value and time ratio of large metric in the second threshold value, described retention path and is greater than in the 3rd threshold value and corresponding any one of described decoding average information or combination in any; Wherein, in the time that the described condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
3. coding method of convolution code according to claim 1, it is characterized in that, in described steps A, if what adopt is tail-biting convolutional code, described decoding average information comprises: retain ratio that whether initial equilibrium state in path and last current state are the metrics that metric corresponding to same state, the last current state of retaining path is corresponding with initial equilibrium state, retain metric corresponding to the last current state in path, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric;
In described step D, the described condition setting in advance is that the initial equilibrium state in described retention path and last current state are that the ratio of the metric that metric corresponding to the last current state in same state, described retention path is corresponding with initial equilibrium state is greater than the first threshold value, or the metric corresponding to last current state in described retention path is greater than last current state maximal metric value and time ratio of large metric in the second threshold value, described retention path and is greater than in the 3rd threshold value corresponding any one or combination in any with described decoding average information; Wherein, in the time that the described condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
4. according to the coding method of convolution code described in claim 2 or 3, it is characterized in that, in described steps A, comprise following sub-step:
If described Viterbi is decoded as the channel decoding of the Physical Downlink Control Channel LTEPDCCH in long evolving system, judges under same Downlink Control Information DCI configuration and whether detect and exceed a DCI configuration;
In this way, the metric corresponding to last current state in the final retention path of the lower all DCI configuration correspondences that detect of directly more same DCI configuration, metric corresponding to last current state that retains maximum retention path is described decoding average information; Or, more finally retain the ratio of path last current state metric and initial equilibrium state metric, the ratio that retains the metric that metric corresponding to the last current state in maximum retention path is corresponding with initial equilibrium state is described decoding average information.
5. a convolution code code translator, is characterized in that, comprises: Viterbi decoding module, decoding average information memory module, CRC check module and secondary correction verification module;
Described Viterbi decoding module carries out Viterbi Viterbi decoding;
Described decoding average information memory module is kept at the decoding average information producing in described Viterbi decoding module decode procedure;
The data that described CRC check module obtains described Viterbi decoding module, carry out cyclic redundancy check (CRC) code CRC check; Whether and it is correct in described secondary correction verification module to export CRC check;
Described secondary correction verification module is in the time that described CRC check module output CRC check is correct, and in conjunction with institute's decoding average information, the data that described CRC check module is obtained, carry out secondary verification; And in the time that the result of described secondary verification meets the condition setting in advance, judge that convolution code decoding is correct; In the time that the result of described secondary verification does not meet the condition setting in advance, judgement is flase drop.
6. convolution code code translator according to claim 5, it is characterized in that, described decoding average information comprises: retain the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state ratio, retain metric corresponding to the last current state in path, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric;
The condition setting in advance in described secondary correction verification module is: metric corresponding to last current state that the ratio of the metric that metric corresponding to the last current state in described retention path is corresponding with initial equilibrium state is greater than the first threshold value, described retention path is greater than last current state maximal metric value and time ratio of large metric in the second threshold value, described retention path and is greater than in the 3rd threshold value and corresponding any one of described decoding average information or combination in any; And in the time that the described condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct; Otherwise judge it is flase drop.
7. convolution code code translator according to claim 5, it is characterized in that, in the time that described Viterbi decoding module adopts tail-biting convolutional code, described decoding average information comprises: retain ratio that whether initial equilibrium state in path and last current state are the metrics that metric corresponding to same state, the last current state of retaining path is corresponding with initial equilibrium state, retain metric corresponding to the last current state in path, retain any one or combination in any in the ratio of last current state maximal metric value in path and time large metric;
The condition setting in advance in described secondary correction verification module is: the initial equilibrium state in described retention path and last current state are same states, the ratio of the metric that metric corresponding to the last current state in described retention path is corresponding with initial equilibrium state is greater than the first threshold value, the metric corresponding to last current state in described retention path is greater than the second threshold value, in described retention path, last current state maximal metric value and time ratio of large metric are greater than in the 3rd threshold value corresponding any one or combination in any with described decoding average information, and in the time that the described condition setting in advance is the combination of two kinds or two or more conditions, if all conditions all meets, judge that convolution code decoding is correct, otherwise judge it is flase drop.
8. according to the convolution code code translator described in claim 6 or 7, it is characterized in that, described Viterbi decoding module comprises: DCI configuration determination submodule, comparison sub-module;
Whether described DCI configuration determination submodule, in the time that described Viterbi decoding module is applied to the channel decoding of the Physical Downlink Control Channel LTE PDCCH in long evolving system, judges to detect under same Downlink Control Information DCI configuration to exceed a DCI configuration;
Described comparison sub-module is judged and under same DCI configuration, is detected while exceeding a DCI configuration at described DCI configuration determination submodule, the lower all DCI that detect of more same DCI configuration configure the metric corresponding to last current state in corresponding final retention path, or more finally retain the ratio of path last current state metric and initial equilibrium state metric;
Described decoding average information memory module is preserved the maximum that described comparison sub-module obtains and is retained the metric corresponding to last current state in path; Or preserve maximum that described comparison sub-module obtains and retain the ratio of the metric that metric corresponding to the last current state in path is corresponding with initial equilibrium state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210586891.4A CN103905065B (en) | 2012-12-28 | 2012-12-28 | A kind of coding method of convolution code and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210586891.4A CN103905065B (en) | 2012-12-28 | 2012-12-28 | A kind of coding method of convolution code and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103905065A true CN103905065A (en) | 2014-07-02 |
| CN103905065B CN103905065B (en) | 2017-06-13 |
Family
ID=50996240
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210586891.4A Active CN103905065B (en) | 2012-12-28 | 2012-12-28 | A kind of coding method of convolution code and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103905065B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016095569A1 (en) * | 2014-12-17 | 2016-06-23 | 深圳市中兴微电子技术有限公司 | Method and apparatus for reducing false detection rate, and storage medium |
| CN105763286A (en) * | 2014-12-15 | 2016-07-13 | 深圳市中兴微电子技术有限公司 | Method and device for identifying wrong detection control information |
| CN110618961A (en) * | 2019-08-22 | 2019-12-27 | 苏州浪潮智能科技有限公司 | Method and device for realizing command verification of UBM (universal UBM management module) backplane |
| CN111294060A (en) * | 2019-02-28 | 2020-06-16 | 展讯通信（上海）有限公司 | Voice information decoding method and device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1471677A1 (en) * | 2003-04-23 | 2004-10-27 | STMicroelectronics N.V. | Method of blindly detecting a transport format of an incident convolutional encoded signal, and corresponding convolutional code decoder |
| CN1901430A (en) * | 2005-07-18 | 2007-01-24 | 财团法人工业技术研究院 | System and method for blind transport format detection with cyclic redundancy check |
| CN101047465A (en) * | 2006-03-27 | 2007-10-03 | 华为技术有限公司 | Signal process method, checking device and signal receiving machine |
| US20080063105A1 (en) * | 2006-09-13 | 2008-03-13 | Via Telecom, Inc. | System and method for implementing preamble channel in wireless communication system |
| US20110173518A1 (en) * | 2010-01-11 | 2011-07-14 | Samsung Electronics Co., Ltd. | Apparatus and method for determining reliabiilty of decoded data in communication system |
| CN102624404A (en) * | 2011-01-31 | 2012-08-01 | 中兴通讯股份有限公司 | Tail-biting convolutional code decoding checking method and apparatus thereof |
-
2012
- 2012-12-28 CN CN201210586891.4A patent/CN103905065B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1471677A1 (en) * | 2003-04-23 | 2004-10-27 | STMicroelectronics N.V. | Method of blindly detecting a transport format of an incident convolutional encoded signal, and corresponding convolutional code decoder |
| CN1901430A (en) * | 2005-07-18 | 2007-01-24 | 财团法人工业技术研究院 | System and method for blind transport format detection with cyclic redundancy check |
| CN101047465A (en) * | 2006-03-27 | 2007-10-03 | 华为技术有限公司 | Signal process method, checking device and signal receiving machine |
| US20080063105A1 (en) * | 2006-09-13 | 2008-03-13 | Via Telecom, Inc. | System and method for implementing preamble channel in wireless communication system |
| US20110173518A1 (en) * | 2010-01-11 | 2011-07-14 | Samsung Electronics Co., Ltd. | Apparatus and method for determining reliabiilty of decoded data in communication system |
| CN102624404A (en) * | 2011-01-31 | 2012-08-01 | 中兴通讯股份有限公司 | Tail-biting convolutional code decoding checking method and apparatus thereof |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105763286A (en) * | 2014-12-15 | 2016-07-13 | 深圳市中兴微电子技术有限公司 | Method and device for identifying wrong detection control information |
| WO2016095569A1 (en) * | 2014-12-17 | 2016-06-23 | 深圳市中兴微电子技术有限公司 | Method and apparatus for reducing false detection rate, and storage medium |
| CN105790882A (en) * | 2014-12-17 | 2016-07-20 | 深圳市中兴微电子技术有限公司 | Method and device for reducing false detection rate |
| CN105790882B (en) * | 2014-12-17 | 2019-04-30 | 深圳市中兴微电子技术有限公司 | A kind of method and device reducing false detection rate |
| CN111294060A (en) * | 2019-02-28 | 2020-06-16 | 展讯通信（上海）有限公司 | Voice information decoding method and device |
| CN110618961A (en) * | 2019-08-22 | 2019-12-27 | 苏州浪潮智能科技有限公司 | Method and device for realizing command verification of UBM (universal UBM management module) backplane |
| CN110618961B (en) * | 2019-08-22 | 2021-04-27 | 苏州浪潮智能科技有限公司 | Method and device for realizing command verification of UBM (universal UBM management module) backplane |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103905065B (en) | 2017-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104052573B (en) | Decoding apparatus and relative decoding method | |
| RU2452101C2 (en) | Decoding scheme using multiple hypotheses about transmitted messages | |
| CN102281123B (en) | Method for detecting the validity of downlink control information, decoder and baseband receiver for performing same | |
| CN104579369B (en) | A kind of Turbo iterative decodings method and code translator | |
| CN103905065A (en) | Convolutional code decoding method and device | |
| US20070153693A1 (en) | Transport format detecting apparatus and method | |
| CN105763286A (en) | Method and device for identifying wrong detection control information | |
| CN111224676A (en) | Self-adaptive serial offset list polarization code decoding method and system | |
| WO2016095569A1 (en) | Method and apparatus for reducing false detection rate, and storage medium | |
| CN111726125B (en) | Error-containing concatenated code identification method based on template matching | |
| CN100438391C (en) | Blind transport format detection for a transmission link | |
| KR101462211B1 (en) | Apparatus and method for decoding in portable communication system | |
| EP2696527B1 (en) | Improved blind transport format detection depending on the conditions of reception of the signal | |
| CN104702370B (en) | A kind of method and apparatus reducing convolutional code decoding flase drop | |
| EP2605410B1 (en) | Channel decoding method and tail biting convolutional decoder | |
| CN103746773A (en) | Method and system for correcting errors of decoded data by using UMTS (Universal Mobile Telecommunications System) receiver | |
| CN112994836B (en) | Detection method, detection device, terminal and storage medium | |
| CN112702141B (en) | Adjustable serial offset list polar code decoding method and device | |
| CN108039935B (en) | Channel coding identification method based on maximum likelihood decoding | |
| EP1387516A1 (en) | Blind transport format detection in spread spectrum receivers | |
| JP3979266B2 (en) | Blind rate detection device, decoding device, communication device, blind rate detection method and decoding method | |
| CN102857233B (en) | Interpretation method and device | |
| CN110460339B (en) | Method and device for detecting convolutional code decoding, storage medium and electronic equipment | |
| CN103095392B (en) | Iterative decoding method and communicator thereof | |
| CN103378943B (en) | The method and apparatus and interpretation method and decoder of verification code word validity |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20191111 Address after: 300450 1-1-609-a, North Zone, financial and Trade Center, 6865 Asia Road, Tianjin Free Trade Zone (Dongjiang Free Trade Port Area), Binhai New Area, Tianjin Patentee after: Huiyi finance leasing (Tianjin) Co., Ltd Address before: 201206 No. 1258 Mingyue Road, Shanghai, Pudong New Area Patentee before: Leadcore Technology Co., Ltd. |
|
| TR01 | Transfer of patent right | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20140702 Assignee: Leadcore Technology Co., Ltd. Assignor: Huiyi finance leasing (Tianjin) Co., Ltd Contract record no.: X2020990000002 Denomination of invention: Convolutional code decoding method and device Granted publication date: 20170613 License type: Exclusive License Record date: 20200103 |
|
| EE01 | Entry into force of recordation of patent licensing contract | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220309 Address after: 201206 Ming Yue Road, Pudong New Area, Shanghai, No. 1258 Patentee after: LEADCORE TECHNOLOGY Co.,Ltd. Address before: 300450 1-1-609-a, north area of financial and Trade Center, No. 6865, Asia Road, Tianjin pilot free trade zone (Dongjiang Bonded Port Area), Binhai New Area, Tianjin Patentee before: Huiyi finance leasing (Tianjin) Co.,Ltd. |
|
| TR01 | Transfer of patent right |