Content deleted Content added
Line 38:
The nitty gritty of turbo codes is how they use the likelihood data to reconcile differences between the two decoders. Each of the two convolutional decoders generates a hypothesis (with derived likelihoods) for the pattern of ''m'' bits in the payload sub-block. The hypothesis bit-patterns are compared, and if they differ, the decoders exchange the derived likelihoods they have for each bit in the hypotheses. Each decoder incorporates the derived likelihood estimates from the other decoder to generate a new hypothesis for the bits in the payload. Then they compare these new hypotheses. This iterative process continues until the two decoders come up with the same hypothesis for the ''m''-bit pattern of the payload, typically in 4 to 10 cycles.
==External
*[http://www331.jpl.nasa.gov/public/JPLtcodes.html Jet Propulsion Laboratory webpage on Turbo codes]
*[http://www.spectrum.ieee.org/WEBONLY/publicfeature/mar04/0304code.html Major IEEE Article: Closing in on the perfect code]
| |||