IRACST International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN: 2250-3501

Vol.4, No2, April 2014

Comparative Analysis of Different Channel

Coding Techniques
Jayshree S. Nandaniya Nilesh B. Kalani Dr.G.R.Kulkarni
Student, M.Tech(EC) Research Scholar, J.J.T. University, Principal, Kalol Institute Of
SOE,RK University Director, SDS, RK University, Technology,& Research Centre,
Rajkot, India Rajkot, India Kalol, Gujarat, India
[email protected] [email protected] [email protected]

AbstractCommunication played important role in the bandwidth requirements on average. In the various
development of human civilization. Today the heart of all transmission channels, at the receiver end signals are received
techniques is the wireless communication. In wireless with different power and time delay due to the reflection,
communication whenever data is transmitted or received error is diffraction and scattering effects. The BER value of the
produced due to dispersive effect, fading, attenuation,
interference, noisy channel. For efficient data communication, it
wireless medium is high, so sometimes the information is lost
is necessary to receive errorless data. The goal of Channel coding due to high BER. So BER is key parameter for wireless
techniques is to find code which transmit rapidly and can correct communication, BER is used to evaluate the system which
or detect many errors. Channel coding techniques code occupies transmit data from one location to another location.
more band width because redundant bits are added to it. The
present research work compares BER analysis of different BER is most affected by SNR, if SNR increases BER
channel coding techniques. The numbers of bits transmitted is decreases. There are two parameters which affects SNR:
almost same for different channel coding techniques. Eb = Error Function.
Keywords- Bournullin Binary, Channel Coding Techniques,
No= Noise power spectral density.
AWGN, BER analysis. During digital data transmission and storage operations,
performance criterion is commonly determined by BER. The
signal is disturbed by noise in transmission medium and
I. INTRODUCTION
causes data corruptions. Relation between signal and noise is
In modern communication techniques the high data rate described with SNR (signal-to-noise ratio). SNR is explained
transmission is increased significantly, but high data rate with signal power / noise power.BER is inversely proportional
transmission requires wide range bandwidth. Bandwidth is a to SNR. If SNR is increased BER decreased.
burning issue for communication, so its not wise decision to
transmit data using more bandwidth. High data rate II. WIRELESS COMMUNICATION MODEL IMPLEMENTATION
transmission in limited bandwidth leads to increased BER. WITHOUT CHANNEL CODING
The widespread use of efficient coding techniques over fading Communication model is implemented in Simulink shown in
channels urges the researchers to determine suitable analytical Figure-1. The Error rate calculation block compares the input
methods for assessing their performance without resorting to data and data received after demodulation and calculates the
cumbersome simulations [1]. Packet losses due to congestion, error rate. The display will show the BER at the end of
errors, or other transmission problems can introduce simulation [3].
significant distortions. In this paper effectiveness of channel
coding techniques in order to increase the quality of
transmission across links with bursty losses and random error
is considered.So in this paper different Channel coding
techniques are used to reduce BER. For high data rate
transmission different modulation and coding techniques are
used. In wireless communication system, various transmission
channels are used. There are two types of Channel coding
techniques: (1) ARQ (Automatic Repeat Request), (2) FEC
(Forward Error Correcting). Most of time in Digital
Communication Forward Error Correcting technique is used,
the advantage of using forward error correction is that
retransmission of data can be avoided, the cost of higher

84
 IRACST International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN: 2250-3501
Vol.4, No2, April 2014

bandwidth than BPSK to be transmitted for same length of

