1 / 6

Format Title Slide

Format Title Slide Objectives: Evaluation of forward error correction capabilities in terms of T x power, R x power, error correction capability, memory footprint (all the key points of SNs) Types of codes we used BCH RS Convolution BCH

spence
Download Presentation

Format Title Slide

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Format Title Slide Objectives: Evaluation of forward error correction capabilities in terms of Tx power, Rx power, error correction capability, memory footprint (all the key points of SNs) Types of codes we used BCH RS Convolution BCH How you did the implementation i.e. which portion of the code is where i.e. on Matlab + Mote Evaluation capabilities (or performance) parameters How did we calculate Show results of BCH Adv. / Dis. Advantages of BCH RS How you did the implementation i.e. which portion of the code is where i.e. on Matlab + Mote Evaluation capabilities (or performance) parameters How did we calculate Show results of BCH Adv. / Dis. Advantages of BCH Convolution How you did the implementation i.e. which portion of the code is where i.e. on Matlab + Mote Evaluation capabilities (or performance) parameters How did we calculate Show results of BCH Adv. / Dis. Advantages of BCH Comparison of results of 3 codes Recommendations for future

  2. Convolution codes Parameters Input bits(k) Output bits(n) Rate (k/n) Constraint length (m) Memory Implementation LFR(Linear feed shift register) Implementing generator polynomial in terms of LFSR Diagram An example polynomial with its implementation over LFSR Limitation of our scheme We have not implemented the bit-interleaver (it will incur more execution time Calculation of execution time at the SINK (how?)

  3. Different configurations Basic Assumption: Computation time will be proportionate on the mote or even slower because of slower crystal on the sensor but it will affect equally to all the configurations of error correction

  4. Graphs • B/w different (for rate = 2) (i) Constraint-Length v/s Memory (all lengths running from 3-9) (ii) Constraint-length v/s Encoding-time (all lengths running from 3-9) (iii) Constraint-length v/s Decoding-time (all lengths running from 3-9)

  5. Graphs • B/w different ( for rate = 3) (i) Constraint-Length v/s Memory (all lengths running from 3-9) (ii) Constraint-length v/s Encoding-time (all lengths running from 3-9) (iii) Constraint-length v/s Decoding-time (all lengths running from 3-9)

More Related