12.07.2015 Views

Journal of Emerging Technologies in Web Intelligence Contents

Journal of Emerging Technologies in Web Intelligence Contents

Journal of Emerging Technologies in Web Intelligence Contents

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

126 JOURNAL OF EMERGING TECHNOLOGIES IN WEB INTELLIGENCE, VOL. 2, NO. 2, MAY 2010VII. FORWARD ERROR CORRECTIONForward error correction [FEC] is a system <strong>of</strong> errorcontrol for data transmission, whereby the sender addsredundant data to its messages, which allows the receiverto detect and correct errors (with<strong>in</strong> some bound) withoutthe need to ask the sender for additional data. Theadvantage <strong>of</strong> forward error correction is thatretransmission <strong>of</strong> data can <strong>of</strong>ten be avoided, at the cost <strong>of</strong>higher bandwidth requirements on average, and istherefore applied <strong>in</strong> situations where retransmissions arerelatively costly or impossible.Such a typical situation where the receiver is not ableto make a request for the re-transmission <strong>of</strong> message isFM reception. FEC devices are <strong>of</strong>ten located close to thereceiver <strong>of</strong> an analog signal, <strong>in</strong> the first stage <strong>of</strong> digitalprocess<strong>in</strong>g after a signal has been received. That is, FECcircuits are <strong>of</strong>ten an <strong>in</strong>tegral part <strong>of</strong> the analog-to-digitalconversion process.Forward Error Correction Implemented:The Forward error correction algorithm consists <strong>of</strong>two parts namely Encod<strong>in</strong>g and Decod<strong>in</strong>g. The Encod<strong>in</strong>gis implemented us<strong>in</strong>g a Convolution algorithm and theDecod<strong>in</strong>g implemented is the Viterbi algorithm. Theconvolution encoder and the correspond<strong>in</strong>g Viterbidecoder are implemented <strong>in</strong> C programm<strong>in</strong>g language.Motivation for Forward Error CorrectionThe situation <strong>in</strong> which the receiver is not able to makea request to the sender for re-transmission <strong>of</strong> messageforms the basis for all forward error correctiontechniques. A typical radio receiver is a classic example<strong>in</strong> which the receiver has no provision to communicatewith the sender. Under such circumstances, if an erroroccurred <strong>in</strong> the signal transmitted, there will be no wayfor the receiver to detect the error unless some errorcontrol mechanisms are <strong>in</strong>corporated <strong>in</strong>to the signalbefore transmission itself. This process <strong>of</strong> add<strong>in</strong>g errorcontrol to the signal before transmission is calledForward Error Correction.A typical communication channel <strong>in</strong> which the datato be transmitted is encoded us<strong>in</strong>g some encod<strong>in</strong>galgorithm by add<strong>in</strong>g some redundant bits (Figure. 6).Thus the output <strong>of</strong> the encoder is called ChannelSymbols. These channel symbols are then transmittedover the wireless channel.Thus it can be seen that unless the error correctionmechanisms are <strong>in</strong>troduced there is no way for thereceiver to recover the orig<strong>in</strong>al <strong>in</strong>formation correctly.Hence Forward Error Correction mechanisms areessential if the receiver is to recover the orig<strong>in</strong>al<strong>in</strong>formation. There are numerous forward error correctionmechanisms each applicable to particular type <strong>of</strong>communication. The factors which govern which errorcorrection algorithm is used for a particularcommunication type are Bandwidth <strong>of</strong> the spectrumDepth <strong>of</strong> error correction requiredRate <strong>of</strong> encod<strong>in</strong>gProcess<strong>in</strong>g capacity <strong>of</strong> Sender/ReceiverIntroduction to Convolution Encod<strong>in</strong>gConvolution Encod<strong>in</strong>g typically <strong>in</strong>volves encod<strong>in</strong>g <strong>of</strong>stream <strong>of</strong> data bits by us<strong>in</strong>g previous bits to perform alogical operation, the output <strong>of</strong> which is the encodedchannel symbols. Thus depend<strong>in</strong>g upon the type <strong>of</strong>convolution encod<strong>in</strong>g, a s<strong>in</strong>gle data bit can have its<strong>in</strong>fluence on two or more adjacent bits thereby provid<strong>in</strong>gthe required redundancy to the data. This <strong>in</strong>fluence whicha bit has on other bits is what enables the receiver toidentify any bit errors that occurred dur<strong>in</strong>g the datatransmission.A convolution encoder is called so because it performsa convolution <strong>of</strong> the <strong>in</strong>put stream with encoder's impulseresponses. It can be represented mathematically aswhere x is an <strong>in</strong>put sequence, y j is a sequence from outputj and h j is an impulse response for output j. A convolutionencoder is a discrete l<strong>in</strong>ear time-<strong>in</strong>variant system. Everyoutput <strong>of</strong> an encoder can be described by its own transferfunction, which is closely related to a generatorpolynomial.Figure 6. Typical wireless communication channel© 2010 ACADEMY PUBLISHER

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!