data. BER of BPSK and QPSK is almost same. In all other
technique BER is comparatively high.64-PSK has highest Bit
Error Rate from other lower order modulation Technique.
QPSK technique is also known as 4-PSK.
1) M-PSK Modulation: Modulation technique is used at
transmitter.
a) M-ary: QPSK technique is used so M=4
b) Phase Offset (rad): QPSK technique is used according
to that /4 .
2) M-PSK Demodulation: Demodulation technique is used at
receiver.
Fig.1
III. BCH CODING TECHNIQUE IMPLEMENTATION
A. AWGN channel
Bose Chaudhari Hocquenhem code is known as BCH Coding.
AWGN is commonly used to simulate background noise of
BCH is most efficient coding technique in Linear Block
the channel under study, in addition to multipath, terrain
Coding techniques.
blocking, interference, ground clutter and self interference
that modern radio systems encounter in terrestrial operation
[4]. AWGN is Additive White Gaussian Noise Channel. Block length, n=2m-1
AWGN channel has constant spectral density. Number of check bits,(n-k) <= mt
Minimum Hamming distance, dmin >= (2t+1)
1) Input Processing: Column as channel parameter is set.
Parameter gives the frame based output. For any integer m andt, there is a binary (n,k) BCH codes.
2) Initial Seed: If initial seed is increased in AWGN BCH coding gives the flexibility for choice of parameters.
channel, BER will be decrease. It will generate random BCH code can correct t number of error or less than t
number which in turn is generated by Gaussian Noise number of error. If BCH code is used to correct single error
Generator. that will work as same as hamming code.BCH code is mostly
3) Mode: There are different mode like Eb/No, SNR, used in wireless communication. In BCH coding when SNR is
Es/No, Variance from mask, Variance from port. Eb/No higher BER is almost zero.BCH code implemented in
parameter is set, this parameter is ratio of bit energy to noise simulink model is shown in Figure-2. BER comparative
power spectral density. analysis is shown in Graph-1.
A. BCH Encoder:
Number of bits per symbol, Input signal power, Symbol
There are three options given to the BCH Encoder block:
period all these parameters are set to generate the noise
1) Specific Primitive Polynomial: It convert nonnegative
variance in AWGN channel.
decimal integer d to a binary row vector. Ifd is vector
B. Modulation Technique output it is in form of matrix and each row of which is the
There are different types of modulation like BPSK, QPSK, binary form of the corresponding element in d.
16-PSK, 32-PSK. QAM etc. Each modulation technique has 2) Specific Generator Polynomial: A generator
its own error function, so the performance of modulation polynomial using a Galois row vector that lists the
technique is different at the time when noise is present. But polynomial's coefficients in order of descending powers of the
high data rate transmission in limited bandwidth increase the variable. Generator polynomial is generated by bchgenpoly
BER. Some time it destroys the original data. The techniques (15, 5).
which are generally used in wireless communication are QAM 3) Puncture Code: When encoder work on different code
(Quadrature Amplitude Modulation) and QPSK (Quadrature words per frame, same puncture pattern is applied to all code
phase shift keying). Higher order modulation technique words. Puncture codeword is used to remove parity symbol
transmits high data rate but higher order modulation B. BCH Decoder:
techniques required high SNR. If the communication area is
1) Enable erasures input port: If receiver generates
not larger than QAM technique is used, but in case of larger
erasures, performance improves specifically in fading channel.
area the QPSK technique is more efficient than the QAM.
2) Output number of error corrected: It indicates number
of error are corrected.
In QPSK two successive bits are combined reducing the bit
rate or signaling rate and also bandwidth of the channel which
is a main resource of communication system. Combination of
two bits creates for distinct symbols [5]. QPSK requires less

85
 IRACST International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN: 2250-3501
Vol.4, No2, April 2014

Fig-2 Fig-3
Bit Error Probability
0
10
without coding technique Bit Error Probability
0
Bit Error Rate BCH 10
Bit error rate Hamming
without coding technique
-1
10
Error Probability

-1
10

E rror P robability
-2
10

-2
10

-3
10
1 2 3 4 5 6 7 8 9 10
Eb/No (dB)

Graph-1 -3
Error probability at Different SNR is Shown in Table-I. 10
1 2 3 4 5 6 7 8 9 10
Eb/No (dB)
IV. HAMMING CODING TECHNIQUE IMPLEMENTATION Graph-2
Hamming code is a type of Linear Block Code. Hamming code
is (n,k) block code, where V. RS CODING TECHNIQUE IMPLEMENTATION
A Reed-Solomon code is one type of BCH coding technique.
n= Number of data bits RS coding technique is used for non-binary data.
k= Number of encoded bits Symbol length= k
Number of check bits m=n-k. Block length, n= (2m-1) symbol.
To calculate number of check bits the Equation used, Message size= k
2m >= (m+k+1) Size of check code, (n-k) =2t
In hamming coding technique as number of data bits increases, Number of correctable symbol in error, t= (n-k)/2
more number of error control bits is required to generate
encoded bits as per Hamming Code. RS codes in consortium with efficient coding techniques which
are used in highly efficient use of redundancy, symbol size and
Hamming coding technique is implemented in communication block length which can be easily adjusted to put-up wide range
model in simulink is shown in Figure-3. In Hamming coding of information data sizes. Implementation of RS coding
M=10 is taken.1023 bits are transmitted through a frame. Bit technique in simulink is shown in Figure-5. Comparative
Error Rate is decreased after implementing hamming coding analysis of RS coding is with without coding technique shown
technique. Comparison of BER is shown in Graph-2.Error in Graph-3.
probability at different SNR shown in Table-I.

