CN101179544B - Sequence type decoding method and device - Google Patents

Sequence type decoding method and device Download PDF

Info

Publication number
CN101179544B
CN101179544B CN2006101444202A CN200610144420A CN101179544B CN 101179544 B CN101179544 B CN 101179544B CN 2006101444202 A CN2006101444202 A CN 2006101444202A CN 200610144420 A CN200610144420 A CN 200610144420A CN 101179544 B CN101179544 B CN 101179544B
Authority
CN
China
Prior art keywords
path
decoding
code word
variable
minimum variable
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.)
Expired - Fee Related
Application number
CN2006101444202A
Other languages
Chinese (zh)
Other versions
CN101179544A (en
Inventor
谢欣霖
陈伯宁
韩永祥
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sunplus Technology Co Ltd
Original Assignee
Sunplus Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sunplus Technology Co Ltd filed Critical Sunplus Technology Co Ltd
Priority to CN2006101444202A priority Critical patent/CN101179544B/en
Publication of CN101179544A publication Critical patent/CN101179544A/en
Application granted granted Critical
Publication of CN101179544B publication Critical patent/CN101179544B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Error Detection And Correction (AREA)

Abstract

The invention provides a sequential decoding method and a decoding device. Permeating an open stack, when codeword fault is generated in an inner decoder, a group of new code wards can be generated by using multi-path storing by an open tack, thus decreasing complexity of the decoding.

Description

List type coding/decoding method and decoding device
Technical field
The invention relates to a kind of coding/decoding method, and particularly relevant for a kind of list type coding/decoding method.
Background technology
In communication system, in order to make the defeated data of tendency to develop to be communicated to receiving terminal via passage more reliably, data can be used chnnel coding when fundamental frequency signal is handled, and present chnnel coding generally includes two or more codings.Fig. 1 is the chnnel coding calcspar of transmission end of the prior art.
Please refer to Fig. 1, a message sequence b is encoded to the first code word v through external encoder 110 earlier, is being encoded to the second code word u through internal encoder 120, and through behind modulation unit 130 modulations, can transfer in the passage.Above-mentioned external encoder can utilize error-detecting code (Error Detection Code) to realize, wherein error-detecting code for example be cyclic redundancy check (CRC) code (Cyclic Redundancy Check, CRC) or parity code (Parity Check Code) or the like.Above-mentioned internal encoder can utilize error-correcting code (Error Correction Code) to realize, wherein error-correcting code is for example for comprising trellis code (Trellis code), trellis code sees through a trellis diagram (trellis diagram) and carries out encoding and decoding, and common trellis code can be convolution code (Convolution Code).
Correspond to the transmission end, also must can obtain one and finally export code word (codeword) at receiving terminal through the processing of demodulation, inner decoding and external decoder via the received signal r of channel
Figure DEST_PATH_GSB00000271195600011
(if do not having finally to export code word under the wrong situation that takes place
Figure DEST_PATH_GSB00000271195600012
Be message sequence b).
In the prior art, existing United States Patent (USP) is announced " the Generalized Viterbi Decoding Algorithms " that proposed for No. 5208816 and Nambirajan Seshadri and Carl-erik W.Sundberg at Institute of Electrical and Electronics Engineers IEEE (IEEE in 1994, Institute of Electrical and Electronic Engineers) communication proceedings (Transactions on communications) the 42nd volume the 2nd, 3,4 phase (VOL.50, NO.2/3/4) deliver the paper that name is called " List Viterbi Decoding Algorithm with Application " in, utilize Veterbi decoding (viterbi decoding) and trellis diagram to decode final output code word at receiving terminal
Figure DEST_PATH_GSB00000271195600021
Wherein, Veterbi decoding is subdivided into parallel (Parallel) Veterbi decoding and serial (Serial) Veterbi decoding again.Fig. 2 is the calcspar of the parallel Veterbi decoding of receiving terminal of the prior art, and Fig. 3 is the calcspar of receiving terminal serial Veterbi decoding of the prior art.
Please earlier with reference to Fig. 2, received signal r demodulates the first output code word through behind the demodulating unit 210 To inner decoder 220, and inner decoder 220 is found out through trellis diagram and the first output code word A similar L path, and export pairing L the second output code word
Figure DEST_PATH_GSB00000271195600024
To outer decoder 230, wherein the pairing second output code word in maximum similarity (maximum likelihood) path is
Figure DEST_PATH_GSB00000271195600025
Having the pairing code word in the second similarity path is
Figure DEST_PATH_GSB00000271195600026
By that analogy, the second output code word is divided into according to similarity
Figure DEST_PATH_GSB00000271195600027
Wherein similarity is calculated with a variable (metric).And outer decoder 230 receives L the second output code word After, will judge in regular turn whether the redundant digit (redundant bits) in the second output code word is correct, and by the second output code word Decode final output code word
Figure DEST_PATH_GSB000002711956000210
Please refer to Fig. 3, received signal r demodulates the first output code word through behind the demodulating unit 310
Figure DEST_PATH_GSB000002711956000211
To inner decoder 320, and inner decoder 320 will be found out the maximum similarity path through trellis diagram, and the pairing second output code word in output maximum similarity path
Figure DEST_PATH_GSB000002711956000212
To outer decoder 330.And outer decoder 330 will be judged the second output code word
Figure DEST_PATH_GSB000002711956000213
In redundant digit whether correct.If be judged as when correct, outer decoder 330 will be by the second output code word
Figure DEST_PATH_GSB000002711956000214
Decode final output code word
Figure DEST_PATH_GSB000002711956000215
Otherwise if when being judged as mistake, outer decoder 330 will require inner decoder 320 to export one second output code word once more
Figure DEST_PATH_GSB000002711956000216
And inner decoder 320 is being found out the second similarity path through trellis diagram, and exports the pairing second output code word in the second similarity path
Figure DEST_PATH_GSB000002711956000217
To outer decoder 330.Can cooperate inner decoder 320 and outer decoder 330 to decode final output code word with this pattern
Figure DEST_PATH_GSB000002711956000218
Yet, with parallel Veterbi decoding, in the process of decoding, must in trellis diagram, go up storage and calculate institute's extended succession path (successor path) variable by each state (state) of each sequential (level), can find out the similar path of L bar.Therefore, in practical application, parallel Veterbi decoding must spend huge operand, can export L the second output code word.In addition, no matter the quality of channel conditions, parallel Veterbi decoding all must calculate the succession path variable of all nodes in the trellis diagram and keep output L the second output code word to outer decoder, therefore, even if under the channel quality good state, parallel Veterbi decoding also can't reduce its huge operand.
With regard to the serial Veterbi decoding, though once only must export one second output code word, when practical application, still must spend huge amount of calculation, calculate and store all nodes institute extended succession path variables.And before not finding out optimal codes as yet, when outer decoder is judged the second output code character error, inner decoding must be set out by the starting point of trellis diagram again, and the survival route of making a strategic decision out on each state again, can export another second output code word again.Therefore, if realize the serial Veterbi decoding with hardware, inner decoder must spend the variable that a large amount of memory headrooms comes all paths in the memory location subgraph, with the second output code word that repeats to provide different.
Summary of the invention
Purpose of the present invention is providing a kind of list type coding/decoding method exactly, and the stored a plurality of paths of the open storehouse of utilization produce and organize the pairing code words in minimum variable paths more, with the operand and the complexity of reduction decoding, and reduce the time of decoding.
A further object of the present invention provides a kind of decoding device, utilizes the open storehouse in the inner decoder, produces the pairing code word in many group minimum variable paths in regular turn, and export outer decoder to, with the use of minimizing internal memory, and reduce hardware cost, the operand in the time of can saving decoding again.
The present invention proposes a kind of list type coding/decoding method, this coding/decoding method comprises: a decoding figure is provided in the step (a), wherein when coding decoding figure expression a plurality of paths and a plurality of node of process, a plurality of path configurations are between a plurality of nodes, and the corresponding code word of each path difference; In the step (b), the starting point (original node) of putting into decoding figure is to an open storehouse (open stack); In the step (c), according to a received signal, calculate minimum variable (metric) path in the open storehouse an end point (end node) the variable in extended a plurality of successions path (successor path); In step (d), the minimum variable path in the open storehouse of deletion; In step (e), put into and inherit the path to open storehouse; Judge in step (f) whether the minimum variable path in a plurality of successions path arrives decoding sink of graph (terminal node) in the open storehouse, if then export the pairing code word in minimum variable path; In step (g), comprise: judge whether the redundant digit (redundant bits) in the pairing code word in described minimum variable path is correct; And, then delete the described minimum variable path in the described open storehouse, and get back to step (c) if during the described redundant digit mistake in the pairing code word in described minimum variable path; If when the described redundant digit in the pairing code word in described minimum variable path was correct, the pairing code word in then described minimum variable path was an optimal codes.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein open storehouse are in order to depositing a plurality of paths, and the pairing code word in these paths has the possibility that becomes optimal codes.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein the variable of starting point is zero.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein each node among the decoding figure has a count value.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method wherein more comprises before that in step (b) count value with each node among the decoding figure is set at zero and set a maximum output number.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein step (d) more comprises: in step (d1), a particular value to this minimum that adds up is measured the count value of the aforementioned end point of path values, and wherein particular value is 1; In step (d2), the count value of judging aforementioned end point is when exporting number more than or equal to maximum, then aforementioned end point is put into a sealing storehouse, enters step (d3), otherwise, then enter step (d3); In step (d3), the minimum variable path in the open storehouse of deletion.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein step (e) more comprises: when inheriting one of them particular path of path and enter into the stored arbitrary node of sealing storehouse, get rid of this particular path; When inherit the path one of them with open storehouse in the path intersection time, get rid of the bigger path of variable; Put into remaining succession path to open storehouse; According to the size of variable, arrange the stored path of open storehouse.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein received signal sees through an external encode and an in-line coding and gets.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein in-line coding is in order to be encoded to n bit word with k data bit, and corresponding j the codeword table in path of decoding figure is shown x j, and x j∈ 0, and 1}, the temporal representation of decoding figure is l, and variable is
Figure DEST_PATH_GSB00000271195600051
Wherein k, n are natural number, and j, l are integer, φ jBe a logarithm possibility ratio, and φ jBe real number, φ jValue is log[Pr (u j| 0)/Pr (u j| 1)], and u jBe j received signal, Pr (u j| 0) expression receives u 0 the time when transmission jProbability, Pr (u j| 1) expression receives u 1 the time when transmission jProbability.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein in-line coding is in order to be encoded to n bit word with k data bit, and corresponding j the codeword table in path of decoding figure is shown x j, and x j∈ 0, and 1}, the temporal representation of decoding figure is l, and variable is Wherein k, n are natural number, and j, l are integer, φ jBe a logarithm possibility ratio, and φ jBe real number, its value is ln[Pr (u j| 0)/Pr (u j| 1)], and u jBe j received signal, Pr (u j| 0) expression receives u 0 the time when transmission jProbability, Pr (u j| 1) expression receives u 1 the time when transmission jProbability.y jBe a rigid decision value, and work as φ j, judge y at＜0 o'clock j=1, work as φ j, judge y at 〉=0 o'clock j=0.
Described according to the preferred embodiments of the present invention, above-mentioned list type coding/decoding method, wherein decoding figure comprises trellis diagram and arborescence or the like.
The present invention reintroduces a kind of decoding device, and in order to received signal is decoded a final output code word, the decoding device of receiver comprises an inner decoder and an outer decoder.This inner decoder is utilized a decoding figure, and set out by a starting point of decoding figure, and utilize an open storehouse store the path of process, when arriving arbitrary node of decoding figure, only select to advance by the minimum variable path in the open storehouse, and according to received signal, calculate the variable in extended a plurality of successions path, and store a plurality of successions path to open storehouse, when the minimum variable path in the open storehouse arrives the Shu terminal point of decoding figure, inner decoder will be exported the pairing code word in minimum variable path.This outside decoder receives the pairing code word in minimum variable path, in order to decoding and judge whether the pairing code word in minimum variable path is correct, and the final output of output code word.When outer decoder is judged the pairing code word mistake in minimum variable path, inner decoder is got rid of the minimum variable path in the open storehouse, and replace minimum variable path by particular path one of in the open storehouse, wherein, particular path has time little variable in open storehouse.And inner decoder will continue to be set out by the end point in minimum variable path, when arriving the decoding sink of graph in minimum variable path, again export the pairing code word in minimum variable path to outer decoder, judge that up to outer decoder the pairing code word in minimum variable path is for correct.
Described according to the preferred embodiments of the present invention, above-mentioned decoding device, wherein received signal sees through an external encode and an in-line coding and gets.In-line coding comprises trellis code, and trellis code comprises convolution code or the like.And external encode comprises an error-detecting code, and error-detecting code comprises cyclic redundancy check (CRC) code and parity code or the like.
Described according to the preferred embodiments of the present invention, above-mentioned decoding device, wherein when coding decoding figure expression a plurality of paths and a plurality of node of process, a plurality of path configurations are between a plurality of nodes, and the corresponding code word of each path difference.
Described according to the preferred embodiments of the present invention, above-mentioned decoding device, wherein decoding device more comprises a demodulating unit, is coupled to inner decoder, according to received signal, demodulates one first output code word, and exports the first output code word to inner decoder.
Described according to the preferred embodiments of the present invention, above-mentioned decoding device, wherein decoding figure comprises a trellis diagram.
The present invention when allowing the code word mistake that inner decoder produced, can utilize the stored a plurality of paths of open storehouse because of adopting an open storehouse, produces code word again, with the operand and the complexity of reduction decoding, and reduces the time of decoding.
For above and other objects of the present invention, feature and advantage can be become apparent, preferred embodiment cited below particularly, and cooperate appended graphicly, be described in detail below.
Description of drawings
Fig. 1 is the chnnel coding calcspar of transmission end of the prior art.
Fig. 2 is the calcspar of the parallel Veterbi decoding of receiving terminal of the prior art.
Fig. 3 is the calcspar of receiving terminal serial Veterbi decoding of the prior art.
Fig. 4 illustrates the trellis diagram into (3,1,2) convolution code.
Fig. 5 is the decoding device calcspar of the preferred embodiment of the present invention.
Fig. 6 is the flow chart of steps of the list type decoding of the preferred embodiment of the present invention.
Fig. 7 is the flow chart of steps of the list type decoding of the preferred embodiment of the present invention.
Fig. 8 illustrates to emulation message sequence length is 100, and the list type coding/decoding method of the embodiment of the invention is the error rate tendency chart under different maximum output number L.
Fig. 9 illustrates to emulation message sequence length is 100, the tendency chart of the list type coding/decoding method of the embodiment of the invention and the existing parallel Veterbi decoding average decoding complex degree of every carry-out bit under different maximum output number L.
Embodiment
In the general communication system, if the signal that transmitted when the transmission end through the coding more than twice, will be in the received signal of receiving terminal through the decoding step more than twice.And the calcspar of transmission end for example is shown in Figure 1, and the external encoder among Fig. 1 for example utilizes error-detecting code to realize, and error-detecting code for example can be cyclic redundancy check (CRC) code or parity code or the like.Above-mentioned internal encoder can utilize error-correcting code to realize, error-correcting code for example comprises trellis code or the like, and common trellis code is convolution code or the like.
Below the present invention for convenience of description, external encoder for example uses one (x+1, parity code x), and hypothesis message sequence b length is 3 (just supposing x=3), therefore 3 message sequence b=(b 0, b 1, b 2) will add a redundant digit v 3Become the first code word v=(b 0, b 1, b 2, v 3), b wherein 0, b 1, b 2∈ 0,1}.And when 1 number among the message sequence b is odd number, v 3=1, otherwise, when 1 number is even number among the message sequence b, v 3=0.
In addition, in following embodiment, internal encoder for example use one (convolution code m) is encoded to the second code word u with the first code word v for n, k, and hypothesis (n, k, m)=(3,1,2).And length is 4 the first code word v, and employed trellis diagram as shown in Figure 4 during through (3,1,2) convolution coding.Fig. 4 illustrates the trellis diagram into (3,1,2) convolution code.Comprise node and the pairing path of each node among Fig. 4.And each node table is shown l-s, and wherein l represents sequential (level), and l ∈ 0,1,2,3,4,5,6}; S represents state, and s ∈ 0,1,2,3}.A code word of corresponding input and 3 trellis code will exporting on the path that each node set out.And when l=0～4, will have two paths to set out by each node, be that enter code word is the path of being walked in 1 o'clock (the pairing code word in path is 1 just) by the top path that node set out.By the following path that node set out is that enter code word is the path of being walked in 0 o'clock (the pairing code word in path is 0 just).Therefore, by starting point (origin node) (0-0) to terminal point (terminal node) (6-0) in, the path that each selection among the first code word v will be passed through has also just determined the trellis code of exporting, and has just determined the second code word u that internal encoder is exported.
Correspond to the transmission end, the received signal r that receiving terminal receives also must can obtain a final output code word through the processing of demodulation, inner decoding and external decoder
Figure DEST_PATH_GSB00000271195600081
Fig. 5 is the decoding device calcspar of the preferred embodiment of the present invention.Please refer to Fig. 5, decoding device comprises demodulating unit 510, inner decoder 520 and outer decoder 530.Wherein, demodulating unit 510 will receive received signal r, and demodulate one first output code word
Figure DEST_PATH_GSB00000271195600082
To this inner decoder 520.
Inner decoder 520 will be utilized a decoding figure, set out by the starting point of decoding figure, and utilize an open storehouse store the path of process.When arriving a node, only select by the minimum variable path in the open storehouse by advancing, and according to the first output code word Calculate the variable in institute extended a plurality of successions path, and store a plurality of successions path to the opening storehouse.When the minimum variable path (path that just has maximum similarity) in the open storehouse arrives the terminal point of decoding figure, inner decoder will be exported the pairing code word in minimum variable path, just the second output code word among Fig. 5
Figure DEST_PATH_GSB00000271195600084
In the present embodiment, variable is represented the first output code word that inner decoder 520 is received
Figure DEST_PATH_GSB00000271195600085
Similarity with the path of decoding among the figure.And when coding decoding figure expression a plurality of paths and a plurality of node of process, these path configurations are between a plurality of nodes, and the corresponding code word of each path difference.And in the present embodiment, the decoding legend is as being a trellis diagram and an arborescence or the like, and for the aspect illustrates the present invention, following examples are all for example implemented it with the trellis diagram of Fig. 4.
Please continue with reference to Fig. 5, outer decoder 530 is coupled to inner decoder 520 and receives the second output code word In order to decode and to judge whether the pairing code word in minimum variable path is correct, to export final output code word
Figure DEST_PATH_GSB00000271195600087
In the present embodiment, be to utilize the trellis diagram of Fig. 4 because the case of internal coding is to use the convolution code of (3,1,2) and inner decoder 520, therefore, second code word that outer decoder 530 is received Can be expressed as Wherein,
Figure DEST_PATH_GSB00000271195600093
With
Figure DEST_PATH_GSB00000271195600094
Be invalid position,
Figure DEST_PATH_GSB00000271195600095
It is a redundant digit.Corresponding to the external encoder 110 employed parity codes of Fig. 1, outer decoder 530 utilizes the second output code word
Figure DEST_PATH_GSB00000271195600096
In redundant digit
Figure DEST_PATH_GSB00000271195600097
Judge the second output code word Whether correct.If outer decoder 530 is judged the second output code word
Figure DEST_PATH_GSB00000271195600099
When correct, will export final output code word
Figure DEST_PATH_GSB000002711956000910
Wherein
Figure DEST_PATH_GSB000002711956000911
If do not having finally to export code word under the wrong situation that produces
Figure DEST_PATH_GSB000002711956000912
Will equal message sequence b among Fig. 1.
Otherwise, if outer decoder 530 is judged the second output code word
Figure DEST_PATH_GSB000002711956000913
During mistake, will require inner decoder 520 to export one second output code word again
Figure DEST_PATH_GSB000002711956000914
And inner decoder 520 will be got rid of the previous second output code word of exporting
Figure DEST_PATH_GSB000002711956000915
Just get rid of stored minimum variable path in open storehouse.Afterwards, inner decoder 520 replaces minimum variable path with a particular path that is stored in the open storehouse again, and this particular path is for example for having time little variable in open storehouse.And inner decoder 520 will continue to be set out by the end point in minimum variable path (end node), when arriving the grid sink of graph in minimum variable path, export the pairing code word in minimum variable path again to outer decoder 530.That is to say that externally encoder 530 detects and judges the second output code word
Figure DEST_PATH_GSB000002711956000916
During mistake, inner decoder 520 will produce one second output code word again
Figure DEST_PATH_GSB000002711956000917
Export outer decoder 530 to, and the second output code word that exported this moment
Figure DEST_PATH_GSB000002711956000918
For example be path, to allow outer decoder 530 rejudge the second output code word that inner decoder 520 is exported with second similarity
Figure DEST_PATH_GSB000002711956000919
Whether correct.Therefore, according to the operator scheme that above-mentioned inner decoder 520 and outer decoder 530 cooperatively interact, inner decoder 520 can be according to the order of similarity, the output second output code word
Figure DEST_PATH_GSB000002711956000920
To outer decoder 530, judge the second output code word up to outer decoder 530 Till correct, to allow outer decoder 530 decode final output code word
Figure DEST_PATH_GSB000002711956000922
And obtain the message sequence b that transmits the transmission end.
By embodiment described above as can be known, compared to Veterbi decoding of the prior art, the embodiment of the invention only need to calculate minimal path variable in the open storehouse the variable in extended succession path.In addition, when outer decoder is judged the code word mistake that inner decoder exports, internal encoder also can utilize the path that is stored in the open storehouse, again produce a code word and export outer decoder to, that is to say, compared to serial Veterbi decoding of the prior art, the embodiment of the invention no longer need be sought out the maximum similarity path again by the starting point of trellis diagram, therefore, save a large amount of memory headrooms, and reduced the complexity of many computings.
What deserves to be mentioned is, though in the present embodiment to having depicted a possible kenel in the decoding device, should know that but know this operator each manufacturer is all different for the design of decoding device, therefore application of the present invention is when being not restricted to the possible kenel of this kind.In other words, so long as can utilize previous stored path to produce other code word again, be to have met spiritual place of the present invention just.The embodiment that next will enumerate several methods illustrates how inner decoder produces the second output code word, so that present technique field person more can implement according to conception of the present invention easily.
Fig. 6 is the flow chart of steps of the list type decoding of the preferred embodiment of the present invention.Please refer to Fig. 6, at first, provide a decoding figure (step S610), wherein, when coding decoding figure expression a plurality of paths and a plurality of node of process, these path configurations are between a plurality of nodes, and the corresponding code word of each path difference.And in the present embodiment, decoding figure can for example implement it with trellis diagram and arborescence, and the present invention for convenience of description, below all as an example with the trellis diagram of Fig. 4.
When initial, first path of trellis diagram is stored in the open storehouse (open stack) (step S620).Wherein, first path only comprises a starting point (for example being node 0-0 among Fig. 4), and the variable in first path is zero.And in the present embodiment, the opening storehouse is in order to leave the path of passing through or extending in the decoding step in.
Next, according to the signal that is received, calculate minimum variable path in the open storehouse end point the variable (step S630) in extended a plurality of successions path.At this moment, minimum variable path is first path in the open storehouse, and the end point in first path is starting point 0-0, with Fig. 4 is example, the path of being extended by starting point 0-0 is path 0-0 → 1-0 and path 0-0 → 1-1, so among the step S630, with the variable of calculating path 0-0 → 1-0 and path 0-0 → 1-1.Wherein, variable is represented the first output code word that inner decoder 520 is received
Figure DEST_PATH_GSB00000271195600101
Similarity with path in the trellis diagram.
Afterwards, minimum variable path (step S640) in the open storehouse of deletion, and put into and inherit the path to open storehouse (step S650).At this moment, the first stored path in the storehouse is opened in deletion, and path 0-0 → 1-0 and path 0-0 → 1-1 are put into open storehouse.In the present embodiment, inherit put into open storehouse in the path order for example for according to variable by little to putting into greatly, or put into from large to small, again or do not have certain sequence according to variable.
Next, judge whether minimum variable path arrives grid sink of graph (for example being the node 6-0 among Fig. 1) (step S660) in the open storehouse.If open in the path stored in the storehouse, step S630 is then got back in minimum variable path no show grid sink of graph.At this moment, (for example all do not reach the grid sink of graph because stored path in open storehouse for path 0-0 → 1-0 among Fig. 1 and path 0-0 → 1-1), therefore, to get back to step S630, in the path of extending by the end point of path 0-0 → 1-0 or path 0-0 → 1-1, set out by the minimal path variable in regular turn, to arrive the grid sink of graph.
Whether correctly otherwise if open in the path stored in the storehouse, minimum variable path has arrived the grid sink of graph, then judge the pairing code word in minimum variable path (step S670).In the present embodiment, the pairing code word in minimum variable path is the second output code word that inner decoder 520 is exported among Fig. 5 And judge that second exports code word
Figure DEST_PATH_GSB00000271195600112
Method then can for example be to utilize the second output code word
Figure DEST_PATH_GSB00000271195600113
In redundant digit
Figure DEST_PATH_GSB00000271195600114
Judge the second output code word
Figure DEST_PATH_GSB00000271195600115
Whether correct.
If when judging the pairing code word mistake in minimum variable path, deletion is stored in minimum variable path (step S680) in the open storehouse, and get back to step S630, to set out by the minimum variable path in the open storehouse again, and when arriving the trellis diagram terminal point, export the pairing code word in minimum variable path again.
If when the pairing code word in minimum variable path was correct, the pairing code word in then minimum variable path was an optimal codes (step S690).And in the present embodiment, optimal codes is has the pairing code word in minimum variable path in the open storehouse, and aforementioned optimal codes is again a correct code word.
Usually know that in order to make having in this area the knowledgeable can implement the present invention easily, below will illustrate the computational methods of above-mentioned variable.At first, the first output code word table that is received is shown N is the length of the first output code word.The first output code word is through after the rigid decision-making, and the sequence table that obtains is shown y=(y 0, y 1..., y N), wherein any one element is
φ wherein jBe log likelihood ratio (log-likelihood ratio) that it is defined as
φ j = ln Pr ( u j | 0 ) Pr ( u j | 1 )
Pr (u wherein j| 0) expression receives u 0 the time when transmission jProbability, Pr (u j| 1) expression receives u 1 the time when transmission jProbability, and φ jBe real number.
Code word in the trellis diagram on the free routing can be expressed as x (ln-1), and x (ln-1)=(x 0, x 1..., x Ln-1), wherein, l represents the sequential of the end point in this path, n represents k data bit to be encoded to n trellis code at every turn, and l is a non-negative integer, n, k are natural number.With the path 0-0 → 1-1 → 2-3 among Fig. 4 is example, and the end point in this path is 2-3, and the sequential l of end point 2-3 is 2, and n=3, and therefore, the pairing trellis code of path 0-0 → 1-1 → 2-3 is x 5=111010.And the computational methods of variable have two kinds, and first kind is
M 1 ( x ( l · n - 1 ) ) ≡ Σ j = 0 l · n - 1 ( y j ⊕ x j ) | φ j | · · · ( 1 )
Second kind is
M 2 ( x ( l · n - 1 ) ) ≡ Σ j = 0 l · n - 1 ( 2 x j - 1 ) × φ j + Σ j = 0 l · n - 1 | φ j | . . . ( 2 )
The computational methods of above-mentioned two kinds of variables represent that all when code word on the path and received signal were similar more, the variable that is calculated was more little, therefore, can utilize variable to judge the similarity of the pairing code word on the grid path in graphs and the first output code word.And, the variable that is calculated by (1) formula and (2) formula is all a non-value of bearing (non-negative), therefore, the computational methods of these two kinds of variables can be applicable in the trellis diagram, and in step S630, only must calculate by end point the variable in extended path, be added to the variable in minimum variable path again, can obtain inheriting the variable in path.
What deserves to be mentioned is, owing to y do not occur in (2) formula j, therefore, when using the computational methods of second kind of variable, the step of rigid decision-making in the time of can saving decoding has also just reduced the probability that makes a mistake when doing decision-making, relatively increase the performance of list type decoding.For instance, when the passage of actual transmissions be additivity white Gauss noise channel (Additive White Gaussian Noise, AWGN), log likelihood ratio psi then j=Cr j, wherein C is a constant, and (2) formula changes into
M 2 ( x ( l · n - 1 ) ) ≡ C · ( Σ j = 0 l · n - 1 ( 2 x j - 1 ) × r j + Σ j = 0 l · n - 1 | r j | ) · · · ( 3 )
More can observe out by (3) formula, when the computational methods of second kind of variable are applied to the circuit of receiving terminal, can save the circuit of carrying out decision-making, reduce the cost of hardware more.
In order to make having of this area know that usually the knowledgeable can implement the present invention more easily, below will enumerate another embodiment and describe list type coding/decoding method proposed by the invention more in detail.
Fig. 7 is the flow chart of steps of the list type decoding of the preferred embodiment of the present invention.Please refer to Fig. 7, at first, provide a decoding figure (step S710), wherein, when coding decoding figure expression a plurality of paths and a plurality of node of process, these path configurations are between a plurality of nodes, and the corresponding code word of each path difference.And in the present embodiment, decoding figure can for example implement it with trellis diagram and arborescence, and the present invention for convenience of description, below all as an example with the trellis diagram of Fig. 4.
Next, the count value of each node in the trellis diagram is set at zero, and sets the value (step S715) of a maximum output number.In the present embodiment, each node in the trellis diagram is provided with a count value respectively, this count value is extended the number of times of inheriting the path in order to counting by each node.And maximum output number (the following L that all is expressed as) is used for representing that each node can extend maximum number of times of inheriting the path, in the present embodiment, supposes maximum output number L=3.And maximum output number L is used for maximum exportable second in the presentation graphs 5 again and exports code word
Figure DEST_PATH_GSB00000271195600132
Number, that is to say, can allow at most second output code word
Figure DEST_PATH_GSB00000271195600133
The number of times of mistake is L.When under the situation of channel environment extreme difference, and the L individual second that inner decoder 520 is exported in regular turn exports code word
Figure DEST_PATH_GSB00000271195600134
When all being judged as mistake, decoding device will require transmission end this received signal that retransfers.
Please continue with reference to figure 7, first path of trellis diagram is stored in the open storehouse (step S720).Wherein, first path only comprises a starting point (for example being node 0-0 among Fig. 4), and the variable in first path is zero.And in the present embodiment, the opening storehouse is in order to leave the path of passing through or extending in the decoding step in.
Next, according to the signal that is received, calculate minimum variable path in the open storehouse end point the variable (step S725) in extended a plurality of successions path.At this moment, minimum variable path is first path in the open storehouse, and the end point in first path is starting point 0-0, with Fig. 4 is example, the path of being extended by starting point 0-0 is path 0-0 → 1-0 and path 0-0 → 1-1, so in step S630, inherit path 0-0 → 1-0 and the variable of inheriting path 0-0 → 1-1 with calculating.In the present embodiment, the computational methods of variable for example be aforesaid (1) formula and (2) formula one of them, but be not limited thereto.
Afterwards, the count value with the end point in minimum variable path adds a particular value (step S730).In the present embodiment, this particular value for example is 1, but does not limit its scope.At this moment, the end point in minimum variable path is the end point in first path (node 0-0 among Fig. 4 just), and in step S730, the count value of node 0-0 is added up by 0 change 1 into behind the particular value (for example being 1).
To judge again whether the count value of this end point in minimum variable path exports number L (step S735) more than or equal to maximum, and this moment, this end point was the end point (node 0-0 among Fig. 4 just) in first path.If the count value of this end point is when exporting number more than or equal to maximum, then this end point will be placed into a sealing storehouse (step S740), and enter step S745.Otherwise, if the count value of this end point then directly enters step S745 less than maximum output number L.At this moment, because the count value of this end point is 1, and therefore this count value, directly enters step S745 less than maximum output number L (L is assumed to be 3 in the present embodiment).
In the present embodiment, the sealing storehouse is in order to depositing a plurality of nodes, and stored node will store and once be the endpoint information in minimum variable path in the opening storehouse in the sealing storehouse, and its endpoint information is the sequential and the state of end point.That is to say that when stored node is identical in the end point of any paths and sealing storehouse, this path will can not readvance.
Afterwards, minimum variable path (step S745) in the open storehouse of deletion.Have only first path in the open storehouse this moment, therefore, deletes first path, and do not have any paths in the open storehouse of feasible this moment.
Next, judge whether exist a particular path to enter into the stored arbitrary node (step S750) of sealing storehouse in a plurality of successions path.If inherit when having a particular path in the path, then get rid of this particular path (step S755), step after proceeding again.There is not this particular path if inherit in the path, step after then directly carrying out.At this moment, inheriting the path is the path of node 0-0 → 1-0 and the path of node 0-0 → 1-1, and in the sealing storehouse without any node, therefore directly carry out step afterwards.
Next, judge to inherit the path one of them whether with the path intersection (step S760) that is stored in the open storehouse.If inherit the path one of them during with the path intersection that is stored in the open storehouse, then delete the bigger path of variable (step S765), and the step after proceeding.If not, then directly carry out step afterwards.At this moment, owing to do not store the path in the open storehouse, the step after therefore directly carrying out.
Afterwards, put into remaining succession path to open storehouse (step S770).At this moment,, just do not delete any path yet, therefore, in step S770, will put into the path of node 0-0 → 1-0 and the path of node 0-0 → 1-1 owing to do not carry out step S755 and step S765.In the present embodiment, put into and inherit the path to open storehouse, can extremely rearrange whole paths stored in the open storehouse in regular turn greatly by little according to variable, so that in step S725, can directly obtain minimum variable path by the uppermost path in the open storehouse.And if before putting into the extremely open storehouse in succession path, arrange in regular turn according to its variable in path in the open storehouse, then when execution in step S770, insert the path of having arranged according to variable in the open storehouse according to the variable of inheriting the path, just can make that arrange in regular turn according to its variable in the path of all storages in the open storehouse.
Next, judge whether minimum variable path arrives grid sink of graph (for example being the node 6-0 among Fig. 1) (step S780) in the open storehouse.If open in the path stored in the storehouse, step S725 is then got back in minimum variable path no show grid sink of graph.At this moment, because path (path of node 0-0 → 1-0 and the path of node 0-0 → 1-1 in for example for Fig. 1) stored in open storehouse does not all reach the grid sink of graph, therefore, to get back to step S725, prolong the path of bearing by the path of node 0-0 → 1-0 and the path of node 0-0 → 1-1 again, set out by the minimal path variable in regular turn, to arrive the grid sink of graph.
Otherwise if in the open storehouse in the stored path, minimum variable path has arrived the grid sink of graph, then judges the redundant digit whether correct (step S785) in the pairing code word in minimum variable path.In the present embodiment, the pairing code word in minimum variable path is the second output code word that inner decoder 520 is exported among Fig. 5
Figure DEST_PATH_GSB00000271195600161
And judge that second exports code word
Figure DEST_PATH_GSB00000271195600162
Method then can for example be to utilize the second output code word
Figure DEST_PATH_GSB00000271195600163
In redundant digit
Figure DEST_PATH_GSB00000271195600164
Judge the second output code word
Figure DEST_PATH_GSB00000271195600165
Whether correct.
If when judging the pairing code word mistake in minimum variable path, deletion is stored in minimum variable path (step S790) in the open storehouse, and get back to step S725, to set out by the minimum variable path in the open storehouse again, and when arriving the trellis diagram terminal point, export the pairing code word in minimum variable path again.
If when the pairing code word in minimum variable path was correct, the pairing code word in then minimum variable path was an optimal codes (step S795).And in the present embodiment, optimal codes is has the pairing code word in minimum variable path in the open storehouse, and optimal codes is a correct code word.
Yet, this area tool knows that usually the knowledgeable should observe out, if in step S785, when judging the pairing code word mistake in minimum variable path, after then only needing the minimum variable path in the open storehouse of deletion, set out by the end point in minimum variable path stored in the open storehouse again, and the step after continuing to carry out, just can export the pairing code word in minimum variable path again, compared to sequence of the prior art is special ratio decoder, the embodiment of the invention can not need to return the starting point of trellis diagram, do not need on each state, to make a strategic decision out again survival route yet, just can export the pairing code word in minimum variable path again and (that is to say and to make inner decoder export one second output code word once more
Figure DEST_PATH_GSB00000271195600166
).Therefore, when practical application, also just relatively the complexity of computing and the time of computing have been saved.And inner decoder also only needs to store the path in the open storehouse, to save the memory headroom in the inner decoder.
The list type coding/decoding method that the foregoing description proposed can carry out emulation with a program.And following Fig. 8 and Fig. 9 will show the analogous diagram under the various encoding conditions, and with the complexity of Veterbi decoding comparison operation of the prior art, and the employed transmission channel of following emulation all is assumed to be additivity white Gauss noise channel.
Fig. 8 illustrates to emulation message sequence length is 100, and the list type coding/decoding method of the embodiment of the invention is the error rate tendency chart under different maximum output number L.Please refer to Fig. 8, its abscissa is potential energy and noise energy ratio E b/ N 0, and unit is dB, ordinate is block error rate (Block Error Rate).Three curves among Fig. 8 are exported number L=1,2 and 4 as simulation with maximum respectively.And can observe out when the L value is big more by Fig. 8, if at identical E b/ N 0Under the value, the L value is big more to access lower block error rate.And, work as E b/ N 0=2.5 o'clock, the list type coding/decoding method block error rate of L=1 was 10 -1.8, the list type coding/decoding method block error rate of L=2 is 10 -2, the list type coding/decoding method block error rate of L=4 is 10 -1.6That is to say that when noise ratio was very big, list type coding/decoding method proposed by the invention still can reach very low block error rate.
Fig. 9 illustrates to emulation message sequence length is 100, the tendency chart of the list type coding/decoding method of the embodiment of the invention and the known parallel Veterbi decoding average decoding complex degree of every carry-out bit under different maximum output number L.Please refer to Fig. 9, its abscissa is potential energy and noise energy ratio E b/ N 0, and unit is dB, ordinate is the average decoding complex degree of every carry-out bit.Three dotted lines among Fig. 9 are use list type coding/decoding method, and export number L=1,2 and 4 as simulation with maximum respectively.Three solid lines among Fig. 9 are the parallel Veterbi decoding method of use, and export number L=1,2 and 4 as simulation with maximum respectively.
Can observe out by Fig. 9, no matter because the quality of parallel Veterbi decoding channel quality, second code word of all exporting same number is to outer decoder, therefore, three solid lines among Fig. 9 are all a straight line, that is to say that no matter the quality of channel quality, parallel Veterbi decoding all can't reduce its complexity of decoding.Review list type coding/decoding method of the present invention, its decoding complex degree is significantly less than parallel Veterbi decoding, and when channel quality preferably the time, the decoding complex degree of list type coding/decoding method of the present invention has been saved complexity over half approximately.For instance, potential energy and noise energy ratio E b/ N 0=4, and during maximum output number L=3, the mean value of list type decoding complex degree is about 10 1, and the mean value of parallel Veterbi decoding complexity is about 10 2.5, therefore, parallel Veterbi decoding complexity is about 31 times of list type decoding complex degree.
In sum, list type coding/decoding method and decoding device that the embodiment of the invention proposed, compared to parallel Veterbi decoding of the prior art, when the embodiment of the invention has only decoder externally to judge the code word mistake that inner decoder exports, internal encoder just utilizes the path that is stored in the open storehouse, produces a code word again and exports outer decoder to.Therefore, under the good situation of channel quality, the decoding of the list type of the embodiment of the invention can reduce huge operand.
In addition, list type coding/decoding method and decoding device that the embodiment of the invention proposed, compared to serial Veterbi decoding of the prior art, when externally decoder is judged the code word mistake that inner decoder exports, internal encoder only need utilize the path that is stored in the open storehouse, produces and export one second output code word again to outer decoder.In other words, when externally decoder is judged the code word mistake that inner decoder exports, the list type decoding that the embodiment of the invention proposed no longer need be sought out the maximum similarity path again by the starting point of trellis diagram, therefore, can reduce the complexity of many computings, and reduce the operation time of decoding.In addition, compared to serial Veterbi decoding of the prior art, the decoding of the list type of the embodiment of the invention does not also store the variable in all paths at the huge internal memory of needs, has also just relatively saved a large amount of memory headrooms.
In the application of reality, the pointed list type decoding of the embodiment of the invention can be implemented in the integrated circuit with hardware mode easily, or directly the present invention is write in a software, and this software for example is applied to Digital Signal Processing (Digital Signal Processing, platform DSP).
Though the present invention discloses as above with preferred embodiment; right its is not in order to limit the present invention; anyly have the knack of this skill person; without departing from the spirit and scope of the present invention; when can doing a little change and retouching, so protection scope of the present invention is when looking accompanying being as the criterion that claim defines.

