Turbo Encoder Final Document Hard

A PROJECT REPORT
ON
CHIP DESIGN FOR TURBO ENCODER MODULE FOR IN-VEHICLE SYSTEM
Submitted to Jawaharlal Nehru Technological University Anantapur for the partial

fulfillment of the requirement for the award of the degree of
Bachelor of Technology
In
ELECTRONICS AND COMMUNICATION ENGINEERING
Submitted by
MOGHAL FAYAZ BEIG 17FH1A0461
SOMPALLI VENKATA SWAMY 17FH1A0476
BESTHA SUNIL 17FH1A0443
M. ABDUL MUIZ 17FH1A0456
SANAMURI MADHUSUDHAN RAO 17FH1A0471
T HARI PRASAD REDDY 16FH1A0465
Under The Esteemed Guidance of
MOHAMMAD ZUBAIR M.Tech
Assistant Professor, ECE Department
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Dr. K.V. SUBBA REDDY INSTITUTE OF TECHNOLOGY
(Affiliated to JNTUA, Anantapuramu, Approved by AICTE)
DUPADU, KURNOOL (Dist), AP-518218
2017-2021
Dr. K.V. SUBBA REDDY INSTITUTE OF TECHNOLOGY
(Affiliated to JNTUA, Anantapuramu, Approved by AICTE)
DUPADU, KURNOOL (Dist.), AP-518218
CERTIFICATE
This is to certify that the project work on “CHIP DESIGN FOR TURBO ENCODER
MODULE FOR IN-VEHICLE SYSTEM” is a bonafide work done by
MOGHAL FAYAZBEIG(17FH1A0461), SOMPALLI VENKATA SWAMY (17FH1A0476),
BESTHA SUNIL(17FH1A0443), M.ABDUL MUIZ(17FH1A0456), S.MADHUSUDHAN
RAO(17FH1A0471), T. HARI PRASAD REDDY(16FH1A0465) in partial fulfillment of the
requirement for the award of the degree of “Bachelor of Technology in Electronics and
Communication Engineering” JNTUA, Anantapuramu during 2017-2021.
PROJECT GUIDE HEAD OF THE DEPARTMENT

MOHAMMAD ZUBAIR Smt. M.V. SRUTHI
M .Tech Ph.D., M. Tech,
Asst. Professor, Assoc. Professor
Department of ECE, Department of ECE
Dr. K.V.S.R. Institute of technology. Dr. K.V.S.R. Institute of technology.
Place: DUPADU EXTERNAL EXAMINER
Date:
ACKNOWLEDGEMENT
At the outset I sincerely thanks to our guide MOHAMMAD ZUBAIR, M.Tech

Assistant Professor in Dept. of Electronics and Communication Engineering at Dr.KVSRIT,
for his kind cooperation and encouragement for the successful completion of Seminar and
providing the necessary facilities.
I am most obliged and grateful to DR. M.V SRUTHI, Head of the Department of
Electronics and Communication of Dr. KVSRIT for giving me guidance in completing this
Seminar successfully.
It is my privilege and pleasure to express my profound sense of gratitude and
indebtedness to Dr. S G GOVINDARAJULU, Professor in Department of Electronics and
Communication, Dr. KVSRIT, for his guidance, cogent discussion, constructive criticisms, and
encouragement throughout this dissertation work.
I would like to express my very great appreciation to T. VIJAY KUMAR, Associate
Professor in Department of Electronics and Communication, Dr.KVSRIT for her valuable and
constructive suggestions during the planning and development of this research work.
I am grateful to Dr. L.THIMMAIAH, Principal, Dr.KVSRIT, for his sagacious
guidance, scholarly and the inspiration offered in an amiable and pleasant manner in helping
me for completing this seminar successfully.
We would like to thank our college management, the chairman Dr.K.V.SUBBA
REDDY Garu, Mrs. K.VIJAYALAKSHMAMMA garu who had inspired a lot through her
speeches. She has given meaning to our Technological studies and told us to survive in this
competitive world. We wish to express our thanks to all staff members and our friends who
have rendered their whole-hearted support at all times for the successful completion of his
seminar within the limited time.
Finally, I acknowledge with gratitude the unflagging support and patience of my

PARENTS for their guidance and encouragement during this dissertation work.
PROJECT MEMBERS
M. FAYAZ BEIG 17FH1A0461
S. VENKATA SWAMY 17FH1A0476
B. SUNIL 17FH1A0443
M. ABDUL MUIZ 17FH1A0456
S. MADHUSUDHAN RAO 17FH1A0471
T. HARI PRASAD REDDY 16FH1A0465
CONTENTS
CHAPTER NAME PAGE NO

LIST OF FIGURES I
ABSTRACT II
CHAPTER 1
INTODUCTION 01-05
1.1 OVERVIEW 01
1.2 AIM AND OBJECTIVE 03
1.3 PURPOSE OF STUDY 03
1.4 REASEARCH QUESTIONS 04
1.5 RESEARCH CONTEXT 04
1.6 RESARCH METHOD 05
CHAPTER 2
LITERATURE REVIEW 06-08
2.1 OVERVIEW 06
2.2 ERRORS OCCURRED DURING THE CODING IN COMMUNICATION PROCESS 07
CHAPTER 3
RESEARCH ON PROPOSED SOLUTION 09-23
3.1 OVERVIEW 09
3.2 LANGUAGE USED FOR TURBO ALGORITHM 09
3.3 IMPORTANCE OF VHDL OVER OTHER LANGUAGES 11
3.4 TOOLS USED TO ALONG WITH THE VHDL 14
3.5 BUILDING TURBO ALGORITHM 16
3.6 BUILDING OF VHDL 17
3.7 SYNTHESIZABLE CONSTRUCTS AND VHDL TEMPLATES 18
3.8 HOW TURBO ALGORITHM IS IMPLEMENTED THROUGH VHDL 18
3.8.1 THE TURBO DECODER ARCHITECTURE 19
3.8.2 THE SMU CONTROL UNIT 20
3.9 SUMMARY 22
CHAPTER 4
ANALYSIS ON RESEARCH 24-41
4.1 INTRODUCTION 24
4.2 TURBO ENCODER MODULE 25
4.3 FPGA DESIGN FOR THE TURBO ENCODER MODULE FPGA 29
A: SIMULATION AND VERIFICATION 31
4.4 PROPOSED SOLUTION FOR THE PROBLEM: TURBO ALGORITHM 32
4.5 HIDDEN MARKOV MODEL AND TURBO DECODER 33
4.5.1 HIDDEN MARKOV MODEL 33
4.5.2 TURBO DECODER 34
4.6 BLOCK DIAGRAM OF TURBO ALGORITHM 35
4.7 DESCRIPTION OF TURBO ALGORITHM 38
4.8 ADVANTAGES OF TURBO ALGORITHM 39
B. HARDWARE IMPLEMENTATION 40
CHAPTER 5
PROPOSED METHOD 42-48
5.1 INTRODUCTION 42
5.2 LITERATURE SURVEY 43
5.3 NEW TURBO ENCODING AND DECODING METHOD 44
A. OVERALL STRUCTURE OF TURBO NoC 44
B. TURBO ENCODER 45
C. TURBO DECODER 46
CHAPTER 6
IMPLEMENTATION 49-56
CHAPTER 7
SIMULATION RESULTS 57-59
CHAPTER 8
CONCLUSION 60-61
8.1 RECOMMANDATIONS 60
8.2 FEATURE SCOPE 61
BIBILOGRAPHY 62-64
LIST OF FIGURES
FIGURE NO NAME OF THE FIGURE PAGE NO
3.1 DESIGN FLOW OF VHDL 12

4.1 THE IVS BLOCK DIAGRAM 24
4.2 THE STRUCTURE OF THE TURBO ENCODER 25
4.3 THE OUTPUT BUFFER OF TURBO ENCODER 26
4.4 THE PSEUDO CODE FOR SERIAL COMPUTATION OF 30
THE TURBO ENCODER
4.5 THE PSEUDO CODE FOR PARALLEL COMPUTATION 31
OF THE TURBO ENCODER
4.6 THE HIDDEN MARCOV MODEL 34

4.7 THE BASIC BLOCK DIAGRAM OF TURBO DECODER 36
4.8 SHOWS THE TURBO ALGORITHM TRELLIS 37
4.9 THE TRELLIS DIAGRAM OF TURBO ALGORITHM 38
4.10 SHOWS THE STATE OF THE TRELLIS DIAGRAM 39
OF THE TURBO ALGORITHM
4.11 THE LOGIC UTILIZATION OF THE TURBO ENCODER 40
WITH SERIAL COMPETITION
WITH PARALLEL COMPETITION
SERIAL VS PARALLEL COMPUTATION
5.1 THE IVS BLOCK DIAGRAM 43
5.2 STRUCTURE OF TURBO NoC 44
5.3 BLOCK DIAGRAM OF ENCODING SCHEME 45
5.4 DATA ENCODING EXAMPLE 46
5.5 BLOCK DIAGRAM OF DECODING SCHEME 47
5.6 DATA DECODING EXAMPLE 47
7.1 WB ENCODER 57
7.2 WB DECODER 57
7.3 SB ENCODER 57
7.4 SB DECODER 58
7.5 DESIGN SUMMARY 58
7.6 TIME SUMMARY 59
I
ABSTRACT
This design and implementation of the Turbo encoder to be an embedded module in the in-
vehicle system (IVS) chip. Field programmable gate array (FPGA) is employed to develop the
Turbo encoder module. As a high-performance on-chip communication method, the Turbo
technique has recently been applied to networks on chip (NoCs). We propose a new standard-
basis (SB) and Walsh basis (WB) based encoding/decoding methods to leverage the
performance and cost of Turbo NoCs in area, power assumption, and network throughput. In
the transmitter module, source data from different venders are separately encoded with an
orthogonal code of a standard basis and these coded data are mixed by an XOR operation.
Then, the sums of data can be transmitted to their destinations through the on-chip
communication infrastructure. In the receiver module, a sequence of chips is retrieved by
taking an AND operation between the sums of data and the corresponding orthogonal code.
After a simple accumulation of these chips, original data can be reconstructed. We implement
our encoding/decoding method and apply it to a Turbo NoC with a star topology.
II
CHIP DESIGN FOR TURBO ENCODER MODULE FOR IN VEHICLE SYSTEM
INTRODUCTION
1. 1. Overview
In the present scenarios, data transferring between the systems plays a vital role as the
technologies are increasing day-by-day the number of users is simultaneously increasing. This wide
usage leads to major issues in the digital communication systems and results in data corruptions. It’s
very necessary for the telecommunication to reduce the data corruption by providing a suitable solution
to the errors occurred in the communication process. One such method that decodes the process by
simultaneously correcting the process effectively is Turbo algorithm . For decoding the convolution
codes Turbo algorithm is the highest recognizable algorithm. This algorithm may be described with
software as well as hardware implementations. To engage well organized communications an efficient
data is presented by the digital systems. Data corruptions are the important issue confronted by the
digital communication systems. To decrease data corruptions error correcting codes is a best technique.
Al most all communication systems followed it because it’s power to decode efficiently, even Turbo
algorithm needs very typical hardware. While the decoding operation is in advance, the functioning
obstructions can be eliminated, So that an improved method, Adaptive Turbo Algorithm is used. The
decoding of codes can be done very fast, as this algorithm is very effective in high speed functions.
Convolution codes are used to gain a possible code sequences AVA uses maximum –likelihood
decoding process.
Hardware description language called Verilog HDL is used to valuate this project, where it is one
of the hardware descriptive languages that stand for Verilog Hardware Description Language. This
language is employed in designing the electronic systems to semiconductor and electronic design
industries as well as for assuring the analog and mixed signal circuit. This research makes use of two
main tools namely MODELSIM – Simulation and XILINX-ISE – Synthesis for successfully reaching its
objectives. Further of this research provides a clear description on Adaptive Turbo Algorithm, its
execution process and various kinds of languages and tools for evaluating the Turbo Algorithm.
Convolutional coding has been used in communication systems including deep space
communications and wireless communications. It offers an alternative to block codes for transmission
over a noisy channel. An advantage of convolutional coding is that it can be applied to a continuous data
stream as well as to blocks of data. IS-95, a wireless digital cellular standard for TURBO (code division
Dept of ECE Dr. KVSRIT 1

multiple access), employs convolutional coding. A third generation wireless cellular standard, under
preparation, plans to adopt turbo coding, which stems from convolutional coding. The Turbo decoding
algorithm, proposed in 1967 by Turbo, is a decoding process for convolutional codes in memory-less
noise [52].
The algorithm can be applied to a host of problems encountered in the design of communication
systems [52]. The Turbo decoding algorithm provides both a maximum-likelihood and a maximum a
posteriori algorithm. A maximum a posteriori algorithm identifies a code word that maximizes the
conditional probability of the decoded code word against the received code word, in contrast a
maximum likelihood algorithm identifies a code word that maximizes the conditional probability of the
received code word against the decoded code word. The two algorithms give the same resultswhen the
source information has a uniform distribution.
Traditionally, performance and silicon area are the two most important concerns in VLSI design.
Recently, power dissipation has also become an important concern, especially in battery powered
applications, such as cellular phones, pagers and laptop computers. Power dissipation can be classified
into two categories, static power dissipation and dynamic power dissipation.
Typically, static power dissipation is due to various leakage currents, while dynamic power
dissipation is a result of charging and discharging the parasitic capacitance of transistors and wires.
Since the dynamic power dissipation accounts for about 80 to 90 percent of overall power dissipation in
CMOS circuits; numerous techniques have been proposed to reduce dynamic power dissipation. These
techniques can be applied at different levels of digital design, such as the algorithmic level, the
architectural level, the gate level and, the circuit level. In this thesis, a low-power design of Turbo
decoders at the gate level in the standard cell design environment is proposed. In the standard cell design
environment, the behavior of a design is described in a high-level hardware description language, such
as VHDL or Verilog.
The behavioral design is synthesized to generate a gate level design. The gate-level design is
placed and routed to generate a layout of the design. The advantages of a standard cell based design over
full custom design are -- faster turn around time for the design, ease in design verification and more
accurate modeling of the circuit. Low-power design of Turbo decoders at the gate-level is focused here.
Turbo algorithms [50], [21], [5] and implementation of Turbo decoders were investigated intensively in
the past three decades. Most relevant works in low-power design of Turbo decoders include [23], [27],
[28], [33], [36] and [43]. Seki et al, [43] and Lang et al, ] suggested use of a scarce state transition (SST)