86
 IRACST International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN: 2250-3501
Vol.4, No2, April 2014

Fig-5
Bit Error Probability Fig-5
0
10
Bit error rate RS Bit Error Probability
0
without coding technique 10
Bit error rate CRC
without coding technique

-1
10
E rror P robability

-1
10
Error Probability

-2
10
-2
10

-3
10 -3
1 2 3 4 5 6 7 8 9 10 10
Eb/No (dB) 1 2 3 4 5 6 7 8 9 10
Eb/No (dB)
Graph-3
Graph-4
VI. CRC CODING TECHNIQUE IMPLEMENTATION
VII. CONVOLUTION CODING TECHNIQUE IMPLEMENTATION
Cyclic Redundancy Check code is used in binary CRC .Binary
(n, k) codes is able to detect the following error patterns, Convolution codes are usually described using two
parameters: the code rate and the constraint length [3]. In
Length of error burst is n-k or less [6]. convolution coding message length is fixed and coded symbol
Minimum Hamming distance is dmin- 1 or fewer errors [6]. length is also fixed. It depends on current input symbol but
also depend on previous input symbol that is shown in figure-
Error patterns with an odd number of errors, if the generator 6 [8]. Trellis structure of encoder shown in Figure-7 [8].
polynomial g(x) has an even number of nonzero coefficients.
There are different types of CRC-16, CRC-32 etc. CRC
coding technique implemented in simulink is shown in Figure-
5.
Comparative analysis of CRC coding and without coding
technique is shown in Graph-4.

87
 IRACST International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN: 2250-3501
Vol.4, No2, April 2014

Bit Error Probability

0
10
Bit error rate Convolution
without coding technique

-1
10

E rro r P ro b a b ility
-2
10
Fig-6

-3
10
1 2 3 4 5 6 7 8 9 10
Eb/No (dB)

Graph-5

VIII. COMPARATIVE ANALYSIS OF ALL ERROR CORRECTING

CODING TECHNIQUES WHICH IMPLEMENT
In Error correcting coding techniques individual BER analysis
with respect to without coding techniques is done. Without
Fig-7 Code Trellis of Convolution Encoder error correcting coding technique, BCH Coding ,Hamming
Coding ,CRC Coding, Convolution Coding, RS Coding
For decoding viterbi decoder is used. In viterbi decoding Technique comparative analysis of all these coding technique
technique trellis diagram is used. Convolution codes are is shown in Graph-6 and Error probability at different SNR is
designed to take action on random independent error. shown in Table-I .
Convolution error correcting coding technique implemented in
simulink is shown in Figure-8. RS coding technique efficient for lower SNR, because error
probability is very low compare other channel coding which
are implemented in this paper.
Bit Error Probability

0
10 Bit Error rate without coding technique
Bit Error rate Hamming
Bit Error rate CRC
Bit Error rate BCH
Bit Error rate RS
Bit Error rate Convolution
-1
E rro r P ro b a b ilit y

10

-2
10

Fig-8
Comparative analysis of convolution coding technique and
1 2 3 4 5 6 7 8 9
without coding technique is shown in Graph-5. Eb/No (dB)

Graph-6

88
 IRACST International Journal of Computer Networks and Wireless Communications (IJCNWC), ISSN: 2250-3501
Vol.4, No2, April 2014

