Advanced Hardware Architecture for Soft Decoding Reed-Solomon Codes
|
|
- Bernadette Powell
- 6 years ago
- Views:
Transcription
1 Advanced Hardware Architecture for Soft Decoding Reed-Solomon Codes Stefan Scholl, Norbert Wehn Microelectronic Systems Design Research Group TU Kaiserslautern, Germany
2 Overview Soft decoding decoding for the RS(255,239) New hardware architecture Goal: large FER gain (over hard decision decoding) Algorithm based on information set decoding Complexity evaluation on a Virtex 5 FPGA 2
3 Motivation RS / BCH Decoder Hardware wireless wired storage VDSL NASA / CCSDS Optical (G.709) Widely used code: RS(255,239) or its shortened versions 3
4 Decoding Algorithms for Reed-Solomon Hard Decoding Soft Decoding Algorithm: standard method algebraic decoding complexity very low: first chip implementations in the 1970/80s Progress in microelectronics allows for more complexity today! 4
5 Decoding Algorithms for Reed-Solomon Hard Decoding Algorithm: standard method algebraic decoding complexity very low: first chip implementations in the 1970/80s Progress in microelectronics allows for more complexity today! Soft Decoding Improved error correction possible gain: up to 3 db (depends on length and coderate) Algorithms: Chase Decoding Information Set Decoding Adaptive Belief Propagation Kötter-Vardy 5
6 Decoding Algorithms for Reed-Solomon Hard Decoding Algorithm: standard method algebraic decoding complexity very low: first chip implementations in the 1970/80s Progress in microelectronics allows for more complexity today! Soft Decoding Improved error correction possible gain: up to 3 db (depends on length and coderate) Algorithms: Chase Decoding Information Set Decoding Adaptive Belief Propagation Kötter-Vardy We consider the widely used RS(255,239) but RS(255,239) seems to be challenging 6
7 State-of-the-art Soft Decoder Hardware Real & complete hardware implementations for RS(255,239) Paper Year Algorithm Gain (over HDD) An (PhD thesis, MIT) 2010 Low complexity Chase 0.45 db Hsu et al (ESSCIRC) 2011 Chase 0.35 db Garcia-Herrero et al (CSSP) 2011 Low complexity Chase 0.3 db low gain hardware <0.5 db Kan et al (ISTC) 2008 Adaptive BP 0.75 db Heloir et al (NEWCAS) 2012 Stochastic Chase 0.7 db Scholl et al (DATE) 2014 Information set 0.75 db medium gain hardware db 7
8 State-of-the-art Hardware Implementations Hard decision decoding low gain <0.5 db 8
9 State-of-the-art Hardware Implementations Hard decision decoding medium gain db low gain <0.5 db 9
10 State-of-the-art Hardware Implementations Hard decision decoding Literature shows: up to 2 db gain should be possible Not yet investigated! high gain > 1 db medium gain db low gain <0.5 db 10
11 Implemented Algorithm* Information set decoding approach most reliable least reliable Received bits Binary image H = reliability *A. Ahmed, R. Koetter, and N. R. Shanbhag. Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm,
12 Implemented Algorithm* Information set decoding approach most reliable least reliable Received bits Diagonalized by Gaussian elimination Binary image H = reliability *A. Ahmed, R. Koetter, and N. R. Shanbhag. Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm,
13 Implemented Algorithm* Information set decoding approach most reliable least reliable Received bits Diagonalized by Gaussian elimination Binary image H = reliability syndrome Syndrome weight: Small: Only errors in least rel. part Large: Min. 1 errors in most rel part *A. Ahmed, R. Koetter, and N. R. Shanbhag. Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm,
14 Implemented Algorithm* Information set decoding approach most reliable least reliable Received bits Diagonalized by Gaussian elimination Binary image H = reliability syndrome Syndrome weight: Small: Only errors in least rel. part Large: Min. 1 errors in most rel part Order 1 processing: tentatively flip each most reliable bit (here: 1912) Order 2 processing: tentatively flip all combinations of 2 most reliable bits (~2 million cases) Can be seen as a low complexity variant of ordered-statistics decoding *A. Ahmed, R. Koetter, and N. R. Shanbhag. Performance analysis of the adaptive parity check matrix based soft-decision decoding algorithm,
15 Algorithm Improvements We add further features for improvement (mostly from other literature): Use a hard decision decoder (counters potential error floor) Use three differently diagonalized parity check matrices (improves FER) Partial overlapping of diagonalized parts allows for sophisticated architecture (complexity reduction) Restrict order 2 processing to fair reliable bits (250 out of 1912) Need to determine additional group: fair reliable (besides least and most) Large reduction of processings (factor 60 less) Use approximative reliability sorting to enable parallelization (higher speed) Overall loss due to complexity reduction: < 0.1 db 15
16 Our New Hardware Architecture Input: 2040 bit LLRs 8 in parallel Quantization: 6 bits Implementation on Virtex 5 FPGA output: 2040 bits (hard out) 8 in parallel 16
17 Our Hardware Architecture Sorting Finds low and fair reliable bits Finds 378 lowest out of 2040 LLRs Shift register based insertion sort 8 sorters parallel (approximative sorting) Stores bit positions in four memories 17
18 Our Hardware Architecture Gaussian Elimination /Diagonalization: Original matrix stored in memory Diagonalization on the fly Diagonalizaton column wise 2 phases: setup & elimination Saves ~70% hardware over state-of-the-art diagonalizations (e.g. systolic arrays) Three diagonalizations: exploit overlapping column original matrix Pipelined array eliminator P P P P: Fixed pivot positions! column eliminated matrix 18
19 Our Hardware Architecture Correction Unit Performs order 1 and 2 processing Parallelized order 2 proc. In 1 clock cycle: 1x order 1 6x order 2 3 instances (for 3 matrices) Selects best results for output 19
20 Our Hardware Architecture Syndrome Calculation: Required: syndrome of the diagonalized matrix Strategy: First: calculate syndrome using original matrix Second: diagonalize syndrome in the Gaussian Elimination Advantage: allows use of Galois field operations (much faster) 20
21 FPGA Implementations State-of-the-art soft decoder RS(255,239), gain > 0.5 db Kan et al Scholl et al Heloir et al THIS WORK Algorithm Adaptive BP Information Set Stoch. Chase Information Set Chip Stratix II Virtex 5 Virtex 5 Virtex 5 Flipflops n/a 42, ,000 70,200 Look-Up Tables 43,700 13, ,000 32,400 Throughput 4 Mbit/s 800 Mbit/s 50 Mbit/s 300 Mbit/s Communications gain over HDD 0.75 db 0.75 db 0.7 db 1.3 db M. Kan et al., Hardware implementation of soft-decision decoding for Reed-Solomon code. In Proc. 5th Int. Turbo Codes and Related Topics Symp, S. Scholl and N. Wehn, Hardware Implementation of a Reed-Solomon Soft Decoder based on Information Set Decoding, DATE 14, R. Heloir, C. Leroux, S. Hemati, M. Arzel, and W.J.Gross. Stochastic chase decoder for reed-solomon codes. IEEE NEWCAS 2012 Our new architecture 21
22 FPGA Implementations State-of-the-art soft decoder RS(255,239), gain > 0.5 db Kan et al Scholl et al Heloir et al THIS WORK Algorithm Adaptive BP Information Set Stoch. Chase Information Set Chip Stratix II Virtex 5 Virtex 5 Virtex 5 Flipflops n/a 42, ,000 70,200 Look-Up Tables 43,700 13, ,000 32,400 Throughput 4 Mbit/s 800 Mbit/s 50 Mbit/s 300 Mbit/s Communications gain over HDD 0.75 db 0.75 db 0.7 db 1.3 db M. Kan et al., Hardware implementation of soft-decision decoding for Reed-Solomon code. In Proc. 5th Int. Turbo Codes and Related Topics Symp, S. Scholl and N. Wehn, Hardware Implementation of a Reed-Solomon Soft Decoder based on Information Set Decoding, DATE 14, R. Heloir, C. Leroux, S. Hemati, M. Arzel, and W.J.Gross. Stochastic chase decoder for reed-solomon codes. IEEE NEWCAS 2012 Our new architecture 22
23 FPGA Implementations State-of-the-art soft decoder RS(255,239), gain > 0.5 db Kan et al Scholl et al Heloir et al THIS WORK Algorithm Adaptive BP Information Set Stoch. Chase Information Set Chip Stratix II Virtex 5 Virtex 5 Virtex 5 Flipflops n/a 42, ,000 70,200 Look-Up Tables 43,700 13, ,000 32,400 Throughput 4 Mbit/s 800 Mbit/s 50 Mbit/s 300 Mbit/s Communications gain over HDD 0.75 db 0.75 db 0.7 db 1.3 db M. Kan et al., Hardware implementation of soft-decision decoding for Reed-Solomon code. In Proc. 5th Int. Turbo Codes and Related Topics Symp, S. Scholl and N. Wehn, Hardware Implementation of a Reed-Solomon Soft Decoder based on Information Set Decoding, DATE 14, R. Heloir, C. Leroux, S. Hemati, M. Arzel, and W.J.Gross. Stochastic chase decoder for reed-solomon codes. IEEE NEWCAS 2012 Our new architecture 23
24 Comparison FER This work 24
25 Summary & Outlook Summary Proposed new RS soft decoder hardware for RS(255,239) Based on information set decoding Implementation with currently best FER: gain 1.3 db over HDD New High gain architecture, besides low & medium gain Acceptable complexity Future Challenges Improving implementation efficiency Architectures for specific application s requirements Approach applicable to every linear code 25
26 Thank you for your attention! Questions? 26
27 Our new Binary Gaussian Elimination Basic operation: adding rows onto other rows to form unit columns For our hardware: Two Phase Approach 1. Setup: configures addition patterns 2. Elimination: performs actual elimination Architecture: Column by column processing with pipelined array P + + Columns from original matrix + P Columns of eliminated matrix + P P: Fixed pivot positions! S. Scholl, C. Stumm, and N. Wehn. Hardware Implementations of Gaussian Elimination over GF(2) for Channel Decoding Algorithms. IEEE AFRICON
28 Comparison, 128 x 2040 matrix Design Example: Reed-Solomon (255,239) Code: Binary Matrix Size: 128 x 2040 Implementation on a Xilinx FPGA Chip (Virtex 7) Architecture Look-Up-Tables Flipflops Throughput SMITH* 780k* 260k* Systolic array 82k 99k 219k matrices / s proposed 17k 33k 272k matrices / s * estimated -80% saving -67% saving +25% increase Efficient Gaussian elimination is the key for efficient soft decoding! 28
An Introduction to Low Density Parity Check (LDPC) Codes
An Introduction to Low Density Parity Check (LDPC) Codes Jian Sun jian@csee.wvu.edu Wireless Communication Research Laboratory Lane Dept. of Comp. Sci. and Elec. Engr. West Virginia University June 3,
More informationStructured Low-Density Parity-Check Codes: Algebraic Constructions
Structured Low-Density Parity-Check Codes: Algebraic Constructions Shu Lin Department of Electrical and Computer Engineering University of California, Davis Davis, California 95616 Email:shulin@ece.ucdavis.edu
More informationChapter 7 Reed Solomon Codes and Binary Transmission
Chapter 7 Reed Solomon Codes and Binary Transmission 7.1 Introduction Reed Solomon codes named after Reed and Solomon [9] following their publication in 1960 have been used together with hard decision
More informationLow Density Parity Check (LDPC) Codes and the Need for Stronger ECC. August 2011 Ravi Motwani, Zion Kwok, Scott Nelson
Low Density Parity Check (LDPC) Codes and the Need for Stronger ECC August 2011 Ravi Motwani, Zion Kwok, Scott Nelson Agenda NAND ECC History Soft Information What is soft information How do we obtain
More informationPipeline processing in low-density parity-check codes hardware decoder
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES, Vol. 59, No. 2, 2011 DOI: 10.2478/v10175-011-0019-9 Pipeline processing in low-density parity-check codes hardware decoder. SUŁEK Institute
More informationPipelined Viterbi Decoder Using FPGA
Research Journal of Applied Sciences, Engineering and Technology 5(4): 1362-1372, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: July 05, 2012 Accepted: August
More informationFPGA-based Niederreiter Cryptosystem using Binary Goppa Codes
FPGA-based Niederreiter Cryptosystem using Binary Goppa Codes Wen Wang 1, Jakub Szefer 1, and Ruben Niederhagen 2 1. Yale University, USA 2. Fraunhofer Institute SIT, Germany April 9, 2018 PQCrypto 2018
More informationMaking Error Correcting Codes Work for Flash Memory
Making Error Correcting Codes Work for Flash Memory Part I: Primer on ECC, basics of BCH and LDPC codes Lara Dolecek Laboratory for Robust Information Systems (LORIS) Center on Development of Emerging
More informationSOFT-DECISION DECODING OF REED-SOLOMON CODES USING PATTERN INFORMATION OVER PARTIAL RESPONSE CHANNELS. Soowoong Lee
SOFT-DECISION DECODING OF REED-SOLOMON CODES USING PATTERN INFORMATION OVER PARTIAL RESPONSE CHANNELS by Soowoong Lee Submitted to the Graduate Faculty of Department of Electrical and Computer Engineering
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan ICC 2011 IEEE International Conference on Communications
More informationAdaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes
Adaptive Cut Generation for Improved Linear Programming Decoding of Binary Linear Codes Xiaojie Zhang and Paul H. Siegel University of California, San Diego, La Jolla, CA 9093, U Email:{ericzhang, psiegel}@ucsd.edu
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon
More informationECC for NAND Flash. Osso Vahabzadeh. TexasLDPC Inc. Flash Memory Summit 2017 Santa Clara, CA 1
ECC for NAND Flash Osso Vahabzadeh TexasLDPC Inc. 1 Overview Why Is Error Correction Needed in Flash Memories? Error Correction Codes Fundamentals Low-Density Parity-Check (LDPC) Codes LDPC Encoding and
More informationA Simplified Min-Sum Decoding Algorithm. for Non-Binary LDPC Codes
IEEE TRANSACTIONS ON COMMUNICATIONS 1 A Simplified Min-Sum Decoding Algorithm for Non-Binary LDPC Codes Chung-Li (Jason) Wang, Xiaoheng Chen, Zongwang Li, and Shaohua Yang arxiv:1207.5555v1 [cs.it] 23
More informationCoding Techniques for Data Storage Systems
Coding Techniques for Data Storage Systems Thomas Mittelholzer IBM Zurich Research Laboratory /8 Göttingen Agenda. Channel Coding and Practical Coding Constraints. Linear Codes 3. Weight Enumerators and
More informationMemory Elements I. CS31 Pascal Van Hentenryck. CS031 Lecture 6 Page 1
Memory Elements I CS31 Pascal Van Hentenryck CS031 Lecture 6 Page 1 Memory Elements (I) Combinational devices are good for computing Boolean functions pocket calculator Computers also need to remember
More informationCompressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes
Compressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes Item Type text; Proceedings Authors Jagiello, Kristin M. Publisher International Foundation for Telemetering Journal International Telemetering
More informationLow-complexity error correction in LDPC codes with constituent RS codes 1
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 348-353 Low-complexity error correction in LDPC codes with constituent RS codes 1
More informationFPGA Implementation of a Predictive Controller
FPGA Implementation of a Predictive Controller SIAM Conference on Optimization 2011, Darmstadt, Germany Minisymposium on embedded optimization Juan L. Jerez, George A. Constantinides and Eric C. Kerrigan
More informationRandom Redundant Soft-In Soft-Out Decoding of Linear Block Codes
Random Redundant Soft-In Soft-Out Decoding of Linear Block Codes Thomas R. Halford and Keith M. Chugg Communication Sciences Institute University of Southern California Los Angeles, CA 90089-2565 Abstract
More informationPerformance Study of Non-Binary Belief Propagation for Decoding Reed-Solomon Codes
Performance Study of Non-Binary Belief Propagation for Decoding Reed-Solomon Codes Bimberg, Marcel; Lentmaier, Michael; Fettweis, Gerhard Published in: [Host publication title missing] Published: 2010-01-01
More informationA COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER. Jesus Garcia and Michael J. Schulte
A COMBINED 16-BIT BINARY AND DUAL GALOIS FIELD MULTIPLIER Jesus Garcia and Michael J. Schulte Lehigh University Department of Computer Science and Engineering Bethlehem, PA 15 ABSTRACT Galois field arithmetic
More informationVHDL Implementation of Reed Solomon Improved Encoding Algorithm
VHDL Implementation of Reed Solomon Improved Encoding Algorithm P.Ravi Tej 1, Smt.K.Jhansi Rani 2 1 Project Associate, Department of ECE, UCEK, JNTUK, Kakinada A.P. 2 Assistant Professor, Department of
More informationLow-density parity-check codes
Low-density parity-check codes From principles to practice Dr. Steve Weller steven.weller@newcastle.edu.au School of Electrical Engineering and Computer Science The University of Newcastle, Callaghan,
More informationA Survey on Binary Message LDPC decoder
A Surey on Binary Message LDPC decoder Emmanuel Boutillon *, Chris Winstead * Uniersité de Bretagne Sud Utah State Uniersity Noember the 4 th, 204 Outline Classifications of BM LDPC decoder State of the
More informationAN IMPROVED LOW LATENCY SYSTOLIC STRUCTURED GALOIS FIELD MULTIPLIER
Indian Journal of Electronics and Electrical Engineering (IJEEE) Vol.2.No.1 2014pp1-6 available at: www.goniv.com Paper Received :05-03-2014 Paper Published:28-03-2014 Paper Reviewed by: 1. John Arhter
More informationSOFT DECISION FANO DECODING OF BLOCK CODES OVER DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM
Journal of ELECTRICAL ENGINEERING, VOL. 63, NO. 1, 2012, 59 64 SOFT DECISION FANO DECODING OF BLOCK CODES OVER DISCRETE MEMORYLESS CHANNEL USING TREE DIAGRAM H. Prashantha Kumar Udupi Sripati K. Rajesh
More informationIntroduction to Low-Density Parity Check Codes. Brian Kurkoski
Introduction to Low-Density Parity Check Codes Brian Kurkoski kurkoski@ice.uec.ac.jp Outline: Low Density Parity Check Codes Review block codes History Low Density Parity Check Codes Gallager s LDPC code
More informationSome Aspects of Hardware Implementation of LDPC Codes
Some Aspects of Hardware Implementation of LDPC Codes Emmanuel Boutillon Fréderic Guilloud (PhD, ENST) Jean-Luc Danger (ENST) Laboratoire d électronique des systèmes temps réel Université de Bretagne Sud
More informationOn the minimum distance of LDPC codes based on repetition codes and permutation matrices 1
Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory June 18-24, 216, Albena, Bulgaria pp. 168 173 On the minimum distance of LDPC codes based on repetition codes and permutation
More informationCodes on graphs and iterative decoding
Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona Funded by: National Science Foundation (NSF) Seagate Technology Defense Advanced Research Projects
More informationFully-parallel linear error block coding and decoding a Boolean approach
Fully-parallel linear error block coding and decoding a Boolean approach Hermann Meuth, Hochschule Darmstadt Katrin Tschirpke, Hochschule Aschaffenburg 8th International Workshop on Boolean Problems, 28
More informationInstruction Set Extensions for Reed-Solomon Encoding and Decoding
Instruction Set Extensions for Reed-Solomon Encoding and Decoding Suman Mamidi and Michael J Schulte Dept of ECE University of Wisconsin-Madison {mamidi, schulte}@caewiscedu http://mesaecewiscedu Daniel
More informationProgressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes
Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes Li Chen ( 陈立 ), PhD, MIEEE Associate Professor, School of Information Science and Technology Sun Yat-sen University, China Joint work
More informationELEC3227/4247 Mid term Quiz2 Solution with explanation
ELEC7/447 Mid term Quiz Solution with explanation Ang Man Shun Department of Electrical and Electronic Engineering, University of Hong Kong Document creation date : 015 1 05 This document explain the solution
More informationError Correction and Trellis Coding
Advanced Signal Processing Winter Term 2001/2002 Digital Subscriber Lines (xdsl): Broadband Communication over Twisted Wire Pairs Error Correction and Trellis Coding Thomas Brandtner brandt@sbox.tugraz.at
More informationStaircase Codes. for High-Speed Optical Communications
Staircase Codes for High-Speed Optical Communications Frank R. Kschischang Dept. of Electrical & Computer Engineering University of Toronto (Joint work with Lei Zhang, Benjamin Smith, Arash Farhood, Andrew
More informationProgressive algebraic Chase decoding algorithms for Reed Solomon codes
IET Communications Research Article Progressive algebraic Chase decoding algorithms for Reed Solomon codes ISSN 1751-8628 Received on 7th September 2015 Revised on 13th December 2015 Accepted on 27th February
More informationTHIS paper is aimed at designing efficient decoding algorithms
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 7, NOVEMBER 1999 2333 Sort-and-Match Algorithm for Soft-Decision Decoding Ilya Dumer, Member, IEEE Abstract Let a q-ary linear (n; k)-code C be used
More informationSTUDY OF PERMUTATION MATRICES BASED LDPC CODE CONSTRUCTION
EE229B PROJECT REPORT STUDY OF PERMUTATION MATRICES BASED LDPC CODE CONSTRUCTION Zhengya Zhang SID: 16827455 zyzhang@eecs.berkeley.edu 1 MOTIVATION Permutation matrices refer to the square matrices with
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
More informationDigital Logic: Boolean Algebra and Gates. Textbook Chapter 3
Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 Basic Logic Gates XOR CMPE12 Summer 2009 02-2 Truth Table The most basic representation of a logic function Lists the output for all possible
More informationConstruction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor
Construction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor Pravin Salunkhe, Prof D.P Rathod Department of Electrical Engineering, Veermata Jijabai
More informationEECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs. Cross-coupled NOR gates
EECS150 - Digital Design Lecture 23 - FFs revisited, FIFOs, ECCs, LSFRs April 16, 2009 John Wawrzynek Spring 2009 EECS150 - Lec24-blocks Page 1 Cross-coupled NOR gates remember, If both R=0 & S=0, then
More informationSimplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey
2014 IJEDR Volume 2, Issue 1 ISSN: 2321-9939 Simplification of Procedure for Decoding Reed- Solomon Codes Using Various Algorithms: An Introductory Survey 1 Vivek Tilavat, 2 Dr.Yagnesh Shukla 1 PG Student,
More informationSymmetric Product Codes
Symmetric Product Codes Henry D. Pfister 1, Santosh Emmadi 2, and Krishna Narayanan 2 1 Department of Electrical and Computer Engineering Duke University 2 Department of Electrical and Computer Engineering
More informationInformation Theoretic Imaging
Information Theoretic Imaging WU Faculty: J. A. O Sullivan WU Doctoral Student: Naveen Singla Boeing Engineer: James Meany First Year Focus: Imaging for Data Storage Image Reconstruction Data Retrieval
More informationShift Register Counters
Shift Register Counters Shift register counter: a shift register with the serial output connected back to the serial input. They are classified as counters because they give a specified sequence of states.
More informationShort Polar Codes. Peihong Yuan. Chair for Communications Engineering. Technische Universität München
Short Polar Codes Peihong Yuan Chair for Communications Engineering July 26, 2016 LNT & DLR Summer Workshop on Coding 1 / 23 Outline 1 Motivation 2 Improve the Distance Property 3 Simulation Results 4
More informationBelief propagation decoding of quantum channels by passing quantum messages
Belief propagation decoding of quantum channels by passing quantum messages arxiv:67.4833 QIP 27 Joseph M. Renes lempelziv@flickr To do research in quantum information theory, pick a favorite text on classical
More informationR. A. Carrasco and M. Johnston, Non-Binary Error Control Coding Cork 2009
Design of Non-Binary Error-Correction Codes and their Applications R. A. Carrasco and. Johnston, Non-Binary Error Control Coding for Wireless Communication and Data Storage, Wiley, SBN 978-- 7-89-9 Prof.
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 9 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering TIMING ANALYSIS Overview Circuits do not respond instantaneously to input changes
More informationCodes on graphs and iterative decoding
Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona Prelude Information transmission 0 0 0 0 0 0 Channel Information transmission signal 0 0 threshold
More informationConstructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,
More informationVLSI Architecture of Euclideanized BM Algorithm for Reed-Solomon Code
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2, 4-4 (29) VLSI Architecture of Euclideanized BM Algorithm for Reed-Solomon Code HUANG-CHI CHEN,2, YU-WEN CHANG 3 AND REY-CHUE HWANG Deaprtment of Electrical
More informationDr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems
Prof. Shu Lin Dr. Cathy Liu Dr. Michael Steinberger U.C.Davis Avago SiSoft A Brief Tour of FEC for Serial Link Systems Outline Introduction Finite Fields and Vector Spaces Linear Block Codes Cyclic Codes
More informationLow-density parity-check (LDPC) codes
Low-density parity-check (LDPC) codes Performance similar to turbo codes Do not require long interleaver to achieve good performance Better block error performance Error floor occurs at lower BER Decoding
More information2. Accelerated Computations
2. Accelerated Computations 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA Stuart W. Schneider Jon T. Butler 2.1.1. Background A naive approach to encoding a plaintext message
More informationEfficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders
Efficient Bit-Channel Reliability Computation for Multi-Mode Polar Code Encoders and Decoders Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross arxiv:1705.05674v1 [cs.it] 16 May 2017 Abstract Polar codes
More informationOn the Performance of SC-MMSE-FD Equalization for Fixed-Point Implementations
On the Performance of SC-MMSE-FD Equalization for Fixed-Point Implementations ISTC 2014, Bremen, Tamal Bose and Friedrich K. Jondral KIT Universität des Landes Baden-Württemberg und nationales Forschungszentrum
More informationERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES
Journal of ELECTRICAL ENGINEERING, VOL. 54, NO. -2, 2003, 305 30 ERROR CORRECTION BEYOND THE CONVENTIONAL ERROR BOUND FOR REED SOLOMON CODES Sergey Egorov Garik Markarian A modification of Blahut procedure
More informationQuasi-cyclic Low Density Parity Check codes with high girth
Quasi-cyclic Low Density Parity Check codes with high girth, a work with Marta Rossi, Richard Bresnan, Massimilliano Sala Summer Doctoral School 2009 Groebner bases, Geometric codes and Order Domains Dept
More informationA Short Length Low Complexity Low Delay Recursive LDPC Code
A Short Length Low Complexity Low Delay Recursive LDPC Code BASHAR M. MANSOOR, TARIQ Z. ISMAEEL Department of Electrical Engineering College of Engineering, University of Baghdad, IRAQ bmml77@yahoo.com
More informationFPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials
FPGA accelerated multipliers over binary composite fields constructed via low hamming weight irreducible polynomials C. Shu, S. Kwon and K. Gaj Abstract: The efficient design of digit-serial multipliers
More informationBInary low-density parity-check (LDPC) codes, discovered
Low Latency T-EMS decoder for Non-Binary LDPC codes Erbao Li, Francisco García-Herrero, David Declercq, Kiran Gunnam, Jesús Omar Lacruz and Javier Valls Abstract Check node update processing for non-binary
More informationPre-sorted Forward-Backward NB-LDPC Check Node Architecture
Pre-sorted Forward-Backward NB-LDPC Check Node Architecture Hassan Harb, Cédric Marchand, Laura Conde-Canencia, Emmanuel Boutillon, Ali Al Ghouwayel To cite this version: Hassan Harb, Cédric Marchand,
More informationCommunication Theory II
Communication Theory II Lecture 24: Error Correction Techniques Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt May 14 th, 2015 1 Error Correction Techniques olinear Block Code Cyclic
More informationDistributed Arithmetic Coding
Distributed Arithmetic Coding Marco Grangetto, Member, IEEE, Enrico Magli, Member, IEEE, Gabriella Olmo, Senior Member, IEEE Abstract We propose a distributed binary arithmetic coder for Slepian-Wolf coding
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More informationOptimizing Loop Operation and Dataflow in FPGA Acceleration of Deep Convolutional Neural Networks
2017 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays Optimizing Loop Operation and Dataflow in FPGA Acceleration of Deep Convolutional Neural Networks Yufei Ma, Yu Cao, Sarma Vrudhula,
More informationAn Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission
An Enhanced (31,11,5) Binary BCH Encoder and Decoder for Data Transmission P.Mozhiarasi, C.Gayathri, V.Deepan Master of Engineering, VLSI design, Sri Eshwar College of Engineering, Coimbatore- 641 202,
More informationCoding for Memory with Stuck-at Defects
Coding for Memory with Stuck-at Defects Yongjune Kim B. V. K. Vijaya Kumar Electrical Computer Engineering, Data Storage Systems Center (DSSC) Carnegie Mellon University Pittsburgh, USA yongjunekim@cmu.edu,
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationGirth Analysis of Polynomial-Based Time-Invariant LDPC Convolutional Codes
IWSSIP 212, 11-13 April 212, Vienna, Austria ISBN 978-3-2-2328-4 Girth Analysis of Polynomial-Based Time-Invariant LDPC Convolutional Codes Hua Zhou and Norbert Goertz Institute of Telecommunications Vienna
More informationCHAPTER 3 LOW DENSITY PARITY CHECK CODES
62 CHAPTER 3 LOW DENSITY PARITY CHECK CODES 3. INTRODUCTION LDPC codes were first presented by Gallager in 962 [] and in 996, MacKay and Neal re-discovered LDPC codes.they proved that these codes approach
More informationA New Performance Evaluation Metric for Sub-Optimal Iterative Decoders
A New Performance Evaluation Metric for Sub-Optimal Iterative Decoders Ashwani Singh, Ali Al-Ghouwayel, G. Masera, Emmanuel Boutillon To cite this version: Ashwani Singh, Ali Al-Ghouwayel, G. Masera, Emmanuel
More informationError Correction Review
Error Correction Review A single overall parity-check equation detects single errors. Hamming codes used m equations to correct one error in 2 m 1 bits. We can use nonbinary equations if we create symbols
More informationTrapping Set Enumerators for Specific LDPC Codes
Trapping Set Enumerators for Specific LDPC Codes Shadi Abu-Surra Samsung Telecommunications America 1301 E. Lookout Dr. Richardson TX 75082 Email: sasurra@sta.samsung.com David DeClercq ETIS ENSEA/UCP/CNRS
More informationPolar Code Construction for List Decoding
1 Polar Code Construction for List Decoding Peihong Yuan, Tobias Prinz, Georg Böcherer arxiv:1707.09753v1 [cs.it] 31 Jul 2017 Abstract A heuristic construction of polar codes for successive cancellation
More informationAchieving Flexibility in LDPC Code Design by Absorbing Set Elimination
Achieving Flexibility in LDPC Code Design by Absorbing Set Elimination Jiajun Zhang, Jiadong Wang, Shayan Garani Srinivasa, Lara Dolecek Department of Electrical Engineering, University of California,
More informationPolar Codes: Graph Representation and Duality
Polar Codes: Graph Representation and Duality arxiv:1312.0372v1 [cs.it] 2 Dec 2013 M. Fossorier ETIS ENSEA/UCP/CNRS UMR-8051 6, avenue du Ponceau, 95014, Cergy Pontoise, France Email: mfossorier@ieee.org
More informationPhysical Layer and Coding
Physical Layer and Coding Muriel Médard Professor EECS Overview A variety of physical media: copper, free space, optical fiber Unified way of addressing signals at the input and the output of these media:
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationECEN 655: Advanced Channel Coding
ECEN 655: Advanced Channel Coding Course Introduction Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 655: Advanced Channel Coding 1 / 19 Outline 1 History
More informationA contribution to the reduction of the dynamic power dissipation in the turbo decoder
0 0 0 0 0 0 Noname manuscript No. (will be inserted by the editor) A contribution to the reduction of the dynamic power dissipation in the turbo decoder Haisheng Liu Christophe Jego Emmanuel Boutillon
More informationEfficient random number generation on FPGA-s
Proceedings of the 9 th International Conference on Applied Informatics Eger, Hungary, January 29 February 1, 2014. Vol. 1. pp. 313 320 doi: 10.14794/ICAI.9.2014.1.313 Efficient random number generation
More informationSide Channel Analysis and Protection for McEliece Implementations
Side Channel Analysis and Protection for McEliece Implementations Thomas Eisenbarth Joint work with Cong Chen, Ingo von Maurich and Rainer Steinwandt 9/27/2016 NATO Workshop- Tel Aviv University Overview
More informationWord-length Optimization and Error Analysis of a Multivariate Gaussian Random Number Generator
Word-length Optimization and Error Analysis of a Multivariate Gaussian Random Number Generator Chalermpol Saiprasert, Christos-Savvas Bouganis and George A. Constantinides Department of Electrical & Electronic
More informationIterative Soft-Decision Decoding of Binary Cyclic Codes
142 JOURNA OF COMMUNICATIONS SOFTWARE AND SYSTEMS, VO. 4, NO. 2, JUNE 2008 Iterative Soft-Decision Decoding of Binary Cyclic Codes Marco Baldi, Giovanni Cancellieri, and Franco Chiaraluce Original scientific
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationChannel Coding I. Exercises SS 2017
Channel Coding I Exercises SS 2017 Lecturer: Dirk Wübben Tutor: Shayan Hassanpour NW1, Room N 2420, Tel.: 0421/218-62387 E-mail: {wuebben, hassanpour}@ant.uni-bremen.de Universität Bremen, FB1 Institut
More informationInformation redundancy
Information redundancy Information redundancy add information to date to tolerate faults error detecting codes error correcting codes data applications communication memory p. 2 - Design of Fault Tolerant
More informationPAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes
359 PAPER A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes Ching-Lung CHR a),szu-linsu, Members, and Shao-Wei WU, Nonmember SUMMARY A low-complexity step-by-step decoding algorithm
More informationError Correction Methods
Technologies and Services on igital Broadcasting (7) Error Correction Methods "Technologies and Services of igital Broadcasting" (in Japanese, ISBN4-339-06-) is published by CORONA publishing co., Ltd.
More informationDesign and Implementation of High Speed CRC Generators
Department of ECE, Adhiyamaan College of Engineering, Hosur, Tamilnadu, India Design and Implementation of High Speed CRC Generators ChidambarakumarS 1, Thaky Ahmed 2, UbaidullahMM 3, VenketeshK 4, JSubhash
More informationA New Division Algorithm Based on Lookahead of Partial-Remainder (LAPR) for High-Speed/Low-Power Coding Applications
202 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: ANALOG AND DIGITAL SIGNAL PROCESSING, VOL. 46, NO. 2, FEBRUARY 1999 j =5: However, increasing j means also decreasing the space in the memory. From the
More informationPolar Coding for the Large Hadron Collider: Challenges in Code Concatenation
Polar Coding for the Large Hadron Collider: Challenges in Code Concatenation Alexios Balatsoukas-Stimming, Tomasz Podzorny, Jan Uythoven {alexios.balatsoukas, tomasz.podzorny, jan.uythoven}@cern.ch European
More informationMapper & De-Mapper System Document
Mapper & De-Mapper System Document Mapper / De-Mapper Table of Contents. High Level System and Function Block. Mapper description 2. Demodulator Function block 2. Decoder block 2.. De-Mapper 2..2 Implementation
More informationImproved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution
Improved Successive Cancellation Flip Decoding of Polar Codes Based on Error Distribution Carlo Condo, Furkan Ercan, Warren J. Gross Department of Electrical and Computer Engineering, McGill University,
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 18 Error Coding. In the real world. Our beautiful digital world.
Outline EECS 150 - Components and esign Techniques for igital Systems Lec 18 Error Coding Errors and error models Parity and Hamming Codes (SECE) Errors in Communications LFSRs Cyclic Redundancy Check
More information