International Journal of Engineering & Technology, 7 (1.

5) (2018) 37-41

International Journal of Engineering & Technology

Website: www.sciencepubco.com/index.php/IJET

Research paper

Efficient and low latency turbo encoder design using Verilog-Hdl

M Siva Kumar*, S Syed Shameem, M.N.V. Raghu Sai, Dheeraj Nikhil,P. Kartheek, K Hari Kishore

Department of ECE, Koneru Lakshmaiah Educational Foundation, Vaddeswaram, Guntur,Andhra Pradesh, India 522502
*Corresponding author E-mail: siva4580@kluniversity.in

Abstract

Low complexity turbo-like codes based totally on the simple trellis or simple graph shape consequences in encoding with low complexity. Out
of this Convolution, encoder and turbo codes are widely used due to the splendid errors control performance. The most famous
communications encoding set of rules, the iterative deciphering calls for an exponential expansion in hardware complexity to acquire
expanded encode accuracy. This paper makes a usage of Log-Map based Iterative decoding technique and specialty in the conclusion of the
turbo encoder. The rapid codes are designed with the help of Recursive Systematic Convolution and are separated thru interleave, which
(thing used to rearrange the bit collection) plays an essential position within the encoding technique. This paper offers the design of the
parallel connection of Recursive Systematic Convolution (RSC) encoders and interleave to restrict postpone, results to form a turbo Encoder.
The turbo Encoder is designed by way of Verilog-HDL and Synthesized through Xilinx ISE

Keywords: Recursive, Turbo, Convolution, parallel concatenation, ShannonHamming, Interleaver.

1. Introduction
Errors are expressed in a state of affairs as soon because the output
statistics doesn’t fit with the input records. at some stage in the
transmission of a signal, they undergo a few noise on the manner to
introduce mistakes within the binary bits motion from one device to
a few other. that means a '0' bit could probably trade to '1' or a '1' bit
may exchange to 'zero'. Whenever a message is transmitted, it'd in all
likelihood get push with the aid of manner of noise or records may
also additionally get corrupted. To avoid this, we make use of errors-
detecting codes which might be more information delivered to a
given digital message to help us to study if mistakes took place
inside the path of transmission of the message.
A right away in advance example of EDC code is parity looks at.
Together with EDC's, we are in a characteristic to bypass corrupted
message to recover the real message from that we obtained. This
kind of code is named as an EDC code. Error-correcting codes
additionally installation the same approach as EDC codes however
further; such codes additionally discover the vicinity of the corrupted
bit. In error-correcting codes, parity takes a take a look at
encompasses an accessible manner to come across mistakes along
with an advanced mechanism to recover the corrupt bit vicinity. as
soon because the corrupt bit is found, it is reverted (from zero to at
the least one or one to 0) from the precise message acquired. To
grow to be privy to and correct the mistakes, more bits are great
imposed to the information bits at some point of the communiqué of
bits.
The parity bits are referred to as extra bits. They are used for
identifying or rectification of error. The code words are formed by
making a shape of the parity bits. Parity checking is owned for
detection of errors. It is outstanding approach for figuring out and
rectification of mistakes. The 8-bit of the word is known as the parity
bit and the last 7 bits are employed as information or message bits.
The parity of 8-bits transmitted phrase is both even parity and an
ordinary parity. Even the parity indicates that the amount of 1's
inside the given word as properly because the parity bit ought to be
even (2, 4, 6 ...). strange parity way the sort of 1's inside the given
phrase along with the parity bit want to be regular (1, three, 5 ...).
The parity bit is set to zero and one relying on the shape of the parity
desired. For even parity, this bit is set to at the least one or 0 such
that the no. of "1 bits" in the complete word is even. For the
abnormal parity, this bit is prepared to one or 0 such that the no. of
"1 bits" within the entire word is strange.
Richard hamming past due 1940’s with the aid, a mathematician who
worked for Bell phone, introduced the concept of error-correcting
codes. His inspiration becomes a software program for a laptop to
correct “insects” got emerged in punch-card applications. His
complete inspiration behind the precept of error-correcting codes
was once to reliably permit digital conversation. for the duration of
doctoral dissertation in 1963 with the aid of the use of R.G. Gallager.
Gallagher has changed into commonly neglected for about 30 years
till connections had been drawn most of the iterative strategies used
for decoding each Turbo code and speedy codes and Turbo codes
were first evolved. Orthogonal Lattice square (rapid) codes had been
first positioned with the useful resource of Gallager inside the early
1960’s and feature presently been rediscovered and generalized.
They have got professional a superb go back within the previous few
years. now not like many other instructions of codes Turbo codes are
already ready with very fast (probabilistic) encoding and decoding
algorithms. it has been verified that those codes acquire an amazing
preferred performance with iterative decoding this is very near the
Shannon restrict. Therefore, those codes have emerged as sturdy