scheme [32]. The scheme uses a simple pr encoder and a pre-encoder to minimize transitions at the input
of a Turbo decoder. This reduces dynamic power dissipation. Kang and Wilson [27] suggested
partitioning major blocks at the system level and the reduction of spurious transitions at a lower level.
Garrett and Stan [23] suggest a specialized SRAM cell structure that allows a sequential write update
and parallel read access across the memory in such a way that reduces dynamic power dissipation.
The above mentioned works showed that their designs substantially reduce power dissipation of
Turbo decoders. Unlike the existing approaches, we introduce low-power design techniques into the
behavior of Turbo decoder. After the behavior of a Turbo decoder was described in VHDL, we modified
the behavior of the circuit to reduce dynamic power dissipation. Two major techniques, clock gating and
toggle filtering, were investigated in this thesis. In addition, a full scan for easy testing of the circuit was
employed. In a full scan design, all sequential elements are controllable and observable during testing. In
our experiments, estimated power dissipation was estimated on the basis of the switching activity
measured through behavioral simulation. Experimental results indicate that our methods effectively
reduce the power dissipation of Turbo decoders.
This section describes the organization of this thesis. The background on the operation of
convolutional encoders and Turbo decoders is provided in Chapter 2. A brief description of low-power
design techniques investigated in this thesis is also covered in this chapter. Chapter 3 proposes a low-
power design for Turbo decoders. It also discusses design alternatives for power dissipation. Chapter 4
describes the environment for our experiments and lists power dissipation results of original and
proposed Turbo decoders. Chapter 5 summarizes the thesis.
1.2. Aim and Objectives:
Aim: Execution of Turbo algorithm applying VHDL coding.
Objectives:
• To clearly understand the Hidden Markov model and Turbo encoder.
• To evaluate the basic functionalities and steps involved in Turbo algorithm
• To research on the implementation of Turbo algorithm through VHDL code
• To critically analyze the results obtained through VHDL code.
1.3. Purpose of Study
The main purpose of this study is to yield the gains obtained by the developers with the usage of
Turbo algorithm. This research mainly centers on the grandness of Turbo algorithm in the practical

applications with the VHDL code. This research not only helps the students related to the
communications but it also helps the people who are in the field of decoders as it is one of the efficient
method for reducing the errors while communication procedure is in advance. Here, VHDL code is used
in order to implement the Turbo algorithm in a proper way. Apart from various codes, researcher
selected VHDL code for this research as it offers the high capability in designing the electronic systems.
Apart from students and the business people, one can easily understand and analyze the Turbo algorithm
concepts and can gain more knowledge on the
VHDL code and the tools that are used in this research.
1.4. Research Questions
• What are the basic functionalities that are used for designing the Turbo algorithm?
• In what way Hidden Markov models are useful in implementing the Turbo algorithm?
• Why turbo algorithm is preferred for reducing the errors in the communication process?
• How one can implement the Turbo algorithm through VHDL coding?
1.5. Research Context
This research usually concerned with the execution of Turbo algorithm applying VHDL coding.
The outlooks of the project such as importance, developments, and applications will be examined by the
researcher. The research mainly carries with the decoder problem while generating the coding. The
Turbo algorithm is used for finding the Turbo path in a sequence which is a VLSI implementation of the
Turbo decoder [3]. This algorithm is employed in high speed and high accuracy functions such as,
WIFI, mobile technology like GPRS and satellite communications, broadband, wireless technology like
WIMAX. Turbo algorithm is advantageous since, it can achieve low power consumption and mainly
error correction using Verilog HDL. VHDL includes Non-proprietary language, widely defended
hardware description language (HDL), programming language, simulation language, Documentation
language, functional verification language and usable for logic synthesis.
The researcher identifies the routes in the trellis diagram that are named in the Turbo decoding.
The Turbo algorithms are mainly employed in the digital communications, decoding the Convolutional
codes and the image and speech recognition. with this research, one can easily estimate the importance
of Turbo algorithm in the reducing the decode errors in the communication and can even make use if
this research to create the new algorithm which provides better features than the Turbo algorithm.
Hence, from this context it can be expressed that this research is mostly useful for the various students

related to the communication filed and the organization in raising their levels in the global market by
reducing their errors in the communication process.
1.6. Research Method
Research is a probe of new facts that are exercised by the researchers. Generally, research
method is an organized engineered which will determine the problems, suggest solutions and finally
prepares the gathered data. For, research the data need to be gathered from many resources where the
researcher will identifies proves to be collected and the techniques that need to applied in the research .
Generally there exist two methods for gathering the accurate data to the research. They are primary type
and secondary type. In the primary type the researcher need to gather the data manually without
referring or taking the ideas from other researchers where as in the secondary type the researcher gathers
the data from numerous resources by referring the journals, magazines, books, etc . For the present
research, it’s better to prefer the secondary resources as this research deals with the implementation of
turbo algorithm. Here, the researcher cannot depend only on primary data as the researcher will not find
data by interviewing of surveying the people as all the people cannot know about this algorithm.
So, it’s better to prefer the secondary resources where the researcher can easily analyze the
about the turbo algorithm by referring to various journals and at last this algorithm can be implemented
with the VHDL code to obtain the required result. In this research the researcher will go for a method of
implementing VHDL programming to derive few areas of research objectives and also ensure that some
areas are of research objectives will be derived and observed using the secondary data. At the same time
the author will draw the conclusions based on the secondary data collected and the primary data gained
from the experimental coding using VHDL programming language. At the same time the research
questions are designed based on secondary data available in the initial research conducted by the
researcher.

LITERATURE REVIEW
2.1. Overview
Virtebi algorithm is an approach towards finding the most common sequence of hidden states in
all listed states. It is dynamic programming algorithms that find the probability of all observed sequence
for each combination. Pr (observed sequence | hidden state combination) It is a feasible procedure to
find the common sequence .The complete calculation in each combination is much costly .It is evaluated
for the error correction for noise in the digital communications. Virtebi algorithm is familiar algorithm
works on the state machine assumption for the conventional codes. By using the system can be modeled
at certain state. There are finite numbers of states. There will be a survivor path mostly a common path
in a multiple sequence path that can lead to a given state.
It can describe the hardware and the soft ware implementations. The noisy channels are usually
corrected by the conventional codes as they are efficient for correcting the corrupted channels. Satellite
communications, TURBO and GSM cellular, dial modem, deep-space communications and 802.11
wireless LANs. Mostly use the conventional codes. Information theory, speech theory, keyword
spotting, computational linguistics and bioinformatics use this algorithm usually. The algorithm is not
more likely i..e, it may create a numerable statements [8]. In the first step both the observed events and
the hidden events must be within the same sequence and that sequence must resemble the time. While
comes to the next step the two sequences must be put together and the known or the observed events
must resemble the accurate one hidden event.
The next coming thirds step computing the most probable hidden sequence up to certain point “t”
depends on the absorbed point within the sequence at point “t-1”.The algorithm examines the forward by
moving to new set of states by combining the metric of possible previous states with the incremental
metric of transition due to the event and select the best for a event occurred. In many cases the state
transition graph is not connected fully. This algorithm can relate the active programming that discovers
the single most probable observed sequence. Sometimes the statically parsing active programming can
be used to detect the single most common context-free derivation of a string. After all compounding of
the incremental metric and the state metric computing only the best lasts and all other paths are
disposed. In iterative Turbo decoding one may find the sequence of engaged that corresponds the
rightest for a given HMM [9].

The working of the iterative turbo algorithm is by iteratively raising an altered Turbo algorithm,
estimating the score for filler till intersection An flip-flop algorithm, called Lazy turbo algorithm, is
recently projected that works not done by expanding the nodes until it really needs to, usually manages
to get away than the normal turbo algorithm. It has been continued to control in a settled finite
automation in gild to have speed operational for the generate trellis with the state transition pointing the
variable amount of history. In many situations the history completes as the state machine starts at a well-
known state as paths are kept at the sufficient memory. When there is a case of bounded resources as
one exercise in convolution encoding the decoder need to leave the history for the sake of acceptable
performance level. There are alterations that made easy for the computational load and the memory
elements that lean to maintain constant.
2.2. Errors occurred during the coding in communication process
Communication is a process of transferring data from one person to other person involves a lot of
coding during the programming of its mechanism and the probability of getting errors is ample. Some of
the simple bit errors can be adjusted by interpreting the real bit sequence during communicative path is
down line. Most of the arbitrarily problems can be solved randomly utilizing few of the important
features of Turbo algorithm which yields to the original sequence. The most important feature for
communication is to facilitate error free data transmission among digital or analog functioning signals
along with amplification. Coding in communication system is basically categorized into four sections as
1) Encryption: mainly used for security of data,

2)data compression: used for data streaming and to reduce the space,
3) Data translation: used to demonstrate the data for transmission of communication channels
4) Error Control: identifies the errors and correct them as soon as possible.
For digital signals data represented as 0 and 1’s, so as to detect errors and analyzing the noise
occurred while transmission as well as to correct those errors. In normal cables the error is due to the
random motion and some deviation occurs when conduction is through various components like
resistors, capacitors, inductors etc, which is known well known as thermal noise. This is one of the

major sources of noise for cable communication system. If there are various sources of noise in wireless
communication systems such as in mobile phones, disturbances are of other user signal noise
interruption. The original signal is normally added with the noise signal at receiver input. The forward
error correction (FEC), auto repeat request (ARQ), hybrid ARQ and error code correction (channel
coding) are the general methods used for error correction [9]
As the error in coding generally occur due to storage or transmission for protection of digital data
is with the modern internet communication and telecommunications. The rich mathematical theory is
also employed number of error protection techniques.

RESEARCH ON PROPOSED SOLUTION

