Muhammad Shoaib Bin Altaf. Outline Motivation Actual Flow Optimizations Approach Results Conclusion.

Slides:



Advertisements
Similar presentations
Convolutional Codes Mohammad Hanaysheh Mahdi Barhoush.
Advertisements

25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
Decoding of Convolutional Codes  Let C m be the set of allowable code sequences of length m.  Not all sequences in {0,1}m are allowable code sequences!
Maximum Likelihood Sequence Detection & the Viterbi Algorithm EE-242 Digital Communications & Coding Miguel Ángel Galicia Ismail AlQerm EE-242 Digital.
6.375 Project Arthur Chang Omid Salehi-Abari Sung Sik Woo May 11, 2011
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.
Maximum Likelihood Sequence Detection (MLSD) and the Viterbi Algorithm
Submission May, 2000 Doc: IEEE / 086 Steven Gray, Nokia Slide Brief Overview of Information Theory and Channel Coding Steven D. Gray 1.
EEE377 Lecture Notes1 EEE436 DIGITAL COMMUNICATION Coding En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room 2.14.
Turbo Codes – Decoding and Applications Bob Wall EE 548.
ECE 559 VLSI – Design Project Viterbi Decoder VLSI Design Project Spring 2002 Dan Breen Keith Grimes Damian Nowak David Rust Advisor: Prof. Goeckel.
An FPGA Based Adaptive Viterbi Decoder Sriram Swaminathan Russell Tessier Department of ECE University of Massachusetts Amherst.
Viterbi Decoder: Presentation #1 Omar Ahmad Prateek Goenka Saim Qidwai Lingyan Sun M1 Overall Project Objective: Design of a high speed Viterbi Decoder.
Forward Error Correction. FEC Basic Idea Send redundant data Receiver uses it to detect/correct errors Reduces retransmissions/NAKs Useful when RTT is.
IASTED- WOC- Canada 07 1 CONVOLUTIONAL CODED DPIM FOR INDOOR NON-DIFFUSE OPTICAL WIRELESS LINK S. Rajbhandari, Z. Ghassemlooy, N. M. Adibbiat, M. Amiri.
1 ACS Unit for a Viterbi Decoder Garrick Ng, Audelio Serrato, Ichang Wu, Wen-Jiun Yong Advisor: Professor David Parent EE166, Spring 2005.
EE 3220: Digital Communication Dr Hassan Yousif 1 Dr. Hassan Yousif Ahmed Department of Electrical Engineering College of Engineering at Wadi Aldwasser.
A Performance and Energy Comparison of FPGAs, GPUs, and Multicores for Sliding-Window Applications From J. Fowers, G. Brown, P. Cooke, and G. Stitt, University.
CEFRIEL Deliverable R4.1.5 MAIS adaptive and reconfigurable modem Giovanni Paltenghi Roma – 24 Novembre 2005.
Compressed Instruction Cache Prepared By: Nicholas Meloche, David Lautenschlager, and Prashanth Janardanan Team Lugnuts.
RICE UNIVERSITY Implementing the Viterbi algorithm on programmable processors Sridhar Rajagopal Elec 696
Techniques for Low Power Turbo Coding in Software Radio Joe Antoon Adam Barnett.
Implementation of MAC Assisted CORDIC engine on FPGA EE382N-4 Abhik Bhattacharya Mrinal Deo Raghunandan K R Samir Dutt.
1 UTILIZING CHANNEL CODING INFORMATION IN CIVA- BASED BLIND SEQUENCE DETECTORS Xiaohua(Edward) Li Department of Electrical and Computer Engineering State.
1/ , Graz, Austria Power Spectral Density of Convolutional Coded Pulse Interval Modulation Z. Ghassemlooy, S. K. Hashemi and M. Amiri Optical Communications.
Implementation of Finite Field Inversion
Sunghwa Son Introduction Time-varying wireless channel  Large-scale attenuation Due to changing distance  Small-scale fading Due to multipath.
J. Greg Nash ICNC 2014 High-Throughput Programmable Systolic Array FFT Architecture and FPGA Implementations J. Greg.
RICE UNIVERSITY “Joint” architecture & algorithm designs for baseband signal processing Sridhar Rajagopal and Joseph R. Cavallaro Rice Center for Multimedia.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 12.
Design of a High-Throughput Low-Power IS95 Viterbi Decoder Xun Liu Marios C. Papaefthymiou Advanced Computer Architecture Laboratory Electrical Engineering.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
1 Implementation in Hardware of Video Processing Algorithm Performed by: Yony Dekell & Tsion Bublil Supervisor : Mike Sumszyk SPRING 2008 High Speed Digital.
Real-Time Turbo Decoder Nasir Ahmed Mani Vaya Elec 434 Rice University.
1 Channel Coding (III) Channel Decoding. ECED of 15 Topics today u Viterbi decoding –trellis diagram –surviving path –ending the decoding u Soft.
Design and Implementation of Turbo Decoder for 4G standards IEEE e and LTE Syed Z. Gilani.
Timo O. Korhonen, HUT Communication Laboratory 1 Convolutional encoding u Convolutional codes are applied in applications that require good performance.
Error Detection. Data can be corrupted during transmission. Some applications require that errors be detected and corrected. An error-detecting code can.
Error Correction Code (2)
A simple rate ½ convolutional code encoder is shown below. The rectangular box represents one element of a serial shift register. The contents of the shift.
EKT303/4 Superscalar vs Super-pipelined.
Sujan Rajbhandari LCS Convolutional Coded DPIM for Indoor Optical Wireless Links S. Rajbhandari, N. M. Aldibbiat and Z. Ghassemlooy Optical Communications.
Wireless Communication Research Lab. CGU What is Convolution Code? 指導教授:黃文傑 博士 學生:吳濟廷
Dr. Muqaibel \ EE430 Convolutional Codes 1 Convolutional Codes.
Log-Likelihood Algebra
SNS COLLEGE OF ENGINEERING Department of Electronics and Communication Engineering Subject: Digital communication Sem: V Convolutional Codes.
Convolutional Coding In telecommunication, a convolutional code is a type of error- correcting code in which m-bit information symbol to be encoded is.
Author: Weirong Jiang and Viktor K. Prasanna Publisher: The 18th International Conference on Computer Communications and Networks (ICCCN 2009) Presenter:
Interleaving Compounding Packets & Convolution Codes
Overview of MB-OFDM UWB Baseband Channel Codec for MB-OFDM UWB 2006/10/27 Speaker: 蔡佩玲.
1 Code design: Computer search Low rate: Represent code by its generator matrix Find one representative for each equivalence class of codes Permutation.
FEC decoding algorithm overview VLSI 자동설계연구실 정재헌.
DIGITAL SYTEM DESIGN MINI PROJECT CONVOLUTION CODES
Backprojection Project Update January 2002
Space Time Codes.
What is this “Viterbi Decoding”
MAP decoding: The BCJR algorithm
Pipelined Architectures for High-Speed and Area-Efficient Viterbi Decoders Chen, Chao-Nan Chu, Hsi-Cheng.
Fei Li Jinjun Xiong University of Wisconsin-Madison
Coding and Interleaving
COS 463: Wireless Networks Lecture 9 Kyle Jamieson
Su Yi Babak Azimi-Sadjad Shivkumar Kalyanaraman
Error Correction Code (2)
Error Correction Code (2)
Error Correction Code (2)
COS 463: Wireless Networks Lecture 9 Kyle Jamieson
Implementation of a De-blocking Filter and Optimization in PLX
Homework #2 Due May 29 , Consider a (2,1,4) convolutional code with g(1) = 1+ D2, g(2) = 1+ D + D2 + D3 a. Draw the.
IV. Convolutional Codes
Chapter 10 Error Detection and Correction
Presentation transcript:

