Mr. Ali Hussain Mugaibel

Slides:



Advertisements
Similar presentations
Noise-Predictive Turbo Equalization for Partial Response Channels Sharon Aviran, Paul H. Siegel and Jack K. Wolf Department of Electrical and Computer.
Advertisements

Iterative Equalization and Decoding
Forward Error Correcting Codes for Forward Error Correcting Codes for Optical Communication Systems University of Technology Dept. of computer Engineering.
What is a good code? Ideal system
Inserting Turbo Code Technology into the DVB Satellite Broadcasting System Matthew Valenti Assistant Professor West Virginia University Morgantown, WV.
The Impact of Channel Estimation Errors on Space-Time Block Codes Presentation for Virginia Tech Symposium on Wireless Personal Communications M. C. Valenti.
Modern Digital and Analog Communication Systems Lathi Copyright © 2009 by Oxford University Press, Inc. C H A P T E R 15 ERROR CORRECTING CODES.
Submission May, 2000 Doc: IEEE / 086 Steven Gray, Nokia Slide Brief Overview of Information Theory and Channel Coding Steven D. Gray 1.
TELIN Estimation and detection from coded signals Presented by Marc Moeneclaey, UGent - TELIN dept. Joint research : - UGent.
Turbo Codes – Decoding and Applications Bob Wall EE 548.
Turbo Codes Azmat Ali Pasha.
CUHK, May 2010 Department of Electrical Engineering École Polytechnique de Montréal Professor of Electrical Engineering Life Fellow of IEEE Fellow, Engineering.
06 Dec 04Turbo Codes1 TURBO CODES Michelle Stoll.
EE436 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
Improving the Performance of Turbo Codes by Repetition and Puncturing Youhan Kim March 4, 2005.
Concatenated Codes, Turbo Codes and Iterative Processing
Turbo-synchronization. Friday, March Sébastien de la Kethulle de Ryhove – Turbo-synchronization Introduction Communication systems based on the.
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Turbo Codes and Iterative Processing IEEE New Zealand Wireless.
Matthew C. Valenti (presenter)
Per-survivor Based Detection of DPSK Modulated High Rate Turbo Codes Over Rayleigh Fading Channels Bin Zhao and Matthew C. Valenti Lane Dept. of Comp.
Telex Magloire Ngatched Centre for Radio Access Technologies University Of Natal Durban, South-Africa Telex Magloire Ngatched Centre for Radio Access Technologies.
ECE 4371, Fall, 2014 Introduction to Telecommunication Engineering/Telecommunication Laboratory Zhu Han Department of Electrical and Computer Engineering.
III. Turbo Codes.
CODED COOPERATIVE TRANSMISSION FOR WIRELESS COMMUNICATIONS Prof. Jinhong Yuan 原进宏 School of Electrical Engineering and Telecommunications University of.
Towards ideal codes: looking for new turbo code schemes Ph.D student: D. Kbaier Ben Ismail Supervisor: C. Douillard Co-supervisor: S. Kerouédan.
Turbo codes for short and medium block length: the state of the art Department 1 Paris, June 25, 2004 Claude Berrou, Catherine Douillard GET-ENST Bretagne/PRACOM/CNRS.
Doc.: IEEE / n Submission September 2004 France TelecomSlide 1 Partial Proposal: Turbo Codes Marie-Helene Hamon, Olivier Seller, John.
Iterative Multi-user Detection for STBC DS-CDMA Systems in Rayleigh Fading Channels Derrick B. Mashwama And Emmanuel O. Bejide.
A Novel technique for Improving the Performance of Turbo Codes using Orthogonal signalling, Repetition and Puncturing by Narushan Pillay Supervisor: Prof.
Wireless Mobile Communication and Transmission Lab. Theory and Technology of Error Control Coding Chapter 5 Turbo Code.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter Thirteen Channel Coding and Encryption.
Name Iterative Source- and Channel Decoding Speaker: Inga Trusova Advisor: Joachim Hagenauer.
ITERATIVE CHANNEL ESTIMATION AND DECODING OF TURBO/CONVOLUTIONALLY CODED STBC-OFDM SYSTEMS Hakan Doğan 1, Hakan Ali Çırpan 1, Erdal Panayırcı 2 1 Istanbul.
Synchronization of Turbo Codes Based on Online Statistics
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Combined Multiuser Detection and Channel Decoding with Receiver.
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Combined Multiuser Reception and Channel Decoding for TDMA.
Iterative Channel Estimation for Turbo Codes over Fading Channels Matthew C. Valenti Assistant Professor Dept. of Comp. Sci. & Elect. Eng. West Virginia.
Real-Time Turbo Decoder Nasir Ahmed Mani Vaya Elec 434 Rice University.
Part 1: Overview of Low Density Parity Check(LDPC) codes.
An ARQ Technique Using Related Parallel and Serial Concatenated Convolutional Codes Yufei Wu formerly with: Mobile and Portable Radio Research Group Virginia.
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Performance of Turbo Codes in Interleaved Flat Fading Channels.
Minufiya University Faculty of Electronic Engineering Dep. of Electronic and Communication Eng. 4’th Year Information Theory and Coding Lecture on: Performance.
Turbo Codes. 2 A Need for Better Codes Designing a channel code is always a tradeoff between energy efficiency and bandwidth efficiency. Lower rate Codes.
VIRGINIA POLYTECHNIC INSTITUTE & STATE UNIVERSITY MOBILE & PORTABLE RADIO RESEARCH GROUP MPRG Iterative Multiuser Detection for Convolutionally Coded Asynchronous.
Matthew Valenti West Virginia University
Log-Likelihood Algebra
Doc.: IEEE / n Submission September 2004 France TelecomSlide 1 Partial Proposal: Turbo Codes Marie-Helene Hamon, Olivier Seller, John.
A Bandwidth Efficient Pilot Symbol Technique for Coherent Detection of Turbo Codes over Fading Channels Matthew C. Valenti Dept. of Comp. Sci. & Elect.
The Softest Handoff Design Using Iterative Decoding (Turbo Coding) Byung K. Yi LGIC 3GPP2 TSG-C WG 3 Physical Layer Jan. 11, 2000.
1 Channel Coding: Part III (Turbo Codes) Presented by: Nguyen Van Han ( ) Wireless and Mobile Communication System Lab.
Doc.: IEEE /0243r1 Submission Franck Lebeugle, France Telecom R&D March 2004 Slide 1 Turbo Codes for IEEE n Marie-Helene Hamon, Vincent.
Channel Coding and Error Control 1. Outline Introduction Linear Block Codes Cyclic Codes Cyclic Redundancy Check (CRC) Convolutional Codes Turbo Codes.
10/19/20051 Turbo-NFSK: Iterative Estimation, Noncoherent Demodulation, and Decoding for Fast Fading Channels Shi Cheng and Matthew C. Valenti West Virginia.
The Softest Handoff Design Using Iterative Decoding (Turbo Coding) Byung K. Yi LGIC 3GPP2 TSG-C WG 3 Physical Layer Jan. 11, 2000.
Bridging the Gap Between Parallel and Serial Concatenated Codes
Rate 7/8 (1344,1176) LDPC code Date: Authors:
Coding for Noncoherent M-ary Modulation
Shi Cheng and Matthew C. Valenti Lane Dept. of CSEE
Coding and Interleaving
January 2004 Turbo Codes for IEEE n
Bin Zhao, Ph.D. student Matthew Valenti, Assistant Professor
Partial Proposal: Turbo Codes
Physical Layer Approach for n
Turbo Codes for IEEE n May 2004
Time Varying Convolutional Codes for Punctured Turbocodes
2019/5/7 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: [FEC coding for TG4a] Date Submitted: [12.
Turbo-equalization for n/ac
III. Turbo Codes.
Presentation transcript:

Mr. Ali Hussain Mugaibel King Fahd University of Petroleum and Minerals Electrical Engineering Department Turbo Codes: Promises and Challenges Mr. Ali Hussain Mugaibel Dr. Maan Kousa 16 March 1999 CETEM’ 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 27/03/1440 Topics of Discussion Turbo Codes Introducing turbo codes. Turbo Encoders Turbo Decoders Promises Challenges Can we Improve TC ? Conclusion Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 Coding Source Channel Convolutional Block X0 X1 D + (a) Input 101101 0 0 0 0 1001011 0 0 1 0 0010110 0 1 0 0 010110 1 0 0 0 1011 101101 Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 What are turbo codes ? New class of CC. Introduced in 1993 by Berrou, Glavieux and Thitimajashima. Perform close to Shannon limit in terms of BER. Use iterative scheme with reference to the turbo engine principle. Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Turbo Encoder More than one CC are linked in parallel by interleavers. PAD Interleaver Enc 1 Enc 2 X0 X1 X2 Information Source Figure 1: Simplified Turbo Encoder Puncturing & Parallel/Serial MUX to the channel Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 Turbo Encoder Important factors : RSC encoders Termination Puncturing D + (b) X0 X1 Input X0 X1 D + (a) Input Figure 2: (a) Classical Non-Recursive Non- Systematic Code (b) Recursive Systematic Code Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 Turbo Decoder SOVA: SOVA is supposed to be the least computation intensive method compared with MAP, LogMAP,... (Interleaver 1)-1 Decoder 1 Interleaver 1 Decoder 2 r0 r1 DEMUX Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 Turbo Decoder Important factors : Iteration DEMUX Synchronization Main idea The decoder will pass the hard decision together with a reliability estimate of this decision to the next decoder Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 The major promise of turbo codes is their astonishing performance of bit error rate (BER) at relatively low Eb/N0. For AWGN channel: for a frame size of 256256=65536 bits we can achieve a BER=10-5 at only Eb/N0=0.7dB, which is very close to Shannon limit. For a Rayleigh fading channel: a BER=10-5 can be achieved at Eb/N0=4.3dB which represents a gain of 2.3dB as compared to classical convolutional codes with similar complexity. Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 Delay: associated with interleaver and the iterative decoding algorithm. Complexity: in the optimal decoding algorithm. Can we use Turbo Codes for real time applications ? Can we improve Turbo Codes ? Can we introduce a mathematical model for the evaluation of different Turbo Codes ? Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 Can We improve Turbo Codes ? A good understanding of the code ingredients will help to improve the code. If we understand what the interleaver is doing we can introduce short frames suitable for real time applications. Puncturing is very important to increase the rate to an applicable value. The decoding algorithm can be sufficiently simplified yet with very minor degradation. Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99

Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99 Conclusion We have reviewed Turbo Codes and some of their promises and challenges. Turbo Codes are attracting more and more applications. More work can be done in understanding the effects of the codes ingredients on the performance. The decoding delay is a major challenge in turbo coding Turbo Coding can be applied as a case study for many of the existing systems ( GSM, IS….) Thanks Mugaibel/Kousa Turbo Codes: Promises and Challenges , CETEM' 99