SEMIANALYTIC BER FOR PSK

ABSTRACT
The most commonly used method for valuating the BER of a Digital Communication system is the Semi-analytic bit error rate (BER) estimation. The main utility of the method is the significant time savings in computation relative to Monte Carlo simulation. Despite this advantage, no known reference defines the procedure for computing exact BER for M-ary phase shift keying (PSK) with ISI and AWGN using the semianalytic method. This project defines an efficient procedure for computing exact semi-analytic BER for modulation formats with circular constellations when the noise component of the decision variable has a circularly symmetric Gaussian distribution. The technique is demonstrated for 8PSK over the Digital Audio Broadcasting-Satellite-Second Generation (DVB-S2) channel. The project is carried out in MATLAB simulation.

BLOCK DIAGRAM

Modulator

Output Multiplexer

Traveling Wave Tube Amplifier

Adder Demodulator Input Multiplexer

Noise

Existing System
The bit error rate (BER) is computed using the Monte Carlo (MC) simulation (Bit Error Counting). It is shown that if we wish to have reliable results with good precision, the total number of transmitted data must be conversely proportional to the product of the true BER by the relative error of estimate. Consequently, computing time is reduced drastically. Some theoretical results are also given to prove the convergence of this new method in the sense of mean square error (MSE) criterion.

Disadvantages
Long

Computation time be calculated Analytically

Performance cannot Requires

the transmitted data to be conversely proportional to true BER computed using relative error of estimate

Proposed System
Monte Carlo methods are often used when simulating physical and mathematical systems. Because of their reliance on repeated computation and random or pseudo-random numbers, Monte Carlo methods are most suited to calculation by a computer. Monte Carlo methods tend to be used when it is unfeasible or impossible to compute an exact result with a deterministic algorithm.

MONTE CARLO SIMULATION

Monte Carlo methods are a class of computational algorithms that rely on repeated random sampling to compute their results. Monte Carlo methods are often used in simulating physical and mathematical systems. Because of their reliance on repeated computation of random or pseudo-random numbers, these methods are most suited to calculation by a computer and tend to be used when it is infeasible or impossible to compute an exact result with a deterministic algorithm However, these approaches tend to follow a particular pattern: Define a domain of possible inputs. Generate inputs randomly from the domain using a certain specified probability distribution. Perform a deterministic computation using the inputs. Aggregate the results of the individual computations into the final result.

Advantages of MONTE CARLO

Often the only type of model possible for complex systems Analytical models frequently infeasible Process of building simulation can clarify understanding of real system Sometimes more useful than actual application of final simulation Allows for sensitivity analysis and optimization of real system without need to operate real system Can maintain better control over experimental conditions than real system Time compression/expansion: Can evaluate system on slower or faster time scale than real system

Disadvantages of MONTE CARLO

May be very expensive and time consuming to build simulation Easy to misuse simulation by stretching it beyond the limits of credibility

Problem especially apparent when using commercial simulation packages due to ease of use and lack of familiarity with underlying assumptions and restrictions Slick graphics, animation, tables, etc. may tempt user to assign unwarranted credibility to output

Monte Carlo simulation usually requires several (perhaps many) runs at given input values

Contrast: analytical solution provides exact values

WHEN TO USE THE SEMIANALYTIC TECHNIQUE

The semi analytic technique works well for certain types of communication systems, but not for others. The semi analytic technique is applicable if a system has all of these characteristics: Any effects of multi path fading, quantization, and amplifier nonlinearities must precede the effects of noise in the actual channel being modeled. The receiver is perfectly synchronized with the carrier, and timing jitter is negligible. Because phase noise and timing jitter are slow processes, they reduce the applicability of the semi analytic technique to a communication system. The noiseless simulation has no errors in the received signal constellation. Distortions from sources other than noise should be mild enough to keep each signal point in its correct decision region. If this is not the case, then the calculated BER will be too low. For instance, if the modeled system has a phase rotation that places the received signal points outside their proper decision regions, then the semianalytic technique is not suitable to predict system performance.

PROCEDURE FOR THE SEMIANALYTIC TECHNIQUE

The procedure below describes how you would typically implement the semi analytic technique using the semi analytic function: Generate a message signal containing at least ML symbols, where M is the alphabet size of the modulation and L is the length of the impulse response of the channel, in symbols. A common approach is to start with an augmented binary pseudo noise (PN) sequence of total length (log2M)ML. An augmented PN sequence is a PN sequence with an extra zero appended, which makes the distribution of ones and zeros equal.

contd

