Scribd
Upload
132 views

Lubi Transform

The document discusses using a combination of Luby Transform (LT) decoding and non-coherent M-ary frequency-shift keying (FSK) modulation for the physical layer of wireless sensor networks to improve energy efficiency. It analyzes the bit error rate, signal-to-noise ratio, and implementation complexity of this approach through Verilog simulations. The key parameters are analyzed to better understand the necessary tradeoffs.

Uploaded by

Shanmuga Sundaram
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
132 views

Lubi Transform

The document discusses using a combination of Luby Transform (LT) decoding and non-coherent M-ary frequency-shift keying (FSK) modulation for the physical layer of wireless sensor networks to improve energy efficiency. It analyzes the bit error rate, signal-to-noise ratio, and implementation complexity of this approach through Verilog simulations. The key parameters are analyzed to better understand the necessary tradeoffs.

Uploaded by

Shanmuga Sundaram
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

abstract

Energy consumption at the physical layer of WPANs or WBANs


which employs Reduced Function Devices (RFD) is a critical
parameter to be review seriously to prolong the life of battery
operated sensor nodes.
In this paper, a novel design technique that considers the
combination of soft decision Luby Transform decoder with non-
coherent M-ary FSK modulation scheme.
Even though this combination may be a promising candidate for
designing the physical layer of wireless sensor its performance is
analyzed through simulations using Verilog HDL platform.
And then some of the key parameters like Bit Error Rate (BER),
Signal-to-noise ratio (SNR), implementation complexity etc. are
analyzed so as to define the necessary trade-offs with much more
clarity.

introduction
LT codes approach minimal overhead as the message size
grows, even when the channel characteristics are unknown.
for some applications, a codeword with large message size
may experience excessive delay, here defined as the time
required for encoding, transmitting, and decoding a message.
For example, in a real-time application, the overall delay can
be dominated by the amount of time it takes to generate (at the
encoder) and receive (at the decoder) encoded symbols.
The LT decoder may have to wait for k or more symbols
before a codeword is produced.
Therefore, a large message size would lead to a long decoding
latency.
it may be better to use LT codes with a smaller message size
LT codes (encoding)
To generate a codeword, the information to be transmitted is first
divided into k input symbols, or variable nodes, of arbitrary length.
From these k input symbols, the encoder generates n encoded
symbols.
For each encoded symbol, the encoder randomly chooses a degree d
from a degree distribution (described below) and chooses uniformly
at random d input symbols to be the neighbors of the encoded
symbol.
The input symbols in a neighbourhood are exclusive -ored together
to form the encoded symbol.
As LT codes are rateless, this procedure continues until an
acknowledgement of successful decoding is received from the
decoder, or a pre-arranged number (n) of encoded symbols have
been generated
LT codes (Decoding)
In addition to the encoded symbols, the decoder must also know the
degree and set of neighbors of each encoded symbol.
This information can either be transmitted along with the encoded
symbols, or it could be generated locally using a pseudo-random generator
and a key.
When the decoder receives a set of encoded symbols, it searches for a
symbol with degree one, an encoded symbol with only one neighbor.
On the erasure channel, this encoded symbol is an exact copy of its
neighboring information symbol, so the decoder immediately recovers the
value of the information symbol.
The decoder then exclusive-ors the recovered information symbol with
each of its remaining neighboring encoded symbols and decreases their
degrees by one.
This process is continued until all encoded symbols have degree one or
until no more updates can be made without receiving more encoded
symbols.

frequency-shift keying
Frequency-shift keying (FSK) is a method of transmitting digital signals.
The two binary states, logic 0 (low) and 1 (high), are each represented by
an analog waveform.
Logic 0 is represented by a wave at a specific frequency, and logic 1 is
represented by a wave at a different frequency.
A modem converts the binary data from a computer to FSK for
transmission over telephone lines, cables, optical fiber, or wireless media.
The modem also converts incoming FSK signals to digital low and high
states, which the computer can "understand."
Basic Properties of Reed Solomon Codes
[
+
=
= =
1 2
) ( ) ( where , ) ( ) ( ) ( : form polynomial Generator (2)
t b
b i
i
x x g x m x g x c o
(
(
(

=
+ +

) 1 2 )( 1 ( 1 2
) 1 (
1
1
: matrix check parity The
t b N t b
b N b
H
o o
o o

1 N where ), ( over defined K) RS(N, =


m m
q q GF
)) ( ),..., ( ), ( ( ) ,..., , ( ) ( : form evaluation Polynomial (1)
1 1 0 2 1
= =
N N
f f f x x x x c o o o
1
1 1 0
... ) ( where

+ + + =
K
K
x f x f f x f
) ( in elements nonzero distinct are s
m
i
q GF o
Properties of BM algorithm:

Decoding region:

Decoding complexity: Usually


Basic Properties of Reed Solomon Codes
(contd)
min
2 d f e < +
Properties of RS code:

Symbol level cyclic (nonbinary BCH codes)

Maximum distance separable (symbol level):


1 1 2
min
+ = + = K N t d
) (
2
N o
2
min
d

You might also like