Copyright © 2018 Authors. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted
use, distribution, and reproduction in any medium, provided the original work is properly cited.
38
opponents to faster codes for errors control in masses of conversation
and digital garage systems wherein immoderate reliability is needed.
A Turbocode is defined as the null place of a parity examine matrix
H with the following structures: (i) every row includes _ “ones”; (ii)
every column includes “ones”; (iii) wide kind of “ones” in not
unusual among any columns, determined as it is not any increased
than 1; (iv) every are small in comparison to the period of the code
and the style of rows in H. on account that one and are small, H has a
small density of “ones” and for this reason is a sparse matrix. Due to
the purpose, the code particular with the aid of H is known as a
Turbo code. The turbo code described above is identified as a normal
Turbo code. If no longer all the columns or all of the rows of the
parity check matrix H have the identical amount of “ones” (or
weights), a turbo code is identified to be abnormal. Even though
turbo codes are confirmed to acquire extremely good basic
performance, no mathematical method has been located for building
the one's codes. Gallager handiest furnished the shape of pseudo-
random Turbo codes. Specific Euro codes, which have been
positioned, are generally computer generated, specifically extended
codes. Generating turbo codes through Encoding process is long
quite complicated because of the dearth of code shape, which
includes cyclic or quasi-cyclic structure.
Fig.1: Encoder Block Diagram for an RSC Code
The encoder is a reminiscence- encoder. The two memory factors
can take on four possible states. A hardware attention for encoder is
shown in parent 1. The value of the two memory elements within the
encoder, R0 and R1; outline the “state” of the encoder. The state
Fig. 2: State diagram for the encoder.
Turbo encoders are key factors in nowadays communication
structures to reap viable message reception with the fewest viable
mistakes the extraordinary faster system the vicinity in which
Forward errors Correction (FEC) is a technique for the control of
error in the direction of communication, wherein unessential records
are mixed with the unique information, where they approve the
International Journal of Engineering & Technology
In addition, their minimal lengths are either horrible or tough to
identify. Turbo codes may be classified into regular and an irregular
code. These irregular codes multiplied overall performance is viable,
due to the fact variable nodes with higher stages (stage is a quantity
of adjacent nodes) acquire extra statistics from their adjacent check
nodes and they get rectified first after a short wide style of iterations.
They then iterative decoding assist unique variable nodes to get
corrected through, much like “wave effect”. when same stages
consist with all variable nodes, as in ordinary codes, there is no
longer presence of wave impact and during this procedure, all
variable nodes get caught at some stage in the decoding procedure.
2. Turbo encoder
As initial code, the encoder for a Turbo code accepts K-bit blocks of
the information collection u and produces an encoded series (code
phrase) p of n-symbol blocks. Furthermore, every encoding block is
based upon now not completely on the corresponding k-bit message
block at the equal time unit, but additionally on m preceding
message blocks.
diagram is comprised of the feasible state modifications of R0 and
R1 (as capable enter sequences are generated) and is used to form a
trellis format applied in the decoder operation. The state diagram for
the encoder is proven in underneath.
Encoder generates a multiplexed code of two coders fed with direct
and interleaved records.
receiver to come across and correct mistakes besides the need to
resend the information. Recursive Systematic Convolution encoders
and an interleave as tested in fig. three here the cause of interleave is
International Journal of Engineering & Technology
to scramble enter data in order that there is no correlation between
Fig. 3: Encoder of Turbo Code
The Turbo encoder includes 2 RSC encoders and an interleave as in
fig.3 here the reason of interleave is to scramble input data in order
that there is no correlation between the records applied to the
encoders.
3. Inter leaver
The interleave block (Khandani 1998) is a key factor, which
determines the correct overall performance of a Turbo code.
Shannon (1948, 1949) showed that large block-length random codes
3.1 Modified Inter leaver design
7
3
4
0
4. Result
39
the facts applied to the encoders.
gain channel capacity. The 23 pseudo-random interleave makes the
code appear random. In this work, the pseudo Random Interleave has
been used. Block interleave or Matrix interleave is a most famous
interleave used in digital data transmission that is illustrated in Fig 6.
When in contrast with the other interleaves, it is very simple and
easy to design and implement. A block interleave writes data in a
matrix row wise from left to right and pinnacle to bottom. After all
of the data bits are writing into a matrix, it reads the information in
column practical from pinnacle to backside and left to proper. The
output of the interleave is applied to the RSC 2.
40
5. Conclusion
The Turbo Encoder is designed the usage of Verilog-HDL and
simulated the usage of Xilinx ISE 14.7, thru thinking about 8-bit
enter circulation and 16-bit input circulate. Its miles determined thru
the simulation effects that the turbo Encoder with 8-bit enter is
greener when observing with contemporary methodologies. While
very low BERs are simulated with these parameters, they have
terrible unfortunate results. Every other purpose for the drawback in
BER ordinary performance is a terrible interleave layout. Because of
noticeably correlated sequences, the BER decreases to a positive
level from the encoding manner. SO, interleave is designed in
efficient manner.
References
[1] Jakob Dahl Andersen, “Turbo Codes Extended with Outer BCH
Code”, Electronics Letters, vol. 32 No. 22, Oct. 1996.
[2] J. Dahl Andersen and V. V. Zyablov, “Interleaver Design for Turbo
Coding”, Proc. Int. Symposium on Turbo Codes, Brest, Sept. 1997.
[3] Jakob Dahl Andersen, “Selection of Component Codes for Turbo
Coding based on Convergence Properties”, Annales des
Telecommunication, Special issue on iterated decoding, June 1999.
[4] L. R. Bahl, J. Cocke, F. Jelinek and R. Raviv, “Optimal Decoding of
Linear Codes for Minimizing Symbol Error Rate,” IEEE Trans.
Inform. Theory, vol IT- 20, pp 284-287, March 1974.
[5] S. Benedetto and G. Montorsi, “Performance Evaluation of Turbo-
codes”, Electronics Letters, vol. 31, No. 3, Feb. 1995.
International Journal of Engineering & Technology
[6] S. Benedetto and G. Montorsi, “Serial Concatenation of Block And
Convolutional Codes”, Electronics Letters, Vol. 32, No. 10, May
1996.
[7] C. Berrou, A. Glavieux and P. Thitimajshima, “Near Shannon Limit
Error-correcting Coding and Decoding: Turbo-codes(1)”, Proc. ICC
_93, pp. 1064-1070, May 1993.
[8] C. Berrou and A. Glavieux, “Near Optimum Error Correcting Coding
and Decoding: Turbo Codes”, IEEE trans. on Communications, Vol.
44, No. 10, Oct. 1996.
[9] R. J. McEliece, E. R. Rodemich and J.-F. Cheng, “The Turbo
Decision Algorithm”, Presented at the 33rd Allerton Conference on
Communication, Control and Computing, Oct. 1995. 21
[10] L. C. Perez, J. Seghers and D. J. Costello, Jr, ”A Distance Spectrum
Interpretation of Turbo Codes”, IEEE Trans. on Inform. Theory, Vol.
42, No. 6, Nov. 1996.
[11] Dr. Seetaiah Kilaru, Hari Kishore K, Sravani T, Anvesh Chowdary
L, Balaji T “Review and Analysis of Promising Technologies with
Respect to fifth Generation Networks”, 2014 First International
Conference on Networks & Soft Computing, ISSN:978-1-4799-
3486-7/14,pp.270-273,August2014.
[12] Meka Bharadwaj, Hari Kishore "Enhanced Launch-Off-Capture
Testing Using BIST Designs” Journal of Engineering and Applied
Sciences, ISSN No: 1816-949X, Vol No.12, Issue No.3, page: 636-
643, April 2017.
[13] N Bala Dastagiri, Kakarla Hari Kishore "Reduction of Kickback
Noise in Latched Comparators for Cardiac IMDs” Indian Journal of
Science and Technology, ISSN No: 0974-6846, Vol No.9, Issue
No.43, Page: 1-6, November 2016.
[14] Murali, K Hari Kishore, D Venkat Reddy "Integrating FPGAs with
Trigger Circuitry Core System Insertions for Observability in
Debugging Process” Journal of Engineering and Applied Sciences,
ISSN No: 1816-949X, Vol No.11, Issue No.12, page: 2643-2650,
December 2016.
International Journal of Engineering & Technology 41