Modulate a carrier with the message signal using base band modulation. Supported modulation types are listed on the reference page for semi analytic. Shape the resultant signal with rectangular pulse shaping, using the oversampling factor that you will later use to filter the modulated signal. Store the result of this step as txsig for later use. Filter the modulated signal with a transmit filter. This filter is often a square-root raised cosine filter, but you can also use a Butterworth, Bessel, Chebyshev type 1 or 2, elliptic, or more general FIR or IIR filter. If you use a square-root raised cosine filter, use it on the nonoversampled modulated signal and specify the oversampling factor in the filtering function. If you use another filter type, you can apply it to the rectangular pulse shaped signal.

.contd

Run the filtered signal through a noiseless channel. This channel can include multipath fading effects, phase shifts, amplifier nonlinearities, quantization, and additional filtering, but it must not include noise. Store the result of this step as rxsig for later use. Invoke the semi analytic function using the txsig and rxsig data from earlier steps. Specify a receive filter as a pair of input arguments, unless you want to use the function's default filter. The function filters rxsig and then determines the error probability of each received signal point by analytically applying the Gaussian noise distribution to each point. The function averages the error probabilities over the entire received signal to determine the overall error probability. If the error probability calculated in this way is a symbol error probability, then the function converts it to a bit error rate, typically by assuming Gray coding. The function returns the bit error rate (or, in the case of DQPSK modulation, an upper bound on the bit error rate).

PHASE-SHIFT KEYING

Phase-shift keying (PSK) is a digital modulation scheme that conveys data by changing, or modulating, the phase of a reference signal (the carrier wave). Any digital modulation scheme uses a finite number of distinct signals to represent digital data. PSK uses a finite number of phases, each assigned a unique pattern of binary bits. Usually, each phase encodes an equal number of bits. Each pattern of bits forms the symbol that is represented by the particular phase. The demodulator, which is designed specifically for the symbol-set used by the modulator, determines the phase of the received signal and maps it back to the symbol it represents, thus recovering the original data. This requires the receiver to be able to compare the phase of the received signal to a reference signal such a system is termed coherent (and referred to as CPSK).

CONSTELLATION DIAGRAM
A constellation diagram is a representation of a signal modulated by a digital modulation scheme such as quadrature amplitude modulation or phase-shift keying. It displays the signal as a two-dimensional scatter diagram in the complex plane at symbol sampling instants. In a more abstract sense, it represents the possible symbols that may be selected by a given modulation scheme as points in the complex plane. Measured constellation diagrams can be used to recognize the type of interference and distortion in a signal.

PSK CONSTELLATION WITH ISI AND AWGN

MODULE SEPERATION

Module 1: Psk Constellation with ISI and

Awgn

Module 2: Bit Error Rate Calculation Module 3: Application Example

MODULE DESCRIPTION

Module 1:
The M signal waveforms for ideal M-ary PSK are represented As sm(t) = g(t)cos(ct + m). When distortions due to channel effects or modem imperfections are present. The received decision variables will differ from the M ideal points, and their locations will be data dependent due to ISI. In this context, ISI will refer to the effects of both linear and non-linear time invariant distortions with memory.

Assuming equiprobable symbols, then in order to completely characterize the ISI of a

channel with L symbol periods of memory, it is sufficient to consider all possible sequences of L symbols.

A maximal length pseudorandom ML symbol sequence will satisfy this property. For

M=2, linear feedback shift registers can be used to generate maximal length
pseudorandom bit sequences.

FUTURE ENHANCEMENT
In

a similar way, the technique can also be extended to frequency non-selective slowly fading channels

Advantages

The probability distributions within the model can be easily and flexibly used, without the need to approximate them

Correlations and other relations and dependencies (such as 'if' statements) can be modeled without difficulty
The level of mathematics required is quite basic Commercial Monte Carlo simulation packages can automate the tasks involved in simulation The behavior of and changes to the model can be investigated with great ease and speed.

APPLICATIONS
The

technique is demonstrated for 8PSK over the Digital Video BroadcastingSatellite-Second Generation (DVB-S2) channel

DOMAIN-COMMUNICATION
Wireless communication is the transfer of information over a distance without the use of electrical conductors or "wires". The distances involved may be short (a few meters as in television remote control) or long (thousands or millions of kilometers for radio communications). When the context is clear, the term is often shortened to "wireless". Wireless communication is generally considered to be a branch of telecommunications.

MATLAB SIMULATION
2 1.5 1 0.5 0 -0.5 -1 -1.5 -2 -2

-1.5

-1

-0.5

0.5

1.5