Claims (22)

1. a list type coding/decoding method comprises the following steps:
(a) provide a decoding figure, when described decoding figure represents to encode a plurality of paths and a plurality of node of process, described a plurality of path configurations are between described a plurality of nodes, and described each path corresponding code word respectively;
(b) storehouse is opened in a starting point to of putting into described decoding figure;
(c) according to a received signal, calculate the minimum variable path in the described open storehouse an end point the variable in extended a plurality of successions path;
(d) the described minimum variable path in the described open storehouse of deletion;
(e) put into described a plurality of successions path to described open storehouse;
(f) judge that the pairing code word in described minimum variable path is exported if arrive the terminal point of described decoding figure in the minimum variable path in a plurality of successions path in the described open storehouse, otherwise, get back to step (c); And
(g) judge whether the redundant digit in the pairing code word in described minimum variable path is correct; And, then delete the described minimum variable path in the described open storehouse, and get back to step (c) if during the described redundant digit mistake in the pairing code word in described minimum variable path; If when the described redundant digit in the pairing code word in described minimum variable path was correct, the pairing code word in then described minimum variable path was an optimal codes.
2. list type coding/decoding method as claimed in claim 1, wherein said open storehouse are in order to depositing described a plurality of path, and the pairing code word in described a plurality of path has the possibility for described optimal codes.
3. list type coding/decoding method as claimed in claim 1, the variable of wherein said starting point are zero.
4. list type coding/decoding method as claimed in claim 1, the described a plurality of nodes among the wherein said decoding figure have a corresponding count value respectively.
5. list type coding/decoding method as claimed in claim 4 wherein more comprises before that in step (b) count value with each the described a plurality of node among the described decoding figure is set at zero.
6. list type coding/decoding method as claimed in claim 4 wherein more comprises before in step (b) and sets a maximum output number.
7. list type coding/decoding method as claimed in claim 6, wherein step (d) more comprises the following steps:
(d1) add up a particular value to described minimum count value of measuring the described end point of path values;
(d2) judge that described minimum count value of measuring the described end point of path values is when exporting number more than or equal to described maximum, then described end point to be put into a sealing storehouse, enter step (d3), otherwise, step (d3) entered; And
(d3) the described minimum variable path in the described open storehouse of deletion.
8. list type coding/decoding method as claimed in claim 7, wherein said particular value are 1.
9. list type coding/decoding method as claimed in claim 7, wherein step (e) more comprises the following steps:
When one of them particular path of described a plurality of successions path enters into the stored arbitrary node of described sealing storehouse, get rid of described particular path;
When the path intersection in described a plurality of successions path one of them and the described open storehouse, get rid of path with big variable; And
Put into remaining described a plurality of successions path to described open storehouse.
10. list type coding/decoding method as claimed in claim 9 wherein more comprises size according to variable to the step of described open storehouse putting into remaining described a plurality of successions path, arranges the stored path of described open storehouse.
11. list type coding/decoding method as claimed in claim 1, wherein said received signal see through an external encode and an in-line coding and get.
12. list type coding/decoding method as claimed in claim 11, wherein said in-line coding are a trellis code.
13. list type coding/decoding method as claimed in claim 11, wherein said in-line coding is in order to be encoded to n bit word with k data bit, and corresponding j the codeword table in path of described decoding figure is shown x j, and x j∈ 0, and 1}, the temporal representation of described decoding figure is L, and variable is
Figure DEST_PATH_FSB00000271195500031
Wherein k, n are natural number, and j, L are integer, φ jBe a logarithm possibility ratio, and φ jBe real number.
14. list type coding/decoding method as claimed in claim 13, wherein φ jBe log[Pr (u j| 0)/Pr (u j| 1)], and u jBe j received signal, Pr (u j| 0) expression receives u 0 the time when transmission jProbability, Pr (u j| 1) expression receives u 1 the time when transmission jProbability.
15. list type coding/decoding method as claimed in claim 11, wherein said in-line coding is in order to be encoded to n bit word with k data bit, and corresponding j the codeword table in path of described decoding figure is shown x j, and x j∈ 0, and 1}, the temporal representation of described decoding figure is L, and variable is
Figure DEST_PATH_FSB00000271195500032
Wherein k, n are natural number, and j, L are integer, φ jBe a logarithm possibility ratio, and φ jBe real number, and y jIt is a rigid decision value.
16. list type coding/decoding method as claimed in claim 15, wherein φ jBe ln[Pr (u j| 0)/Pr (u j| 1)], and u jBe j received signal, Pr (u j| 0) expression receives u 0 the time when transmission jProbability, Pr (u j| 1) expression receives u 1 the time when transmission jProbability.
17. list type coding/decoding method as claimed in claim 16 is wherein worked as φ j, judge y at＜0 o'clock j=1, work as φ j, judge y at 〉=0 o'clock j=0.
18. a decoding device, in order to a received signal is decoded a final output code word, described decoding device comprises:
One inner decoder, utilize a decoding figure, set out in a starting point by described decoding figure, and utilize an open storehouse store the path of process, when arriving arbitrary node of described decoding figure, only select to advance by the minimum variable path in the described open storehouse, and according to described received signal, calculate described minimum variable path end point the variable in extended a plurality of successions path, and store described a plurality of successions path to described open storehouse, when the described minimum variable path in the described open storehouse arrived the terminal point of described decoding figure, described inner decoder was exported the pairing code word in described minimum variable path; And
One outer decoder receives the pairing code word in described minimum variable path, in order to decoding and when judging that the pairing code word in described minimum variable path is correct, exports described final output code word;
Wherein, when described outer decoder is judged the pairing code word mistake in described minimum variable path, described inner decoder is got rid of the described minimum variable path in the described open storehouse, and replace described minimum variable path by the particular path in the described open storehouse, wherein, described particular path has time little variable in described open storehouse, and described inner decoder will continue to be set out by the end point in described minimum variable path, when described minimum variable path arrives the described terminal point of described decoding figure, again export the pairing code word in described minimum variable path to described outer decoder, judge that up to described outer decoder the pairing code word in described minimum variable path is for correct.
19. decoding device as claimed in claim 18, wherein said received signal see through an external encode and an in-line coding and get.
20. decoding device as claimed in claim 19, wherein said in-line coding are a trellis code.
21. decoding device as claimed in claim 18, when wherein said decoding figure represents to encode a plurality of paths and a plurality of node of process, described a plurality of path configurations are between described a plurality of nodes, and described each path corresponding code word respectively.
22. decoding device as claimed in claim 18, wherein said decoding device more comprises a demodulating unit, is coupled to described inner decoder, according to described received signal, demodulate one first output code word, and export the described first output code word to described inner decoder.
CN2006101444202A 2006-11-07 2006-11-07 Sequence type decoding method and device Expired - Fee Related CN101179544B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2006101444202A CN101179544B (en) 2006-11-07 2006-11-07 Sequence type decoding method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2006101444202A CN101179544B (en) 2006-11-07 2006-11-07 Sequence type decoding method and device

