Additive White Gaussian Noise (AWGN)

In this study, Box-Muller Algorithm is incorporated to generate AWGN based from [2008 batch].
This method says that, if you have two numbers U1 and U2 uniformly distributed on (0,1), you can
inversely transform this into two normally distributed random, X and Y having zero mean and a variance
of one. Generating AWGN taken from [SP kang 2008]:

do //if U1 == 0, then the log() below will blow up

U1 = uniform()

while U1==0

U2 = uinform()

X = sqrt(-2*log(U1))*cos(2pi*U2)

Y = sqrt(-2*log(U1))*sin(2pi*U2)

The algorithm based on this method is shown in awgn.c in the program code. Varying SNR is
used in the simulation.

Signal distortion technique

This study used signal distortion technique to address the high PAPR in the transmitted signal of
OFDM system. PAPR is defined in [https://www.nutaq.com/blog/understanding-papr-ofdm-systems],

Where x(t) are complex tone OFDM signal and ()* corresponds to conjugate operator. The signal
distortion technique applied was Peak Windowing and Clipping. The peak windowing method uses a
Hamming window with 17 window length.

To ensure clipping at the average power, the maximum clipping level of the baseband signal was
determined by getting the square root of the number of subcarriers. This model was discussed in
[https://ieeexplore.ieee.org/abstract/document/605835].
Turbo Encoder

The turbo encoder design used in the study is based on the simulation of [sir ref] with a (7,5)
code generator. The encoder used a simile-odd even helical interleaver consists of 23 rows and 24
columns. Figure(something) shows the diagram of the encoder taken from[sir ref] , the circle represents
a modulo-2 addition and the square represents a memory.

Figure(something) Recursive Systematic Convolutional Encoder

The simile odd-even interleaver uses identical tail bits to ensure that both convolutional
encoders will be of the same state. Puncturing of bits is also applied so that a bit will be represented in
decoding.

The fundamental structure of a simile interleaver was further discussed in [sir ref] and gave this
example, given a data of 30bits

{x1,x2,x3,x4,x5, … ,x30}
 The interleaver will rearranged the data in manner that the number of columns will be an even
multiple of three and the number of rows will be equal to the number of columns minus 1. For
the given example, the resulting arrangement will be;

x1 x2 x3 x4 x5 x6

x7 x8 x9 x10 x11 x12

x13 x14 x15 x16 x17 x18

x19 x20 x21 x22 x23 x24

x25 x26 x27 x28 x29 x30

and reading in a helical manner starting from the first element of the last row, the output of the
interleaver will be

{x25,x20,x15,x10,x5,x30,x19,x14,x9,x4,x29,x24, … , x6}

Figure(something) state diagram of (7,5) code generator