Content deleted Content added
→Examples: new section |
Gnomingstuff (talk | contribs) rv 2024 WP:NOTFORUM |
||
| (16 intermediate revisions by 10 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=Start|
{{WikiProject Telecommunications }}
}}
== turbo a "misnomer==
I think the usage of the word turbo generally means "fast" in popular english, so this is not really a misnomer unless you understand what a "turbo" is in car mechanics.
[[User:DarkShroom|DarkShroom]] ([[User talk:DarkShroom|talk]]) 13:19, 2 August 2014 (UTC)
== Latency ==
Line 7 ⟶ 15:
::I believe the reference is to deep-space satellie communications; the latency introduced in that case is on the order of minutes to hours. 15 April 2007
== Error"correcting" code? ==
Is the Turbo code actually an error "correcting" code? To my understanding, separate demodulation, hard decision and then error "correction" justify that term.
I believe, instead "error control" code has been used.
Also, I just took from a lecture that LDCP codes will also have an error floor, although orders of magnitude lower. It can still be a problem for example in fiber optic links, where the BER can be designed as 10e-14 or so.
I'm not expert enough to edit the article, but I thought I'd put it here for discussion. If needed, Biglieri's book on "coding for wireless channels" should provide references.
[[User:Internetexploder|Internetexploder]] ([[User talk:Internetexploder|talk]]) 14:16, 23 September 2008 (UTC)
== The Shannon Limit ==
Line 52 ⟶ 70:
== Examples ==
This article have lack of examples. If anyone got some example please add it. <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/217.198.239.190|217.198.239.190]] ([[User talk:217.198.239.190|talk]]) 09:57, 12 May 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== Boundary conditions for divergence and the probability of failure ==
In a nice analogy of solving crossword puzzles, the article states, "Based on this new knowledge, they both come up with updated answers and confidence ratings, repeating the whole process until they converge to the same solution."
Or until they clearly diverge, with no solution possible. The failure case ought to be considered, since promising performance close to the Shannon limit without any risk should not be accepted without an estimate of the probability of failure. Failure in a serial communications algorithm could mean loss of an entire message block.
Of course, the probability of failure is the number of initial states for which the two parity calculations do not converge to a single hypothesis divided by the total number of initial states.
Someone who works with Turbo Codes could probably contribute a paragraph on the failure probability of this class of communication algorithms. [[User:David spector|David spector]] ([[User talk:David spector|talk]]) 20:14, 18 July 2009 (UTC)
== Example: WTF??? ==
It's unusual to see a ''hardware'' example used to describe what is essentially an algorithm. What would that look like in software? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/71.72.235.91|71.72.235.91]] ([[User talk:71.72.235.91|talk]]) 20:19, 8 December 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== External links modified ==
Hello fellow Wikipedians,
I have just modified {{plural:1|one external link|1 external links}} on [[Turbo code]]. Please take a moment to review [https://en.wikipedia.org/w/index.php?diff=prev&oldid=748754401 my edit]. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit [[User:Cyberpower678/FaQs#InternetArchiveBot|this simple FaQ]] for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20130611235418/http://www.ima.umn.edu:80/csg/bib/bib16.0429hage.pdf to http://www.ima.umn.edu/csg/bib/bib16.0429hage.pdf
When you have finished reviewing my changes, please set the ''checked'' parameter below to '''true''' or '''failed''' to let others know (documentation at {{tlx|Sourcecheck}}).
{{sourcecheck|checked=false}}
Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 04:58, 10 November 2016 (UTC)
| |||