Publications (2)

Publication Number Publication Date
CN101179544A CN101179544A (en) 2008-05-14
CN101179544B true CN101179544B (en) 2011-02-09

Family

ID=39405632

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2006101444202A Expired - Fee Related CN101179544B (en) 2006-11-07 2006-11-07 Sequence type decoding method and device

Country Status (1)

Country Link
CN (1) CN101179544B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5208816A (en) * 1989-08-18 1993-05-04 At&T Bell Laboratories Generalized viterbi decoding algorithms
CN1237300A (en) * 1996-09-19 1999-12-01 艾利森公司 Interference mitigation by joint detection of cochannel signals
WO2005117316A1 (en) * 2004-05-28 2005-12-08 Koninklijke Philips Electronics, N.V. Extended convolutional codes

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5208816A (en) * 1989-08-18 1993-05-04 At&T Bell Laboratories Generalized viterbi decoding algorithms
CN1237300A (en) * 1996-09-19 1999-12-01 艾利森公司 Interference mitigation by joint detection of cochannel signals
WO2005117316A1 (en) * 2004-05-28 2005-12-08 Koninklijke Philips Electronics, N.V. Extended convolutional codes

Also Published As

Publication number Publication date
CN101179544A (en) 2008-05-14

Similar Documents

Publication Publication Date Title
CN102694625B (en) Polarization code decoding method for cyclic redundancy check assistance
CN108462558B (en) Method and device for decoding polarization code SCL and electronic equipment
Taipale et al. An improvement to generalized-minimum-distance decoding
CN107026656B (en) CRC-assisted medium-short code length Polar code effective decoding method based on disturbance
CN104025459A (en) Decoding processing method and decoder
Mahdavifar et al. Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding
WO2010115371A1 (en) Implementation method and apparatus for cyclic redundancy check crc codes
US8234550B2 (en) Efficient decoding
Buzaglo et al. Consecutive switch codes
CN101179544B (en) Sequence type decoding method and device
CN111464267A (en) Communication data checking method and device, computer equipment and storage medium
Gupta et al. Efficient interactive coding achieving optimal error resilience over the binary channel
Wan et al. Algebraic soft decoding of elliptic codes
WO2006104856A2 (en) Efficient decoding
Aggarwal et al. Distributed computing with channel noise
Hachem et al. Coding with encoding uncertainty
Mahdavifar et al. Algebraic list-decoding in projective space: Decoding with multiplicities and rank-metric codes
WO2020234185A1 (en) A method of marking bits, a method of decoding bits, a bit marking device, a decoder, a receiver and a chip
CN102751996A (en) High-performance low-complexity decoding method of block product codes TPC (Turbo Product Code)
Zheng et al. Complexity‐adjustable SC decoding of polar codes for energy consumption reduction
Swart Distance-preserving mappings and trellis codes with permutation sequences
Dai et al. Multiple Dimensional Encoding/Modulation Shift‐and‐Addition Design for Distributed Systems
Fujiwara Parsing a sequence of qubits
Wu et al. Interpolation-based low-complexity Chase decoding algorithms for Hermitian codes
Huang et al. Research of Error Control Coding and Decoding

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20110209

Termination date: 20161107

CF01 Termination of patent right due to non-payment of annual fee