3.1. Overview
Research is generally defined as the human activity that is carried out based on the intellectual
application in the investigation of matter. Basically there are various approaches for the researcher to
finish their task successfully but these people select the approaches depending on their research
objectives [17]. For the present research, it’s better to prefer the secondary resources when compare to
the primary resources. As the researcher may face problems while gathering the accurate
3.2. Language used for Turbo algorithm
There are number of functional programming languages, since most of the hardware programs
are written in hardware description language such as VHDL (Very High Speed Integrated Circuits)
hardware description language which may not be programmed through imperative languages like C or
MATLAB. There are basically two Turbo algorithms namely isolated sign language Turbo algorithm
and continuous sign language Turbo algorithm both are standard used to search the frame
simultaneously. To find the sequence of hidden states which is called as Turbo path the Turbo algorithm
is used which is a dynamic programming algorithm.
A state machine assumption is used for the functioning of Turbo algorithm. There is finite
number of states, at any time system being modeled in some state. The survivor path which is at least
one of the most likely paths to the state when number of sequences of paths can be directed to given
state. The most likely state is kept by examining all the possible states which are the fundamental
assumption of the algorithm. Thus by keeping only one path is necessary and do not need to keep all the
track of all states. This is the first assumption. A new path from the previous state is marked by additive
metric which is the second assumption. And the third assumption is that in some sense events are
accumulative over a state. By moving advance in a new state it chooses the best by combining the
additive metric with the previous path an new set of stated can be examined by the algorithm whenever
an event occurs. The transition property from old path to new path is linked with the additive metric
[18]. Let us consider an example for this. It is only possible to beam half of the symbols from even
numbered path and the other half of the states from odd numbered path in data communications.

The state transition graph is not fully connected in almost all cases. To find the sequence of
hidden states which is called as Turbo path the Turbo algorithm is used which is a dynamic
programming algorithm. A state machine assumption is used for the functioning of Turbo algorithm.
There is finite number of states, at any time system being modeled in some state. The survivor path
which is at least one of the most likely paths to the state when number of sequences of paths can be
directed to given state.
The most likely state is kept by examining all the possible states which are the fundamental
assumption of the algorithm. Thus by keeping only one path is necessary and do not need to keep all the
track of all states. This is the first assumption. A new path from the previous state is marked by additive
metric which is the second assumption. And the third assumption is that in some sense events are
accumulative over a state. By moving advance in a new state it chooses the best by combining the
additive metric with the previous path an new set of stated can be examined by the algorithm whenever
an event occurs. The transition property from old path to new path is linked with the additive metric. Let
us consider an example for this. It is only possible to beam half of the symbols from even numbered
path and the other half of the states from odd numbered path in data communications. The state
transition graph is not fully
connected in almost all cases. Let us consider a simple example for this type.
Let a car has three states. They are forward stop reverse. And a transition is made that reverse to
forward is not allowed [19]. To verify the Turbo algorithm MATLAB code should be short.
TMS320C54x DSP assembly language is used to write the Turbo decoding algorithm. In this report a
detailed execution of Turbo algorithm is provided.
The Turbo coder you will implement is based on a 16-state rate 1/2 convolution coder with the following
system equations:
G0 (n) = x (n) + x (n-1) + x (n-3) + x (n-4)
G1 (n) = x (n) + x (n-2) + x (n-3) + x (n-4)
Where x (n) is the un-coded input and G0 (n), G1 (n) are the encoded outputs
To implement the Turbo decoder we will use a 16-state trellis diagram. This allows us to use the
specialized instruction set supported by the C54x DSP's

3.3. Importance of VHDL over other languages
VHDL is known to be the standards of Very High Speed Integrated Circuit (VHSIC) as it is a
hardware description language. VLSIC is the advanced technology in designing the new technique VLSI
silicon chips, which was proposed in 1980s by United State government as well as air force. VHDL
describes the behavior for the electronic circuit/ system. The VHDL is the earliest hardware descriptive
language which was originally accepted by the Institute of electrical and electronics engineers of IEEE
1076 standards as well as later IEEE 1164 is an additional standard introduced for multi-valued logic
system [20].
The designing process of the VHDL synthesis involves a cycle of six steps which are illustrated
as follows:
• Analysis on all the requirements of design and define them: The design requirements are for
providing the essential setup, clock requirements, and maximum operating frequency in the critical paths
of the project.
• Design the VHDL code along with its description: basically a design methodology is made use
of for describing any system some of the common design methodology are Top-down, bottom-up
and flat
• The source code of the process is to be simulated: As the simulation would be done before
synthesis and design stage it is most essential feature of hardware and description languages.
• Achieve a synthesized, best optimized and to fit the design: creation of design descriptions and
logic circuits are done by the designers in the synthesis tools of VHDL. Optimization process
compresses the circuit by reducing the amount of product terms. Placing the logical products in
al logic device is called fitting process.
• Next the design is to be simulated again: the design element of VHDL includes entity
declaration and body of architecture.
• Finally the processed design is to be implemented.
From the above steps it can be concluded that the circuit synthesis and circuit simulation are the
main task to be carried out by VHDL. The synthesis circuit in PLD or FPGA or ASIC are the major
utilities of VHDL. The designer starts writing the code with an extension of .VHDL while saving the
ENTITY’s same name by compilation which is the conversion of high-level VHDL language as shown
in the figure below. The next level of performance is on the gate-level net-list for rapid operation at a

register transfer level (RTL) for simulation. The place and route filter software will generate practical
layout for PLD chip and generate masks for ASIC.
Figure 3.1: shows the design flow of VHDL

Design process includes analysis, elaboration, simulation and synthesis. During analysis verify
the syntax and semantic errors in the design. Identify all the steps which are involved in the design unit
separation and which are placed in the library. Flatten the design chain of command and finalize the
results of elaboration of collected signal process. Simulation of the executed module and use discrete
events for sensitive input signals. Simulation algorithm will initializes all the phase of transactions. The
translated register-transfer-level (RTL) to gate-level-netlist is functioned in the synthesis process. The
electronic components execution in many areas is described by VHDL. VHDL simulation model is
created by the accurate view of electric circuit behavior. VHDL simulation model can be used as a basis
for constructing big circuits .
VHDL functions as a universal programming language. VHDL resembles C and C++ languages.
VHDL allows concurrent issues description that provides a strong set of control and data representation
characteristics which make VHDL different from other languages. VHDL is mainly used to point the
function of a circuit. Text models are normally written by using VHDL which depicts a logic circuit that
is refined by a synthesis program. The logic design is tested by using a simulation program. The design
is interfaced by the logic circuits using the simulation models. The collection of all these simulation

models is called as testbench. The parallelism integral in hardware designs is managed by VHDL [21].
But the parallel constructs differs from the syntax. VHDL is a universal language and has filed input and
output potentialities.
Executable binaries can also be chassis by some VHDL compilers. Then VHDL is used to write
a test bench to assert the functionality of design using files on the host computer so that to define stimuli
and the results are compared with the user. To produce a successful simulation it may be easy for an
inexperienced developer, but to synthesis into a real device it cannot be done and even it is too large. To
produce a RTL schematic of a wanted circuit one has to design hardware in a VHDL IDE. The
waveforms of inputs and outputs of the circuit after getting appropriate test bench are showed by
verifying the generated schematic. The inputs have to be determined correctly to bring forth an
appropriate testbench for a particular circuit.
Advantages: Before the synthesis tools transform the design into real hardware VHDL is used for
system design and grants the behavior of the required system to be modeled and simulated which is the
key advantage of VHDL. VHDL is a dataflow language and allows a description of concurrent system
which is another advantage of VHDL. Synthesizable constructs and VHDL templates [22].Simulation of
electronic and synthesis of such designs are two different goals often used in VHDL. FPGA or an ASIC
is an execution technology in which VHDL is compiled and mapped. This process is called as synthesis.
To synthesize VHDL many FPGA sellers have free tools for employ with their chips, whereas ASCI
tools are of very high cost. For synthesis all constructs in VHDL are not worthy. Different capacities are
associated with various syntheses.
For language constructs map into similar hardware for all synthesis tools there exists a common
synthesizable subset. The official synthesis subset that is considered as a subset of the language is
defined by IEEE 1076.6. To write very idiomatical code for synthesis as results it is considered as a best
practice. VHDL is the IEEE standard technology independent language as it is the vendor portable and
reusable. VHDL is mostly used in the fields of application specific integrated circuits and
programmable logic devices but, it is not a programming language. Some of the basic functional areas of
the VHDL are [ 
• VHDL components facilitates for using an array as well as regular analysis of its structure.
• All the component algorithm of the VHDL describes hook-up.

• Some of the other components like N-bit array memory, J-bit memory, K-register file etc are
also used frequently.
As the VHDL language code is processed it may be used in two purpose one for implementation and
programmability of the device like Altera, Xilinx, Atmel etc in the process of fabrication to ASIC chip.
And the second is to approach for number of complex designs for the process of commercial chips, for
the entity, architecture, package and control
.
3.4. Tools used along with the VHDL
The two main tools which are used in the Modelsim SE/DE and Xiliniex ISE which are
described as follows: Modelsim SE and Modelsim DE are the two basic commercial tools available.
Modelsim SE uses UNIX (Sun Solaris, IBM AIX, HP-UX), Linux (Redhat 6.0 - 7.2), Microsoft
Windows (98, 2000, NT, XP) operating system, Modelsim DE uses 32-bit Windows
XP/Vista and Linux platforms. Both of these are available in 5.6 and 5.5 versions respectively.
The combination of unified debug environment for Verilog with single kernel simulator (SKS)
technology, VHDL, and System C was first done by mentor graphics. For both FPGA and ASIC design,
MODELSIM became a choice for simulation by the compounding of industryleading, native SKS
performance. In almost all tools flows process it is the best standard and platform.
ModelSim PE - Simulation and Debug: Modelsim PE Features: Modelsim PE is the windows based
simulator for VHDL, Verilog or mixed language simulation environments, and is leading in the industry.
Features of Modelsim PE are described in further sections. It has partial VHDL 2008 support. It has
windows 7, Secure IP support. The transaction wlf logging support in all languages including VHDL It
has system C option. It has RTL and Gate-Level Simulation. VHDL and System Verilog Design,
Integrated Debug, Verilog, , Mixed-HDL Simulation option, Code Coverage option, Windows 32-bit,
Enhanced debug option are some of the features of Modelsim PE.
Modelsim PE Benefits: Integrated project management simplifies managing project data ,Easy to use
with outstanding technical support ,Intuitive GUI for efficient interactive debug, Award- winning
technical support are the benefits of ModelSim PE,Sign-off support for popular ASIC libraries, Cost

effective HDL simulation solution Upgradeable to ModelSim SE for higher performance, ASIC sign-off
,.
Overview of Modelsim PE: ModelSim PE is entrance level simulator, and it offers Verilog, VHDL.
ModelSim is known for its high execution delivering, simplicity in use, and outstanding product support.
It alters transparent mixing of Verilog and VHDL in one design. The outstanding performance of native
compiled code which is done by the platform independent compile is allowed by the ModelSim
architecture. Verilog and VHDL language standards are fully supported by ModelSim PE
ModelSim DE - Simulation and Verification: The choice of simulator for all leading electronics
companies is ModelSim DE
ModelSim DE Features: easy-to-use GUI with TCl interface, Intelligent, System C option available,
Code coverage, Standard support for Xilinx Secure IP, source code templates, integrated project
management, Native compiled, Single Kernel Simulator technology are some of the features of
ModelSim DE.
ModelSim DE Overview: ModelSim technology enables the transparent mixing of Verilog and VHDL
languages in one design. The design quality can be improved by assertion based verification. The cause
of failure can be easily examined by the simulation results in only the wave window caused when
complex assertions are triggered. A powerful simulation can be delivered by ModelSim DE. It will be
well suited for small and medium sized FPGAs verifications, especially designs with critical
functionality and that are complex.
XILINX ISE: is Xilinx Integrated Software Environment. FPGA and CPLD designs are designed in
XILINX. World class design entry, synthesis and executiontools are offered by ISE. Various versions
are available for installing ISE. Various design steps can be brought up by ISE as it is a graphical User
Interface. This can be used in markets like communications, industrial, consumer, automotive and data
processing. In design flow the user creates the source files based on design objectives using any HDL
like Verilog, VHDL etc. After design entry and simulation the project synthesis is done. For HDL
devices and its design process it can be said that XILINX ISE is a dominant software tool.

3.5. Building Turbo algorithm

The coding in Turbo Algorithm was introduced in the year 1967 for the first time in one of the literature
paper [26, P.1]. Since then, due to its easiness in implementation, it has been used to many different
areas related to decoding problems. VHDL is a hardware description language. For the use in design
process systems this has become a practical tool because this application is used to define the operation
than the logic of the design which leads to the diminution of costs and evolution time. Recently VHDL
code can be mapped on FPGAs. This method is available to the designer which reduces the costs of
ASIC designs. As Digital signal processing is now used in many areas of human life. The demand for
more complex ASICs is gradually increasing. Like Turbo algorithm and matched filters many important
algorithms used in digital communication systems contains the calculation of square of some sample
value . Usually the maximum-likelihood path given the input sequence is reconstructed by the Turbo
algorithm. Let us define some of the following terms:
A soft decision decoder: A reliable estimation is made on a decoder receiving bits from the channel. To
complete a task three bits are normally sufficient. If the width of the soft decision is increased further
then there will be only slight increase in the performance but there will be a significant increase in the
computational difficulty.
A hard decision decoder: It is a decoder which receives only bits without any reliable estimate from the
channel,
A branch metric: it is the difference between the ideal pairs and the received pairs.
A path metric: A path metric is the sum of the all branches in the path. The path with the minimal metric
path is the maximum-likelihood path. Therefore the decoding problem is almost equal to the problem of
finding such a minimal path.
Let us suppose assume that we know a minimal path metric ending for almost every possible
encoder in this state. There will be only two states for an encoder to move to that state in any given
encoder and branch metrics must be known for both of these transitions. Therefore in the next step, in
any given state there will be only two paths ending. If the path has lesser metric then the path is called as
survivor path and the other path is dropped less likely.

Thus a minimum metric path can be known on next step, and can repeat the above procedure.
For the Turbo algorithm in general the fundamental process is assumed to be Markov process with some
characteristics is: Finite state, in this the number M is finite. Discrete time, this means that same unit of
time is taken from going to one state of position to another state of position. The sequence of
observations depends probabilistically only on the previous sequence transitions which is observed in
memory less noise.
3.6. Building of VHDL
VHDL (VHSIC hardware description language) is a programming language. The behavior of
field programmable gate arrays can be illustrated by this language. The electronic components execution
in many areas is described by VHDL. VHDL simulation model is created by the accurate view of
electric circuit behavior. VHDL simulation model can be used as a basis for constructing big circuits.
VHDL functions as a universal programming language. VHDL resembles C and C++ languages. VHDL
allows concurrent issues description that provides a strong set of control and data representation
characteristics which make VHDL different from other languages. VHDL is mainly used to point the
function of a circuit. Text models are normally written by using VHDL which depicts a logic circuit that
is refined by a synthesis program.
The logic design is tested by using a simulation program. The design is interfaced by the logic
circuits using the simulation models. The collection of all these simulation models is called as test
bench. The parallelism integral in hardware designs is managed by VHDL. But the parallel constructs
differs from the syntax. VHDL is a universal language and has file input and output potentialities.
Executable binaries can also be chassis by some VHDL compilers. Then VHDL is used to write a test
bench to assert the functionality of design using files on the host computer so that to define stimuli and
the results are compared with the user. To produce a successful simulation it may be light for an
inexperienced coding engineer, but to synthesis into a real device it cannot be done and even it is too
large.
To produce a RTL schematic of a wanted circuit one has to design hardware in a VHDL IDE. The
waveforms of inputs and outputs of the circuit after getting appropriate test bench are showed by
verifying the generated schematic. The inputs have to be determined correctly to bring forth a required
test bench for a particular circuit

3.7. Synthesizable constructs and VHDL templates
Simulation of electronic designs and synthesis of such designs is two different goals often used
in VHDL. FPGA or an ASIC is an execution technology in which VHDL is compiled and mapped. This
process is called as synthesis. To synthesize VHDL many FPGA sellers have free tools for use with their
chips, whereas ASCI tools are of very high cost. For synthesis all constructs in VHDL are not worthy.
Different capacities are associated with various syntheses. For language constructs and idioms map into
common hardware for many synthesis tools there exists a common synthesizable subset. The official
synthesis subset that is considered as a subset of the language is defined by IEEE 1076.6. To write very
idiomatic code for synthesis as results it is considered as a best practice.
3.8. How Turbo algorithm is implemented through VHDL
In digital signal processing, the decoder circuit use Turbo algorithm as a basic conventional
coding. The Turbo decoder operates at very high speed decode processing to get desired result.The
designing of Turbo decoder needs large circuitry for calculations and memory allocation for results.
The Turbo decoder also used to acquire exact expectation of transmitted sequence passed
through a medium with inter symbol interference (ISI).In order to decode conventional codes Turbo
maximum likelihood algorithm is the effective computational procedure. Especially for limited length
conventional codes the Turbo decoder computes very accurately. It is also decodes conventional codes at
high speed. The graphical representation of Turbo algorithm is known as trellis diagram.
The working of Turbo algorithm is, it takes a tray of bits and try to get a direction in the trellis
diagram with an output digit sequence which is similarly as the received sequence input bits. In trellis
diagram each branch maintains a particular value. This value is known as the branch metric. If the
weights are considered as branch metric values, the aim of the Turbo algorithm is to calculate the least
weight path from the left final column to the right most column of the trellis state diagram. At each
branch node only few small path metrics can be omitted. At each node Turbo algorithm computes a
desired decision path value and an input label for each node. The decision value is taken from the last

stage of computation and it is the smallest path value in that stage. From this observation we can
conclude that the result of Turbo algorithm is the smallest path metric previous computation stage.
Turbo algorithm uses the software of Turbo decoder for implementation. Initially it is essential to
develop some data structure around the algorithm since there are implemented as arrays, thus the
structure of most important six array is explained in following steps. Prepare the convolution encoder
copy it to the next table for state transition encoder table. Before the process of decoding is stated the
array is to be initialized in every step.
Prepare the output table for convolution encoder. The array or table is represented for the present stage
as well as next stage of convolution encoder, based on the high or low input values the next state is
processed to show the present states. This array/table is called as the input table. Store each state history
of all encoder for K at received pairs to symbols.
The accumulated error array is to be stored in the form of metrics with add compare-select
operation. This is known to be as accumulated error metric array.
List all the array states gritty with trace back and named it as state sequence array.
3.8.1. The Turbo Decoder Architecture
The Turbo decoder is seperated as three functional units. The first part is an add-compare-select (ACS)
unit designed for calculating the path metrics. The second unit is used for survivor memory
management. It is the last sequence is known as survivor sequences and the survivor memory is used for
storing survivor sequences. Register. The register exchange technique or the trace-back techniques are
used for survivor memory implementation. The trace-back technique is also used in Technical Data
Freeway’s (TDF) VHDL model of the Turbo decoder. The third part of the Turbo decoder is ACS (Add-
Compare-Select Cell) unit. The ACS cells work is to lead together the branch metrics to the next
attempting path metrics to choose the path that is less. The ACS cells also produce the pointer to the
decision value which is the smallest path metric in the previous state and stored in the survivor
memory[27].
The ACS functional unit has more number of ACS cells, and the number of cells is calculated by the
parameters of ACS_UNITs and path metrics. While in decoding process registers and temporary
registers are used for storing the parameters and path metrics. The ACS unit also computes the number
of the input branches. The signal clock counter in the Turbo architecture is used to control the

computations of the decision values and path metrics and also drive the SMU control unit. The control
unit carries two computations. In trellis diagram it calculates the states of upper part, in be twin lines
with the path metrics in the lower part are parallel. The incoming clock counter counts from 0 to
ACS_period-1. Temporary registers store the computed path metrics when the clock counter is greater
than zero and when it is equal to zero path metrics registers are used for storing the finishing computed
path metrics and the elements of the temporary registers. A small value should be chosen as the path
metric register word length in order to avoid overflow. If generally used path metric is considered then
the smallest path value in the previous stage also is selected. The ACS unit will stop processing when
freeze signal will rise because of computing the whole burst in the ACS unit. This type of operation
leads Turbo decoder in the trace-back mode.
3.8.2. The SMU CONTROL Unit
To store the final sequences in the Turbo decoder the survivor memory is used and controlled by
the SMU unit. It is also based on trace back method. In this unit the alteration of studying the new
branch metrics and trace back is scheduled by the state machine. The SMU control unit read the smallest
path values or previous stage smallest values from the registers and outputs the decoded bits. The
decision values are written in bursts at survivor memory when the branch metrics are inserted in bursts.It
contains four counters. The first one is the ACS counter, used to count from 0 to ACS_period- 1 during
the ACS operation. It generates the write-enable and load-enable signals. For counting from 0 to burst
_length load counter is used in ACS operation. It generates the internal control signals and counts the
input data. In trace back mode TB counter is used for counting from 0 to mem_size-1. Turbo algorithm
is the one of the simple and unique method and it has a wide spread in the complexity at the
transmission side [28]. By using the Field programmable gate arrays (FPGA) there is break time in the
design of telecommunication devices that are based on the requirements that customize and recycle the
Verilog HDL. Field programmable gate arrays are the semi conductor devices that maintain
programmable logics and inter connectors.
All the systems will be implemented in the Verilog (HDL).To build the RTL level VHDL for
decoder the synthesis tool is used. Initial conditions that are placement of the weights and the paths need
to modify the state are readily coded in the VHDL. Field programmable gate arrays (FPGA) are the
extremely worth full tools in the design of the VLSI. Users determine the FPGA with the hardware

description language (HDL). Turbo algorithm is based on the strongly connected trills decoding of the
binary convolution codes. The use of the error correcting codes has solved to be the effectively to
overcome the data corruption in digital signal communications. With the utmost likelihood Turbo
algorithm for the better decoding of the convolution codes .It also the easy way for short constraints to
decode. Turbo algorithm implements the ML coding by reducing the complexity. It eliminates the east
trellis paths at each level of transaction. It gets efficient via focus on the survival of the trellis. The
advanced FPGA technologies and the well developed electronic design automatic tools (EDS) have
made it possible to realize the Turbo decoder.
The main motivation of this is to use the VHDL synthesis and the simulation tools to realize the
Turbo algorithm. The Turbo decoder makes use of Turbo algorithm for decoding of the bit stream that is
encoded with the forward error correction based on the code .The decoder implemented in VHDL can be
used to generate in MAT LAB for the noisy, encoded streams of data which were to be quantized using
the common bit width [29]. While coming to the implementation parts there are some key points that are
to be remembered that are:
 To generate the required data that is to be transmitted through channel can be achieved with a
random number generator.
 Using the shift registers and the convolution logics that perform the modulo-two addition the
convolution encoding of data is possible.
 Mapping the one / zero output of the convolution encoder onto the antipodal baseband and
signaling scheme that produce the transmitted channel symbols.
 Addition of noise channels to the transmitted channels symbols by the encoder that implies in
the generation of the Gaussian random numbers to produce the received channel symbols.
 A Turbo algorithm decoder should precisely work on the infinite or at least the floating point
numbers.
 Result again the binary data bits on the quantized received channel to perform the Turbo
decoding.
 Comparison of the decoded data to the transmitted data bits and the count number of errors.
The Simple and the unique as described Turbo algorithm operates on the block of received data and
the block length decides the decoding speed. Then at last the decoder is synthesized and simulated on by
writing the VHDL description.

FPGA is used to implement Turbo algorithm. The design is described by the hardware description
language VHDL. The implementation of this design is done on Xilinx Spartan 2e xc2s100-5cpq208.
Using Xilinx tool Turbo decoder is first synthesized and simulated for the proposed pipeline structure.
First let us have a brief introduction about Xilinx software and
VHDL. Traceback method (TB) and register exchange method are the two techniques used for
decoding the data. XILINX: Xilinx is capable of planning; formulating and markets programmable logic
services by devices those changes day by day with integrated circuits. Software design tools, determined
system derivatives delivered as intellectual property (IP) cores, design services, customer training, field
engineering and proficient support. Xilinx sells both FPGAs and CPLDs programmable logic devices for
electronic equipment makers in end markets such as communications, industrial, consumer, automotive
and data processing. The emphasis is on writing solid synthesizable code and enough simulation code to
write a viable test bench. Structural, Register Transfer Level (RTL), and behavioral coding styles are
covered .
3.9. Summary
A convolutional code that uses the maximum-likelihood method was decoded by the Turbo
algorithm procedure. Formal definition of algorithm, This names the probability calculations by
gathering the product of the initial hidden state probabilities with the related observed probabilities. The
errors found in the convolution coded sequence are decoded basically by using Turbo algorithm. To find
the coded sequence based on the transmission signals trellis diagram is used by the Turbo algorithm.
Trellis diagram is the common supporter to study the Turbo algorithm
C or MATLAB are the languages used for Turbo algorithm. Two Turbo algorithms, namely
isolated sign language Turbo algorithm and continuous sign language Turbo algorithm are used to
search the frame at all the same time. The sequence of hidden states that were found is called as Turbo
path the Turbo algorithm is used which is a dynamic programming algorithm. To verify the Turbo
algorithm MATLAB code should be short. TMS320C54x DSP assembly language is used to write the
Turbo decoding algorithm.
VHDL is known to be the standards of Very High Speed Integrated Circuit (VHSIC). The
behavior of field programmable gate arrays can be illustrated by this language. VHDL functions as a
universal programming language. VHDL resembles C and C++ languages. VHDL is mainly used to

point the function of a circuit. In VHDL the test benches were used to assert the functionality of design
with the usage of files on the host computer so that to define stimuli and the results are compared with
the user.
Before the synthesis tools transform the design to real hardware VHDL is used for system design
and grants the behavior of the required system to be modeled and simulated which is the key advantage
of VHDL. VHDL is preferred apart from other languages because it is a independent technology and
moreover it is a IEEE standard technology, but it is not a programming language. There are no tools to
generate VHDL test benches automatically.

ANALYSIS ON RESEARCH
4.1 INTRODUCTION
The European emergency call (eCall) system is a telematics system designed to save more lives in
vehicle accidents. It is a governmental mandatory system that is to be implemented by March 2018
[1][2]. The EU eCall system provides an immediate voice and data channel between the vehicles and an
emergency center after car accidents. The data channel provides the emergency center with the
necessary data for emergency aids. The EU eCall system main parts includes the in-vehicle system
(IVS), the public safety answering point (PSAP), a cellular communication channel. The IVS activates
the data channel automatically when a car accident occurs. The IVS collects the minimum set of data
(MSD) that includes GPS coordinates, the VIN number, and all required data for an emergency aid. It
sends the MSD to the closest PSAP through a cellular channel in up to 4 seconds [1]. The PSAP sends
the emergency team to the location of the accidents. The IVS modem employs multiple modules for the
MSD signal processing. The modules of the IVS are shown in Figure 1. The IVS employs a Turbo
encoder as a forward error correcting (FEC) [1]. The Turbo encoder implements the digital data
encoding technique in data transmissions. Turbo coding is one of the most popular and efficient coding
technique to improve bit error rate (BER) in digital communications [3] [4]. The cyclic redundancy
check (CRC) [5], the modulator [6], the demodulator-decoder [7] modules are projected and
implemented on an FPGA device. They are developed to be embedded modules of the IVS chip.
Fig. 4.1: The IVS block diagram.

4.2 TURBO ENCODER MODULE

The turbo encoder technique is one of the most powerful FEC techniques in digital communication [8].
The IVS employs a Turbo encoder module with 1/3 code rate. The Turbo encoder functionalities are
detailed in the third generation partnership project (3GPP) standards. The 3GPP Turbo encoder is
illustrated in Figure 4.1. The input signal of the turbo encodes is the MSD data appended with the CRC
parity bits in binary. The block length of the MSD data is 1148 bits. The output of the module is the
MSD encoded data in binary. Implementing the turbo coding technique with 1/3 coding rate and thrills
bits, the length of the output is 3456 bits. The thrills structure has an impact of the Turbo encoder [9].
The Turbo encoder employs a parallel concatenated convolutional code (PCCC). The PCCC uses two
constituent encoders with eight states as it is shown in Figure 4.2. The initial status of the register are
zeros. The first constituent takes the MSD bits and implements the employed convolutional technique. It
takes one bit at a time and generates one bit of parity1 bits. The second constituent implements an
identical technique of the first constituent, but it calls for the MSD bit after they are interleaved with a
3GPP designed interleaver technique [8]. The length of the input data, parity1, and parity2 are 1148 bits.
There are 12 bits of the tail bits. They are driven from the shift register feedback. The tail bits are
applied for end points between the encoded data blocks. The output structure of the Turbo encoder is
illustrated in Figure 3.
Fig. 4.2: The structure of the Turbo encoder.

Fig. 4.3: The output buffer of the Turbo encoder

Interleaver Denote the transfer function of the employed PCCC as: G(D) = 1, g1(D) g0(D) (1) where
g(D) = 1 + D2 + D3
g(D) = 1 + D + D3
And denote the input bits to the encoder as x1, x2, ..., xK, the output of the interleaver as x 0 1 , x0 2 , ...,
x0 K, and the output bits of the first and second constituents as z1, z2, ..., zK and z 0 1 , z0 2 , ..., z0 K,
respectively; where K is the number of input bits to the Turbo encoder. The encoder output is expressed
as:
d (0) K = xK, d(1) K = zK, d(2) K = z 0 K where K = 0, 1, ..., K − 1.
The three code blocks of the output, d (0) K , d (1) K , and d (2) K are separated by trellis bits. The
trellis bits are generated from the tail bits of the shift registers after encoding of all the input bits. In
figure 4.2, when the upper switch is lowered and the second constituent is disabled, the three tail bits are
used to terminate the first constituent. The output bits of the Turbo encoder, including the trellis bits can
be expressed as:
d (0) K = xK, d(0) K+1 = zK+1, d(0) K+2 = x 0 K, d(0) K+3 = z 0 K+1
d (1) K = zK, d(1) K+1 = xK+2, d(1) K+2 = z 0 K, d(1) K+3 = x 0 K+2
d (2) K = xK+1, d(2) K+1 = zK+2, d(2) K+2 = x 0 K+1, d(2) K+3 = z 0 K+2
where K = 0, 1, ..., K − 1.
The internal interleaver of the 3GPP Turbo encoder is designed to generate a systematic relationship
between xK and x 0 K for any 40 ≤ K ≤ 5114 [8]. There is a specific approach to design an internal
interleaver for the employed Turbo encoder that is detailed in [8]. This work employs the 3GPP standard
approach to design the internal interleaver for the employed Turbo encoder. First, the input bits of the
Turbo encoder is re-arranged in a matrix form that has column, C, and row, R. The rows are labeled as 0,
1, ..., R − 1 and the columns are organized as 0, 1, ..., C − 1. The numbers of rows and columns are
determined according to the 3GPP standard for Turbo encoder interleavers [8]. Then the input bits x1,

x2, ..., xK are re-organized in a matrix where yk = xk for k = 1, 2, ..., K, and yk = 0 for the elements that
R × C > K:
Then an intra-row and inter-row permutation is performed on the R × C matrix. This work employs the
3GPP standard approaches for the intra-row and inter-row. Denote, s(j) = (v × s(j − 1)) mod p (2) where
D s(j) E for j ∈ 1, 2, ..., p − 2 and p(0) = 0 is the intarow permutation sequence and v is associated
primitive root for the specified p from table ??, and use table I to choose the appropriate pattern to
compute the inter-row permutation, D T(i) E for i ∈ 0, 1, ..., R − 1. i is the row number index of R×C
matrix, and j is the column number index of the matrix. Also the minimum prime integer (qi) is
determined in the sequence D q(i) E for i ∈ 0, 1, ..., R − 1 such that qi > q( i−1), qi > 6 and g.c.d(qi , p −
1) = 1, where g.c.d is the greater common divisor. Then one can build a sequence of the permuted prime
integers D r(i) E for i ∈ 0, 1, ..., R − 1 such that, rT (i) = qi , i = 0, 1, ..., R − 1
Denote the pattern of i − th row Intra-row permutation as, D Ui(j) E for i ∈ 0, 1, ..., R − 1, one can
perform the intra-row permutation such that the position of the i − th permuted bit of the j − th row
(Ui(j)) is calculated based on equation 3, 4, or 5. if (C = p) then, Ui(j) = s((j × ri) mod (p − 1)) (3) where
j = 0, 1, ...,(p − 1) and Ui(p − 1) = 0. if (C = p + 1) then, Ui(j) = s((j × ri) mod (p − 1)) (4) where j = 0, 1,
...,(p − 1), Ui(p − 1) = 0, and Ui(p) = p. if (C = p − 1) then, Ui(j) = s((j × ri) mod (p − 1)) − 1 (5) where j
= 0, 1, ...,(p − 1). And then the inter-row permutation is implemented on the R × C matrix by using the
sequence pattern D T(i) E for i ∈ 0, 1, ..., R − 1. After the permutations, the elements of the R × C matrix
is denoted by y 0 k = yk such that:

The output of the interleaver, x 0 2 , x0 2 , ..., x0 K, is the bit sequence that are read out from the R × C
matrix column by column starting with y 0 1 and ending with y 0 (R×C) . The appended zero bits for R
× C > K are removed from the output. There are 1148 elements in the interleaver matrix. The 1148 bits
of the MSD data are the elements of the interleaver matrix. The interleaver reorganizes the MSD bits in
a systematic order. The intra-row and inter-row techniques of the interleaver elements organizations.
Denote the MSD bits as B1, B2, ..., BK, where K = 1148. According to the algorithm that is explained in
the above mathematical modeling, the interleaver matrix is a rectangular matrix, where R is the number
of rows and C is the number of columns of the matrix. The interleaver matrix is designed for an input
data block that consists of 1148 bits. As a result, the size of the matrix is 20 X 58. The following steps
are implemented to drive the interleaver matrix:
1. The input bits of the matrix are denoted as b1, b2, ..., bK, where bK = BK and K = 1148. The
remaining elements are padded with zeros.
2. The intra-row and inter-row permutation are performed according to 3GPP.
3. The calculated elements of the interleaver matrix, except for the padded bits, are stored in a file in
hexadecimal format. The Turbo encoder is developed in Verilog HDL language. Verilog has ability to
read the hexadecimal file to get the data and use it as the interleaver data.
The length of the input data, parity1, and parity2 are 1148 bits. There are 12 bits of the tail bits. They are
driven from the shift register feedback. The tail bits are applied for end points between the encoded data
blocks. The output structure of the Turbo encoder is illustrated in Figure 3. The employed interleaver for
the Turbo encoder is designed according to 3GPP standards [8]. The interleaver elements are organized
in a rectangular matrix. There are 1148 elements in the interleaver matrix. The 1148 bits of the MSD
data are the elements of the interleaver matrix. The interleaver reorganizes the MSD bits in a systematic
order. There are intra-row and inter-row techniques of the interleaver elements organizations. Denote the
MSD bits as B1, B2, ..., BK, where K = 1148. According to the 3GPP standards [8], the interleaver
matrix is a RxC rectangular matrix, where R is the number of rows and C is the number of columns. The
size of the matrix is 20 X 58. The following steps are implemented to drive the interleaver matrix:

1. The input bits of the matrix are denoted as b1, b2, ..., bK, where bK = BK and K = 1148. The
remaining elements are padded with zeros.
2. The intra-row and inter-row permutation is performed according to 3GPP [8].
3. The calculated elements of the interleaver matrix, except for the padded bits, are stored in in a file in
hexadecimal format. The Turbo encoder is developed in Verilog HDL language. Verilog has ability to
read the hexadecimal file to get the data and use it as the interleaver data.
4.3 FPGA DESIGN FOR THE TURBO ENCODER MODULE FPGA
technologies are employed to develop and implement the designed Turbo encoder module. The register
transfer level (RTL) of the module is developed in Verilog HDL. There are multiple registers defined for
the input, output, and necessary parameters to implement the Turbo encoding technique. This work
studies two methods to execute the encoding, which are serial computation and parallel computation.
The serial computation method processes one bit in one clock cycle. It reads the input data of the MSD,
builds the input and output registers, and calculates the parity1, parity2, and the tail bits in a serial
process. After performing the encoding, it generates the output bits. Although the method is designed
and implemented, it is noted that there is a long processing time that can be overlapped with the other
processes in the module. Figure 4 shows the pseudocode of the serial computation of the Turbo encoder
module. The parallel computing technique is employed to develop the Turbo encoder in Verilog. There
are many processes in the serial computation technique that are overlapped by using parallel computing
technique. There are two functions developed in the parallel Turbo encoder. The two functions
implements almost all the processing time of the encoding technique. The Turbo encoding technique
needs the MSD data as a whole package to implement the encoding. Figure 5 shows the pseudocode of
the implemented parallel technique

Fig. 4.4: The pseudocode for serial computation of the Turbo encoder.
for the Turbo encoder. Both Pseudocodes of the serial and parallel computing techniques are designed in
Verilog and implemented on an FPGA device. The processing time of the Turbo encoder module (in
clock cycles) is denoted by Ts for the serial computation and by Tp for the parallel technique, one has,
Ts = Tr +Tb +Tparity1 +Ttail1 +Tparity2 +Ttail2 +Tw (6) Ts = 1148 + 1148 + 1148 + 3 + 1148 + 3 +
3456 = 8054 where Tr is the time for reading the 1148 bits of the MSD, Tb is the processing time to
build the output register, Tparit1 is the time of processing parity bits, Ttail is the time of processing tail
bits, and Tw is the time of generating output bits. Note that the Tr +Tb +Tparity1 +Ttail1 +Tparity2
+Ttail2 are processed in one clock cycle in the parallel computing technique. Tp = 1 + Tw = 1 + 3456 =
3457 (7) Then one has, Tp = 0.42Ts (8) Eq. 8 reveals that the parallel computing can improve the
proceeding time of the Turbo encoder by 58%.

A. Simulation and Verification

Xilinx tools are utilized to simulate the developed modules. A test bench is designed to simulate the
Turbo encoder. Verilog
Fig. 4.5: The pseudocode for parallel computation of the Turbo encoder.
HDL is employed to design the test bench. There are two MSD data that are simulated for each of
the serial computation and parallel computation of the Turbo encoder. Figure 6 shows the simulation
results for the serial computation of the Turbo encoder module. The simulation indicates that the

structure output data is correct. However, there is a long time that can be overlapped, which is
colored in red in the output trace.
Figure 7 shows the simulation result of the parallel computing technique. The module starts to generate
the output in the beginning. Note that the MSD is encoded in a shorter time compare with the serial
computation simulation. This is the result of parallel computing of multiple process in one clock cycle.
4.4 Proposed solution for the problem: Turbo Algorithm
Wide range applications of the Turbo algorithm are towards the DNA analysis, speech
appreciation for cell phones communication and facilitates. The outcome of backtracks from all the
branches may obtain the algorithm task. The Turbo algorithm can perform step-by-step function as
illustrated:
1) Initialization: Arrange all metric in the perfect format.

