Jump to content

Talk:Turbo code

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Yamla (talk | contribs) at 18:08, 21 March 2005 (Compared to reed-solomon?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

User:HughSW -- hats off to your addition How Turbo codes work -- really nice work! technopilgrim

Compared with Reed-Solomon

I am interested to know if turbo code is more efficient than Reed-Solomon error correction for those areas that Reed-Solomon is particularly used for. For example, given the same number of additional bits, is turbo code better able to handle errored signals? Is turbo code better able to handle missing signals? Is turbo code well suited to 'bursty' errors? Also, on modern desktop CPUs, which is most time-efficient for encoding and decoding? --Yamla 18:08, 2005 Mar 21 (UTC)