Muhammad Shoaib Bin Altaf

Outline Motivation Actual Flow Optimizations Approach Results Conclusion

Motivation Convolutional coding with Viterbi decoding a powerful method for FEC in Communication Systems Viterbi Algorithm is based on Maximum Likelihood Estimation which is sequential. Thus slow. Modern Communications Standards like Wimax support very high throughput Data speed is increasing so is the need for high speed Viterbi decoding We are looking for such a scheme which gives vectorized output bits

Actual Algorithmic Flow We have done this stuff in our Homework as well On building trellis, at each stage path metric will be computed Best path metric computation at each stage Traceback decoding done bit by bit Each clock cycle, one bit will be decoded

Optimization VA is sequential but the “Good” thing is, it’s Recursive Various optimization possibilities can be employed for speed-up. Since the purpose was to have vectorized output, the only viable option is ‘Look Ahead Transformation’ Discussed Look Ahead transformation for Hoffman decoding in the class Block processing of the data

Optimization Contd. Decoding using 2 Look Ahead step.

Optimization Contd. Increasing the number of Look Ahead steps

Optimization Contd. Instead of 2 paths, we have to select the minimum among the 4 possible paths Lookup table needs to be changed

Approach Matlab Simulation N= 10^5 bits of data Two implementations of VA Constraint Length K= 3 One based on simple decoding Other based on Look Ahead Transformation Performance comparison to justify the correctness of the suggested approach

Results Data processing speed nearly doubles on taking a single Look Ahead step. Sequential VAOptimized VA Execution time in Seconds

Results Contd.. Performance Comaprsion

Conclusion Look Ahead Transformation is very attractive for increasing the throughput for Recursive Algorithms No loss in decoding abilities Depending on the Application Look Ahead step can be increased to any value The extra hardware cost is nominal as compared to the achieved performance In this Project the main focus was on speeding up the decoding rate irrespective of the extra hardware cost incurred