2) Computation step j+1: Suppose the previous step and use to identify the basic survivor paths
for storage in allthe states.
3) Final step Continue to compute the entire pending algorithm reaches with all-zero state like
hood paths. Turbo algorithm is most likelihood detected sequence with the MLSD with in all the
inter-symbol interference (ISI) as well as memory less noise considering all the input state
channel as well as observable sequence .
Let the Hidden Markov Model(HMM) with the states may be Y, at initial stage probabilities p I
of being in state i and transition probabilities a of transitioning from state i to state j. Say we observe
outputs . The state sequence most likely to have produced the observations is given by the recurrence
relations.
Vok= P (Xo/k).𝜋k
Vt,k = P (xi,j).pk /k).maxy∈ Y(ay,kVt-1,y
Here Vt,k is the probability of the most probable state sequence responsible for the first t +1
observations (we add one because indexing started at 0) that has k as its final state. The Turbo path can
be retrieved by saving back pointers which remember which state y was used in the second equation. Let
Ptr (k,t) be the function that returns the value of y used to compute Vt,k if t > 0, or k if t = 0. Then:
yt = arg maxy∈ Y(VT,y)

4.5 Hidden Markov model and Turbo decoder

4.5.1 Hidden Markova model
The chain of Markov is generally absorbed in noise processing signals. Markov chain is
symbolized as {Xk}k≥0, hear k is basically an integer index. So as to quit the finite set that is for
making secreted, Markov chain is hidden and can’t be observed in arbitrary state, thus it is experimental
known to be as stochastic process {Yk}k≥0 this is an another linked process, as Yk is governed with the
Markov chain in the distribution links [14]. This hidden Markova model is known to be a bivariate
discrete time process {Xk , Yk} k≥0, where {Xk},{Yk} are the sequence of random independent
variables as {Xk} is the Markov chain and conditional distribution of Yk. The hidden Markov model
(HMM) is a signal facilitates to communicate with speech signals which achieved acceptance from
almost all the communication systems.
The fully discrete model with an idea of conditional independence had introduced the hidden
Markov modes as a bivariate process. The hidden Markov models consist of two classic layers sub
cellular location known as upper layer and the functional class, which is lower layer. If any process is
undertaken in the hidden Markov model the doubly stochastic process can’t be observed directly since, it
is hidden and may be observed only with another stochastic process which will facilitates in sequential
observation

Figure 4.6: Shows the hidden Markov model
The two layers upper layer and lower layer are joined for analyzing multiple paths for the flow
from begin to end. Nodes present at the ends of two layers encode the standards which are randomly
hidden from the upper layer namely location class variables with the lower that is functional class
variables. The direction of arrows present in between two layers is the transition flow indication there
colors and shades are indicated as per the estimated probability counts based on training sequence.
4.5.2. Turbo decoder:
In general Turbo decoder apparatus Turbo algorithm mainly for decoding as well as encode fragment
flow by using he forward error correction (FEC) intricacy encoding system. Turbo decoder is mainly
employed for encoding the convolutional data as it is able to overcome number of errors received at the
input data due to channel noise. The Turbo decoding algorithm is a state of the art algorithm used to
decode convolutional binary codes (viewed as a trellis tree) used in communication standards (like
Qualcomm’s TURBO standard). In the implementation of input code symbol stream this Turbo decoder
is used to operate in decoding with some likely sequence. Turbo algorithm follows the most likely path
for maximum encoders and decoders with three main processing steps which are listed below :

• Branch metric generation

• State metric generation
• Chain back
Before implementing the Turbo algorithm it is essential to collect and relate all the noise with the
Markov process in definite order. Turbo detector includes the ISI channels having the predetermined
memory noise driven with the MLSD and MAP sequence detector is utilized. Some of the important
features of Turbo decoder as listed below:
In most of the Industry standard k = 7. Where (G0, G1) = (133, 171), rated at ½ Turbo decoder.
It is possible to implement both with Xilinx FPGA or ASIC. There are 256 latency clock cycle, Speed of
the design is very high which is approximately up to 122 Mbps for the Virtex II at the same time for
Spartan III the data rate is nearly 108 Mbps and more high for ASIC. The software input is of almost 4
bits. The length of track back will be of 64. Simple clock designs are completely synchronous.
4.6. Block Diagram of Turbo algorithm
The Turbo algorithm is one of the standard sections in number of high-speed modems of the
process for information infrastructure applicable in modern world. The dynamic algorithm includes
some path metrics so as to compute the path sequence transmitted earlier the name Turbo algorithm
arrived after Andrew Turbo and is represented as VA for reorganization, record of huge possibility
decodes as well as least reserved decoding are generally similar in a defined binary symmetric channel.
Kia, J. (2005, p.1) explains Turbo algorithm as a “dynamic algorithm that uses certain path metrics to
compute the most likely path of a transmitted sequence” [13]. The basic performance of the Turbo
decoder is analyzed with the block diagramshown below. It consists of three main blocks branch metric
unit, add compare select and trace back unit. The unit of branch metric will calculate all the branch
metrics and then processed to add compare for selecting the surviving branches as per the branch metrics
finally the decoded data bits are generated by the trace back unit.

Figure – 4.7: Shows the basic block diagram of Turbo decoder [14].
The overall performance of the Turbo algorithm is analyzed with the help of conventional codes.
The simulated block diagram explains the operation of detecting and correcting the coding errors in
normal communication system. The transmitted bits of data are encoded in the first block with
conventional code that is (CC encoder) which are modulated by means of binary pulse-amplitude
modulation (PAM) so as to tune those bits into antipodal bits and process to the additive white Gaussian
noise (AWGN) channel thus obtained data combined with noise is supplied to soft decision Turbo
algorithm (SDVA) which only accepts the antipodal data at the input for decoding and produces the
output decoded bits.
Implementation of the Turbo algorithm is supported with two main steps the initial step is to select the
trellis from the bits that are achieved at the input at the receiver. A simple trellis figure shows with four
stage points for transmission, each state is represented with a dot and the state transition is shown as
edge of branch. Each and every branch is known as the branch metric as it is associated at Euclidean
distance with the symbol towards final transition.

Figure 4.8: Shows the Turbo algorithm trellis [15].

For calculating the branch metric can be obtained with the trellis using the Euclidean analysis as
follows:
BM (rr, bb) = (r0-b0)2+ (r1+ b1)2
= r02−2r0b0+b02+r12−2r1b1+b12
= r0b0+r1b1
Where,
rr = symbol received at the input
bb = branch symbol
Both rr and bb are dependent on the used for conventional encoder. Under the basic assumption that
there is no noise in the data and the value of r and b will vary between -1 to +1, the range of branch
metric will range within -2 to +2. In case rr = bb branch metric would be 2, Similarly r0 = - b0 as well as
r1 = - b1 and BM= -2
The path metric (λ) in the minimum Euclidean distance in the trellis does not required the actual value
the original order of the floating point pair numbers is
λnew=λprev+r0b0+r1b1
The path metric λ is the shortest distance among cumulative state, thus distance of the path (Euclidean
distance) is inversely proportional to the branch metric. After complication of generating a trellis it is
necessary to find survivor path with maximum path metric. In the above the solid black line is the
survivor path.

4.7. Description of Turbo Algorithm
Turbo algorithm is basically implemented to decode the errors found in convolution encoded
sequence. As discussed the Turbo algorithm will make use of trellis structure in finding the coded
sequence based on the transmission signals. Since each and every code sequence will follow based on
the trellis process of encoding data. Considering an example of trellis diagram of half rate, three
convolution encoder K=3 and 15 bit messages with four possible states shown in 4 horizontal rows with
dotes.
Figure 4.9: shows the trellis diagram of turbo algorithm.

18 columns shows the time instants from t0 to t17 both t=o and t=17 has the four dot column
which is initial and final state situations while encoding messages. The state transition is shown with a
dotted line at zero input. The figure shows the state of trellis, which reach the encoding of messages.

Figure 4.10: shows states of the trellis diagram of turbo algorithm
Maximum likelihood (ML) sequence will be obtained from the track of paths that occur for
Turbo algorithm is essential for processing information coding. The common aid to analyze the Turbo
algorithm is the trellis diagram. It is the decoding algorithm used with convolution code. The input,
output, receiver and error details are shown at bottom to the figure. The receiver pair of the channel after
collecting the complete information regarding the process the Turbo decoder is ready to function with
the bit that are to be transmission following some steps. Initially number of state is to be selected at a
negligible collected error metric then save the number state arrived. Accurate performs of step from the
initial trellis is to be achieved. All the state sequence state numbers are to be saved. Work forward with
record of all the selected states which are saved in the previous steps which are to be built in by all the
encoded convolution encoder.
4.8. Advantages of Turbo algorithm
All the trellis occurred are arbitrarily solved even in presence of two or more simple errors in
input string using Turbo algorithm. At the same time the in presence of more errors the decryption will
be low even then the algorithm works effectively this is the main advantage in implementation of Turbo
algorithm. The usage of this Turbo algorithm is found to be advantageous due to its cost effectiveness in
modulated minimize at the same time the functional performance in some situation would modulate in
maintaining the original cost. Emerging linear functioning of linear pulse distance is due to convenient
source sequence.

In the analysis of Turbo algorithm basic concept is to know the maximum-likelihood sequence detector
(MLSD), MAP sequence required for the inter-symbol interference (ISI) channels which has some noise
in the statistics of signal. Importance and working of turbo algorithm can be understood from the
description and block diagram explanation of Turbo algorithm.
B. Hardware Implementation
FPGA has been widely used in the SoC design [10][11]. Zynq-7000 FPGA device is employed to
implement the developed Turbo encoder module. Both serial and parallel computation methods are
implemented on the FPGA device separately. The Turbo encoder module is synthesized and loaded on
the FPGA device. The synthesis reports show that the parallel computation does not only save
processing time, but also reduces the utilized logics and the chip size. Figures 8 and 9 show the
utilization flip flops and look-up tables (LTU) for the serial and parallel computation respectively
Fig. 4.11: The logic utilization of the Turbo encoder with serial computation.
The impact of the parallel computation on the logic utilization is shown in Figure 4.13. Note that the
utilized flip flop and LUTs are significantly reduced when parallel computation is employed. The LUT
utilization is improved by 73% and the flipflop utilization enhanced by 75%. It is proven that the FPGA
technologies strongly supports parallel computation for the Turbo encoder. By reducing the size of the
Turbo encoder module, the IVS can be implemented on a single programmable chip with less hardware
constrains.
Fig. 4.12: The logic utilization of the Turbo encoder with parallel computation.

Fig. 4.13: The logic utilization of the Turbo encoder, serial vs parallel computation.

PROPOSED METHOD
5.1. INTRODUCTION
The European emergency call (eCall) system is a telematics system designed to save more lives in
vehicle accidents. It is a governmental mandatory system that is to be implemented by March 2018
[1][2]. The EU eCall system provides an immediate voice and data channel between the vehicles and an
emergency center after car accidents. The data channel provides the emergency center with the
necessary data for emergency aids. The EU eCall system main parts includes the in-vehicle system
(IVS), the public safety answering point (PSAP), a cellular communication channel. The IVS activates
the data channel automatically when a car accident occurs. The IVS collects the minimum set of data
(MSD) that includes GPS coordinates, the VIN number, and all required data for an emergency aid. It
sends the MSD to the closest PSAP through a cellular channel in up to 4 seconds [1]. The PSAP sends
the emergency team to the location of the accidents. The IVS modem employs multiple modules for the
MSD signal processing. The modules of the IVS are shown in Figure 1. The IVS employs a Turbo
encoder as a forward error correcting (FEC) [1]. The Turbo encoder implements the digital data
encoding technique in data transmissions. Turbo coding is one of the most popular and efficient coding
technique to improve bit error rate (BER) in digital communications [3] [4]. The cyclic redundancy
check (CRC) [5], the modulator [6], the demodulator-decoder [7] modules are projected and
implemented on an FPGA device. They are developed to be embedded modules of the IVS chip.
This work studies the hardware development of the Turbo encoder. It employs FPGA technologies to
develop the Turbo encoder to be an embedded module in the IVS modem. It discusses serial and parallel
computation techniques for the Turbo encoder. It does not only design and implement the Turbo encoder
module, but also proposes a better solution for the turbo encoder implementation. The improvement of
the chip size and processing time are exhibited by developing the parallel computation technique for the
Turbo encoder.

Fig. 5.1: The IVS block diagram.

5.2 Literature survey:
The Turbo technique has recently attracted research attentions in the NoC community. To show the
advantages of Turbo NoC, Kim et al. [4] used Walsh codes to distinguish different senders and develop
a hierarchical star-mesh topology to handle a large number of communication processors. The
simulation results show that the Turbo NoC has good performance in latency and throughput. In [7], a
specific application is scheduled onto a Turbo-based NoC and a conventional crossbar-based packet-
switched NoC. The experimental results show that the Turbo NoC achieves lower packet transfer latency
and less area overhead. To further improve the Turbo NoC performance, a globally asynchronous locally
synchronous (GALS) Turbo NoC is modeled and simulated in [8]. By applying the GALS strategy to
Turbo NoC, the Turbo NoC can be used for asynchronous chips. In [9], the multicasting function is
realized in Turbo NoC to address the hotspot problem at the center of NoC with mesh topology. The
results exhibit that traffic congestion at the center of NoC is reduced. Since code utilization rate affects
the Turbo NoC performance, two methods on code word assignment are separately proposed in [10] and
[11]. In [10], the length of code word is adjusted depending on the number of nodes that have packets to
send at the same time. In [11], a scheduling method is proposed to make a compromise on the utilization
rate of code words. Simulation results show that these methods improve the utilization efficiency of the
orthogonal codes. Besides the traditional wired NoC, the Turbo technique has also been applied to
photonic NoC [12] and wireless NoC [13]. The results show that their performance can be significantly
improved with lower energy and area compared with the crossbar-based NoC. All the above-mentioned
Turbo NoCs use the WB encoding/ decoding method, and thus they have the drawbacks mentioned. Our
proposed SB encoding/decoding method shall overcome the common weaknesses.

5.3. NEW Turbo ENCODING AND DECODING METHOD

A. Overall Structure of Turbo NoC
Figure 5.2. Structure of Turbo NoC

The basic structure of applying Turbo technique to NoC with a star topology is shown in Figure 5.2. In
this figure, a PE executes tasks of the application and network interface (NI) divides data flows from PE
into packets and reconstruct data flows by using packets from NoC. In the sender, packet flits from NI
are transformed to a sequential bit stream via a parallel-to-serial (P2S) module. This bit stream is
encoded with an orthogonal code in the Encoding module (E in Fig. 5.2). The coded data from different
encoding modules are added together in the Addition module (A in Fig. 5.2).
Then, the sums of data chips are transmitted to receivers. In the receiver, Decoding modules (D in
Fig.5.2) reconstruct original data bits from the sums of data chips. Then these sequential bit streams are
transformed to packet flits by serial-to-parallel (S2P) modules. Finally, these packet flits are transferred
to NI. In the Turbo NoC, network scheduler receives the transmitting requests from senders and assigns

proper spreading codes to the senders and requested receivers. Note that all-zero codeword is assigned to
nodes having no data to transmit/ receive. Moreover, when there are multiple senders requesting the
same receiver, the scheduler will apply an arbitration scheme, for example, round-robin.
The chip counters calculate how many orthogonal chips are used in one encoding/decoding operation.
Each node needs two chip counters, one for the sender and the other for the receiver. Note that packet
flits from NI can also be transformed to multiple bit streams in the P2S module to make tradeoffs
between power/area cost and packet transfer latency, and the scheduler should provide a bit-synchronous
scheme to maintain the orthogonality of the transmitted channels, as discussed in [8]. In this brief, we
focus on the design and comparison of WB- and SB-based Turbo encoding/decoding method, which
corresponds to E, A, and D modules in Fig. 5.2.
B. Turbo Encoder
Two different encoding methods, WB encoder and SB encoder, are compared in Fig. 5.3.
Figure 5.3. Block diagram of encoding scheme. (a) WB encoder. (b) SB encoder.
Fig. 5.3(a) shows the WB encoder architecture. An original data bit is first encoded with a Walsh code
by taking an XOR operation. Then, these encoded data are added up to a multi bit sum signal by taking
arithmetical additions. Each sender needs an XOR gate, and multiple wires are used to express the sum
signal if we have two or more senders. Moreover, the number of wires increases as the number of
senders increases.
Fig. 5.3(b) shows our SB encoding scheme. An original data bit from a sender is fed into an AND gate
in a chip-by-chip manner, and it will be spread to n-chip encoded data with an orthogonal code of a
standard basis. The relationship between a bit and a chip is shown in Fig. 5.4. Then, the encoded data
from different senders are mixed together through an XOR operation, and a binary sum signal is

generated. Therefore, the output signal is always a sequence of binary signal transferred to destination
using one single wire. The progressions of both the encoding schemes are depicted in Fig. 5.4. Fig.
5.4(a) and (b) illustrates the WB encoding process with four-chip Walsh codes and the SB encoding
process with four-chip standard orthogonal codes, respectively.
Figure 5.4: Data encoding example. (a) WB encoding. (b) SB encoding.

C. Turbo Decoder
The WB decoding scheme is presented in Fig. 5.5(a). According to the chip value of Walsh code, the
received multibit sums are accumulated into positive part (if the chip value is 0) or negative part (if the
chip value is 1). Therefore, the two accumulators in the WB decoder separately contain a multibit adder
to accumulate the coming chips and a group of registers to hold the accumulated value. Through the
comparison module after the two accumulators, the original data is reconstructed. If the value of positive
part is large, the original data is 1. Otherwise, the original data is 0. The SB decoding scheme is shown
in Fig5.5(b).

Figure 5.5 Block diagram of decoding scheme. (a) WB decoder. (b) SB decoder.
Figure 5.6. Data decoding example. (a) WB decoding at receiver 1. (b) SB decoding at receiver 1.
When the binary sum signal arrives at receivers, an AND operation is taken between the binary sum and
the corresponding orthogonal code in chip-by chip manner. Then, the result chips are sent to an
accumulator. After m-chips are accumulated (m is the length of the orthogonal code), the output value of
the accumulator will be the corresponding original data. Note that there is always only one chip equal to
1 and all other chips are equal to 0 for an orthogonal code in standard basis. Hence, the maximal
accumulated value in the SB accumulator is 1 and it can be stored in a 1-bit register. Therefore, in the
SB decoding module, only one AND gate and an accumulator with one 1-bit register are used, resulting
in less logical resources.
An example of the decoding process is illustrated in Fig 5.6. In Fig. 5.6(a), at the WB decoder of
receiver 1, the accumulated value 3 in the positive part is larger than the accumulated value 1 in the

negative part. By the WB decoding scheme, the decoded data is 1, which is equal to the source data bit
from sender 1. In Fig. 5.6(b), at the SB decoder of receiver 1, the output value of the accumulator is 1,
which is also equal to the source data bit from sender 1. Note that the decoding results in receiver 2 are
also correct, but are not shown in the figure. Hence, both methods can reconstruct the original data bit
from the sum signal by using their respective spreading codes.

IMPLEMENTATIONS
Step 1: CLICK ON NEW PROJECT
Step 2: GIVE THE PROJECT NAME and SELECT LOCATION (WRITABLE)


Step 3: CLICK ON NEXT and NEXT

Step 4: CLICK ON FINISH

Step 5: CLICK ON CHIP (XC…) then MOUSE RIGHT CLICK then CLICK ON ADD SOURCE

Step 6: SELECT THE CODE LOCATION GIVEN BY DEVELOPER AND ADD CODE
(Note ALL FILES) AND CLICK OPEN

Step 7: SELECT THE SIMULATION and select files to RUN
Step 8: SELECT ISIM SIMULATOR and SIMULATE BEHAVIORAL MODEL

If no errors isim window will open

Step 9: ISIM WINDOW

select zoom to full view

SIMULATION RESULTS
Figure 7.1: WB encoder
Figure 7.2: WB decoder
Figure 7.3: SB encoder

Figure 7.4: SB decoder
From figure 7.1 and figure 7.2, the encoded data from two senders are mixed together through xor
operation, and a binary sum signal is generated. Therefore, the output signal is always a sequence of
binary signal transferred to destination using one single wire. The progression of both the encoding
schemes is depicted from figure 7.1 and figure 7.2. In WB decoding scheme the chip value of walsh
code, the received multi bit sums are accumulated positive part or negative part by using comparator we
have to compare positive and negative parts, if positive is greater than negative then the original data is
1, otherwise the original data is 0.
From figure 7.3 and figure 7.4 in SB encoding scheme original data bit from a sender is fed into an AND
gate in chip by chip manner and encoded data from a different senders are mixed together by an xor
operation and a binary sum signal is generated. In SB decoding scheme the binary sum signal arrives at
receivers, an AND operation is taken between binary sum and corresponding sum then the result is send
to an accumulator the output of the accumulator will be the corresponding original data.
Figure 7.5: Design summary

Figure 7.6: Time summary

CONCLUSION
As Turbo algorithm is conceived more interesting and challenging for this research topic, it is
considered, and also it has wide variety of applications in digital communications field. This research
helps to generate more profits by the developers using Turbo algorithm. Anyone besides students can
easily analyze these Turbo algorithm concepts and can gain more knowledge about it. This research
mainly concerned with implementation of Turbo algorithm using VHDL coding. Turbo algorithm has
many advantages like low power consumption and main advantage is error correcting using VHDL.
Anyone reading this document will have to gain the cognition of working with different tools like Xilinx
ISE and ISIM.
The Turbo encoder module is designed and implemented to be an embedded module in the IVS
modem. FPGA technologies are employed to develop the Turbo encoder module. Xilinx tools and
Verilog are employed to design and simulate the module. Both serial and parallel computation
techniques are studied for the encoding process. It is shown that the parallel computation can improve
the chip size and processing time of the module. Comparing with the serial computation technique, the
parallel computation encoding, improves the processing time by 58% and logic utilization by 73%. The
processing time enhancement can be seen in both simulation and analyzing the chip processing.
8.1. Recommendations
To attain the outturn of various hundred Mega Bits per second Turbo algorithm is recommended
to solve the problem of supplying power in case of applications which require high decoding throughput.
By using a new coming called as relaxed Turbo algorithm, the silicon area occupation and power
consumption can be overcome, which provides even more better silicon area reduction and power
saving. A less memory Turbo algorithm is recommended as the Adaptive Turbo algorithm requires very
large amount of logic and memory for performing the functions. FPGA kits are used in the research for
the implementation. Large amount of time in milliseconds will be spend by FPGA which is used by the
Adaptive computing to overwrite the data and extra power consumption for charging the assemble data.
FPGA guides to temporary growth by this of it response time and can be fatal in the communication path
[42].
Therefore dynamically reconfigurable Processors are used in order to overcome these
dynamically reconfigurable devices. Low signal to noise ratio is observed by the problem of localization

principle. 3-D Turbo search is recommended to overcome this trouble. Advanced versions for the
algorithm are recommended as Turbo algorithm has high throughput.
8.2. Future scope
By using FPGA device and hybrid microprocessor the decoding benefits can be achieved in future.
Power benefits are provided by the integration of sequential decoding. To reduce the multipath fading
which damages the signals, the adaptive array technique is used for future satellite communication. The
solutions of the Adaptive Turbo decoding calculate on the chosen noise level and algorithmic
parameters. For independence on noise level and fixed complexity M-algorithm is used. In future to
improve the decoder performance the adaptive Turbo algorithm is carried out in reconfigurable
hardware. [43]For power saving techniques can be used for the power saving architecture can be
designed for the above decoder which is executable in the mobile devices. The non binary codes can be
implemented in the future for the Turbo decoder. Turbo decoder is now being implemented in XILINX
in future it can also be implemented using JAVA. Therefore in the future Turbo algorithm may be used
for various scenarios. So in the future the complexity can be greatly reduced. By using M-algorithm
decoding noise effects can also be greatly reduced.

BIBILOGRAPHY
[1]. [1] R. E. Stake (1995) “The art of case study research”. USA: Sage.
[2]. [2] K.Aleksandar, M.F. Jose (2000) “The Turbo Algorithm and Markov Noise Memory”.
[Internet] available at URL:
[3]. <http://www.ece.cmu.edu/~moura/papers/kavcic_turbonoisememory.pdf>, [accessed on20th
November 2010].
[4]. [3] K. Hueske, J. Geldmacher, J. Gotze (2007) Adaptive decoding of convolutional codes,
Copernicus Publications, pp. 209-214. Internet. (N.D) Coding in communication
system.[Internet] available at URL:
<http://www.mathdb.org/notes_download/elementary/number/ne_N6.pdf>, [accessed on20th
November 2010].08)e: Sprnger.
[5]. [7] B. Tristan (2006) IMPLEMENTATION OF THE TURBO ALGORITHM USING
FUNCTIONAL PROGRAMMING LANGUAGES. [Internet] available at URL:
<http://people.eecs.ku.edu/~esp/publications/c2009ItcTristan.pdf>, [accessed on 20November
2010].
[6]. [8] K. Hucker (2001) Research Methods in Health, Care and Early Years. UK: Heinemann
Publishers.
[7]. [9] Y. K. P.Cheung, G. A. Constantinides, J.T. D. Sousa (2003) Field-programmable logic and
applications: 13th International Conference, FPL 2003, Lisbon, Portugal. New York: Springer.
[8]. [10] J. Kia (2005) What Is a Convolutional Encoder / Convolutional Encoding. [Internet]
available at URL: <http://www.askkia.com/articles/what-is-a-convolutional-encoderturbo-
algorithm.html>, [accessed on 20 th November 2010].
[9]. 17. G. Fettweis and H. Meyr, “Feedforward architecture for parallel turbo decoding,” J. VLSI
Signal Processing, vol. 3, pp. 105-119, 1991.
[10]. 18. G. Fettweis, H. Meyr, “High rate Turbo processor: a systolic array solution,” IEEE J.
SAC, Oct. 1990.

