Slashdot Mirror


Turbo Codes Promise Better Wireless Transmission

captain igor writes "IEEE is running a story about two French professors that have created a new class of encoding, called 'Turbo Codes,' that will allow engineers to pass almost twice as much data through a given communications channel, or equivalently, the same amount of data at half the power. The new codes allow the Shannon Limit (the theoretical maximum capacity of a channel) to be approached to, currently, within .5 dB. Scientists hope that this breakthrough will revolutionize wireless communications, especially with the coming reclamation of large swaths of the EM spectrum." As the article points out, such codes are in use now, but seem poised for much wider implementation.

212 comments

  1. Finally!!! by JustinXB · · Score: 4, Funny
    Finally, Millo will be able to complete Synapse for Bill Gates.

    Oh wait...

    1. Re:Finally!!! by AyeRoxor! · · Score: 1

      Rhymes with pillow?

  2. Odd wording by GMontag · · Score: 5, Informative
    The story is a bit misleading. IEEE is running a story about two French professors that have created a new class of encoding is an odd way of stating that it was invented eleven years ago, as the story states:

    It happened a decade ago at the 1993 IEEE International Conference on Communications in Geneva, Switzerland. Two French electrical engineers, Claude Berrou and Alain Glavieux, made a flabbergasting claim: they had invented a digital coding scheme that could provide virtually error-free communications at data rates and transmitting-power efficiencies well beyond what most experts thought possible.

    It also seems to be making a natural progression into new areas, beginning at satellite transmissions 11 years ago and making it's way into other digital wireless applications along the way.

    Thanks to timothy for almost clearing this up :)
    1. Re:Odd wording by nosphalot · · Score: 5, Funny
      Yea, I thought that was odd. When I worked at Motorola about 4 years ago we had a turbo encoder/decoder in a prototype of a 3G cellphone.

      Wonder how long until the story about a revolutionary new compression scheme called LZW hits the frontpage?

    2. Re:Odd wording by Anonymous Coward · · Score: 1, Interesting

      It's odd that "turbo code" in the satellite biz means one particular code patented by France Telecom.

      It's more odd "turbo code" has been claimed to be only one instance of a class of
      Low Density Parity Checking (LDPC) codes.

      It's greatly odd we don't refer to all instances of this class of coding as "Gallager Codes".
      If the demodulator is recursive, then it's a Gallager code?!

    3. Re:Odd wording by Anonymous Coward · · Score: 0

      I implemented this at my old job for a broadband sat-com terminal .... this is old news :-) And it does work great!

    4. Re:Odd wording by Imperator · · Score: 3, Funny
      Wonder how long until the story about a revolutionary new compression scheme called LZW hits the frontpage?

      Yeah, I read about that new LZW thing the other day. I just hope it doesn't have patent problems.

      --

      Gates' Law: Every 18 months, the speed of software halves.
    5. Re:Odd wording by Rick.C · · Score: 1
      Two French electrical engineers

      Wouldn't that make it "turbeaux"?

      --
      You were 80% angel, 10% demon. The rest was hard to explain. - Over The Rhine
      "Math in a song is good."-Linford
  3. Haha! by lukewarmfusion · · Score: 3, Funny

    Sounds a lot like this story...

    Double your hard drive space, your bandwidth, data transfer, penis size...

    1. Re:Haha! by adrielus · · Score: 1

      But is it needed? I figure we will cap out the need eventually with transfer rate in so far that it will be faster than hard drive transfer rates. It comes to need, wireless technology does need improvement, but I have been sitting at 11 mbs for a while and I can stream video no problem. Besides, penis-size doesn't matter to a geek if the geek doesn't use it.

    2. Re:Haha! by Anonymous Coward · · Score: 0
      I really love /.
      I make a comment like the one above, and because it's critical it's flamebate -2. I just took a look at my comments and moderations and it's funny to see that the majority of them get marked down for something or other, but the few I get marked up to +5 so outweigh those that my karma stays excellent.
      Also, while I'm posting anonymously & off-topic, I might as well critique the karma system. I was always a /. reader & anonymous poster, but I didn't think I could be a really cool +2 poster like the 31337. Until one day I observed several trolls karma whore their way up to +2 status then procede to troll away at +2 forcing some poor moderator to use 3 moderation points to wipe them off the board. So I got myself an account, karma whored my way up, and now I have the ability to post very infrequently at +2. If you look at my user page, before the post above, the last thing I posted was posted a year ago!!!

      Let me sum all this up for you in a few bullet points:
      • I love /.
      • Despite this, there are things I don't like about /.
      • It is OK to go againts the grain & not like some things about /.
      • Plan on being moderated down when you speak up about things you don't like about /.
      • Don't worry, if you need some karma, you can always whore it out of the mindless hoard of /. minions, use their own inability to think independently against them!!!
  4. Lucky guys! by lovebyte · · Score: 4, Funny

    Clever AND good looking !

    --

    I'll do it for cheesy poofs.

    1. Re:Lucky guys! by AnonymousNoMore · · Score: 0, Troll

      Oh Christ, mod parent as funny please!

    2. Re:Lucky guys! by Morologous · · Score: 4, Funny

      That guy on the right is either:

      1.) Suffering from severe dehydration.
      2.) Skeletor's distant relative

    3. Re:Lucky guys! by Anonymous Coward · · Score: 0

      If you open up the guy on the left, the one on the right jumps out and yells "Sacre bleu!".

    4. Re:Lucky guys! by gowen · · Score: 1

      Theres a third option you missed: "Member of a Sparks tribute band"

      --
      Athletic Scholarships to universities make as much sense as academic scholarships to sports teams.
    5. Re:Lucky guys! by Anonymous Coward · · Score: 0

      What did you say ?

    6. Re:Lucky guys! by herberts · · Score: 1

      Well there is a startup that has emerged from the ENST Bretagne and that focuses on Turbo Codes, it is called Turboconcept and you might find one of its creator more good looking.

    7. Re:Lucky guys! by raile · · Score: 1
      You forgot:

      3) Mr. Noodle's brother Mr. Noodle*

      *caveat: only (possibly) humorous to those with small children.

    8. Re:Lucky guys! by Anonymous Coward · · Score: 0

      3) French

    9. Re:Lucky guys! by OwlofCreamCheese · · Score: 1

      nope not funny still, elmo's world is a rape of sesame street, it was much better when it was teaching us that black people eat fried bannanas and that snuffy was imaginary.

      --
      -You're wasting your time. Alfador only likes me.
  5. turbo codes aren't new ... by Anonymous Coward · · Score: 0, Redundant

    ... they've been around for a little over a decade (11 years). It just irks me when I read something on an otherwise quasi-technical website, and see people hailing this "new technology" which has been around -- and in use (surprise!) -- for years.

  6. Hardly cutting edge news by grahamsz · · Score: 1, Redundant

    Whilst turbo codes are cool, as the article points out they were developed in 1993. I graduated last year and we covered them on my course.

    Now they are a fairly obvious choice in any digital communications system and it's hardly groundbreaking that someone has chosen to use them.

  7. News? by lightspawn · · Score: 3, Informative

    Like the article says, these codes were introduced in 1993. This would have made a good story - back then.

    The problem is that turbo codes are so computationally intensive that using them in consumer electronics is only new becoming feasible.

    1. Re:News? by happyfrogcow · · Score: 3, Insightful

      Like the article says, these codes were introduced in 1993. This would have made a good story - back then.

      The problem is that turbo codes are so computationally intensive that using them in consumer electronics is only new becoming feasible.


      Did you know about it? Did most people know about it? If something is making it more feasible to use, then its news. Dr. Evil wanted to put laser beams on sharks *years* ago, but no one's really done it. If something made it possible to put frikking laser beams on sharks today, it'd be news.

    2. Re:News? by LinuxInDallas · · Score: 1

      Well, they were mentioned in one of my college classes way back when so I would guess that for anyone that considers this interesting (and understandable) news already knew about it.

    3. Re:News? by AnonymousNoMore · · Score: 2, Insightful

      It's not that they are just now feasible, it's that few people outside of satcom were hip to them. Processor performance is not much of a factor because you don't do turbo coding in software. It's accelerated in hardware and is performed in line as the datastream passes through the mod/demod sections. There are chips that are not too expensive that do this or a turbo coding core can be dropped into the ASIC that holds the mod/demod sections. That makes it pretty cheap for a consumer device.

    4. Re:News? by Waffle+Iron · · Score: 4, Funny
      Like the article says, these codes were introduced in 1993.

      Ahh, that would explain the "Turbo" thing: It comes from the era of Borland compilers and 486 clone boxes. If it were invented today, it would surely be called something like "iCodes".

    5. Re:News? by ajagci · · Score: 4, Insightful

      I knew about it, as did many other people. But you have to realize that coding theory is a pretty funny and insular field. Related techniques had been used in other fields for many years prior to that discovery. Most people who work in this general area of statistics simply don't think about coding and aren't interested in it. One of the obstacles is that people who build communications systems generally are engineers thinking about fast, low-level processing; their first reaction to anything non-trivial and new is that it's too slow to be implemented in practice.

      Turbo coding is ultimately not much of a theoretical breakthrough, but a compromise and algorithmic hack that happens to work fairly well for real-world problems and is expressed in a language that people who work on communications systems understand. But that's nothing to be sneezed at, since it will ultimately mean that we will get higher data rates and other benefits in real-world products.

    6. Re:News? by yamadaa · · Score: 1

      Turbo codes have been used in consumer electronics for some time now. In my service area it's called 1X and if you have a new-ish CDMA phone you already have a turbo code'n consumer electronic appliance. Turbo codes are only used for data (because of the processing delay), and I don't know anyone who connects their phone to their computer (or pays the extortionary prices) to get the theoretical 144kbs. Oh, there's a pcmcia card as well.

    7. Re:News? by Zakabog · · Score: 2, Funny

      I'm sorry the frikking sharks with the frikking laser beams on their heads aren't here yet but for now enjoy our ill-tempered sea bass.

    8. Re:News? by DoctorStarks · · Score: 1
      I knew about it, as did many other people. But you have to realize that coding theory is a pretty funny and insular field.

      You have that right. When I was at MIT in 1996, I took a course in coding theory. It was not a regular part of the curriculum for electrical engineers concentrating in communications. It was a special course, which was only taught that one time. We discussed turbo codes.

      I soon came to realize why: coding theory is stuck halfway between comm theory and mathematics, and the mathematics (field theory, for one) is much more abstract than what engineers usually see.

      It really takes a special kind of communications engineer to get into coding theory to any kind of depth, and most mathematicians couldn't care less about it... which makes it insular indeed.

    9. Re:News? by Anonymous Coward · · Score: 0

      I've got a cool new system that combines dotCodes with dashCodes to transmit data.

      What hath God wrought?

  8. TURBO! by Junior+J.+Junior+III · · Score: 4, Funny

    Finally, by forcing more air into the cylinders than ordinary air pressure would allow, we will be able to achieve more efficient combustion, which will in turn allow us to transmit more data using radio frequencies. ...Don't you just hate it when terminology gets mis-applied to stuff it has nothing to do with?

    Dang it, this software isn't made out of platinum, either.

    --
    You see? You see? Your stupid minds! Stupid! Stupid!
    1. Re:TURBO! by leinhos · · Score: 1, Informative

      The term "turbo" is applied here in analogy because of the "turbo principle" in the decoder. The outputs of two decoders are compared and then fed back to improve the original estimate (almost like feeding the exhaust energy back into the input stream to improve output).

    2. Re:TURBO! by Anonymous Coward · · Score: 1, Informative

      You are a tard. If you want to start arguing about the misappropriation of terminology, then you grease-covered gearmonkies need to remember that ribogeeks have always known turbo as a genus of gastropoda, and Romageeks have long known that turbo is the nominative singular construction for a whirlwind, and the 1st person present active conjugation of turbo, turbare meaning to disturb or agitate.

      In other words, get your wrench out of your ass.

    3. Re:TURBO! by Anonymous Coward · · Score: 0
      Don't you just hate it when terminology gets mis-applied to stuff it has nothing to do with?
      Don't you just hate it when people don't read the articles? Turbo was a reference to a feedback system that the original inventors were familiar with. Since the Turbo codes used feedback, they liked the analogy.
    4. Re:TURBO! by nosphalot · · Score: 4, Interesting
      Actually, turbo is an appropriate name for the way these codes work. If I remember correctly, its been 4 years since it was explained to me, as the data leaves the encoder, some of it gets routed back into the first stage to act as a hint for encoding the next stage of data. So the data exhaust, helps compress the data intake, much like a mechanical turbo.

    5. Re:TURBO! by sharkey · · Score: 1

      Then I suggest they be christened "reset" codes. THAT button will ALWAYS be needed, on Windows PCs anyway.

      --

      --
      "Outlook not so good." That magic 8-ball knows everything! I'll ask about Exchange Server next.
    6. Re:TURBO! by Anonymous Coward · · Score: 0

      Well that beats my theory, which was that turbo codes act much like the turbo button on old pcs, which DOUBLE the speed to an amazing 7MHz

    7. Re:TURBO! by ciroknight · · Score: 1

      Actually, Turbo is a great word for this. It's a system with great chaos, and the root word "Turb", means chaotic, confusion. If anything, a Turbocharger, the device you're talking about, uses the wrong word, because it has nothing to do with a Turbulant system (it's more about taking hot exaust gasses to turn an impeller to move more cool air into the engine).

      --
      "Victory means exit strategy, and it's important for the President to explain to us what the exit strategy is." G.W.Bush
    8. Re:TURBO! by Andy+Dodd · · Score: 1

      Actually, "turbo" in turbocharger derives from the fact that a turbocharger uses an exhaust-driven turbine to provide power to the compressor.

      As explained earlier, turbo codes were named because they use a positive feedback loop to improve their performance, just like a turbocharger, even though in the strictest sense of using the word "turbo", it is inappropriate since "turbo" implies the use of a turbine somewhere.

      --
      retrorocket.o not found, launch anyway?
  9. Question... by barcodez · · Score: 1

    Can this be applied to wired transmissions too?

    --

    ----
    1. Re:Question... by Garak · · Score: 2, Informative

      Yep, it has been, thats what adsl uses I belive...

      --
      God, root, what is the difference?
    2. Re:Question... by IIEFreeMan · · Score: 1

      I suppose there are too few errors in wire transmission to justify the extra complexity and latency of these codes.

    3. Re:Question... by Garak · · Score: 1

      Not true at all, over a distance there can be alot of error in wire transmission. ADSL is a good example of this, with adsl your trying to get alot of signal through unshielded pair, you gota keep the power down to keep it from interfearing with other pairs, you also got alot of noise caused by the other pairs, so you have a low SNR, which these codes can help get alot of data through.

      --
      God, root, what is the difference?
    4. Re:Question... by IIEFreeMan · · Score: 1

      Yep you're right :)

      Maybe there is a problem with the latency or the processing power required. It could not be used in UMTS for voice communication because latency would have been too big (see the article).

      Surely it will be used as soon as it becomes cheap to do so for the operators :)

    5. Re:Question... by gtwrek · · Score: 1

      Incorrect. ADSL uses a serially concatenated code. The outter code is the well known Reed-Soloman. The inner code is a convolutional interleaver.

      Both are optional, and parameters are negotiated during modem training.

      Some comments were brought up during the latests standards definitions about adding turbo codes to the ADSL specs. However, that code complexity issue raises it's head, and those discussions usually get dropped quickly...

  10. Has it something to do with signal sampling? by Nicolas+Pillot · · Score: 0, Redundant

    I know Shannon as someone who tells we need to sample a signal at rate which is minimum twice the highest frequency found in the sampled signal. Is this related to that ?

    I can't quite understand what turbo codes are, and if there is no relation, well .... yeah, i'd be off-topic ;)

    1. Re:Has it something to do with signal sampling? by Anonymous Coward · · Score: 1, Informative

      That's the Nyquist limit actually. ;-)

    2. Re:Has it something to do with signal sampling? by tjb · · Score: 5, Informative

      Nyquist is the sample-rate guy (the Nyquist theorem).

      Shannon capacity is the theoretical bit-rate you can stuff through a channel of a given physical bandwidth with a given signal to noise ratio:

      C = W * Log2(1+S/N)

      where C is capacity (bits per second), W is bandwidth (Hz), S is signal power, and N is noise power.

      As far as Turbo Codes go, without getting too technical, its an extension of the principle that you can increase the efficiency of a channel while transmitting at a given power by attaching some redundant bits (redundant signal dimensions is probably a better way to look at it, though) to the signal. I'm not too familiar with the particulars of Turbo Coding, but it is a lot like Viterbi coding where these redundant bits are dependent on the data bits and when you detect an error (the redundant bit doesn't match the proper sequence), you back-trace through your data and find the most likely non-errored sequence and adjust your data bits accordingly.

      Tim

    3. Re:Has it something to do with signal sampling? by leinhos · · Score: 1, Informative

      Sort-of. You may be thinking of the Nyquist criterion, but this is related in a way. Shannon was the first to quantify the concept of information via "entropy", which leads to the concept of "mutual" or shared information (i.e. between inputs and outputs of a channel). Distortion (additive noise or some other form) limits the amount of mutual information shared between the input an output of a channel, and is independent of the nature of the data source. Thus, he proved that communication channels have a theoretical limit to the amount of data that can be reliably (error free) transmitted through them. He also suggested coding as a method to achieve this theoretical limit, which turbo codes approach for certain classes of channels (additive gaussian noise channel, for instance).

    4. Re:Has it something to do with signal sampling? by bsd4me · · Score: 1

      ... I'm not too familiar with the particulars of Turbo Coding ...

      Turbo coding basically does block interleaving of the output of two different convolution encoders of the input.

      --

      (S(SKK)(SKK))(S(SKK)(SKK))

    5. Re:Has it something to do with signal sampling? by hawkstone · · Score: 2, Informative

      I just heard about Turbo Codes recently, but from a different perspective. I think at the time, they developed these codes with rates so close to the Shannon limit, and no one believed it. Even then, I don't think they were aware of the theoretical basis for why they worked.

      Theory finally caught up with them more recently, from the framework of probabilistic networks. It turned out that if you have a Bayesian network with cycles, inference is difficult. But there is a method of belief propagation through message passing that can be used, and it turned out that this is exactly what these guys were doing. (The network itself would include a probabilistic model of noise and its effect on the messages from the sender to receiver.)

    6. Re:Has it something to do with signal sampling? by uss_valiant · · Score: 1

      Actually, both, Nyquist and Shannon, discovered the sample-rate formula at the same time, hence you can call it Nyquist theorem or Shannon's critical sample-rate theorem.
      It happened quite often that people - geographically separated by thousands of miles - invented/discovered the same thing at the same time, +/- a few weeks.

      Studying EE, comm. electronics / systems.

    7. Re:Has it something to do with signal sampling? by cryptochrome · · Score: 1

      I believe the most important aspect of turbo codes is that it uses signal strength in it's error-correction algorithm. It's a rather important chunk of data which allows them to refine their signal bits through parity checking to correct errors by determining which bits went wrong.

      --

      ---If you can't trust a nerd, who can you trust?

    8. Re:Has it something to do with signal sampling? by lightspawn · · Score: 0, Redundant

      when you detect an error (the redundant bit doesn't match the proper sequence), you back-trace through your data and find the most likely non-errored sequence and adjust your data bits accordingly.

      From my admittedly limited exposure to turbo codes, it seems there are no redundant bits and the algorithm never detects an error per se. Instead it always backtracks to find the most likely sequence. Hence the huge performance demands - this analysis needs to happen for every possible state of the encoder for every bit, times multiple iterations (the more you do, the closer to the limit you get).

  11. Reception Quality. by Omni+Magnus · · Score: 3, Interesting

    I live in a rural area, where we are sometimes lucky that we have a signal, let alone a good one. This could improve the reception for us a lot. Either that, or it doubles the battery life of the cell phones. Either way, I am happy. Although I wonder if this coding could be used in wireless devices as well. Hopefully this could somehow be used to help limit the battery drain of WiFi on a laptop/PDA.

  12. Turbo Codes for modems? by Doppler00 · · Score: 3, Interesting

    Could turbo codes be used with a 56K modem giving somewhere around 80kbps of bandwidth?

    1. Re:Turbo Codes for modems? by distributed · · Score: 5, Informative

      well they are not exactly a compression technique... but basically an error correcting technique.... like hamming. And thus help you transfer more reliably at the same power.

      see this small writeup

      besides changes like the one you talk about would require hardware changes... as i said its not compression

      --
      [all generalizations are untrue except this one]
    2. Re:Turbo Codes for modems? by Anonymous Coward · · Score: 1, Informative

      My understanding is that thay aren't employed for modems, but not for any fundamental reason. Rather, turbo decoding requires evaluating certain likelihood functions before the iterations begin, and the likelihood function evaluations can be rather complicated when the channel doesn't fit the additive white Gaussian noise model. Experimental tests indicate that the background interference on phone lines doesn't behave much like white Gaussian noise, especially or ADSL modems. Apparently (older) Reed-Solomon codes work well for these applications.

    3. Re:Turbo Codes for modems? by Anonymous Coward · · Score: 0

      No. The channel capacity is 64kbps.

    4. Re:Turbo Codes for modems? by Just+Some+Guy · · Score: 2, Informative

      No. A POTS line has 64000bps of bandwidth (minus 8000bps for signalling). That is the maximum number of bits you can push across the connection per second.

      --
      Dewey, what part of this looks like authorities should be involved?
    5. Re:Turbo Codes for modems? by Anonymous Coward · · Score: 0
      No, BUT... I can see where turbo codes could be used to allow a 56K modem actually communicate at 56Kbps*, even over noisy lines. Typically, modems will negotiate a communication speed, starting at a higher speed, then throttling down until the error rate is minimal. In areas with noisy connections, often the negotiated speed is somewhat lower than 56Kbps. With turbo code usage, the acceptance criteria can be met at a lower S/N level, thus allowing full modem speed over noisy (or lower power) lines.

      * Well, 53Kbps, but that's a separate issue, I believe.

    6. Re:Turbo Codes for modems? by Short+Circuit · · Score: 1

      So how does ISDN work?

    7. Re:Turbo Codes for modems? by ipjohnson · · Score: 1

      There are 2 channels (lines if you will) each 64K. Some setups had the land line on the second line so if you wanted to make a call your ISDN would drop down to one channel and your back to a normal modem :)

    8. Re:Turbo Codes for modems? by Short+Circuit · · Score: 1

      So the ISDN modem takes full control of the signaling on the line?

    9. Re:Turbo Codes for modems? by Anonymous Coward · · Score: 0

      Yes, there's a 16 Kbps signalling channel (D channel) which is always active.

    10. Re:Turbo Codes for modems? by shawno · · Score: 1

      > No. A POTS line has 64000bps of bandwidth

      True--if you're talking about the whole telephone network, including the digital parts. Then something shy of 64kbps is the speed limit. But the "plain old telephone service" part of the line has a capacity that's a function of noise on the line.

      Shannon's theorem says that, if the signal-to-noise ratio is high enough, you can squeeze as much information as you'd like into an arbitrarily narrow bandwidth.

      The missing piece of information required to answer the question about modem speed is this: the signal-to-noise ratio on a typical POTS line is about 30 dB, or 1000:1. Plug that into the equation given above and you see that you can fit something in the neighborhood of 30 kbps on a phone line. If you want to do better, you have to have a quieter line, or you HAVE TO SHOUT--that is, increase the signal level.

      My recollection is that 56k modems have to shout to get all the way up to 56k, and either the FCC or the phone company (I forget) won't let the modems yell. If they let your modem get too loud, your signal could leak into your neighbor's line, and they'd have to listen to your squawking. DSL modems, by the way, shout real loud.

      In the fine print on Shannon's theorem, it says that you can approach the theoretical capacity so long as you perform sufficient processing on the signal. The processing can get to be hard as you approach the limit, though. That's why the turbo codes are still cool, a decade later. Even if they won't help your POTS modem go faster.

    11. Re:Turbo Codes for modems? by dillon_rinker · · Score: 1

      No. But if you assume that 56K is the maximum amount of information that can be carried on a phone line at current power levels, then if all the phone companies change all their equipment and everyone buys a new modem, then turbo codes would let us nearly 112K without changing the power level. Or we could do the same thing without turbo codes by doubling power level.

      Or we could reach close to 1,000K by calling it DSL.

    12. Re:Turbo Codes for modems? by harrouet · · Score: 0

      No, the nominal speed of a phone channel is 64kbps. There is no way you will do 80kbps on that, even with compression.

    13. Re:Turbo Codes for modems? by shawno · · Score: 1

      > then if all the phone companies change all their equipment and
      > everyone buys a new modem, then turbo codes would let us [reach]
      > nearly 112K without changing the power level

      For the quarter-of-a-trillion dollars that would cost, we should demand 150kbps! :)

      BTW, I think doubling the signal power buys you only another 3 kbps.

    14. Re:Turbo Codes for modems? by jafuser · · Score: 2, Informative

      DSL modems, by the way, shout real loud.

      Just for those reading, DSL isn't just louder shouting, it's shouting at a much higher frequency so there's a lot more waves to float your data on. =)

      --
      Please consider making an automatic monthly recurring donation to the EFF
    15. Re:Turbo Codes for modems? by Kris_J · · Score: 1

      Given that I'm currently connected at 49.2, I'd buy a new modem if a product was released that my ISP supported.

  13. Not really news... by bsd4me · · Score: 5, Informative

    Turbo codes aren't really new. As the article states, they were invented in 1993. I have a big stack of papers on them at home.

    Turbo codes have a few problems, though. One, they are a pain to implement and consume a lot of resources. Two, turbo codes are SNR dependent, which makes them harder to use in varried channels.

    The article also makes it seem like there were no coding advances since Shannon published his orginal paper on channel capacity. Ungerbock's papers on trellis coded modulation (TCM) from 1987 or so radically altered digital communications, and he should have been mentioned. Some of the current turbo code research is trying to unify TCM and Turbo Coding (TTCM), which has great promise once it is practical.

    --

    (S(SKK)(SKK))(S(SKK)(SKK))

    1. Re:Not really news... by Zoinks · · Score: 1

      Question for you with the big stack of papers:

      When I first saw a lecture on turbo codes 5 years ago, they suffered from an irreducible error rate phenomenon. Have they figured a way around this? Also, it seemed that choosing the proper interleaving was a black art.

      Would read the articles if I had the time...

    2. Re:Not really news... by bsd4me · · Score: 1

      To be honest, it's been about four years since I did any real work with digital communications. I still have all of my notes, papers, but they are stashed away.

      At the time, we wrote off turbo codes as unusable for our application. The biggest problem was the complexity. The other big problem was (if I remember right) that we were concerned about performance degredation due to channel variability. If turbo coding is being considered for next gen mobile standards, then they probably figured out a way aound this.

      --

      (S(SKK)(SKK))(S(SKK)(SKK))

  14. theres plenty of room at the bottom !! by distributed · · Score: 2, Informative

    Error correction again seems like one of the bottom less pits... like trying to achieve zero kelvin... perfect vacuum and of course this landmark talk by feynman.

    Another thing that worries me is why all prepostrous claims are met with so much resistance.... relativity, quantum mechanics, secure-crashfree-windows(oops)...
    strange world we live in.

    --
    [all generalizations are untrue except this one]
    1. Re:theres plenty of room at the bottom !! by pclminion · · Score: 1
      Another thing that worries me is why all prepostrous claims are met with so much resistance....

      If it's true, it will be accepted in the end. Scientists don't want to live in a fantasy world. It seems logical that preposterous claims are met with resistance, otherwise every nutcase who makes an outrageous statement would cause a massive waste of time as people try to validate it.

      And anyway, nothing about turbo codes is preposterous. It's been around for years, and I really don't understand why this article is written as if there is some huge controversy around it.

  15. Re:Pfff there's a lot faster than this by spacefight · · Score: 1

    Ehm, what have you been smoking recently?

  16. Moores Law? by scum-e-bag · · Score: 2, Interesting

    Is there a similar Law to Moores law (or a combination of such) that could be applied to this compression of data and the effective use of the spectrum? As time goes I feel we are going to see the need for the available ammount of wireless transmission medium to increase. How long before we hit the theoretical limit of data transmission and the planet is saturated?

    Just interested...

    --
    Does it go on forever?
    1. Re:Moores Law? by metamatic · · Score: 2, Informative

      Compression is weird.

      You can calculate the best possible compression scheme for handling arbitrary data. That is, the compression algorithm which, if you fed it every possible combination of input data, would compress the data the best. The algorithm is called Huffman coding.

      The problem is, in actual use Huffman coding is crap. Why? Because real data isn't random, it doesn't cover the entire space of possible data.

      So useful compression algorithms take advantage of the non-randomness of actual data, to do significantly better than Huffman--but only for particular kinds of data. For instance, run-length encoding is fabulous at compressing bitmap graphics which have large areas of the same color--but feed it plain text, and it's hopeless. Lempel-Ziv algorithms are great at compressing plain text, but they're not good at compressing audio files.

      As someone else has pointed out in the threads, if you allow your compression scheme to be useful only for particular files, and allow the compression and decompression software to be arbitrarily complex, there's essentially no limit to how tight you can compress data.

      For example, suppose I want to write some software which will compress webcam images of playing cards on a table, for transmission across the net. One approach is to have the encoder recognize the cards, and make the decoder contain a complete set of playing card images. That lets me compress a complete 24-bit image of playing cards on a table into a few bytes--a byte to say which card, one to say what angle it's at, and send them in order from back to front. Of course, the resulting code is useless if someone drops a $20 bill on the table, and doing the compression is a bitch.

      So in general, there's no way to tell what the technical limit is on compression. There's usually a tradeoff between how specialized the compression is, and how effective; and if your application allows lossy compression, you can compress still further (e.g. JPEG, MP3).

      --
      GCHQ Quantum Insert installed. If only our tongues were made of glass, how much more careful we would be when we speak
    2. Re:Moores Law? by Garak · · Score: 5, Informative

      This technique is only for one very small specfic part of the specturm, a communication channel. Communcation channels can very from a few khz in size to a few Mhz, I belive 6Mhz is the biggest which was orginally for TV but channels orginally desinated for TV are not being used for 802.11b and g.

      The total spectum goes from 30hz right up past light at some crazy big number. Frequecies below 30Mhz are called HF, these frequceys are pretty full but the total band is only 30 Mhz, thats only 6 TV channels, or alot of small 30khz voice channels. This band is so saturated because its not limited to line of sight and its possible to communicate right around the world on it. Its also the easyest to transmit and recive on because filters for these low frequcencies have very high Q(very narrow bandpass, basicly tune better). At these freq. things are already pretty saturated but are strictly regulated along with most of the spectum up to 300Ghz.

      Frequcencys from 30Mhz-1Ghz have been the primary frequecys for local communications for the past 50 years or so. Ever since super-hetrodyning has been around, that allows you to "move" a freq down to a lower intermediated frequecy where you have high Q filters. This range is pretty full too, not much room for new communications, aircraft, broadcast tv and radio, police, cell phones, everything is in this range, old UHF tv channels were resently given up to make room for cellphones. These bands are strickly los, well rf los which is a little better than optical line of sight, lower frequencys refract and difract more than higher frequncy light..

      Above 1Ghz has been very expensive to use up untill recently. With the advent of new semiconductors and processes its now viable to use these frequecys. There is lots of bandwidth up here to use, alot of it is tied up in radar and with the miltary which is just legal BS because 99.999% isn't being used. Its more political than techinical. There is also quite a bit of it being wasted by older technology that use like 20Mhz for a 6Mhz signal.

      Also alot of companies own rights to these microwave frequenies(above 1Ghz) and have swiched to fiber optics and they are just sitting their idle.

      Frequencys above 1Ghz can be used again and a again in diffrent areas provided they are seperated by mountains or the curvature of the earth. The problem with 802.11b is that there are only 3 channels that don't overlap.

      Also with frequencys above 1 Ghz you can use a dish to focus the signal in one area rather than using more power in all directions. This way you will only interfear with people using the same frequcys in the direction that your dish is pointing. This flashlight vs a room lamp, the flashlight can light up a small area far away and so can the room lamp, but the room lamp uses more power because it also lights up the full room.

      In short there is tones of spectum left, we just need to get some of it back from the military and wasteful users.

      --
      God, root, what is the difference?
    3. Re:Moores Law? by pclminion · · Score: 5, Informative
      That is, the compression algorithm which, if you fed it every possible combination of input data, would compress the data the best. The algorithm is called Huffman coding.

      No. Huffman coding is only optimal if the block size grows to infinity. In that case, it can approach the Shannon limit. For finite data sets (i.e., all data sets), arithmetic coding performs slightly better on a per-symbol basis, because it is able to use fractional numbers of bits to represent symbols.

      Huffman is never used on its own, except as a demonstration of basic compression algorithms. It's commonly used as the final step in entropy-coding the output symbols of another compressor, commonly a lossy compressor, like JPEG, MP3, or MPEG.

      The problem is, in actual use Huffman coding is crap. Why? Because real data isn't random, it doesn't cover the entire space of possible data.

      In actual coding, it is crap, but not for the reasons you listed. It's crap because it's infeasible to allow the block size to grow without bound, since the number of possible codes increases exponentially.

      As someone else has pointed out in the threads, if you allow your compression scheme to be useful only for particular files, and allow the compression and decompression software to be arbitrarily complex, there's essentially no limit to how tight you can compress data.

      There's a very clear limit, given by the Shannon entropy (which can vary widely, depending on the transformations you apply to the data). It is also limited by the quite obvious pigeonhole principle. You cannot pick an algorithm which will compress a given data set arbitrarily well.

      So in general, there's no way to tell what the technical limit is on compression.

      No. The limit is definitely the Shannon entropy. You cannot magically represent data using fewer bits than necessary (and Shannon's entropy tells you how many that is). What changes between compression algorithms is the transformations which are applied to the data, or in other words, the different ways of looking at it which reveal a lower entropy than other ways of looking at it. However, the limit is always the Shannon entropy. The transformations can toss out data which is irrelevant. Your playing card example is a good one -- the information which is relevant is which card it is and possibly its angle. You've applied a transformation to the data -- transformed it from a bitmapped image to a series of card values and positions. You can then compress those pieces of information with Huffman codes (if the entropy allows it).

    4. Re:Moores Law? by Anonymous Coward · · Score: 0

      More power -> better SNR -> more bandwidth. Not sure if there's an upper limit in how much power one can transmit per m^2 vacuum. Something like a black hole density times the cube of the speed of light maybe?

    5. Re:Moores Law? by metamatic · · Score: 1

      Yeah, I skipped the discussion of block sizes and memory requirements, just like people generally skip such things when talking about Turing machines.

      Your distinction between "transformation" and "compression" is unclear and appears arbitrary. For the purposes of the original question, "put data in, get less data out that represents original data losslessly" is compression; whether the method used is technically known as compression or coding or transformation or notational re-engineering is irrelevant.

      --
      GCHQ Quantum Insert installed. If only our tongues were made of glass, how much more careful we would be when we speak
    6. Re:Moores Law? by pclminion · · Score: 1
      Yeah, I skipped the discussion of block sizes and memory requirements, just like people generally skip such things when talking about Turing machines.

      In the case of a Turing machine, it's not really relevant to mention how long the tape is (for example). It's definitely relevant to mention block sizes when discussing Huffman compression, because it has a major impact on its effectiveness.

      Your distinction between "transformation" and "compression" is unclear and appears arbitrary.

      I wasn't drawing a distinction between transformation and compression, but between transformation and entropy coding. "Compression" is the overall concept of reducing the number of bits required to represent the data.

      The distinctions are quite clear. Transformation preserves the number of bits, but potentially can reduce the entropy. Coding can mean several things, the most common of which is entropy coding, which preserves the entropy while reducing representation size. "Notational re-engineering" is, I'm guessing, a lot like coding -- renaming symbols. Compression is what you get by combining all these things.

      To someone with a rough understanding of compression, it might seem okay to equate all these things, but it's really not correct, any more than saying that a distributor and an alternator are really the same thing because they both happen to be parts of a car's electrical system. You can't replace either one with the other, and the car won't work without both of them.

    7. Re:Moores Law? by Lars+T. · · Score: 1

      That still leaves your claim: "The problem is, in actual use Huffman coding is crap. Why? Because real data isn't random, it doesn't cover the entire space of possible data. So useful compression algorithms take advantage of the non-randomness of actual data, to do significantly better than Huffman". Which is just plain wrong. Any form of compression, including Huffman, only works because "real data isn't random".

      --

      Lars T.

      To the guy who modded me down from perfect to terrible Karma - Apple haters still suck

    8. Re:Moores Law? by pe1chl · · Score: 1

      >You can calculate the best possible compression scheme for handling arbitrary data. That is, the compression algorithm which, if you fed it every possible combination of input data, would compress the data the best.

      That algorithm is a simple "copy" operation, compressing the input to an output that is the same size.
      It is not possible to construct a compression algorithm that will compress every possible combination of input data with a better result.

    9. Re:Moores Law? by Anonymous Coward · · Score: 0
      This technique is only for one very small specfic part of the specturm, a communication channel.

      Sigh ... this is what happens when people wish to show that they know something when they clearly do not. To address the completely fundamental way in which this totally misses the point is outside the scope of my patience.

  17. Re:Pfff there's a lot faster than this by Anonymous Coward · · Score: 0

    The same with your cell phone communications : you first agree with the person you're calling so that he downloads all the conversations you might possibly have and then you only have to send him the id of the conversation.

    Or you may use a monkey and a typewriter.

  18. Answer by bsd4me · · Score: 1

    From a theoretical standpoint, there is no difference between wired and wireless communications. The difference lies in how you model the channel. So, turbo codes can be applied to wired communications.

    --

    (S(SKK)(SKK))(S(SKK)(SKK))

  19. Re:whu-huh? by Anonymous Coward · · Score: 0

    Well, they were mentioned in one of my college classes way back when so I would guess that for anyone that considers this interesting (and understandable) news already knew about it.


    So, basically everyone who would have any interest in such a thing must certainly have taken the same college classes as you, and been there the day this was 'mentioned'? You may understand encoding algorithms, but you still have some work to do on ballparking probabilities!

  20. Well, no, not obvious by HarveyBirdman · · Score: 2, Informative

    There are a lot of high data rate links where it's either prohibitively complex to implement turbo codes, or the nature of the channel actually makes trellis codes concatenated with some other code a better choice.

    --
    --- Ban humanity.
    1. Re:Well, no, not obvious by Inspector+Lopez · · Score: 1

      ... and an earlier SlashPost remarked that latency was inevitably large with these huge block codes. And that's true. However, the trellis codes --- which have their own problems for decoders, such as big memory requirements --- have relatively low intrinsic latency.

      The trellis codes have less "beautiful math" supporting them than do the block codes (the Galois Fields are gorgeous, but the trellis codes are very very useful. Someone else mentioned that block codes are fine for long-haul comm in space; but I'm pretty certain that the error control coding for Galileo (of damaged antenna fame) were big trellis (convolutional) codes --- not block codes.

      There was a rather interesting article in Nature. 'way back in 1988 or so, in which some physicists developed a class of codes which could approach the Shannon Limit even in low SNR. These codes were developed as analogs of Ising Spin Glass models.

      Gotta love Google! Here's the citation---

      N. Sourlas. Spin-glass models as error-correcting codes. Nature, 339:693a"695, 1989

  21. Delay by kohlyn · · Score: 3, Informative


    As other posters have commented, turbo codes have been around along time. Any Digital Modulation Course will cover it.

    Turbo Codes do have one major drawback ... they add a huge delay into the data stream. It works by overlapping data on the same bit (sound implausible, but that's how it works), and it essence sends the same data several times. Turbo codes are used with some satellites, and add an extra 10-20 minutes delay to the communication, for satellites this isn't too bad ... for cell phones this is dreadful.

    1. Re:Delay by AnonymousNoMore · · Score: 2, Informative

      10-20 minutes delay!

      What are they using for the decoding? Monkeys turning hand cranks?

      Modern turbo coding cores (and I mean modern as in several years ago) introduce a latency of only a couple frames.

    2. Re:Delay by jobbegea · · Score: 1

      I suppose you mend seconds not minutes. Even then a 10 second delay is unusable for cell phones

      --

      Net sa best, mar it koe minder
    3. Re:Delay by Anonymous Coward · · Score: 0
      Hey, I've tested satellite modems with turbo coding, and you say it adds 10 to 20 minutes delay?
      No way!!

      try 10 to 20 milliseconds delay, and I'll believe you..
      besides, convolutional coding plus Reed-Solomon delay is can easily be larger for equivalent BERs.

    4. Re:Delay by Anonymous Coward · · Score: 0

      what your saying is rubish ... the delay is big in terms of "algorithms run time" relative to other algorthims (i.e. you need a fast dsp or asic) ... i have implemented it and integrated it with sat-com solutions and seen only the typical delay for an ip packet given a geo-stationary satelitte ... data rates were well over 1 Mbits per socond on the up link ...

    5. Re:Delay by Anonymous Coward · · Score: 0

      Thanks for making shit up and bringing the general level of intelligence down. You may now resume your regularly scheduled fapping in your parents' basement.

  22. High-powered? by Lehk228 · · Score: 3, Informative

    After partially reading the FA It seems that this scheme is particularly well suited for what it is currently doing, Sat Comm and deep space probes where you have alot of computational and analysis power at the recieving end but not a good way to ask for a re-transmission, when you have a multiple second (or multiple hour) latency in your communication system but really, this is not going to be in a cell phone for quite a while, cell phones are built to make lots of connections from one tower, not to make your phone get insane coverage or to make your battery last longer. especially the stuff abour predicting bit value based on analog value, so now we turn every digital reciever into a digital reciever + Analog to Digital reciever in x bits.... honestly i think most consumer applications are not worth the added cost. keep in mind it has been 11 years since this tech came out... communications companies aren't stupid... it WOULD be on the market if it was feasable/affordable.

    --
    Snowden and Manning are heroes.
    1. Re:High-powered? by Beryllium+Sphere(tm) · · Score: 2, Informative

      In the specialized market for data communications in the long-range but noisy HF spectrum (roughly 3-30MHz), there's at least one modem that relies on analog sampling of the data signal.

      It's a really clever hack -- when the protocol asks for a retry, the modem compares the analog levels of the second copy of the packet to the analog levels of the first copy. At first I thought they were signal-averaging, but a telecom engineer told me it's doubtless more sophisticated.

      So, even before applying ECC to correct bad bits, the modem has a more accurate idea what the bit was intended to be.

      >but not a good way to ask for a re-transmission

      It's not just deep-space missions where that's an issue. You don't want to ask for re-transmissions in TCP. It thinks you're congested and starts slowing down. Worse, imagine a mesh radio network in which a packet needs to pass through several noisy hops. Who retransmits?

  23. Turbo Codes? by Czernobog · · Score: 2, Insightful

    People have been working on them for ages and yes there are significant advantages.
    However, the latest word on source and channel coding though, is Space-Time Coding. Especially convolutionsal S-T codes are very very promising and quite naturally perform even better than block S-T codes...

    What I don't understand is why this now? It's like running a feature on GSM, instead of writing about TDD or FDD in 3G, or even the discussion going on about how 4G will shape out to be...

    --
    /. Where the truth
  24. Re:Pfff there's a lot faster than this by John+Harrison · · Score: 1

    What is this Nobel price you speak of?

  25. Value of bands by tekunokurato · · Score: 1

    Yesterday, Nextel finalized a deal to add a pretty big chunk of spectrum to their business (in exchange for some sort of administration requirements for police and other channels which currently fit in that band.

    Are there any of you who could comment on whether this will reduce the value of such a chunk of the spectrum?

    1. Re:Value of bands by tekunokurato · · Score: 0

      eh, I just RTFA and I guess it's kind of old news. never mind, then, I guess.

  26. It gets better by s20451 · · Score: 4, Interesting

    Briefly, the big problem in data communication is achieving the Shannon limit, which is the maximum theoretical data rate at which information can be transmitted with arbitrarily low probability of error. Shannon proved his result in 1948, but until the Turbo guys, nobody knew how to achieve it.

    The main problem is that optimal decoding of any non-trivial code is NP-hard, which has been known for about 30 years now (i.e., the only known algorithm has exponential complexity in the code length). The Turbo breakthrough was to show that a suboptimal decoder with O(n) complexity for code length n could nonetheless achieve excellent results. This is the so-called "Turbo principle".

    There is an even "newer" class of codes called Low-Density Parity-Check Codes that can beat turbo codes. Turbo codes have a small gap to the Shannon limit, and these new codes can potentially eliminate the gap. Small gains are a big deal; the rule of thumb is that 1 dB of gain is equal to a million dollars of annual revenue for a wireless provider.

    The twist is that these LDPC codes were actually proposed in a 1963 PhD thesis, but were disregarded as beyond the computational abilities of the time. They were only "rediscovered" in 1996, after the Turbo code furore.

    --
    Toronto-area transit rider? Rate your ride.
    1. Re:It gets better by avalys · · Score: 2, Insightful

      1 dB of gain is equal to a million dollars of annual revenue for a wireless provider

      So, turbo codes have brought the gain differential (sorry, don't know the proper term) to .5 dB. The .5 dB that's left would bring in only $500,000 of revenue?

      That doesn't sound like terribly much, considering how much money those companies are pulling in already.

      --
      This space intentionally left blank.
    2. Re:It gets better by GuyZero · · Score: 4, Interesting

      The twist is that these LDPC codes were actually proposed in a 1963 PhD thesis, but were disregarded as beyond the computational abilities of the time. They were only "rediscovered" in 1996, after the Turbo code furore.

      The article also mentions that the latency associated with turbo codes is too high for most voice applications and that LDPC codes, while more computationally intensive, have a low latency. (At least, that's what I remember from the article).

      I thought it was funny that their sponsor, Alcatel or whoever, never patented it in Asia so NTT has been using turbo codes in Japan for years, free.

    3. Re:It gets better by Short+Circuit · · Score: 4, Insightful

      Just because a company's revenue continues to grow doesn't mean that company's profit margin is a constant percentage... A multi-billion dollar corporation could very easily be making only five-hundred thousand in profit. Despite the size of the comany, adding another five hundred grand to their profit is still twice what they were making.

    4. Re:It gets better by Foxxz · · Score: 3, Informative

      We're talking about signal loss. Every 3db your signal doubles (or halves if you're talking about loss). If your losing 3db of signal information that means you're only using half of the theoretical bandwidth avalible in a frequency. Which means you can only have half the theoretical amount of people using the same cell phone frequency. Therefore, as you use better encoding algos to lessen the loss in db you can cram more people into the same frequency and get a better density ratio for your signals. So 1db less loss is significant.

      -Foxxz

    5. Re:It gets better by Anonymous Coward · · Score: 1, Insightful

      I haven't heard the 1M figure before, but I bet that it is per tower, or per tower in densely populated areas.

    6. Re:It gets better by Anonymous Coward · · Score: 0

      Rateless codes are still cooler, allowing you to generate new encoding symbols on demand. Check out http://www.digitalfountain.com

    7. Re:It gets better by Anonymous Coward · · Score: 0

      One interesting problem we've had with near-shannon-limit codes is that it is hard for the phase locked loops to lock at below 0 dB SNR (shannon limit is -1.6 dB SNR).

      I guess the point is that meeting the shannon limit is harder than finding good codes...

    8. Re:It gets better by Phil+Karn · · Score: 4, Informative
      Actually, the latency associated with even an ideal code is dictated by Shannon. The closer you want to approach the Shannon limit, the larger the code block must be. The larger the code block, the longer it takes to transmit. So at low data rates, you can wait a long time just sending the encoded block even if you can instantly decode it once you get it.

      These large block sizes are not a problem at high data rates or on very long deep space links where the propagation delay still exceeds the block transmission time, but they are a problem with heavily compressed voice where low latencies are required.

      One way to decrease the average latency associated with a forward error correcting code is to attempt a decode before the entire block has been received. If the signal-to-noise ratio is high, the attempt may succeed; if not, you wait, collect more of the frame and try again, and you've only lost some CPU cycles. This is called "early termination", and it's one of the tricks done in Qualcomm's 1xEV-DO system, now deployed by Verizon as BroadbandAccess. 1xEV-DO is probably the first widespread commercial application of turbo codes. A 128-byte code block is used to get good coding gain. This relatively large block size is practical because 1xEV-DO is primarily designed for Internet access rather than voice.

    9. Re:It gets better by Smitty825 · · Score: 1

      This relatively large block size is practical because 1xEV-DO is primarily designed for Internet access rather than voice.

      Isn't EV-DO designed _only_ for data access? I thought the DO stood for Data Only. (I currently work on IS-2000 1xrtt applications right now, and I have very little knowledge of EV-DO and EV-DV interworkings)

      --

      Doh!
    10. Re:It gets better by Phil+Karn · · Score: 1

      1xEV-DO is designed for Internet access, and I'm sure you're aware you can run voice over the Internet. That's all I meant.

    11. Re:It gets better by Smitty825 · · Score: 2, Insightful

      That's a fair answer :-) I always assumed that the latency on 1xEV-DO was too high to run voice over IP. (The reviews I've read on Verizon's EV-DO seemed to imply that the latency was too high to handle VoIP...however, it still is better than GPRS/EDGE)

      Also, (please correct me if I'm wrong), wasn't EV-DV designed to treat all (non-legacy) calls as data? (What I am asking is that all EV-DV calls are VoIP calls, and voice & data calls share the same service option number?) (I'm also of the assumption that EV-DV and EV-DO are two complementary (and incompatible) technologies, but I assume both use Turbo codes to maximize spectral efficiency?)

      Again, outside of IS-95 and 1xRTT, my knowledge on CDMA is quite low! When your company makes money off of currently deployed technologies, there isn't much incentive to retrain until there is a larger market demand...plus I haven't seen many good EV-DO/EV-DV documents online :-)

      --

      Doh!
    12. Re:It gets better by Phil+Karn · · Score: 1
      The latency is higher than I'd like, but it can be improved. Do a traceroute over 1xEV-DO and you'll see that much of the latency isn't in the airlink, but in the backhaul.

      I'm not up on 1xEV-DV, so I'm afraid I can't answer your questions about it.

  27. chemotheraphy is such a +5 Funny by Anonymous Coward · · Score: 0

    Thanks Mods for showing your utter stupidity once again by poking fun at a sick man's physical appearance-uterrly repugnent your sense of humor

  28. oooops, the french "invented" something? by Anonymous Coward · · Score: 0, Funny

    Man, crap! Echelon didn't work this time! That could have been two americans inventing this! Well just another technology they got out before US...
    When will the French learn to put all their sensitive data on WinBoxes, until then they are hindering the US market.

  29. LDPC codes by auburnate · · Score: 5, Interesting

    Lots of /.ers have been quick to point out that turbo codes have been around since 1993. However, the IEEE article points out that LDPC ( low density parity check) codes were invented in the early 1960s. Researchers have gotten the LDPC codes to outperform the turbo codes, and to top it off, the LDPC patents have all expired, meaning no royalty fees like turbo codes. My first slashdot post ... be gentle!!!

    1. Re:LDPC codes by Wimmie · · Score: 3, Interesting

      Lots of /.ers have been quick to point out that turbo codes have been around since 1993. However, the IEEE article points out that LDPC ( low density parity check) codes were invented in the early 1960s. Researchers have gotten the LDPC codes to outperform the turbo codes, and to top it off, the LDPC patents have all expired, meaning no royalty fees like turbo codes.

      The patent issue might by one of the reasons why it is probably not as widespread in use today. In Space communication various methods of FEC (Forward Error Correction) have been in use since the 60's.

      On OSCAR40 (a radio amateur satelite) it is one of the reasons why they proposed the combination of Viterbi (against random errors) and Reed-Solomon (against burst errors) codecs.

      A quote from KA9Q's website:

      Why not turbo codes?

      Some readers may ask: why not turbo codes? Why use FEC technology that has already been around for 25 years? The answer is simple: while turbo codes do outperform by 1-2 dB the classic concatenated codes proposed here, they were only discovered in the early 1990s and as such are surrounded by a minefield of patents that will not begin to expire for another decade. The Viterbi decoder was invented in the late 1960s, and the concatenated code used here has been around, almost in the present form, since before Voyager 1 and 2 were launched in 1977, so all patents on this technology have long since expired.

      http://www.ka9q.net/papers/ao40tlm.html

    2. Re:LDPC codes by TheSync · · Score: 2, Interesting

      Be careful, there are some specific LDPC codes that have been patented (such as the Digital Fountain "tornado" codes).

  30. Next on the list... by Anonymous Coward · · Score: 2, Funny

    I hope they get cracking on

    Up, Up, Down, Down, Left, Right, Left, Right... etc.

  31. Telebit turbo PEP? by Anonymous Coward · · Score: 0

    Telebit had these modems that had built-in support for UUCP and used a communication protocol called Turbo PEP (packetized ensemble protocol). I think the 'turbo' part was just a popular term and it was a custom trellis encoding, but it did squeeze more of the theoretical bandwidth than any other modems of the time. I know for a long time this modem had more processor than my Amiga (16MHZ 68000 class, compared to my 8MHZ 68000) so it had some ability to add complex processing to the data stream. Anyone know if telebit's 'turbo' refers to turbo codes?

  32. But what is it good for? by Smallpond · · Score: 5, Funny

    "much as when, in a crowded pub, you have to shout for a beer several times"

    I was wondering when they would get to the practical applications.

  33. Re:whu-huh? by addaon · · Score: 1

    They were discussed in classes at both universities I attended, too...

    --

    I've had this sig for three days.
  34. Re:whu-huh? by Anonymous Coward · · Score: 0
    must certainly have taken the same college classes as you, and been there the day this was 'mentioned'...

    Not only that. He would also have needed to pay attention to what the teacher said, rather than trying to convince his bench neigbor that the Apple II had already a working IPv6 implementation back in 1982...

  35. Turbo Codes for modems?-"Effective" rate. by Anonymous Coward · · Score: 0

    True, however it does raise the effective rate by decreasing the amount of retransmission needed. It's kind of like a tax cut for communications. You make the same amount of money, but you effectively get to keep more of it.

  36. TURBO! by deltwalrus · · Score: 2, Funny

    Didn't the word "turbo" go out several years ago, along with the useless PC case button of the same name?

    --
    --- "When I think back on all the crap I learned in high school, it's a wonder I can think at all..."
  37. Patented in Europe too, ArrgggGGGhhhHH!! by Anonymous Coward · · Score: 0

    The first thing Berrou and Glavieux did after confirming that their results were correct was to patent the invention in France, Europe, and the United States. At the time, France Telecom was the major sponsor of their work, so the French company took possession of the turbo code patents. The inventors and their institution, however, share part of the licensing profits. (Turbo codes were not patented in Asia, where they can therefore be used for free.)

    Are patentable the mathematical formulas derived from many authors since Shannon, Boole, Turing, ..?

    open4free

    1. Re:Patented in Europe too, ArrgggGGGhhhHH!! by Anonymous Coward · · Score: 0
      convolutional codes: are not patented.
      turbo codes (a work derived from convolutional codes): are patented.

      These french men are fucking us 8=o

  38. Turbo codes already part of cell phone standards by Anonymous Coward · · Score: 0

    Turbo codes are already in the UMTS mobile communications standards (3rd generation successor to GSM). Turbo coding is used for higher speed data rate channels, as opposed to Viterbi coding for voice channesl.

  39. And there's a lot better than that too... by heironymouscoward · · Score: 1

    Just assign every possible file a name, let's call it... hmmm... a "universal resource locator". Now, instead of exchanging huge files, you just exchange these universal resource locators, or "URLs". Imagine the savings! The only slight problem is that you can't actually read the file without downloading / transferring it.

    Hint: transmitting the names of things is not the same as transmitting the things themselves.

    --
    Ceci n'est pas une signature
  40. this is so weird by the_2nd_coming · · Score: 1

    I was looking up an article the other day for my Analysis class....I needed an article that involved "proof" meathods and such, I put in google "numerical analysis and cyphers"

    I got a reseach paper about turbo codes....and now today, I see this....I swear coincidences like this don't happen by chance.

    --



    I am the Alpha and the Omega-3
  41. Not so practical by NeedBeans · · Score: 1

    Since turbo codes cause a delay at the decoder: You would be waiting a long time for you beer. You'd better stick to good old parity bits: Keep on shouting...

  42. Re:It is news to us by Anonymous Coward · · Score: 0

    Its been impacting your consumer devices positively for the last 10 years, is the problem.

  43. Shannon's Limit.... by dustinmarc · · Score: 5, Informative

    I've seen that some people are curious about Shannon's limit, so I though I would give a little insight to it. It starts, with Nyquist's theorem which states:

    max data rate = 2H log V bits/sec

    Here, H is the bandwith available, usually through a low-pass filter, and V is the number of discrete signal levels (V = 2 in a straight binary system).

    This equation however is for a noiseless channel, which doesn't exist. So Shannon updated the formula for a channel which contains a signal-to-noise ratio. This turns out to be:

    max bits/sec = H log (1 + S/N)

    Here the log is again base 2, H is still the bandwith (in Hertz) and S/N is the signal-to-noise ratio in dB. Notice that the parameter V is missing. This is because no matter how many discrete symbols you have, or how often you sample them, this is still the maximum number of bits/sec that you will be able to attain.

    Most coding schemes, or modulation techniques as they are also called, rely on shifting signal amplitude, frequency, and phase to transmit more than one bit per symbol. The problem is that the more symbols there are, the harder it is to detect them correctly with the addition of noise. Basically, when you fire up your modem, and you hear all that weird buzzing and beeping, a lot of that is time being spent for your modem trying to determine just how noisy the channel is, and what the best modulation scheme it can use is while still being able to detect symbols correctly.

    --


    Microsoft should hire me. I can write code that doesn't work faster than the guys they have doing it now.
    1. Re:Shannon's Limit.... by GePS · · Score: 1

      Along a similar vein... Here's something else Shannon (I believe it was him) introduced in his original 1948 paper. It's how one calculates the minimum description length given only the probability distribution of the RV (independent of the channel it's being sent on.)

      The Entropy of a random variable is the minimum number of bits needed to encode all information about said variable, and it can be found by calculating

      -[Sum over all i] Pi*log(1/Pi)

      where Pi is the probability that the variable takes on the ith value. E.G. if an arbitary letter in a text message has a 1/4th probability of being an "a", then P1 = 1/4.

      One of the main problems with this value, is that it causes the average codeword length of an ideal coding scheme to often not be an integer, which is why optimal coding schemes only approach the ideal (the entropy), as has been stated earlier. (That is, of course, unless the probabilities are inverse powers of the # of letters in your alphabet - for binary codes this means that probabilities are 1/2, 1/4, 1/8th, etc.)

      It is known, however, how far off a real code gets from the entropy. The average code length of an optimal code always lies within one bit of the entropy.
      That is, Entropy(X)
      This is using a scheme that encodes each character individually, however, and can be made more accurate coding in block lenghts (this is the idea behind arithmetic coding, which somebody mentioned eariler).

      The main idea behind Arithmetic Coding is this: the probablility difference between a long string of likely characters and a long string of unlikely characters is greater than the probability difference of just the lone likely character and the lone unlikely character. That is, instead of encoding each letter of your message alphabet individually, encode chunks of your alphabet in one shot.

      This has been shown to get better compression, that is, you're able to divide the previous inequality by the encoded block length n, and get:
      Entropy(X)/n
      So you can probably guess that increasing the block length (n) gets you closer and closer to the entropy.

      Keep in mind all of my post assumed an error-free channel.

    2. Re:Shannon's Limit.... by GePS · · Score: 1

      bah. damn HTML parsing my inequalities.

    3. Re:Shannon's Limit.... by Anonymous Coward · · Score: 0

      actually the S/N ratio is NOT in dB.

  44. Theory vs. Practice by akajerry · · Score: 2, Insightful

    I always enjoy the moment in history when theory becomes practice.

    1904 Einstein predicts the energy released from nuclear fission (E=MC^2). ~1938 first atom split, the equation was correct.

    FM radio was therorized for many years, but until Amstrong came up with his Phase Lock Loop none could make an FM radio capable of broadcasting more than about a hundred feet.

    CDMA has been around for a while too, Qualcomm doesn't own the pattent on it, just some techniques for practically implementing it which wasn't possible until microprocessor and DSP technology got sufficientlt small and powerful to fit in a cell phone.

    This is the difference between science and engineering and I think it's very fitting that an engineering journal (that's the last E in IEEE) is pointing out that a bit of science has finally become interesting to a rather large group of engineers.

  45. wireless? or witless? only your provider knows? by Anonymous Coward · · Score: 0

    nazi softwar gangsters propose .mob(bile) ext. (Score:mynuts won, yet another nazi hostage scam rears it's ugly head)
    by Anonymous Coward on Wednesday March 10, @11:42AM (#8521935)
    how appropriate?

    lookout bullow.

    consult with/trust in yOUR creators.... you can almost smell the fear?

  46. "they actually outperform turbo codes" From articl by Anonymous Coward · · Score: 0
    Like turbo codes, LDPC attains capacity by means of an iterative decoding process, but these codes are considerably different from turbo codes. Now researchers have implemented LDPC codes so that they actually outperform turbo codes and get even closer to the Shannon limit. Indeed, they might prove a serious competitor to turbo codes, especially for next-generation wireless network standards, like IEEE 802.11 and IEEE 802.16. "LDPC codes are using many of the same general ideas [as turbo codes]," says Caltech's McEliece. "But in certain ways, they are even easier to analyze and easier to implement." Another advantage, perhaps the biggest of all, is that the LDPC patents have expired, so companies can use them without having to pay for intellectual-property rights.

    So uhmmm.... tell me again why turbo codes are so nifty keen? Explain why one would want to implement already surpassed non-free codes/tech when better free codes/tech are available?

  47. LDPC by nil5 · · Score: 3, Insightful

    You must remember that LDPC codes rely upon block (Codeword) lengths of many bits, e.g. over 10,000 bits long in order to achieve performance better than turbo codes. So your parity check matrix is enormous.

    I'm sure there are some efficient implementations, but for certain applications having packets that long can be prohibitive.

  48. Shannon's Limit....Can you hear me now? Good! by Anonymous Coward · · Score: 0

    " Most coding schemes, or modulation techniques as they are also called, rely on shifting signal amplitude, frequency, and phase to transmit more than one bit per symbol. The problem is that the more symbols there are, the harder it is to detect them correctly with the addition of noise. Basically, when you fire up your modem, and you hear all that weird buzzing and beeping, a lot of that is time being spent for your modem trying to determine just how noisy the channel is, and what the best modulation scheme it can use is while still being able to detect symbols correctly."

    You're forgetting spatial[1], like what the BLAST chip uses. As we gain a better grasp of noise (maybe by observing how mother nature solves the problem) our devices will get better.

    [1] Channel bonding could be thought of as the wired version of this.

  49. Monster Garage by Anonymous Coward · · Score: 0
    So *that's* how AOL's High-Speed internet equipment works! ;)

    j/k... AOL's High-speed internet equipment works by convincing people that paying double for the priviledge of being automatically identified as a retard is a *good* thing, because X million dumbasses can't be wrong!

    1. Re:Monster Garage by Evil+Adrian · · Score: 1

      AOL jokes are so 1999.

      --
      evil adrian
  50. Re:LDPC: It gets even betterer by !ucif3r · · Score: 5, Informative

    I have been dying for an article in my field to post on! Actually new classes of LDPC codes based on finite geometries have shown that you can construct them at almost any size (say 1000 bits, much more practical). These 'algebraic' LDPC codes perform much better than both Turbo codes and other LDPC codes mostly because they have more structure and are not generated by random computer searches.

    Also they don't require the more time consuming decoding algorithm needed for Turbo Codes (although they can be used). Check 'em out, you can search for papers on IEEE Xplore. Also someone is working on research to show Turbo Codes are LDPC codes! Crazy.

    I almost crapped my pants when I saw that statement that Turbo codes were new. ;-)

    -Take that Lisa's beliefs!

    --
    "Take that Lisa's beliefs!" - Homer Simpson
  51. Most frightening information .... by fygment · · Score: 2, Informative

    .... was the fate of Shannon. He is the father/creator of information theory which he shared with the world in a brilliant paper. He was afflicted by Alzheimer's disease, and he spent his last few years in a Massachusetts nursing home.

    --
    "Consensus" in science is _always_ a political construct.
  52. CDMA 1x by Anonymous Coward · · Score: 1, Informative

    If you use high-speed "1x" data (e.g. 153 kbps) on the CDMA networks from Verizon, Sprint, others, there is a reasonable chance that you are already using turbo codes (the high-speed data channels also support convolutional codes).

    Check here for all the gory detail (WARNING: 2.3 MB PDF).

  53. Re:LDPC codes (useful links to coding information) by rhussmann · · Score: 2, Interesting

    The neat thing about Turbo codes is that they're being used in the 3G cell phone standards (along with various other codes.) Turbo codes are powerful because they are iterative: they make several approximations at the information sent across the wire (or lack of wire, heh).

    This allows the system to do a good job of guessing what the original message is quickly. If you're interested in Turbo Codes, one of my former professors has done a lot of work with them, and has links to other turbo code sites on his website:

    http://www.csee.wvu.edu/~mvalenti

    Click on the turbo code link.

  54. National "Get more out of your stuff" day? by natefanaro · · Score: 1

    Did I forget to mark this on my calendar? At first it's hard drives and now bandwidth. What's next, how to overclock your pc/microwave/toaster/car?

  55. Whoa, way false by Srin+Tuar · · Score: 4, Informative


    Gee- thats funny. I work a a satellite internet company, and we use Turbo-codes in our FPGA's. The delay from TPC is in the low milisecond range- trust me.

    Anything close to one second would have been unacceptable.

    I dont know where you got your numbers from.

    1. Re:Whoa, way false by Lars+T. · · Score: 1

      Cut him some slack, he just wrote minutes instead of milliseconds ;-)

      --

      Lars T.

      To the guy who modded me down from perfect to terrible Karma - Apple haters still suck

    2. Re:Whoa, way false by Matt_Bennett · · Score: 2, Informative

      I remember reading one of the original papers on turbo coding- (maybe 5 or 6 years ago) and turbo codes are great, but they add latency (which was the point of the original poster in this thread)- the more latency they add, the better they get- they spread the "energy" of a bit of information over a long time period- as you approach infinite latency (useless, of course), you approach Shannon's limit. A little bit of noise only messes up a little bit of the energy in that bit of information, most of the information still gets through.

  56. STOP USING THE WORD "TURBO" by osjedi · · Score: 0, Redundant



    This is one of my biggest peeves. Unless the power output of your product is increased by using a turbine pump, driven by exhaust gasses to increase the density of the intake charge IT'S NOT A TURBO. STOP USING THE WORD TURBO TO DESCRIBE ANY DESIGN OR PERFORMANCE IMPROVEMENT!!!!!!
    I'd think a pair of professors could do better than that, French or not.

    --
    -=-=-=-=- osjedi uses Debian GNU/Linux. -=-=-=-=-
    1. Re:STOP USING THE WORD "TURBO" by Anonymous Coward · · Score: 1, Interesting

      Actually, as someone above pointed out, it is slightly similar to a turbo exhaust. You take the output of the decoder (its guesses basically) and feed it back into the decoder for another pass. As you iterate over the data block in different dimensions, thus after correcting one section in one axis, you might be able to correct a different section in another axis that previously had too many errors to correct.

      Back to the point, it is somewhat similar to a turbo, more so than most things that use the name.

    2. Re:STOP USING THE WORD "TURBO" by xlv · · Score: 2, Informative

      This is not some dumb use of turbo to mean fast, it's based on the fact that the decoders are using feedback to improve the error correction. This quote is taken from the article:


      It was France Telecom that asked Berrou to come up with a commercial name for the invention. He found the name when one day, watching a car race on TV, he noticed that the newly invented code used the output of the decoders to improve the decoding process, much as a turbocharger uses its exhaust to force air into the engine and boost combustion. Voila: "turbo codes"!


      Of course, the fact that I graduated from the school where they're teaching/doing research may be the reason I feel that I need to defend their name choice...

    3. Re:STOP USING THE WORD "TURBO" by osjedi · · Score: 0, Troll


      Ok, what you just described is not a turbo, it's what is know as Exhaust Gas Recirculation (or EGR for short). It's a technique used to reduce automotive emissions. Turbo sounds cooler, but it's still a lame perversion of the true meaning.

      They should just call it multi-pass decoding or something logical like that IMHO. My shop air-compressor has an intake, a compressor, and an exhaust, but I don't call it a jet engine.

      --
      -=-=-=-=- osjedi uses Debian GNU/Linux. -=-=-=-=-
    4. Re:STOP USING THE WORD "TURBO" by Enigma_Man · · Score: 1

      Actually, that's incorrect. A "Turbocharger" also commonly referred to as a "Turbo" on an automobile uses a turbine that sits in the exhaust stream to push another turbine connected to the intake stream to pressurize the intake stream. EGR is a separate thing used for emissions, where exhasut gas is introduced back into the intake manifold. It is supposed to help the engine reach operating temperature quickly, and reduce the amount of hydrocarbons, but all it really does is make the inside of your intake manifold turn black.

      --
      Nothing says "unprofessional job" like wrinkles in your duct tape.
    5. Re:STOP USING THE WORD "TURBO" by Enigma_Man · · Score: 1

      Maybe we should also stop using the words "FAST" and "SLOW" to describe how "quickly" a computer can process things. It's a word commonly associated with "fast", why get all aggravated about it? "Cool" is commonly associated with "good", but do you get all upset about that? I mean really.

      --
      Nothing says "unprofessional job" like wrinkles in your duct tape.
  57. Re:LDPC: It gets even betterer by s20451 · · Score: 1

    Hey, I just finished my PhD on LDPC codes. Where do you work?

    --
    Toronto-area transit rider? Rate your ride.
  58. ZeoSync by Anonymous Coward · · Score: 0

    Does anyone remember the ZeoSync folks from Florida from a few years back? I will not even repeat their claims.

    Where are they now?

  59. Or perhaps even more frightening... by Anonymous Coward · · Score: 0

    ...is that there's actually a city named Gaylord.

  60. Soft Decision Decoding by Detritus · · Score: 1

    Bit synchronizers with soft decision outputs have been available for decades. Error correction decoding algorithms that take advantage of soft decision inputs have also been around for a very long time, even if they haven't been widely implemented.

    --
    Mea navis aericumbens anguillis abundat
  61. New phone buttons? by UnknowingFool · · Score: 2, Funny

    If turbo codes get used in cell phones, does that mean that new cell phones will have a Turbo button? Great, now I have to use advanced duct-tape technology so that the turbo button is always activated.

    --
    Well, there's spam egg sausage and spam, that's not got much spam in it.
  62. My 386 Had This by ortcutt · · Score: 1

    The button was right there next to the power button, "Turbo". Must've used turbo codes when you pressed it. ;)

  63. Sorry, 56K is about it. by Ungrounded+Lightning · · Score: 4, Informative

    Could turbo codes be used with a 56K modem giving somewhere around 80kbps of bandwidth?

    Nope. (They'd actually reduce the data rate if used.)

    Turbo codes are members of the class "Forward Error Correction" codes, which are used to correct errors that creap in during signal propagation from a sender to a receiver over a noisy channel. They work by sending EXTRA bits (typically 3 times as many with turbo), then processing what you get to correct the errors.

    Turbo codes are typically used on noisy analog channels - such as radio links. Because they make the data bits less susceptable to noise you can reduce the amount of power you use to transmit them. It's like saying the same sentence three times in a noisy room, rather than scraeming over the noise level just once, so the guy at the next table can hear exactly what you said.

    Turbo code (and other FEC codes) send more bits. But because the underlying data is so much less likely to be received incorrectly the sender can can reduce the amount of power used for each bit by MORE than enough to make up for the extra bits. You can trade this "coding gain" either for more BPS at a given power level or a lower power consumption at a given BPS.

    But adding bits also increases the amount of information you're sending - either by broadening the bandwidth or more finely dividing the signaling symbol (for instance: more tightly specifying and measuring the voltage on a signal). So if your bitrate is limited by the channel capacity rather than the noise level you're stuck. The coding scheme will "hit the wall" and after that the extra bits come right out of your data rate. Not a problem with Ultra Wideband, or with encoding more bits-per-baud to get closer to a noise floor. But a big problem with telephone connections.

    If you had a pure analog telephone connection they would be useful for increasing your bandwidth utilization. And in the old days you did. And analog modems struggled to push first 110 BPS, then 300, then 1200 through it despite the distortion and noise. Then they got fancy and cranked it up to 9.6k and beyond by using DSPs.

    But these days you don't have an analog connection all the way. Your analog call is digitized into 8,000 8-bit samples per second and transmitted at 64,000 BPS to the far end. No matter WHAT you do to your signal you can't get more than that number of bits through it.

    (This is actually very good, by the way, if the connection is more than a couple miles long. The digital signal is propagated pretty much without error, while an analog signal would accumulate noise, crosstalk, and distortion. So for calls outside your neighborhood you usually get a better signal-to-noise ratio with the digital system for the long hops than with an analog system. That's why cross-continent calls these days sound better than cross-town calls in the '50s.)

    In practice it's worse than 64,000 BPS - because the system sometimes steals one of the bits from one sample in six for signaling about dialing, off-hook, ringing, etc. And you don't know WHICH sample. So you can only trust 7 of the bits. 56,000 BPS max. (It's a tad worse yet, because some combinations of signals are forbidden due to regulatory restrictions on how much energy you can put on a phone line - a particular signal could slightly exceed the limit. This makes the actual bit rate a little lower. And you have to sacrifice a little bandwidth to keep the receiver synchronized, too.)

    And you only get the approximately 56k in the downlink direction, because to use it you have to have a digital connection at the head end to make full use of the digital transmission. At your uplink you can't be sure enough of the sampling moment to create a waveform that would force exactly the right bit pattern out of the A-to-D converter. So you have to fall back to a modulation scheme that allows some slop when you're transmitting at the POTS end of the link. (If you had a digital connection at both ends - i.e. ISDN - yo

    --
    Bantam Dominique roosters crow a four-note song. Once you've heard it as "Happy BIRTHday" you can't NOT hear it that way
  64. Not new by bullestock · · Score: 2, Informative
    If you RTFA, you will discover that turbo coding is not new - e.g. it is currently used on at least one well-known packet-switched satellite phone system.

    The article simply says that turbo coding is about to go mainstream.

  65. Actually not true by Andy+Dodd · · Score: 1

    If you read the article (Not sure if that's possible to do without paying $$$ unless you're an IEEE member, in which case you have it in dead-tree format and can access it for free online), the reason they were called "turbo" codes was because one of the creators of turbo codes was apparently a big automotive racing fan.

    Part of the turbo coding system involves a feedback loop between two seperate decoders at the receiver. The feedback from each decoder helps the other decoder make a better decision about the data.

    Similarly, a turbocharger relies on feedback to operate. Exhaust pressure spins the turbo, which is used to compress intake air to the engine, increasing the amount of fuel that can be burned. More fuel/air being burned in the cylinders means more exhaust gases being pushed out, which results in a positive feedback loop that increases power until something is done to interrupt the loop. (Usually a wastegate that dumps the exhaust gas in a path that bypasses the turbine once the pressure reaches a certain threshold.)

    Thus while the naming of "turbo" codes isn't completely appropriate (no turbine...), it is far more appropriate than the old inappropriate association of the word "turbo" with anything fast.

    --
    retrorocket.o not found, launch anyway?
  66. Why not use VMSK? by pe1chl · · Score: 2, Funny

    Why are they not all migrating to VMSK, the magical modulation that promises to exceed the Shannon limit by orders of magnitude? Approaching it by .5dB seems to be not very much of an accomplishment, compared to that.

    Checkout http://www.vmsk.org/ where all the claims are made. Supposedly you could compress all communication to 1Hz bandwidth, or so.

    [of course I do not believe this]

    1. Re:Why not use VMSK? by TheSync · · Score: 1
    2. Re:Why not use VMSK? by pe1chl · · Score: 1

      Of course I know about this :-)

  67. Minor problem by Andy+Dodd · · Score: 1

    Doubling power does not double available channel capacity.

    Note the log(1 + SNR) in Shannon's theorem...

    --
    retrorocket.o not found, launch anyway?
    1. Re:Minor problem by dillon_rinker · · Score: 1

      Note the log (1+SNR) in Shannon's theorem...

      1. RTFA: I quote the relevant portion: "The scheme, the authors claimed, could double data throughput for a given transmitting power or, alternatively, achieve a specified communications data rate with half the transmitting energy"

      2. THEORETICAL vs PRACTICAL: Shannon's formula gives the theoretical max. Turbo codes double the practical max.

      3. HUMOR: Note the tongue planted firmly in the cheek..."Will this work?" "Sure, if you do a stupid $14 billion upgrade."

    2. Re:Minor problem by Andy+Dodd · · Score: 1

      "1. RTFA: I quote the relevant portion: "The scheme, the authors claimed, could double data throughput for a given transmitting power or, alternatively, achieve a specified communications data rate with half the transmitting energy" "

      In this case, the article is wrong. Articles can have errors, you know.

      You can have either of the two benefits mentioned above, but not both.

      Shannon's theorem C = B * log(1+SNR) is the theoretical maximum.

      The practical maximum for a given coding scheme can be thought of as
      C = B * log(1 + SNR * somefactor)

      Which translates (approximately) to C = B * (log(1+SNR) + log(somefactor)) for relatively large SNR. (Given that SNRs for most comm. systems are in excess of 10-20 dB, i.e. a factor of 10-100, this is a safe assumption)

      With old coding schemes, the practical limit was around 3.5 dB below Shannon's limit. Thus
      C = B * (log(1 + SNR) - .35)

      (since dBs are 10*log() instead of log())

      Turbo codes bring us to within 0.5 dB or so of the theoretical max.

      Thus C = B * (log(1 + SNR) - 0.05)

      Thus turbo codes will require 3 dB less (half as much) power (half the SNR) to achieve a given ratio of C to B.

      Assuming power (and hence SNR) constant, turbo codes will NOT double the ratio of C to B, unless the SNR is very low. At high SNRs, they will make very little difference at all if power (SNR) is kept constant.

      Note that the above equations are very quick and dirty approximations, but they illustrate the effects of the log() in Shannon's Theorem, both in the theoretical sense and in practical applications. i.e. doubling power (Turbo codes essentially double your "effective" power) does NOT double channel capacity.

      --
      retrorocket.o not found, launch anyway?
  68. Not long by Andy+Dodd · · Score: 1

    FYI, this applies not to compression of data, but to error correction. It's assumed with turbo codes that there is no redundancy in the information being encoded. (In reality there may be, but that's a completely different problem.)

    i.e. a communications system is always optimized to maximize performance with a bitstream that is assumed to be non-redundant.

    Turbo codes are a method for error correction, not compression. In fact, they do the exact opposite of compression - they ADD redundant data.

    As to a limit - Turbo codes have performance within 0.5 dB of SNR of Shannon's limit for a given channel. Can't do much better. (Although it may be possible to come up with a coding scheme that is less computationally intensive/has less latency)

    --
    retrorocket.o not found, launch anyway?
  69. Re:TURBO! - The name is correct! by Terje+Mathisen · · Score: 2, Interesting

    nosphalot is correct: The Turbo breakthrough was that they determined that by using feedback, just as in an engine turbo, you could get arbitrarily close to Shannons limit.

    The key idea is that this feedback gives you an infinite impulse response, i.e. in theory all bits ever transmitted through such a channel will continue to affect it for ever after.

    Even if you do limit the feedback time to more reasonable levels, you can still get a very useful increase in channel capacity.

    It is also important to notice that such a channel must have significant delay, i.e. here's another reason to complain about being lagged. ;.)

    Terje

    --
    "almost all programming can be viewed as an exercise in caching"
  70. Shannon limit applies only to linear systems... by Anonymous Coward · · Score: 0

    so a nonlinear system could exceed that limit.

    1. Re:Shannon limit applies only to linear systems... by pclminion · · Score: 1
      I think you are confusing the Shannon limit with the Shannon entropy. Shannon limit gives a maximum data rate for a channel given bandwidth and signal-to-noise ratio. Shannon entropy gives the average number of bits required to optimally encode a source symbol.

      I don't even have the slightest idea what "linear" or "nonlinear" means in the context of information entropy. Thus I can only assume you're talking about the channel theorem.

  71. Just wait three months by niom · · Score: 1

    And it won't.

    --
    -- Repeat with me: "There is no right to profits".
  72. I for one by Anonymous Coward · · Score: 0

    welcome our new turbo coding overlords.

  73. Re:LDPC: It gets even betterer by TheSync · · Score: 4, Insightful

    Right, Gallager worked out LDPC codes in 1963. Then they were forgotton for 20 years until people realized that Digital Fountain's "Tornado" codes were LDPC codes.

    LDPC codes will be behind DVB-S2, the new transmission system for digital satellite video distribution. Since they approach the Shannon limit so closely, there will be no DVB-S3.

    I should say that the IEEE article is a little over-hyped, in that these codes really only buy about 2-4 dB additional gain, concatenated RS and convolutional coding were pretty close to the Shannon limit in AWGN, but those last couple of dBs were nice, but the remaining 0.5-1 dB beyond LDPC & Turbo Codes isn't worth much.

    Much more important now are ways to handle "fast fading" channels found in mobile environments, this is what is driving OFDM.

    Also, both Turbo Codes and LDPC codes are really computationally intensive to decode. They are currently only decoded at speeds below 20 Mbps, generally implemented as (expensive) FPGAs. We won't see real cheap ASICs for another year or two.

  74. Interesting article by cavebear42 · · Score: 2, Informative

    I RTFLA and the attached pdf . First, let me say that the PDF sums it up, you can avoid the article. Second, I would like to know, according to this pdf, how did the system rate a +8 on a scale of -7 to +7?

  75. Why hasn't this already been in use? by Anonymous Coward · · Score: 0

    This is all applied math. Why have they waited 11 years to use this in communication? I learned about Turbo Codes in school a couple of years ago.

  76. Then maybe you can explain something to me by Atario · · Score: 0, Offtopic

    Are any of these things being use in cell phones right now?

    If so, why does hold music (but never speech) always get little half-second blocks of pink noise interspersed when listening on one?

    --
    "A great democracy must be progressive or it will soon cease to be a great democracy." --Theodore Roosevelt
    1. Re:Then maybe you can explain something to me by s20451 · · Score: 1

      I don't know if they are being used right now (I think not), but what you're describing happens for a different reason. Digitized speech in a cell phone is passed through a lossy compression algorithm which is optimized for voice as opposed to general sounds (they're called "vocoders"). As such they can achieve huge gains in compression over general lossy compression, though music will always sound like crap.

      --
      Toronto-area transit rider? Rate your ride.
  77. Re:LDPC: It gets even betterer by gnu-sucks · · Score: 1

    Can you explain how they are relating dB to datarates?

    dB what? dBf (decible fempto-watts, used for receiver signal strength often)?

  78. original paper / there are actually 3 authors by Anonymous Coward · · Score: 2, Informative

    The original paper is here

    Claude Berrou, Alain Glavieux, and Punya Thitimajshima, "Near Shannon Limit Error-Correcting Coding and Decoding:Turbo-Codes", in Proceedings of IEEE International Conference on Communications, (Geneva, Switzerland), pp. 1064--1070, May 1993.
    http://gladstone.systems.caltech.edu/EE/Courses/EE 127/EE127B/handout/berrou.pdf

    (with 400 citations, as counted by CiteSeer ResearchIndex
    http://citeseer.ist.psu.edu/context/31968/0
    -- yeah, it is since 1993 .. not "new", but currently still a hot topic in telecomm.)

    about the authors, the first two are French professors who had already mentioned in the article, the last one is Thai, at that time a PhD student at Ecole.

  79. Re:LDPC: It gets even betterer by !ucif3r · · Score: 3, Informative

    Yes, I hear that Space-Time coding is the 'new deal' for Rayleigh type fading channels. A few people in my dept. have been doing research into these codes. I should probably read the work whenever I don't have other projects, assignments, TA duties, marking, etc. to do. ;-).

    What amazes me is how far behind these companies are in actually implementing this technology. 10-years old is actually new.

    A friend of mine was saying that even when new research developments are implemented in new hardware the IT people (read: customers) don't understand how to use it anyways or just don't configure it at all (his comments applied specifically to high-end network hardware and new routing schemes). Reminds me of people who setup the company wireless network with 'default'.

    --
    "Take that Lisa's beliefs!" - Homer Simpson
  80. another misleading, it has actually THREE authors by Anonymous Coward · · Score: 0

    FYI,

    from this IEEE Information Theory Society Golden Jubilee Awards for Technological Innovation (1998) website,
    http://www.ieeeits.org/society/goldjub_tech.htm

    All three authors (Claude Berrou, Alain Glavieux, and Punya Thitimajshima) got the award for their invention of turbo codes.

    The first two are French professors who had already got mentioned in the article, the last one is Thai, at that time a PhD student at Ecole.

    The original paper in the conference is this one

    Claude Berrou, Alain Glavieux, and Punya Thitimajshima, "Near Shannon Limit Error-Correcting Coding and Decoding:Turbo-Codes", in Proceedings of IEEE International Conference on Communications, (Geneva, Switzerland), pp. 1064--1070, May 1993.
    http://gladstone.systems.caltech.edu/EE/Courses/EE 127/EE127B/handout/berrou.pdf

    for publications in Turbo Code, try this one

    TURBO CODE BIBLIOGRAPHY
    http://pilgrim.unl.edu/comlab/turbopage/tcb.html

  81. 3x redundancy by ChrisJC · · Score: 1

    So I don't understand how sending the same data three times over is efficient? The example illustration is sending 15 bits to code 5 bits.

    Please explain.

    --
    -- PC architecture - what a mess.
  82. Re:LDPC: It gets even betterer by s20451 · · Score: 2, Informative

    Usually the dB refers to the signal power to noise power ratio (SNR) -- noise power is usually proportional to the noise variance. Thus, an SNR of 0 dB means that the signal power and the noise power is the same.

    Ability to accurately distinguish bits in a communication system decreases with data rate (crudely speaking, this is because you get less time to "look" at each bit and distinguish it from noise.) For a given communication system, we have an acceptable probability of bit error, say 10^-6. Given this probability, usually we try to find the minimum SNR for a given data rate so that the criterion is achieved. To say that one system has 3 dB gain over another is to say that 3dB is the difference in SNR required to achieve the required probability of error. Since noise power is usually normalized, this means the difference in signal power is 3 dB.

    Of course, you can look at the problem from the other direction and say, for fixed SNR, what is the difference in data rate? In this sense, SNR and data rate are interchangeable.

    --
    Toronto-area transit rider? Rate your ride.
  83. What the fuck does this have to do Moores Law? by Anonymous Coward · · Score: 0

    some people just can't wait to get their rocks off by mentioning moores law in inapproprieate places and you sir are one of them!

  84. Re:LDPC: It gets even betterer by Anonymous Coward · · Score: 0

    Well, even in the Gulf War I, with all the fancy, newly deployed, crypto-equiped comm equipment that the US military had (SINCGARS, MSE), they often ran them w/o using the crypto features, especially SINGCARS. Plus, they had to communicate with NG/reserve units that did not have the new stuff anyways.

    Don't know what they're doing with the "new" stuff now. It's been at least 12 years since I've played with it.