CN102832953A - Convolutional code decoding method and device - Google Patents
Convolutional code decoding method and device Download PDFInfo
- Publication number
- CN102832953A CN102832953A CN2011101626502A CN201110162650A CN102832953A CN 102832953 A CN102832953 A CN 102832953A CN 2011101626502 A CN2011101626502 A CN 2011101626502A CN 201110162650 A CN201110162650 A CN 201110162650A CN 102832953 A CN102832953 A CN 102832953A
- Authority
- CN
- China
- Prior art keywords
- data
- convolutional code
- binary
- decoded
- convolution
- 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
Abstract
The invention discloses a convolutional code decoding method and a convolutional code decoding device, wherein the convolutional code decoding method comprises the steps of generating a convolutional code decoding table, which comprises to-be-coded binary data and binary convolutional codes corresponding to the binary data, and decoding the to-be-decoded data according to the convolutional code decoding table. According to the convolutional code decoding method and the device, the problems that the existing decoding method is complex to realize, and has heavy computation are solved, and the effects of realizing simply, reducing decoding calculations and improving decoding speed are achieved.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of convolutional code decoder method and device.
Background technology
Convolution code is widely used in communication field to be had, and is a kind of good channel coded system.The convolution coding mode is to weave into n bit to k information bit, but because k and n are very little usually, is suitable for especially can effectively reducing encoding time delay with series form transmission information.
In convolution coding, when encoder for convolution codes was compiled k information code element for n code element, this n code element was not only individual information-related with the k of present segment, and relevant with (m-1) segment information of front, and wherein, m is the constraint length of coding.
Equally, in the convolutional code decoder process, extract decoding information in the code character of not only from then on constantly receiving, but also extract for information about in each code character of constantly receiving before will utilizing or later on.At present, convolutional code decoder method commonly used generally has: algebraic decoding, Viterbi decoding and sequential decoding.Algebraic decoding is to regard the sign indicating number section of an encoding constraint length of convolution code as [n0 (m+1); K0 (m+1)] linear block codes; Each basis (m+1) branch head receives numeral, and the message digit in corresponding that branch is the earliest estimated, pushes ahead a branch then; Viterbi decoding is on the trrellis diagram of sign indicating number, to find out one according to receiving sequence to be minimum a kind of algorithm with receiving sequence distance (or other are measured), it with operational research in ask the algorithm of shortest path similar; Sequential decoding is according to receiving sequence and coding rule, and search (both can advance, and also can retreat) goes out an a kind of algorithm with receiving sequence distance (or other are measured) minimum in whole code tree.
But that above-mentioned coding/decoding method is realized when carrying out convolutional code decoder is complicated, operand is big.Especially at some channel condition preferably under the situation, these realize that the coding/decoding method complicated, that operand is big can cause bigger burden to system.
Summary of the invention
Main purpose of the present invention is to provide a kind of convolutional code decoder method and device, realizes the problem complicated, that operand is big to solve above-mentioned existing coding/decoding method at least.
According to an aspect of the present invention, a kind of convolutional code decoder method is provided, has comprised: generate the convolutional code decoder table, this convolutional code decoder table comprises the Binary Convolutional Code that binary data to be encoded is corresponding with this binary data; Treating decoded data according to the convolutional code decoder table decodes.
Preferably, the step that generates the convolutional code decoder table comprises: begin from the first place of convolution code list entries, generate the record of the said convolutional code decoder table corresponding with each according to each of list entries successively; Wherein, the record according to a generation of the list entries convolutional code decoder table corresponding with this comprises: with a binary data that converts the length that meets binary system convolutional encoding rule request into of list entries; Generate the corresponding Binary Convolutional Code of this binary data according to the Binary Convolutional Code coding rule; This Binary Convolutional Code and this binary data storage are arrived the convolutional code decoder table.
Preferably, Binary Convolutional Code is with decimal system form, perhaps octal system form, and perhaps the hexadecimal form stores the convolutional code decoder table into.
Preferably, treating the step that decoded data decodes according to the convolutional code decoder table comprises: the convolution code data that from data to be decoded, read length successively and be the length of Binary Convolutional Code coding rule requirement are decoded; Wherein, the convolution code data that once read are decoded comprise: reading length is the convolution code data of the length of Binary Convolutional Code coding rule requirement; According to the convolution code data in the convolutional code decoder table and the corresponding relation of binary data, this Binary Convolutional Code that reads is decoded.
Preferably; When Binary Convolutional Code with decimal system form; Perhaps octal system form, when perhaps the hexadecimal form was represented, the said convolution code data that once read are decoded to be comprised: reading length was the convolution code data of the length of Binary Convolutional Code coding rule requirement; With this convolution code data transaction that reads is decimal data, perhaps octal data, perhaps hexadecimal data; According in the convolutional code decoder table, with decimal system form, perhaps octal system form, perhaps the convolution code data represented of hexadecimal form and the corresponding relation of binary data are decoded to this convolution code that reads.
Preferably; From said data to be decoded, reading successively before length is the convolution code data of the length of the Binary Convolutional Code coding rule requirement step of decoding; Also comprise: for data to be decoded are set up the binary decoded data register of n+k-1 position, and all to compose initial value be 0; Wherein, n representes the figure place of convolution code output sequence, and k representes constraint length.
Preferably, this convolutional code decoder method also comprises: data behind the segmentation decoding and the data in the corresponding binary decoded data register are carried out addition or exclusive disjunction mutually.
Preferably, this convolutional code decoder method also comprises: the data to be decoded after decoding is accomplished, and k-1 position before clipping, wherein, preceding k-1 position is corresponding to the initial value of the encoder for convolution codes that generates Binary Convolutional Code, and k representes constraint length.
Preferably, this convolutional code decoder method is applied to the error rate less than 10
-6Channel condition under.
Preferably, to be applied to the error rate be under 0 the channel condition to this convolutional code decoder method.
According to a further aspect in the invention, a kind of convolutional code decoder device is provided, has comprised: generation module, be used to generate the convolutional code decoder table, this convolutional code decoder table comprises the Binary Convolutional Code that binary data to be encoded is corresponding with this binary data; Decoder module is used for treating decoded data according to the convolutional code decoder table and decodes.
Through the present invention; Adopt and generate the convolution coding table corresponding with former data; And then treat decoded data according to this convolution coding table and decode, make that table look-at can obtain the former data corresponding with data to be decoded when decoding; Solved existing coding/decoding method and realized the problem complicated, that operand is big, so reached realize simple, reduce the decoding operation amount, improve the effect of decoding speed.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, and illustrative examples of the present invention and explanation thereof are used to explain the present invention, do not constitute improper qualification of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart of steps according to a kind of convolutional code decoder method of the embodiment of the invention one;
Fig. 2 is that a kind of constraint length in embodiment illustrated in fig. 1 is the sketch map of the Binary Convolutional Code encoder of k;
Fig. 3 is the flow chart of steps according to the generation method of a kind of 1/2 code check decoding table of the embodiment of the invention two;
Fig. 4 is the flow chart of steps corresponding to the convolutional code decoder method of 1/2 code check decoding table in embodiment illustrated in fig. 3 two;
Fig. 5 is the flow chart of steps according to the generation method of a kind of 2/3 code check decoding table of the embodiment of the invention three;
Fig. 6 is the flow chart of steps corresponding to the convolutional code decoder method of 2/3 code check decoding table in embodiment illustrated in fig. 5 three;
Fig. 7 is the flow chart of steps according to the generation method of a kind of 3/4 code check decoding table of the embodiment of the invention four;
Fig. 8 is the flow chart of steps corresponding to the convolutional code decoder method of 3/4 code check decoding table in embodiment illustrated in fig. 7 four;
Fig. 9 is the structured flowchart according to a kind of convolutional code decoder device of the embodiment of the invention five;
Figure 10 is the structural representation according to a kind of convolutional code decoder device of the embodiment of the invention six.
Embodiment
Hereinafter will and combine embodiment to specify the present invention with reference to accompanying drawing.Need to prove that under the situation of not conflicting, embodiment and the characteristic among the embodiment among the application can make up each other.
Embodiment one
With reference to Fig. 1, show flow chart of steps according to a kind of convolutional code decoder method of the embodiment of the invention one.
The convolutional code decoder method of present embodiment may further comprise the steps:
Step S102: generate the convolutional code decoder table;
Wherein, the convolutional code decoder table comprises binary data to be encoded and its corresponding Binary Convolutional Code.
Each bar record comprises the Binary Convolutional Code that a binary data is corresponding with this binary data at least in the convolutional code decoder table; Binary Convolutional Code can be represented with the form of original shape; Also can represent, certainly, be not limited thereto with forms such as the decimal system, octal system, hexadecimals; Those skilled in the art also can adopt other appropriate format performance Binary Convolutional Code, and the present invention does not limit this.
Binary data in the convolutional code decoder table is got by former data to be encoded; For example; All convert in the former data to be encoded each into suitable binary data, there is one-to-one relationship in Binary Convolutional Code and this binary data that generates through convolution coding that then converts in the former data behind the binary data.Rely on this corresponding relation just, realize the decoding of data to be decoded.
In actual use, the Binary Convolutional Code encoder that data is carried out convolution coding can be as shown in Figure 2, and the constraint length of this encoder for convolution codes is k, and is as shown in table 1 through the Binary Convolutional Code of this encoder output.
Table 1
| Code check | 1/2 | 2/3 | 3/4 |
| |
1 | 10 | 101 |
| |
1 | 11 | 110 |
| XY | X0Y0 | X0Y0Y1 | X0Y0Y1X2 |
Step S104: treat decoded data according to the convolutional code decoder table and decode.
In this step,, realize the decoding of data to be decoded according to the corresponding relation of Binary Convolutional Code and binary data in the convolutional code decoder table.
In the correlation technique, existing coding/decoding method because of on have certain error correcting capability, be used under the channel condition that actual communication exists noise, interference or decline more.But that existing coding/decoding method is realized when carrying out convolutional code decoder is complicated, operand is big.Especially, under some application scenarios (like agreement, signaling test), channel condition is better, and in general, channel bit error rate is less than 10
-6, perhaps the error rate is 0 o'clock, and error correcting capability is not had special demands, at this moment, the convolutional code decoder that existing coding/decoding method causes is realized, and problem complicated, that operand is big is just more obvious.Pass through present embodiment; Adopt and generate the convolution coding table corresponding with former data; And then treat decoded data according to this convolution coding table and decode, make that table look-at can obtain the former data corresponding with data to be decoded when decoding; Solved existing coding/decoding method and realized the problem complicated, that operand is big, so reached realize simple, reduce the decoding operation amount, improve the effect of decoding speed.
Embodiment two
1/2 code check is adopted in the convolution code output of present embodiment, and the Binary Convolutional Code in the convolutional code decoder table adopts decimal system form, and the constraint length of setting the Binary Convolutional Code encoder of present embodiment is k.The convolutional code decoder method of present embodiment mainly comprises two parts, and a part is the generation of 1/2 code check decoding table, and a part is the realization of the convolutional code decoder device that uses look-up table, below describes respectively.
With reference to Fig. 3, show flow chart of steps according to the generation method of a kind of 1/2 code check decoding table of the embodiment of the invention two, may further comprise the steps:
Step S302: set pointer i=0.
Wherein, pointer i is used for indicating of convolution code list entries, when initial, is set to 0, i.e. the first place of convolution code list entries.
Step S304: with the data transaction of i indication is (2k-2) bit x.
Step S306: with this binary number x input encoder for convolution codes, wherein before the k position be used for k register of initialization encoder for convolution codes.
Step S308: through obtaining the Binary Convolutional Code of (2k-2) position 1/2 code check after (k-1) inferior input.
This (2k-2) position Binary Convolutional Code has relation one to one with (2k-2) position original binary number that generates it, utilizes this corresponding relation can realize the decoding of convolution code.
Wherein, the input of step S306 is included in (k-1) inferior input as once input.
Step S310: convert this (2k-2) position Binary Convolutional Code into decimal system sequence number y.
Step S312: (2k-2) bit x write sequence number is the row of y in the convolutional code decoder table.
Step S314: pointer i+1, and relatively whether i+1 equals 2
2 (k-1), as be not equal to, return top step S304, generate residue row in the convolutional code decoder table; As equating, explain that the convolutional code decoder table fills up, decoding table is accomplished.
Corresponding with 1/2 code check decoding table, the steps flow chart corresponding to the convolutional code decoder method of 1/2 code check decoding table of present embodiment is as shown in Figure 4.Suppose that data length to be decoded is the 2n position, the decoder that uses 1/2 code check decoding table to realize carries out the convolutional code decoder process and comprises:
Step S402: set up n+k-1 position binary decoded data register, and all compose initial value 0.
In this step, because of bit rate output is 1/2, be the 2n position by data length to be decoded, the figure place that can learn the convolution code output sequence of present embodiment is the n position.
Step S404: build two pointer i and j, and compose initial value 0.
Wherein, pointer i is used to indicate data to be decoded, and pointer j is used to indicate the decoded data register.
Step S406: from data to be decoded, take out continuous (2k-2) bit since the i position.
Step S408: convert this (2k-2) bit into decimal system sequence number.
Step S410: in 1/2 code check decoding table, find corresponding (2k-2) position original binary data with this decimal system sequence number.
Step S412: with in this (2k-2) position original binary data and the decoded data register since continuous (2k-2) bit register addition of j position (or binary system mutually or).
This step is an optional step, can improve the accuracy rate of decoded data through this step.
Step S414: pointer i+2k-2, and relatively whether (i+2k-2) equals 2n, and if not, execution in step S416; If, execution in step S418 then.
Step S416: comparative result is not, pointer i+2, and pointer j+1 returns step S406, continues the decoding of remaining data.
Step S418: comparative result explains then that for being data to be decoded have traveled through, and continues subsequent treatment.
Step S420: the preceding k-1 position (these several is the initial value of encoder for convolution codes, no matter tail biting codes whether all can be ignored) of clipping the decoded data register.
Step S422: 0 of residue decoded data register divided by k, and 1 divided by (k+1) ... (k-3) position is divided by (2k-3), and (k-2) position to (n-2k+2) position is divided by (2k-2), and (n-2k+3) position is divided by (2k-3); (n-2) position is divided by 2, and (n-1) divided by 1, everybody gets immediate integer and promptly obtains n position decoded data then.
Need to prove that this step is an optional step, if step S412 use be binary system mutually or, then step S420 can obtain complete decoded data, thus this step can be omitted.
Embodiment three
2/3 code check is adopted in the convolution code output of present embodiment, and the Binary Convolutional Code in the convolutional code decoder table adopts decimal system form, and the constraint length of setting the Binary Convolutional Code encoder of present embodiment is k.The generation of 2/3 code check decoding table of present embodiment is as shown in Figure 5, and similar with 1/2 code check decoding table generating method among the embodiment two, just original binary data length becomes (3k-3), and the line number of table becomes 2
3 (k-1)Use the convolutional code decoder of look-up table as shown in Figure 6, below describe respectively.
With reference to Fig. 5, show flow chart of steps according to the generation method of a kind of 2/3 code check decoding table of the embodiment of the invention three, may further comprise the steps:
Step S502: set pointer i=0.
Wherein, pointer i is used for indicating of convolution code list entries, when initial, is set to 0, i.e. the first place of convolution code list entries.
Step S504: with the data transaction of i indication is (3k-3) bit x.
Step S506: with this binary number x input encoder for convolution codes, wherein before the k position be used for k register of initialization encoder for convolution codes.
Step S508: then with x follow-up everybody by bit input encoder for convolution codes after, can obtain the Binary Convolutional Code of (3k-3) position 2/3 code check.
Step S510: convert this (3k-3) position Binary Convolutional Code into decimal system sequence number y.
Step S512: (3k-3) bit x write sequence number is the row of y in the convolutional code decoder table.
Step S514: pointer i+1, and relatively whether i+1 equals 2
3 (k-1), as be not equal to, return top step S504, generate residue row in the convolutional code decoder table; As equating, explain that the convolutional code decoder table fills up, decoding table is accomplished.
Corresponding with 2/3 code check decoding table, the steps flow chart corresponding to the convolutional code decoder method of 2/3 code check decoding table of present embodiment is as shown in Figure 6.Suppose that data length to be decoded is the 3n position, the decoder that uses 2/3 code check decoding table to realize carries out the convolutional code decoder process and comprises:
Step S602: set up 2n+k-1 position binary decoded data register, and all compose initial value 0.
In this step, because of bit rate output is 2/3, be the 3n position by data length to be decoded, the figure place that can learn the convolution code output sequence of present embodiment is the 2n position.
Step S604: build two pointer i and j, and compose initial value 0.
Wherein, pointer i is used to indicate data to be decoded, and pointer j is used to indicate the decoded data register.
Step S606: from data to be decoded, take out continuous (3k-3) bit since the i position.
Step S608: convert this (3k-3) bit into decimal system sequence number.
Step S610: in 2/3 code check decoding table, find corresponding (3k-3) position original binary data with this decimal system sequence number.
Step S612: with in this (3k-3) position original binary data and the decoded data register since continuous (3k-3) of j position carry out binary system mutually or.
This step is an optional step, can improve the accuracy rate of decoded data through this step.
Step S614: pointer i+3k-3, and relatively whether (i+3k-3) equals 3n, and if not, execution in step S616; If, execution in step S618 then.
Step S616: comparative result is not, pointer i+3, and pointer j+2 returns step S606, continues the decoding of remaining data.
Step S618: comparative result explains then that for being data to be decoded have traveled through, and continues subsequent treatment.
Step S620: the preceding k-1 position (these several is the initial value of encoder for convolution codes, no matter tail biting codes whether all can be ignored) of clipping the decoded data register.
Embodiment four
3/4 code check is adopted in the convolution code output of present embodiment, and the Binary Convolutional Code in the convolutional code decoder table adopts decimal system form, and the constraint length of setting the Binary Convolutional Code encoder of present embodiment is k.The generation of 3/4 code check decoding table of present embodiment is as shown in Figure 7, and similar with 1/2 code check decoding table generating method among the embodiment two, just original binary data length becomes (4k-4) in the table, and the line number of table becomes 2
4 (k-1)Use the convolutional code decoder of look-up table as shown in Figure 8, below describe respectively.
With reference to Fig. 7, show flow chart of steps according to the generation method of a kind of 3/4 code check decoding table of the embodiment of the invention three, may further comprise the steps:
Step S702: set pointer i=0.
Wherein, pointer i is used for indicating of convolution code list entries, when initial, is set to 0, i.e. the first place of convolution code list entries.
Step S704: with the data transaction of i indication is (4k-4) bit x.
Step S706: with this binary number x input encoder for convolution codes, wherein before the k position be used for k register of initialization encoder for convolution codes.
Step S708: then with x follow-up everybody by bit input encoder for convolution codes after, can obtain the Binary Convolutional Code of (4k-4) position 3/4 code check.
Step S710: convert this (4k-4) position Binary Convolutional Code into decimal system sequence number y.
Step S712: (4k-4) bit x write sequence number is the row of y in the convolutional code decoder table.
Step S714: pointer i+1, and relatively whether i+1 equals 2
4 (k-1), as be not equal to, return top step S704, generate residue row in the convolutional code decoder table; As equating, explain that the convolutional code decoder table fills up, decoding table is accomplished.
Corresponding with 3/4 code check decoding table, the steps flow chart corresponding to the convolutional code decoder method of 3/4 code check decoding table of present embodiment is as shown in Figure 8.Suppose that data length to be decoded is the 4n position, the decoder that uses 3/4 code check decoding table to realize carries out the convolutional code decoder process and comprises:
Step S802: set up 3n+k-1 position binary decoded data register, and all compose initial value 0.
In this step, because of bit rate output is 3/4, be the 4n position by data length to be decoded, the figure place that can learn the convolution code output sequence of present embodiment is the 3n position.
Step S804: build two pointer i and j, and compose initial value 0.
Wherein, pointer i is used to indicate data to be decoded, and pointer j is used to indicate the decoded data register.
Step S806: from data to be decoded, take out continuous (4k-4) bit since the i position.
Step S808: convert this (4k-4) bit into decimal system sequence number.
Step S810: in 3/4 code check decoding table, find corresponding (4k-4) position original binary data with this decimal system sequence number.
Step S812: with in this (4k-4) position original binary data and the decoded data register since continuous (4k-4) of j position carry out binary system mutually or.
This step is an optional step, can improve the accuracy rate of decoded data through this step.
Step S814: pointer i+4k-4, and relatively whether (i+4k-4) equals 4n, and if not, execution in step S816; If, execution in step S818 then.
Step S816: comparative result is not, pointer i+4, and pointer j+3 returns step S806, continues the decoding of remaining data.
Step S818: comparative result explains then that for being data to be decoded have traveled through, and continues subsequent treatment.
Step S820: the preceding k-1 position (these several is the initial value of encoder for convolution codes, no matter tail biting codes whether all can be ignored) of clipping the decoded data register.
Embodiment five
With reference to Fig. 9, show structured flowchart according to a kind of convolutional code decoder device of the embodiment of the invention five.
The convolutional code decoder device of present embodiment comprises: generation module 902, be used to generate the convolutional code decoder table, and this convolutional code decoder table comprises binary data to be encoded and its corresponding Binary Convolutional Code; Decoder module 904 is used for treating decoded data according to the convolutional code decoder table and decodes.
Preferably, generation module 902 begins from the first place of convolution code list entries, successively according to each generation of list entries and the record of said each corresponding convolutional code decoder table; Wherein, the record according to a generation of the list entries convolutional code decoder table corresponding with this comprises: with a binary data that converts the length that meets binary system convolutional encoding rule request into of list entries; Generate the corresponding Binary Convolutional Code of this binary data according to the Binary Convolutional Code coding rule; This Binary Convolutional Code and this binary data storage are arrived the convolutional code decoder table.
Preferably, Binary Convolutional Code is with decimal system form, perhaps octal system form, and perhaps the hexadecimal form stores the convolutional code decoder table into.
Preferably, from data to be decoded, to read length successively be that the convolution code data of the length of Binary Convolutional Code coding rule requirement are decoded to decoder module 904; Wherein, the convolution code data that once read are decoded comprise: reading length is the convolution code data of the length of Binary Convolutional Code coding rule requirement; According to the convolution code data in the convolutional code decoder table and the corresponding relation of binary data, this Binary Convolutional Code that reads is decoded.
Preferably; When Binary Convolutional Code with decimal system form; Perhaps octal system form, when perhaps the hexadecimal form was represented, the convolution code data that 904 pairs of decoder modules once read were decoded and comprised: reading length is the convolution code data of the length of Binary Convolutional Code coding rule requirement; With this convolution code data transaction that reads is decimal data, perhaps octal data, perhaps hexadecimal data; According in the convolutional code decoder table, with decimal system form, perhaps octal system form, perhaps the convolution code data represented of hexadecimal form and the corresponding relation of binary data are decoded to this convolution code that reads.
Preferably; The convolutional code decoder device of present embodiment also comprises: set up module; Being used for reading length successively from data to be decoded at decoder module 904 is before the convolution code data of the length of Binary Convolutional Code coding rule requirement are decoded; For data to be decoded are set up the binary decoded data register of n+k-1 position, and all to compose initial value be 0; Wherein, n representes the figure place of convolution code output sequence, and k representes constraint length.
Preferably, the convolutional code decoder device of present embodiment also comprises: the verification module is used for the data behind the segmentation decoding and the data of corresponding binary decoded data register are carried out addition or exclusive disjunction mutually.
Preferably, the convolutional code decoder device of present embodiment also comprises: interception module is used for the data to be decoded after the decoding completion; K-1 position before clipping; Wherein, preceding k-1 position is corresponding to the initial value of the encoder for convolution codes that generates Binary Convolutional Code, and k representes constraint length.
Preferably, the convolutional code decoder device of present embodiment is applied to the error rate less than 10
-6Channel condition under.More preferably, to be applied to the error rate be under 0 the channel condition to the convolutional code decoder device of present embodiment.
The convolutional code decoder device of present embodiment carries out the method for convolutional code decoder can be with reference to aforementioned correlation method embodiment, and has the effect of aforementioned correlation method embodiment, repeats no more at this.
Embodiment six
With reference to Figure 10, show structural representation according to a kind of convolutional code decoder device of the embodiment of the invention six.
The convolutional code decoder device of present embodiment comprises:
Use the convolutional code decoder device of present embodiment; When realizing convolutional code decoder with look-up table; It is subsequent use at first to generate convolutional code decoder table 1008 with convolution coder 1002, and the convolutional code decoder table comprises binary data to be encoded and its corresponding Binary Convolutional Code, wherein; Binary Convolutional Code can represent with any suitable form, like decimal system form etc.; Then, import data 1004 to be decoded, decode, reduction initial data, i.e. decoded data 1006 with convolutional code decoder table 1008.
The detailed process that the convolutional code decoder device of use present embodiment is decoded can be with reference to aforementioned correlation method embodiment; And has the effect of aforementioned correlation method embodiment; Simultaneously; The corresponding component of the convolutional code decoder device of present embodiment also can be done preferred setting with reference to the corresponding module of embodiment five, all repeats no more at this.
Need to prove; The a plurality of embodiment of the present invention are that example describes with 1/2,2/3 or 3/4 bit rate output all; But be not limited thereto, those skilled in the art can apply the present invention to the scene of other bit rate output with reference to a plurality of embodiment of the present invention; Like scene of 5/6 bit rate output etc., the present invention does not limit this.
From above description; Can find out; The invention provides a kind of look-up table and realize the technical scheme of convolutional code decoder; Be particularly useful for some application scenarios (like agreement, signaling test) and possess under the good channel condition, what special requirement is error correcting capability do not had, as long as can decode with regard to passable situation simply, quickly and accurately.Adopt scheme of the present invention, the problem that the realization that existed when having overcome convolutional code decoder in the prior art is complicated, operand is big, reached realize simple, reduced operand, improved the effect of decoding speed.
Obviously, it is apparent to those skilled in the art that above-mentioned each module of the present invention or each step can realize with the general calculation device; They can concentrate on the single calculation element; Perhaps be distributed on the network that a plurality of calculation element forms, alternatively, they can be realized with the executable program code of calculation element; Thereby; Can they be stored in the storage device and carry out, and in some cases, can carry out step shown or that describe with the order that is different from here by calculation element; Perhaps they are made into each integrated circuit modules respectively, perhaps a plurality of modules in them or step are made into the single integrated circuit module and realize.Like this, the present invention is not restricted to any specific hardware and software combination.
The above is merely the preferred embodiments of the present invention, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1. a convolutional code decoder method is characterized in that, comprising:
Generate the convolutional code decoder table, said convolutional code decoder table comprises binary data to be encoded and the corresponding Binary Convolutional Code of said binary data;
Treating decoded data according to said convolutional code decoder table decodes.
2. method according to claim 1 is characterized in that, the step of said generation convolutional code decoder table comprises:
Begin from the first place of convolution code list entries, successively according to each generation of said list entries and the record of said each corresponding said convolutional code decoder table;
Wherein, the record according to a generation of the said list entries said convolutional code decoder table corresponding with this comprises: with a binary data that converts the length that meets binary system convolutional encoding rule request into of said list entries; Generate the corresponding Binary Convolutional Code of this binary data according to said Binary Convolutional Code coding rule; This Binary Convolutional Code and this binary data storage are arrived said convolutional code decoder table.
3. method according to claim 2 is characterized in that, said Binary Convolutional Code is with decimal system form, perhaps octal system form, and perhaps the hexadecimal form stores said convolutional code decoder table into.
4. method according to claim 1 is characterized in that, treats the step that decoded data decodes according to said convolutional code decoder table and comprises:
From said data to be decoded, reading length successively and be the convolution code data of the length of said Binary Convolutional Code coding rule requirement decodes;
Wherein, the said convolution code data that once read are decoded comprise: reading length is the convolution code data of the length of said Binary Convolutional Code coding rule requirement; According to the convolution code data in the said convolutional code decoder table and the corresponding relation of binary data, this said Binary Convolutional Code that reads is decoded.
5. method according to claim 1 is characterized in that, when said Binary Convolutional Code with decimal system form, perhaps octal system form, when perhaps the hexadecimal form was represented, the said said convolution code data that once read are decoded comprised:
Reading length is the convolution code data of the length of said Binary Convolutional Code coding rule requirement;
With this convolution code data transaction that reads is decimal data, perhaps octal data, perhaps hexadecimal data;
According in the said convolutional code decoder table, with decimal system form, perhaps octal system form, perhaps the convolution code data represented of hexadecimal form and the corresponding relation of binary data are decoded to this convolution code that reads.
6. according to claim 4 or 5 described methods, it is characterized in that, from said data to be decoded, read successively before length is the convolution code data of the length of the said Binary Convolutional Code coding rule requirement step of decoding, also comprise said:
For said data to be decoded are set up the binary decoded data register of n+k-1 position, and all to compose initial value be 0; Wherein, n representes the figure place of convolution code output sequence, and k representes constraint length.
7. method according to claim 6 is characterized in that, also comprises:
Data behind the segmentation decoding and the data in the corresponding said binary decoded data register are carried out addition or exclusive disjunction mutually.
8. according to claim 4 or 5 described methods, it is characterized in that, also comprise:
To the data said to be decoded after the decoding completion, k-1 position before clipping, wherein, preceding k-1 position is corresponding to the initial value of the encoder for convolution codes that generates said Binary Convolutional Code, and k representes constraint length.
9. according to each described method of claim 1 to 5, it is characterized in that said method is applied under the channel condition of the error rate less than 10-6.
10. method according to claim 9 is characterized in that, it is under 0 the channel condition that said method is applied to the error rate.
11. a convolutional code decoder device is characterized in that, comprising:
Generation module is used to generate the convolutional code decoder table, and said convolutional code decoder table comprises binary data to be encoded and the corresponding Binary Convolutional Code of said binary data;
Decoder module is used for treating decoded data according to said convolutional code decoder table and decodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110162650.2A CN102832953B (en) | 2011-06-16 | 2011-06-16 | Convolutional code decoder method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110162650.2A CN102832953B (en) | 2011-06-16 | 2011-06-16 | Convolutional code decoder method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102832953A true CN102832953A (en) | 2012-12-19 |
| CN102832953B CN102832953B (en) | 2017-12-12 |
Family
ID=47335942
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110162650.2A Active CN102832953B (en) | 2011-06-16 | 2011-06-16 | Convolutional code decoder method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102832953B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105721105A (en) * | 2016-01-22 | 2016-06-29 | 广州市毅航互联通信股份有限公司 | Decoding method based on byte stream |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1515079A (en) * | 2001-06-12 | 2004-07-21 | 英特尔公司 | Low complexing channel decoders |
| CN101257314A (en) * | 2007-02-27 | 2008-09-03 | 恩益禧电子股份有限公司 | Viterbi decoding system and viterbi decoding method |
-
2011
- 2011-06-16 CN CN201110162650.2A patent/CN102832953B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1515079A (en) * | 2001-06-12 | 2004-07-21 | 英特尔公司 | Low complexing channel decoders |
| CN101257314A (en) * | 2007-02-27 | 2008-09-03 | 恩益禧电子股份有限公司 | Viterbi decoding system and viterbi decoding method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105721105A (en) * | 2016-01-22 | 2016-06-29 | 广州市毅航互联通信股份有限公司 | Decoding method based on byte stream |
| CN105721105B (en) * | 2016-01-22 | 2020-06-02 | 广州市毅航互联通信股份有限公司 | Decoding method based on byte stream |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102832953B (en) | 2017-12-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100454767C (en) | Turbo decoder and turbo decoding method | |
| CN101777924B (en) | Method and device for decoding Turbo codes | |
| KR20000076697A (en) | Interleaving method, Interleaving apparatus, turbo encoding method, and turbo encoding apparatus | |
| CN103370879A (en) | Power and pin efficient chip-to-chip communications with common-mode rejection and SSO resilience | |
| RU2007141938A (en) | ENTROPY CODING USING COMPACT CODE BOOKS | |
| CN101483043A (en) | Code book index encoding method based on classification, permutation and combination | |
| CN108694918A (en) | Coding method and device, coding/decoding method and device and display device | |
| CN101779379B (en) | Encoding and decoding using generalized concatenated codes (GCC) | |
| CN110278001B (en) | Polarization code partition decoding method based on deep learning | |
| CN101635611A (en) | Channel decoding method and channel decoding device | |
| JP2014510302A (en) | Encoding and decoding the pulse positions of tracks of audio signals | |
| CN101902228A (en) | Rapid cyclic redundancy check encoding method and device | |
| EP3602796A1 (en) | Polar coding with dynamic frozen bits | |
| Lai et al. | Communicating with chaos using two-dimensional symbolic dynamics | |
| CN102832953A (en) | Convolutional code decoding method and device | |
| KR20040044589A (en) | A Soft-Input Decoding Method of Reed-Muller Codes Using Majority Logic and Apparatus thereof | |
| CN102377438B (en) | Channel decoding method and tail biting convolutional decoder | |
| CN102244555B (en) | Blind identification method for coding parameter of Turbo code | |
| JP2008199100A (en) | Device for decoding variable length code | |
| CN104901774B (en) | interleaving mapping method and de-interleaving de-mapping method of LDPC code words | |
| CN102811066B (en) | Syndrome calculating device and decoder | |
| CN101695002B (en) | Coding circuit based on Reed-Solomon code | |
| CN102118225B (en) | Coding-decoding method used for any-bit polynomial division type codes based on multi-index table | |
| CN110784287B (en) | Interleaving mapping method and de-interleaving de-mapping method of LDPC code words | |
| JP6445890B2 (en) | Communication method and communication system |
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 |