[11]. 19. G. Fettweis, H. Dawid, and H. Meyr, “Minimized method for Turbo decoding: 600
Mb/s per chip,” in Proc. GLOBECOM 90, vol. 3, pp. 1712-1716,Dec. 1990.
[12]. 20. G. Fettweis, L. Thiele, H. Meyr, “Algorithm transformations for ulimited
parallelism,” Proc.
[13]. IEEE ISCAS’90, 1756-59; also L Thiele, G.Fettweis, “-,” Electronics & Commun. no.2,
83- 91, 4/1990.
[14]. [22] A. P. Volnei (2004) Circuit design with VHDL. United States of America: MIT
press.
[15]. [23] P. P. Chu (2006) RTL hardware design using VHDL: coding for efficiency,
portability, and scalability. USA: John Wiley and Sons.
[16]. [24] Project seminar (2010) VHDL (VHSIC hardware description language) [Internet]
available at URL: http://www.seminarprojects.com/Thread-vhdl-vhsic-hardwaredescription-
language--14251#top>, [accessed on 20th November 2010]
[17]. 29. S. Kato, M. Morikura, S. Kubota, H. Kazama and K. Enomoto, “A TDMA satellite
communication system for ISDN services,” Proc. Globecom’91, pp. 1533-1540, December 1991.
[18]. 30. K. Kawazoe, S. Honda, S. Kubota and S. Kato, “Ultra-high-speed and universal
coding-rate Turbo decoder VLSIC,” Proc. ICC’93, pp. 1434-1438, May 1993.
[19]. 31. K. Koora, et. al, “ From algorithms testing to ASIC input code of SOVA algorithm
for Turbo codes,” Proceedings of Turbo-code seminar, 1996.
[20]. 32. S. Kubota, K. Ohtani and S. Kato, “A high-speed and high-coding-gain Turbo
decoder with low power consumption employing SST (scarce state transition) scheme,” Electron.
Lett., 22 (9), pp. 491-493,1986.
[21]. 33. L. Lang; C.Y. Tsui and R.S. Cheng, “Low power soft output Turbo decoder scheme
for turbo code decoding,” Conference-Paper, ISCAS ‘97(Cat. No97CH35987). IEEE, New York,
NY, USA, 4 vol. Lxvi+2832 pp. p. 1369-1372 vol.2, 1997.
[22]. 34. H.F. Lin and D.G. Messerschmitt, “Algorihtms and architectures for concurrent
Turbo decoding,” in Proc. ICC, pp.836-840, 1989.
[23]. 35. B.K. Min and N. Demassieux, “A versatile architecture for VLSI implementation of
the Turbo algorithm,” in Proc. ICASSP, pp. 1101-1104, May 1991.
[24]. 36. D. Oh and S. Hwang, “Design of a Turbo decoder with low power using minimum
transition traceback scheme,” Electronic-Letters, IEE, Vol.32, No.22, pp. 2198-2199, Oct. 1996.

