Pulse Position Modulation PPM using 555 timers

 Pulse-position modulation (PPM) is a form of signal modulation in which M message bits are encoded by transmitting a single pulse in one of 2^M possible time-shifts. This is repeated every T seconds, such that the transmitted bit rate is M/T bits per second. It is primarily useful for optical communications systems, where there tends to be little or no multipath interference

          Pulse position modulation (PPM) use pulses that are of uniform height and width but displaced in time from some base position according to the amplitude of the signal at the instant of sampling. The position of each pulse, in relation to the position of a recurrent reference pulse, is varied by each instantaneous sampled value of the modulating wave. Pulse position modulation is also sometimes known as pulse-phase modulation

ADVANTAGE OF PPM:

Pulse position modulation has the advantage over pulse amplitude modulation (PAM) and pulse duration modulation (PDM) in that it has a higher noise immunity since all the receiver needs to do is detect the presence of a pulse at the correct time; the duration and amplitude of the pulse are not important.

VERILOG CODE FOR CLOCK DIVIDER

In some of the applications we don't want a very high speed clock and the problem occurs when we have a fixed frequency clock then we have to use a module that divide the frequency of the clock by a certain factor that satisfies the requirement .It seems to b a difficult task but believe me it is a very simple thing to do and it can solve your problems.Clock Divider can be used in many applications like if you are implementing a Traffic signal on spartan board then you want to divide your clock frequency as you don't like the signals to change their states in less than a thousand part of a second the simple solution is he CLOCK DIVIDER.so,here is the verilog cod for the code.

Bisection Method For Finding Roots Of equation Matlab Code

fed up of doing calculations by hand to find the roots of an equation by "BISECTION METHOD" (one of  the bracketing techniques to solve an equation) the solution is simple and reliable write a piece of MATLAB code.Cant do this???? thats what i am here for !! here is the required code !! this code will
1.find the mean value at each iteration
2.plot the graph of true error
3.plot graph of approximate error
change the function and initial bracket according to your requirements!!
here is the code

WGA 1.9.9.0 and 1.9.9.1 FOR FREE

get rid of "windows genuine advantage" like thing in your PERSONAL computer .All you have to do is:

Remove Genuine Windows Validation Watermark

fed up of the "GENUINE WINDOWS VALIDATION" WATERMARK  !!! DONT BE SO WORRIED !!

WRESTLEMANI 27 THEME SONG WRITTEN IN THE STARS Tinie Tempah

Here are the  lyrics of the theme song of the main event of the WWE universe "WRESTLEMANIA 27"

Oh written in the stars
A million miles away
A message to the main
Ooooh
Seasons come and go
But I will never change
And I’m on my way

[Tinie Tempah - Verse 1]
Lets go…
Yeah
You’re listening now
They say they aint heard nothing like this in a while
Thats why they play my song on so many different dials
Cause I got more hits than a disciplined child
When they see me everybody brrrrrap’s, brrrrrraps
Man I’m like a young gun fully black Barrack
I cried tear drops over the massive attack
I only make hits like I work with a racket and bat
Look at my jacket and hat
So damn berserk
So down to earth
I’m bringing gravity back
Adopted by the major I want my family back
People work hard just to get all their salary taxed
Look Im just a writer from the ghetto like Malory blackman
Where the hells all the sanity at, damn
I used to be the kid that no one cared about
Thats why you have to keep screaming til they hear you out

VERILOG CODE BCD TO EXCESS 3 CONVERTER(GATE LEVEL)

Excess-3 binary-coded decimal (XS-3), also called biased representation or Excess-N, is a numeral system used on some older computers that uses a pre-specified number N as a biasing value. It is a way to represent values with a balanced number of positive and negative numbers. In XS-3, numbers are represented as decimal digits, and each digit is represented by four bits as the BCD value plus 3 (the "excess" amount):

• The smallest binary number represents the smallest value. (i.e. 0 − Excess Value)
• The greatest binary number represents the largest value. (i.e. 2 ^N+1 − Excess Value − 1)

The primary advantage of XS-3 coding over BCD coding is that a decimal number can be nines' complemented (for subtraction) as easily as a binary number can be ones' complemented; just invert all bits. In addition, when the sum of two XS-3 digits is greater than 9, the carry bit of a four bit adder will be set high. This works because, when adding two numbers that are greater or equal to zero, an "excess" value of six results in the sum. Since a four bit integer can only hold values 0 to 15, an excess of six means that any sum over nine will overflow.

Adding Excess-3 works on a different algorithm than BCD coding or regular binary numbers. When you add two XS-3 numbers together, the result is not an XS-3 number. For instance, when you add 1 and 0 in XS-3 the answer seems to be 4 instead of 1. In order to correct this problem, when you are finished adding each digit, you have to subtract 3 (binary 11) if the digit is less than decimal 10 and add three if the number is greater than or equal to decimal 10 (thus causing the number to wrap).

HERE is the code to convert a BCD number to EXCESS 3: