Adama Science and Technology University

School of Electrical Engineering and Computing

Department of Electronics and Communication
Engineering

Title: Channel Coding: Convolutional and Turbo Codes

Presented by: Tsegaab Getu

Submitted to: Dr. Rajaveerappa Devados
06/07/2023
 Outlines
2
 Introduction

 Statement of the Problem

 Objective

 Literature Review

 Methodology

 Result and Discussion

 References

06/07/2023
 Introduction
3

 Numerous senders and multiple receivers communicate via a common

noisy channel in a network communication system.

 By converting the message into an input sequence, each sender aims

to reliably deliver a message to the desired recipient or receivers.

 By mapping the output sequence to the message estimate, each

receiver recovers all or a portion of the required message(s).

 The objective of channel coding is to provide encoding and decoding

mappings with high message rates and low error probabilities.

06/07/2023
 Continued…
4

 In digital communications, channel coding is a technique

used to ensure that a signal is received with few or no
mistakes.

 The communication can be examined for potential faults

after being decoded on the receiving end, and in many
circumstances, such problems can be fixed. Sometimes the
recipient will merely request the transmission once more.

06/07/2023
 Types of Channel Coding
5

convolutional code
 Convolutional codes are error detecting codes used to reliably
transmit digital data over unreliable communication channel
system to channel noise.
 The Convolution codes map information to code bits but
sequentially convolve the sequence of information.
Decoding Convolution codes
 The most probable state sequence can be found using the min-
sum algorithm(Viterbi algorithm)
 This algorithm is used to decode convolutional codes.
 It is resource consuming method but it does the maximum
likelihood decoding. 06/07/2023
 Turbo Coding
6

 Turbo codes are a class of high-performance forward error correction

(FEC) method.
 It is the parallel-concatenated convolutional codes(PCCC).
 It has the dilemma of structure and randomness through
concatenation and interleaving respectively.
 It has an better performance of bit error rate(BER) at relatively low
Eb/No.
Interleaving
 An interleaver is a device that rearranges the ordering of sequence of
symbols in a deterministic manner.
 Interleaving is used to feed the encoders with permutations so that
the generated redundancy sequences can be assumed independent.
06/07/2023
 Statement of the Problem
7

 As the ever-growing number of wireless devices is driving a denser and

denser network deployment,

 efficient interference management among multiple parties communicating

over the same spectrum becomes the key challenge for future
communication networks.

 However, the theoretically optimal approach is simultaneous decoding,

which exploits the digital structures of both the desired and interfering
signals.

06/07/2023
 Objectives
8

General Objectives
 The main objective of this paper is to study about Channel Coding
specifically the two coding techniques, Convolutional Coding and Turbo
coding.
Specific Objectives
 To study how we can achieve a given data rate at a lower SNR; hence we
can save power.
 To study how to deal with errors since noise attack our information at the
channel,
 To study how we can detect errors and recover them using Channel
coding techniques

06/07/2023
 Literature Review
9

Authors Year Title Contribution

This paper presents

Graphical User Interface
Ezeofor Convolutional
(GUI) for simulating
C. J.1, codes and their
Ndinechi
2020 convolutional coding with
performance in
M.C.2 Viterbi decoding in digital
communication
communication system using
systems
MATLAB.

06/07/2023
 Literature Review
10

Authors Year Title Contribution

adapted three interleaving

design methods used for
Etxezar
classical turbo codes to the
reta Near optimum
quantum domain,
Martin error correcting
2019 demonstrating the
ez, J.; coding and
importance of interleaver
Crespo, decoding:
construction in quantum
et al,), Turbo-codes.
turbo code

06/07/2023
 Literature Review
11

Authors Year Title Contribution

Etxezar
reta Near-optimum Adapted three interleaving
Martin decoding of design methods used for
2019
ez, J.; product codes: classical turbo codes to the
Crespo, classical turbo quantum domain,
et al, codes

06/07/2023
12
Methodology

06/07/2023
 Block diagram of convolutional coding
13

 x[n-i] is the encoding state. x[n-1] and x[n-2], denoting there are 2 states of
the encoder which is nothing but the previous bits. Input bit x[n] is fed to
the encoder in order to obtain the parity bits.

 The parity bits are calculated using the states of the encoder and the input