[25]. 37. D. Oh, Y. Kim, and S. Hwang “A VLSI architecture of the trellis decoder block for
the digital HDTV grand alliance system,” IEEE Trans. Consum. Electron, 42, (3) pp. 346-356,
1996.
[26]. 38. J.K. Omura, “On the Turbo decoding algorithm,” IEEE Transactions on Information
Theory, vol. IT-15, pp. 177-179, Jan 1969.
[27]. 39. K.K. Parhi, D.G.Messerschmitt, “Pipeline interleaving and parallelism in recursive
digital filters,” IEEE Tr. ASSP, 1099-117, 7/89.
[28]. 40. Qualcomm, Inc., “Proposed EIA/TIA interim standard wideband spread spectrum
digital cellular system dual-mode mobile station – base station compatibility standard,” April 21,
[29]. 1992.
[30]. 41. C.M. Rader, “Memory management in a Turbo decoder,” IEEE Transactions on
Communications, vol. COM-29, pp. 1399-1401, Sept. 1981.
[31]. 42. R. Scheweikert, A.J.Vinck,”Trellis coded modulation with high-speed low
complexity decoding,” submitted to IEEE GLOBECOM 1990.
[32]. 43. K. Seki; S. Kubota; M. Mizoguchi and S. Kato, “Very low power consumption Turbo
decoder LSIC employing the SST (scarce state transition) scheme for multimedia mobile
communications,” Electronics-Letters, IEE, Vol.30, no.8, p.637-639, 14 April 1994.
[33]. 44. C.B. Shung, P.H. Siegel, H.K. Thapar, and R. Karabed, “A 30-MHz trellis coded chip
for partial response channels,” IEEE Journal of Solid-State Circuits, vol. 26, pp. 1981-1987,
Dec. 1991.

