Turbo code: Difference between revisions

Content deleted Content added
m s/turbo-code/turbo code/
m s/turbo-code/turbo code/
Line 76:
This introduces a probabilistic aspect to the data-stream from the front end, but it conveys more information about each bit than just 0 or 1.
 
For example, for each bit, the front end of a traditional wireless-receiver has to decide if an internal analog voltage is above or below a given threshold voltage level. For a turbo- code decoder, the front end would provide an integer measure of how far the internal voltage is from the given threshold.
 
To decode the {{nowrap|''m'' + ''n''}}-bit block of data, the decoder front-end creates a block of likelihood measures, with one likelihood measure for each bit in the data stream. There are two parallel decoders, one for each of the {{frac|''n''|2}}-bit parity sub-blocks. Both decoders use the sub-block of ''m'' likelihoods for the payload data. The decoder working on the second parity sub-block knows the permutation that the coder used for this sub-block.
 
==Solving hypotheses to find bits==