TABLE I. COMPARATIVE ANALYSIS OF ERROR CORRECTING CODING system. But for reliable communication there must be some
TECHNIQUES
trade-off between system complexity and correction capability
Eb/ of the codes. Hence the objective of the research is
No Error Probability with Respect to 1000 Transmitted Bits
successfully achieved in which this paper, success to analyse
Without BCH Hamming RS CRC Convolution and simulates the performance of Channel coding using QPSK
coding through AWGN channel.
X. FUTURE SCOPE
1 0.246 0.107 0.149 0.048 0.123 0.195
In future, this research can be extended by evaluating the
0.207 0.060 0.115 0.037 0.090 0.125
2 performance of Source coding techniques with Channel coding
3 0.159 0.039 0.093 0.033 0.068 0.035 techniques on Audio input signal.
4 0.115 0.014 0.064 0.029 0.049 0.009 REFERENCES
5 0.070 0.002 0.043 0.020 0.035 0 [1] Fulvio Babich, Senior Member, IEEE On the Performance of Efficient
Coding Techniques Over Fading Channels IEEE Transactions On
6 0.041 0 0.030 0.010 0.021 0 Wireless Communications, Vol. 3, No. 1, January 2004.pp.290-299.
0.017 0 0.020 0.005 0.008 0 [2] Emin Martinian, Student Member, IEEE, and Carl-Erik W. Sundberg,
7
Fellow, IEEE Decreasing Distortion Using Low Delay Codes for
8 0.011 0 0.010 0.005 0.004 0 Bursty Packet Loss Channels IEEE Transactions On Multimedia, Vol.
5, No. 3, September 2003 ,pp.285-292.
9 0.004 0 0.006 0.003 0.001 0
[3] Himanshu Saraswat, Govind Sharma Sudhir Kumar Mishra and
0.002 0 0.002 0 0 0 Vishwajeet,Performance Evaluation and Comparative Analysis of
10
Various Concatenated Error Correcting Codes Using BPSK Modulation
for AWGN Channel, International Journal of Electronics and
Communication Engineering. ISSN 0974-2166 Volume 5, Number 3
(2012), pp. 235-244
IX. CONCLUSION [4] Syed Md. Asif, Abdullah - Al - Maruf, S. Anisul Islam, amitavo
Tikader,Md. Abdul Alim Comparison Of Ber Between Uncoded Signal
After implementation of Channel coding techniques concludes And Coded Signal (Using Convolution Code) Over Slow Rayleigh
that, RS coding technique is efficient whenever power limited Fading Channel, 2005-2009JATIT,pp.76-82.
channel used like Satellite Channel. Because if Eb/No is 1dB, [5] Abhijyoti Ghosh, Bhaswati Majumder, Parijat Paul, Pinky
2dB, 3dB at that time error probability is lowest compare to Mullick,IshitaGuha Thakurta and Sudip Kumar Ghosh, Comparative
Study Of Bit Error Rate (Ber) For Mpsk-Ofdm In Multipath Fading
BCH coding, Convolution Coding, CRC Coding, Hamming Channel, ISSN: 2231-1963, IJAET, Vol. 4, Issue 1, july-2012, pp. 465-
coding shown in Table-I. According to that RS coding 474.
technique is most efficient at lower SNR. [6] Marvin K Simon, Sami M. Hinedi , Willam C. Lindsey. Digital
Convolution coding technique error probabilities become zero, Communication Technique, Signal Design and Detection.
when Eb/No is 5dB but at same Eb/No, 0.002 error probability [7] Sanjeev Kumar, Ragini Gupta Performance Comparison of Different
present in BCH coding technique. But BCH coding technique Forward Error Correction Coding Techniques for Wireless
Communication Systems ,Elec. & Comm. Engg. Amritsar College of
not required memory component and memory component Engg. & Technology, Amritsar, Punjab, India. IJCST Vol. 2,pp.553-
increase time delay, cost, complexity etc. In most of wireless 557, Issue 3, September 2011.
communication technique BCH coding technique is used. After [8] Harjot Kaur,Bindiya Jain, Amit Verma, Comparative Performance
adding channel coding increases the signal quality on bursty Analysis of M-ary PSK Modulation Schemes using Simulink, IJECT
channels [2]. ,Vol. 2, Issue 3, pp.204-209, Sept. 2011.

This confirms the fact that by implementation of channel

coding, we can improve the correction capability of codes.
However this increases the complexity of the communication

89