Turbo Encoder Final Document Hard

Uploaded by

Copyright:

Available Formats

You might also like

Turbo Encoder Final Document Hard

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Turbo Encoder Final Document Hard

Uploaded by

Copyright:

Available Formats

A PROJECT REPORT

CHIP DESIGN FOR TURBO ENCODER MODULE FOR IN-VEHICLE SYSTEM

Submitted to Jawaharlal Nehru Technological University Anantapur for the partial

ELECTRONICS AND COMMUNICATION ENGINEERING

MOGHAL FAYAZ BEIG 17FH1A0461

SOMPALLI VENKATA SWAMY 17FH1A0476

BESTHA SUNIL 17FH1A0443

M. ABDUL MUIZ 17FH1A0456

SANAMURI MADHUSUDHAN RAO 17FH1A0471

T HARI PRASAD REDDY 16FH1A0465

Under The Esteemed Guidance of

MOHAMMAD ZUBAIR M.Tech

Assistant Professor, ECE Department

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

DUPADU, KURNOOL (Dist.), AP-518218

PROJECT GUIDE HEAD OF THE DEPARTMENT

Place: DUPADU EXTERNAL EXAMINER

At the outset I sincerely thanks to our guide MOHAMMAD ZUBAIR, M.Tech

Finally, I acknowledge with gratitude the unflagging support and patience of my

CHAPTER NAME PAGE NO

FIGURE NO NAME OF THE FIGURE PAGE NO

3.1 DESIGN FLOW OF VHDL 12

4.6 THE HIDDEN MARCOV MODEL 34

Dept of ECE Dr. KVSRIT 1

Dept of ECE Dr. KVSRIT 2

Dept of ECE Dr. KVSRIT 3

Dept of ECE Dr. KVSRIT 4

1.6. Research Method

Dept of ECE Dr. KVSRIT 5

Dept of ECE Dr. KVSRIT 6

2.2. Errors occurred during the coding in communication process

1) Encryption: mainly used for security of data,

Dept of ECE Dr. KVSRIT 7

Dept of ECE Dr. KVSRIT 8

RESEARCH ON PROPOSED SOLUTION

3.2. Language used for Turbo algorithm

Dept of ECE Dr. KVSRIT 9

Dept of ECE Dr. KVSRIT 10

3.3. Importance of VHDL over other languages

Dept of ECE Dr. KVSRIT 11

Figure 3.1: shows the design flow of VHDL

Dept of ECE Dr. KVSRIT 12

Dept of ECE Dr. KVSRIT 13

Dept of ECE Dr. KVSRIT 14

Dept of ECE Dr. KVSRIT 15

3.5. Building Turbo algorithm

Dept of ECE Dr. KVSRIT 16

Dept of ECE Dr. KVSRIT 17

3.7. Synthesizable constructs and VHDL templates

3.8. How Turbo algorithm is implemented through VHDL

Dept of ECE Dr. KVSRIT 18

3.8.1. The Turbo Decoder Architecture

Dept of ECE Dr. KVSRIT 19

3.8.2. The SMU CONTROL Unit

Dept of ECE Dr. KVSRIT 20

Dept of ECE Dr. KVSRIT 21

Dept of ECE Dr. KVSRIT 22