bit. In the above-given block diagram, we have considered 2 states with a
single input bit. 06/07/2023
 Block diagram of Turbo code
14

 Block Diagram of Turbo Coding

 There are two convolutional encoders in parallel. the information

bits are scrambled before entering the second encoder.
 Turbo code block diagram shows only two branches. The
convolutional code at every branch is called constituent code(cc).
06/07/2023
 Comparison
15

 Convolution code is easy to implement than the turbo codes.

 Turbo codes produces randomness in coding due to interleavers

which is absent in convolution code.

 Only one decoder is needed and adaptive coding scheme can be

implemented in convolution code unlike turbo code.

 The Viterbi decoding uses hard decisions is therefore operates on

data that take on fixed set of possible values typically 0 or 1 in
binary code.

06/07/2023
 Result and Discussion
16

 Convolutional codes are generated by the convolution of the input

sequence with the impulse response of the encoder. The encoder accepts
blocks of k-bit input samples and, by operating on the current block of
data and the m previous input blocks, produces an n-bit block of output
samples.

06/07/2023
 Convolutional Coding Result
17

06/07/2023
 Convolutional Coding
18
Convolutional codes are generated by the convolution of the input sequence with
the impulse response of the encoder. The encoder accepts blocks of k-bit input
samples and, by operating on the current block of data and the m previous input
blocks, produces an n-bit block of output samples. The coding rate of the
encoder is given by the ratio Rc=k/n

06/07/2023
 Turbo Code Result
19  Turbo codes substantially improve BER performance over soft-
decision Viterbi decoding. Turbo coding uses two convolutional
encoders in parallel at the transmitter and two A Posteriori
Probability (APP) decoders in series at the receiver

06/07/2023
 Conclusion
20

 Channel coding comprises error detection and error correction

 Forward-error-correction coding allows errors to be corrected based on

the redundancy bits that are included with the transmitted signal.

 .Error-correcting codes are usually classified into block codes and

convolutional codes. Convolutional codes are widely used in 2G and 3G
mobile communications standards, primarily because of their low
complexity

06/07/2023
 Reference
21

 Liu, T., & Chen, X. (2022). Attention-based neural joint source-channel coding of text for point to
point and broadcast channel. Artificial Intelligence Review, 55(3), 2379-2407.

Sartipi, M., & Fekri, F. (2020, October). Source and channel coding in wireless sensor networks
using LDPC codes. In 2020 First Annual IEEE Communications Society Conference on Sensor and
Ad Hoc Communications and Networks, 2004. IEEE SECON 2020. (pp. 309-316). IEEE.

Forney, G. (2018). Convolutional codes I: Algebraic structure. IEEE Transactions on Information

Theory, 16(6), 720-738.

Berrou, C., & Glavieux, A. (2021). Near optimum error correcting coding and decoding: Turbo-
codes. The best of the best: fifty years of communications and networking research, 45.

Qiu, M., Wu, X., i Amat, A. G., & Yuan, J. (2021). Analysis and design of partially information-and
partially parity-coupled turbo codes. IEEE Transactions on Communications, 69(4), 2107-2122.

.
06/07/2023
 Cont…
22

Shaheen, F., Butt, M. F. U., Agha, S., Ng, S. X., & Maunder, R. G. (2019). Performance
analysis of high throughput map decoder for turbo codes and self-concatenated
convolutional codes. IEEE Access, 7, 138079-138093.

Etxezarreta Martinez, J., Crespo, P. M., & Garcia-Frías, J. (2019). On the performance of
interleavers for quantum turbo codes. Entropy, 21(7), 633.

Pehkonen, K., & Komulainen, P. (2019, September). A superorthogonal turbo-code for

CDMA applications. In Proceedings of ISSSTA'95 International Symposium on Spread
Spectrum Techniques and Applications (Vol. 2, pp. 580-584). IEEE.

Bartal, A., & Jagodnik, K. M. (2022). Progress in and Opportunities for Applying
Information Theory to Computational Biology and Bioinformatics. Entropy, 24(7), 925.
Poulin, D., Tillich, J. P., & Ollivier, H. (2009). Quantum serial turbo codes. IEEE
Transactions on Information Theory, 55(6), 2776-2798
06/07/2023
23

Thank You

06/07/2023