[15] Mahesh Mudavath, K Hari Kishore "Design of CMOS RF Front-End

of Low Noise Amplifier for LTE System Applications Integrating
FPGAs” Asian Journal of Information Technology, ISSN No: 1682-
3915, Vol No.15, Issue No.20, page: 4040-4047, December 2016.
[16] P Bala Gopal, K Hari Kishore, B.Praveen Kittu “An FPGA
Implementation of On Chip UART Testing with BIST Techniques”,
International Journal of Applied Engineering Research, ISSN 0973-
4562, Volume 10, Number 14 , pp. 34047-34051, August 2015.
[17] S Nazeer Hussain, K Hari Kishore "Computational Optimization of
Placement and Routing using Genetic Algorithm” Indian Journal of
Science and Technology, ISSN No: 0974-6846, Vol No.9, Issue
No.47, page: 1-4, December 2016.
[18] N Bala Gopal, K Hari Kishore "Analysis of Low Power Low
Kickback Noise in Dynamic Comparators in Pacemakers” Indian
Journal of Science and Technology, ISSN No: 0974-6846, Vol No.9,
Issue No.44, page: 1-4, November 2016.
[19] Rajesh, M., and J. M. Gnanasekar. "Congestion control in
heterogeneous wireless ad hoc network using FRCC."
Australian Journal of Basic and Applied Sciences 9.7 (2015): 698-
702.
[20] S.V.Manikanthan and V.Rama“Optimal Performance Of Key
Predistribution Protocol In Wireless Sensor Networks” International
Innovative Research Journal of Engineering and Technology ,ISSN
NO: 2456-1983,Vol-2,Issue –Special –March 2017.
[21] T. Padmapriya and V. Saminadan, “Inter-cell Load Balancing
Technique for Multi- class Traffic in MIMO - LTE - A Networks”,
International Conference on Advanced Computer Science and
Information Technology , Singapore, vol.3, no.8, July 2015.