Content deleted Content added
Line 112:
{{see also|Viterbi algorithm}}
[[File:Softhard.png|thumb|right|300px|Theoretical bit-error rate curves for uncoded and coded QPSK, additive white Gaussian noise channel. Hard decision means that the decoder expects binary symbols (0's and 1's); Soft decision means that the decoder expects [[Likelihood_function#Log-likelihood|log-likelihood ratios]]<ref>[https://www.mathworks.com/help/comm/examples/llr-vs-hard-decision-demodulation.html LLR vs. Hard Decision Demodulation]</ref><ref>[https://www.mathworks.com/help/comm/ug/estimate-ber-for-hard-and-soft-decision-viterbi-decoding.html Estimate BER for Hard and Soft Decision Viterbi Decoding]</ref>.]]
Several [[algorithm]]s exist for decoding convolutional codes. For relatively small values of ''k'', the [[Viterbi algorithm]] is universally used as it provides [[maximum likelihood]] performance and is highly parallelizable. Viterbi decoders are thus easy to implement in [[VLSI]] hardware and in software on CPUs with [[SIMD]] instruction sets.
| |||