1. 1/19 2008, Graz, Austria Power Spectral Density of Convolutional Coded Pulse Interval Modulation Z. Ghassemlooy, S. K. Hashemi and M. Amiri Optical Communications Research Group, School of Computing, Engineering and Information Sciences, Northumbria University, Newcastle, U.K. Web site: http://soe.unn.ac.uk/ocr

2. 2/19 2008, Graz, Austria Outline  Aims and Objectives - Motivations  Introduction  DPIM and Convolutional Coded DPIM  Power Spectral Density of CC-DPIM  Results  Conclusions

3. 3/19 2008, Graz, Austria Aims and Objective – Motivation  Carry out analysis for the power spectral density for the convolutional coded DPIM and investigate:  Bandwidth efficiency  DC component.  Compare the results with both the uncoded and coded DPIM

4. 4/19 2008, Graz, Austria Indoor Optical Wireless Communications Definition:  OWC is wireless transmission of light i.e. infrared radiation through the medium of the air. Some advantages are:  Higher bandwidth.  Unregulated bandwidth.  Immunity to electromagnetic interference.  High security compared with RF.  Absence of multipath fading (due to the use of IM/DD).  Complementary to RF.

5. 5/19 2008, Graz, Austria Modulation Techniques

6. 6/19 2008, Graz, Austria Digital Modulation Schemes Information Frame 4 1 1 1 Frame 3 1 1 0 Frame 2 0 1 0 Frame 1 0 0 0 DPIM

7. 7/19 2008, Graz, Austria Digital Pulse Interval Modulation  DPIM signal is defined :  p(t) - rectangular pulse shape,  Ts - slot duration  a n - set of random variables representing a pulse/no pulse in the nth Ts  L = 2 M, hence for M = 2, L = 4 slots.

8. 8/19 2008, Graz, Austria DPIM - Convolutional Coding  Linear block codes like Hamming code, Turbo code and Trellis coding are difficult (if not impossible ) to apply in PIM because of variable symbol length.  Hence, Convolutional coding - since it acts on the serial input data rather than the block.

9. 9/19 2008, Graz, Austria Convolutional Coding  Defined as (n,k,K), where k and n are the input (1) and output bits (i.e. 2), and K is the memory element.  Code rate is defined as k/n = 1/3.  Constraint length (K)=3;  The Generator Function:  G 0 = [111]  G 1 = [101]

10. 10/19 2008, Graz, Austria Convolutional Coded DPIM Average symbol length of code data: P[.] - probability function and For L-DPIM and For CC-DPIM symbol length L ave = L + 5.

11. 11/19 2008, Graz, Austria DPIM - Convolutional Coding  2 empty slots / symbol - to ensure that the memory is cleared after each symbol.  Trellis path is limited to 2.

12. 12/19 2008, Graz, Austria DPIM - Decoder  Viterbi ‘Hard ‘ decision decoding  The Chernoff upper bond on the error probability is: where P se is the slot error probability of uncoded DPIM. It is also possible not use Viterbi algorithm instead one can use a simple look-up table.

13. 13/19 2008, Graz, Austria Power Spectral Density  Generally signals can be divided into two models:  Deterministic Model - No uncertainty about signal’s time dependent behaviour at any instance of time.  Random or Stochastic Model – Uncertain about signal’s time-dependent behaviour at any instance of time. However certain on the statistical behaviour of the signal on overall.  Power of Random Signal  Deterministic signals - Instantaneous power is x 2 (t).  Random signals – There is no single number to associate with the instantaneous power i.e. x 2 (t) is a random variable for each time. The expected instantaneous power of x 2 (t) need to obtained.

14. 14/19 2008, Graz, Austria PSD of CC-DPIM  A DPIM pulse train may be expressed as [12]: which is cyclostationary, where p(t) is the rectangular pulse shape, Ts is the slot duration and for all n is a set of random variables that represent the presence or absence of a pulse in the nth time slot.  x c (t) can be stationarized with the introduction of a continuous variable  to give x s (t) = x c (t +  ), where  is equally distributed over [0, T s ] and is independent of a n. The distribution of stationarization depends on the length probabilities given as: .

15. 15/19 2008, Graz, Austria PSD of CC-DPIM  The general expression for the spectral distribution expressed by the spectral density is given as: Where  T is the input period of the {a n } (the sequence !!),  P(f) is the Fourier transform of p(t), the rectangular pulse shape  |P(f)| 2 = T 2 Sinc 2 (fT)

16. 16/19 2008, Graz, Austria PSD of CC-DPIM (Contd.)  The continuous Spectrum of the CC-DPIM Sequence {a n }is evaluated as: Where z = e i2Πu,  is the greatest common divisor.  The Discrete part of the spectrum is defined as: Where

17. 17/19 2008, Graz, Austria PSD of CC-DPIM (Contd.),

18. 18/19 2008, Graz, Austria PSD of CC-DPIM - Simulation  8-CC-DPIM using (3-7),  Pulse shape p(t) - rectangular with 100% duty cycle.

19. 19/19 2008, Graz, Austria Results (1) PSD of 8-CC-DPIM with 100% pulse duty cycle against the normalised frequency: (a) predicted, and (b) simulated Clock (slot) DC level

20. 20/19 2008, Graz, Austria Results (2) PSD of 8-CC-DPIM with 50% pulse duty cycle against the normalised frequency: (a) predicted, and (b) simulated Clock (slot) DC level

21. 21/19 2008, Graz, Austria Results (1&2) - Observation  Slot (clock) component - Phase locked loop to recover it at the receiver.  The nulls at normalised frequencies (fT) 0 = ±1, ±2,… are poles on the unit circle.  It is followed by two symmetrically close poles on both sides at (fT) 0 = ±1.5.  With information on nulls and poles, filter H(z) can be implemented as an Auto Regressive Moving Average (ARMA) filter.  DC level – may result in the baseline wander effect due to high-pass filtering of the ambient light.

22. 22/19 2008, Graz, Austria Results (3)- Spectral Comparison High DC component

23. 23/19 2008, Graz, Austria Results (4) - Slot Error Rates Higher bit resolution provides better performance ( at the expense of bandwidth) The code gain is 0.6 higher for bit resolution of 5 compared to 3.

24. 24/19 2008, Graz, Austria Packet Error Rates 10 - -8 -6 -4 -12

25. 25/19 2008, Graz, Austria Conclusions  PSD of CC-DPIM has been derived analytically based on the stationarisation of variable length word sequence.  Close match between predicted and simulated results.  Clock components can used for synchronisation.  DC PIM > DC PPM, more susceptible to baseline wander  Convolutional coding has improved PER performance of DPIM scheme.

26. 26/19 2008, Graz, Austria Thank You!