Does soft-decision ECC improve endurance?

Size: px
Start display at page:

Download "Does soft-decision ECC improve endurance?"

Transcription

1 Flash Memory Summit 2015 Does soft-decision ECC improve endurance? Thomas Parnell IBM Research - Zurich

2 Outline Motivation Why do we need more endurance? Capacity What is channel capacity? How can it be used to compare different error-correction techniques? MLC Flash Channel How do we evaluate capacity for MLC Flash devices? Experimental Results + Analysis How much endurance gain can soft-decision ECC offer for real MLC devices? Why does the MLC programming algorithm affect capacity? Conclusion 2

3 Why do we need more endurance? All-flash storage solutions are gaining momentum in the enterprise sector HOW? High performance and rapidly decreasing $/GB WHAT IS DRIVING DOWN COST? LDPC codes can make use of soft information from Flash to enhance reliability Papers on LDPC + Flash listed on IEEE plore In part, the move from SLC emlc cmlc ISN T cmlc VER UNRELIABLE? 2D cmlc has ~3k P/E cycling endurance BUT ENTERPRISE NEEDS >20k? Advanced ECC is required to boost endurance Source: 3

4 Channel Capacity (Shannon 1948) Channel Capacity: Amount of information (in bits) that channel output () contains about channel input () (Maximized over all input distributions) C max P( ) I( ; ) R < C Error-free operation is possible R > C Error-free operation is NOT possible BINAR SMMETRIC CHANNEL 0 1-f 0 Channel capacity can be used in two ways: 1 f f 1-f 1 a) For a given level of channel noise, what ECC rate is required in order to operate reliably? b) For a given ECC rate, how much channel noise can be tolerated? 4

5 AWGN Channel: Hard vs. Soft Information AWGN CHANNEL Binary Input Binary Output ˆ Soft output (Fine quantization) RBER gain in capacity highly correlated with RBER gain for real ECC SOFT CAPACIT HARD CAPACIT C SOFT P( ) max I ; C HARD P( ) max I ˆ ; ECC data sourced from: Tzimpragos et al. A Survey on FEC Codes for 100G and Beyond Optical Networks, IEEE Comm. Surveys & Tutorials,

6 MLC Flash Channel V i, j Soft Output (21 shifted reads from Flash) MLC FLASH CHANNEL Binary Input (2 bits) i, j ( L) i, j x2 + i, j READ (Upper) READ (Lower) i, j ( L) i, j Binary Output (2 bits) WL[i+1] BL[j-1] BL[j] BL[j+1] i 1, j 1 i 1, j i 1, j 1 Read Lower Page ( L) i, j 1 ( L) i, j 0 i, j 1 Read Upper Page i, j 0 i, j 1 WL[i] WL[i-1] i, j 1 i 1, j 1 i, j i 1, j i, j 1 i 1, j V i, j V i, j 6

7 MLC Flash Channel is NOT Memoryless 11 Threshold voltage distribution conditional on state of aggressor cells 10 i, j i j 10, The threshold voltage of a cell depends on the data written to the surrounding cells MLC flash channel is a FSMC: Finite State Markov Channel 7 n1 V V V V Pr,, Pr,,,, i,0 i,1 i, n1 i, j i, j1 i, j i, j1 i1, j i1, j j0 Conditional threshold voltage distributions are extracted from real MLC Flash devices

8 Calculation of Symmetric Capacity SOFT CAPACIT (UPPER PAGE) 1 C I V V V n lim,,..., ;,,..., SOFT i,0 i,1 i, n1 i,0 i,1 i, n1 n V i, j Soft Output Capacity* is calculated recursively using a very long sample from the channel (n=10 7 ) assuming i.u.d input distribution [ICC2015] MLC FLASH CHANNEL Binary Input (2 bits) i, j ( L) i, j x2 + i, j READ (Upper) READ (Lower) i, j ( L) i, j Binary Output (2 bits) HARD CAPACIT (LOWER PAGE) 1 C I n ( L) lim ( L), ( L),..., ( L) ; ( L), ( L),..., ( L) HARD i,0 i,1 i, n1 i,0 i,1 i, n1 n 8

9 Experimental Results Vendor A/B 1y-nm MLC devices with approx. same cell area VENDOR A VENDOR B Gain in capacity due to soft information is much larger for upper pages 9

10 How much endurance can we gain using soft information? Endurance (Balanced ECC) Same ECC rate in upper/lower page: PEC( R) min(pec ( R),PEC ( R)) L U Endurance (Unbalanced ECC) Different ECC rate in upper/lower page: PEC( R) max min(pec ( R ),PEC ( R )) R R 2R L U L L U U VENDOR A (R=0.99) VENDOR B (R=0.99) 14% 21% 11% 21% 10

11 Why do we only see a small increase in capacity for lower pages? INTERMEDIATE READ 1y-nm MLC DEVICE (a) Program LP=1 E x0 V TH LP=0 LP=1 Read LP=1 Read LP=0 (b) Program UP= V TH Degradation of the erase state can lead to errorpropagation during two-stage MLC programming Programming errors are present for the lower page that are difficult to correct even with soft information 11

12 What if we can prevent programming errors? 1x-nm MLC MODEL [ICC2015] Removing programming errors dramatically improves the lower page capacity ~40% endurance gain due to soft information BALANCED ECC (R=0.99) 5% 37% 12

13 Conclusion Does soft-decision ECC improve endurance? Sub-20nm planar MLC device? ES NO Does the device employ two-pass programming? SLC, TLC, and 3D devices have not been studied NO ES ~40% Endurance Gain Same ECC in upper/lower pages? NO ~20% Endurance Gain ES ~10-15% Endurance Gain 13

14 Acknowledgements IBM - Zurich Research Laboratory IBM FlashSystem 900/V9000 IBM Research Zurich IBM Flash Systems Development (Houston) IBM Systems (San Jose, Poughkeepsie, Raleigh) 14

Noise Modeling and Capacity Analysis for NAND Flash Memories

Noise Modeling and Capacity Analysis for NAND Flash Memories Noise Modeling and Capacity Analysis for NAND Flash Memories Qing Li, Anxiao (Andrew) Jiang, and Erich F. Haratsch Flash Components Division, LSI Corporation, San Jose, CA, 95131 Computer Sci. and Eng.

More information

Graph-based codes for flash memory

Graph-based codes for flash memory 1/28 Graph-based codes for flash memory Discrete Mathematics Seminar September 3, 2013 Katie Haymaker Joint work with Professor Christine Kelley University of Nebraska-Lincoln 2/28 Outline 1 Background

More information

880 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 32, NO. 5, MAY 2014

880 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 32, NO. 5, MAY 2014 880 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 32, NO. 5, MAY 2014 Enhanced Precision Through Multiple Reads for LDPC Decoding in Flash Memories Jiadong Wang, Kasra Vakilinia, Tsung-Yi Chen,

More information

Information Theoretic Imaging

Information 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 information

Making Error Correcting Codes Work for Flash Memory

Making 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 information

Low-density parity-check codes

Low-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 information

Write Once Memory Codes and Lattices for Flash Memories

Write Once Memory Codes and Lattices for Flash Memories Write Once Memory Codes and Lattices for Flash Memories Japan Advanced Institute of Science and Technology September 19, 2012 Seoul National University Japan Advanced Institute of Science and Technology

More information

CHANNEL modeling for NAND flash memories is a developing

CHANNEL modeling for NAND flash memories is a developing IEEE TRANSACTIONS ON COMMUNICATIONS 1 Channel Models for Multi-Level Cell Flash Memories Based on Empirical Error Analysis Veeresh Taranalli, Student Member, IEEE, Hironori Uchikawa, Member, IEEE, Paul

More information

ECC for NAND Flash. Osso Vahabzadeh. TexasLDPC Inc. Flash Memory Summit 2017 Santa Clara, CA 1

ECC 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 information

ECEN 655: Advanced Channel Coding

ECEN 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 information

Asymptotic Capacity Bounds for Magnetic Recording. Raman Venkataramani Seagate Technology (Joint work with Dieter Arnold)

Asymptotic Capacity Bounds for Magnetic Recording. Raman Venkataramani Seagate Technology (Joint work with Dieter Arnold) Asymptotic Capacity Bounds for Magnetic Recording Raman Venkataramani Seagate Technology (Joint work with Dieter Arnold) Outline Problem Statement Signal and Noise Models for Magnetic Recording Capacity

More information

The E8 Lattice and Error Correction in Multi-Level Flash Memory

The 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 information

Noise Modeling and Capacity Analysis for NANS Flash Memories

Noise Modeling and Capacity Analysis for NANS Flash Memories Noise Modeling and Capacity Analysis for NANS Flash Memories Qing Li Computer Sci. and Eng. Dept. Texas A & M University College Station, TX 77843 qingli@cse.tamu.edu Anxiao (Andrew) Jiang CSE and ECE

More information

THE introduction of Solid State Drives (SSD) based on

THE introduction of Solid State Drives (SSD) based on IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 63, NO. 9, SEPTEMBER 015 3069 Adaptive Read Thresholds for NAND Flash Borja Peleato, Member, IEEE, Rajiv Agarwal, Student Member, IEEE, John M. Cioffi, Fellow,

More information

One-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information

One-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information One-Bit LDPC Message Passing Decoding Based on Maximization of Mutual Information ZOU Sheng and Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan University of

More information

TOWARDS MINIMIZING READ TIME FOR NAND FLASH

TOWARDS MINIMIZING READ TIME FOR NAND FLASH TOWARDS MINIMIZING READ TIME FOR NAND FLASH Borja Peleato, Rajiv Agarwal, John Cioffi Stanford University Stanford CA 94305-950 Minghai Qin, Paul H. Siegel University of California, San Diego La Jolla,

More information

One Lesson of Information Theory

One Lesson of Information Theory Institut für One Lesson of Information Theory Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/

More information

Low 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 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 information

Codes on graphs and iterative decoding

Codes 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 information

/12/$ IEEE 486

/12/$ IEEE 486 International Conference on Computing, Networking and Communications, Data Storage Technology and Applications Symposium Characterization and Error-Correcting Codes for TLC Flash Memories Eitan Yaakobi,

More information

The PPM Poisson Channel: Finite-Length Bounds and Code Design

The PPM Poisson Channel: Finite-Length Bounds and Code Design August 21, 2014 The PPM Poisson Channel: Finite-Length Bounds and Code Design Flavio Zabini DEI - University of Bologna and Institute for Communications and Navigation German Aerospace Center (DLR) Balazs

More information

Tackling Intracell Variability in TLC Flash Through Tensor Product Codes

Tackling Intracell Variability in TLC Flash Through Tensor Product Codes Tackling Intracell Variability in TLC Flash Through Tensor Product Codes Ryan Gabrys, Eitan Yaakobi, Laura Grupp, Steven Swanson, Lara Dolecek University of California, Los Angeles University of California,

More information

Advanced Flash and Nano-Floating Gate Memories

Advanced Flash and Nano-Floating Gate Memories Advanced Flash and Nano-Floating Gate Memories Mater. Res. Soc. Symp. Proc. Vol. 1337 2011 Materials Research Society DOI: 10.1557/opl.2011.1028 Scaling Challenges for NAND and Replacement Memory Technology

More information

Optimizing Flash based Storage Systems

Optimizing Flash based Storage Systems Optimizing Flash based Storage Systems 1 Lifetime Reliability Latency Throughput 2 Projects Reliability/Latency/Throughput: Error Correction Code (ECC) Parallelization and Incremental Redundancy Lifetime:

More information

Error Control Codes for Memories

Error Control Codes for Memories The 2 th Korea Test Conference Error Control Codes for Memories June 22, 2 Jun Jin Kong, Ph.D. (jjkong@samsung.com) Samsung Electronics Co., Ltd. (Memory) Biography of Jun Jin Kong Brief History Present:

More information

Lecture 4. Capacity of Fading Channels

Lecture 4. Capacity of Fading Channels 1 Lecture 4. Capacity of Fading Channels Capacity of AWGN Channels Capacity of Fading Channels Ergodic Capacity Outage Capacity Shannon and Information Theory Claude Elwood Shannon (April 3, 1916 February

More information

Coding theory: Applications

Coding theory: Applications INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts

More information

ITCT Lecture IV.3: Markov Processes and Sources with Memory

ITCT Lecture IV.3: Markov Processes and Sources with Memory ITCT Lecture IV.3: Markov Processes and Sources with Memory 4. Markov Processes Thus far, we have been occupied with memoryless sources and channels. We must now turn our attention to sources with memory.

More information

Iterative Timing Recovery

Iterative Timing Recovery Iterative Timing Recovery John R. Barry School of Electrical and Computer Engineering, Georgia Tech Atlanta, Georgia U.S.A. barry@ece.gatech.edu 0 Outline Timing Recovery Tutorial Problem statement TED:

More information

Noise and Interference Characterization for MLC Flash Memories

Noise and Interference Characterization for MLC Flash Memories International Conference on Computing, Networking and Communications Invited Position Paper Track Noise and Interference Characterization for MLC Flash Memories Jaekyun Moon, Jaehyeong No Department of

More information

IBM Research Report. Notes on Reliability Models for Non-MDS Erasure Codes

IBM Research Report. Notes on Reliability Models for Non-MDS Erasure Codes RJ10391 (A0610-035) October 24, 2006 Computer Science IBM Research Report Notes on Reliability Models for Non-MDS Erasure Codes James Lee Hafner, KK Rao IBM Research Division Almaden Research Center 650

More information

Discrete Memoryless Channels with Memoryless Output Sequences

Discrete Memoryless Channels with Memoryless Output Sequences Discrete Memoryless Channels with Memoryless utput Sequences Marcelo S Pinho Department of Electronic Engineering Instituto Tecnologico de Aeronautica Sao Jose dos Campos, SP 12228-900, Brazil Email: mpinho@ieeeorg

More information

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture) ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Read and Write Voltage Signal Optimization for Multi- Level-Cell (MLC) NAND Flash Memory Author(s) Aslam,

More information

Codes on graphs and iterative decoding

Codes 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 information

Computation of Information Rates from Finite-State Source/Channel Models

Computation of Information Rates from Finite-State Source/Channel Models Allerton 2002 Computation of Information Rates from Finite-State Source/Channel Models Dieter Arnold arnold@isi.ee.ethz.ch Hans-Andrea Loeliger loeliger@isi.ee.ethz.ch Pascal O. Vontobel vontobel@isi.ee.ethz.ch

More information

FEEDBACK does not increase the capacity of a discrete

FEEDBACK does not increase the capacity of a discrete 1 Sequential Differential Optimization of Incremental Redundancy Transmission Lengths: An Example with Tail-Biting Convolutional Codes Nathan Wong, Kasra Vailinia, Haobo Wang, Sudarsan V. S. Ranganathan,

More information

The Continuing Miracle of Information Storage Technology Paul H. Siegel Director, CMRR University of California, San Diego

The Continuing Miracle of Information Storage Technology Paul H. Siegel Director, CMRR University of California, San Diego The Continuing Miracle of Information Storage Technology Paul H. Siegel Director, CMRR University of California, San Diego 10/15/01 1 Outline The Shannon Statue A Miraculous Technology Information Theory

More information

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code. Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional

More information

Recent Results on Input-Constrained Erasure Channels

Recent Results on Input-Constrained Erasure Channels Recent Results on Input-Constrained Erasure Channels A Case Study for Markov Approximation July, 2017@NUS Memoryless Channels Memoryless Channels Channel transitions are characterized by time-invariant

More information

Error-Correcting Schemes with Dynamic Thresholds in Nonvolatile Memories

Error-Correcting Schemes with Dynamic Thresholds in Nonvolatile Memories 2 IEEE International Symposium on Information Theory Proceedings Error-Correcting Schemes with Dynamic Thresholds in Nonvolatile Memories Hongchao Zhou Electrical Engineering Department California Institute

More information

Shannon s noisy-channel theorem

Shannon s noisy-channel theorem Shannon s noisy-channel theorem Information theory Amon Elders Korteweg de Vries Institute for Mathematics University of Amsterdam. Tuesday, 26th of Januari Amon Elders (Korteweg de Vries Institute for

More information

The Poisson Channel with Side Information

The Poisson Channel with Side Information The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH

More information

Decomposition Methods for Large Scale LP Decoding

Decomposition Methods for Large Scale LP Decoding Decomposition Methods for Large Scale LP Decoding Siddharth Barman Joint work with Xishuo Liu, Stark Draper, and Ben Recht Outline Background and Problem Setup LP Decoding Formulation Optimization Framework

More information

Feedback Capacity of a Class of Symmetric Finite-State Markov Channels

Feedback Capacity of a Class of Symmetric Finite-State Markov Channels Feedback Capacity of a Class of Symmetric Finite-State Markov Channels Nevroz Şen, Fady Alajaji and Serdar Yüksel Department of Mathematics and Statistics Queen s University Kingston, ON K7L 3N6, Canada

More information

Joint Equalization and Decoding for Nonlinear Two-Dimensional Intersymbol Interference Channels with Application to Optical Storage

Joint Equalization and Decoding for Nonlinear Two-Dimensional Intersymbol Interference Channels with Application to Optical Storage Joint Equalization and Decoding for Nonlinear Two-Dimensional Intersymbol Interference Channels with Application to Optical Storage 1 arxiv:cs/0509008v1 [cs.it] 4 Sep 2005 Naveen Singla and Joseph A. O

More information

Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels

Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering

More information

Variable Rate Channel Capacity. Jie Ren 2013/4/26

Variable Rate Channel Capacity. Jie Ren 2013/4/26 Variable Rate Channel Capacity Jie Ren 2013/4/26 Reference This is a introduc?on of Sergio Verdu and Shlomo Shamai s paper. Sergio Verdu and Shlomo Shamai, Variable- Rate Channel Capacity, IEEE Transac?ons

More information

Coding Techniques for Data Storage Systems

Coding 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 information

Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes

Progressive 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 information

Density Evolution and Functional Threshold. for the Noisy Min-Sum Decoder

Density Evolution and Functional Threshold. for the Noisy Min-Sum Decoder Density Evolution and Functional Threshold 1 for the Noisy Min-Sum Decoder C. Kameni Ngassa,#, V. Savin, E. Dupraz #, D. Declercq # CEA-LETI, Minatec Campus, Grenoble, France, {christiane.kameningassa,

More information

Lecture 9 Polar Coding

Lecture 9 Polar Coding Lecture 9 Polar Coding I-Hsiang ang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 29, 2015 1 / 25 I-Hsiang ang IT Lecture 9 In Pursuit of Shannon s Limit Since

More information

EXTENDING THE DORSCH DECODER FOR EFFICIENT SOFT DECISION DECODING OF LINEAR BLOCK CODES SEAN MICHAEL COLLISON

EXTENDING THE DORSCH DECODER FOR EFFICIENT SOFT DECISION DECODING OF LINEAR BLOCK CODES SEAN MICHAEL COLLISON EXTENDING THE DORSCH DECODER FOR EFFICIENT SOFT DECISION DECODING OF LINEAR BLOCK CODES By SEAN MICHAEL COLLISON A thesis submitted in partial fulfillment of the requirements for the degree of MASTER OF

More information

Chapter 7: Channel coding:convolutional codes

Chapter 7: Channel coding:convolutional codes Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication

More information

The Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels

The Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels The Effect of Memory Order on the Capacity of Finite-State Markov and Flat-Fading Channels Parastoo Sadeghi National ICT Australia (NICTA) Sydney NSW 252 Australia Email: parastoo@student.unsw.edu.au Predrag

More information

ELG 5372 Error Control Coding. Claude D Amours Lecture 2: Introduction to Coding 2

ELG 5372 Error Control Coding. Claude D Amours Lecture 2: Introduction to Coding 2 ELG 5372 Error Control Coding Claude D Amours Leture 2: Introdution to Coding 2 Deoding Tehniques Hard Deision Reeiver detets data before deoding Soft Deision Reeiver quantizes reeived data and deoder

More information

A Discrete Channel Model for Capturing Memory and Soft-Decision Information: A Capacity Study

A Discrete Channel Model for Capturing Memory and Soft-Decision Information: A Capacity Study A Discrete Channel Model for Capturing Memory and Soft-Decision Information: A Capacity Study Cecilio Pimentel Department of Electronics and Systems Federal University of Pernambuco Recife, PE, 507-970,

More information

Basic Principles of Video Coding

Basic Principles of Video Coding Basic Principles of Video Coding Introduction Categories of Video Coding Schemes Information Theory Overview of Video Coding Techniques Predictive coding Transform coding Quantization Entropy coding Motion

More information

Introduction to Low-Density Parity Check Codes. Brian Kurkoski

Introduction 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 information

Constructing Polar Codes Using Iterative Bit-Channel Upgrading. Arash Ghayoori. B.Sc., Isfahan University of Technology, 2011

Constructing Polar Codes Using Iterative Bit-Channel Upgrading. Arash Ghayoori. B.Sc., Isfahan University of Technology, 2011 Constructing Polar Codes Using Iterative Bit-Channel Upgrading by Arash Ghayoori B.Sc., Isfahan University of Technology, 011 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree

More information

Blind phase/frequency synchronization with low-precision ADC: a Bayesian approach

Blind phase/frequency synchronization with low-precision ADC: a Bayesian approach Blind phase/frequency synchronization with low-precision ADC: a Bayesian approach Aseem Wadhwa, Upamanyu Madhow Department of ECE, UCSB 1/26 Modern Communication Receiver Architecture Analog Digital TX

More information

Error Floors of LDPC Coded BICM

Error Floors of LDPC Coded BICM Electrical and Computer Engineering Conference Papers, Posters and Presentations Electrical and Computer Engineering 2007 Error Floors of LDPC Coded BICM Aditya Ramamoorthy Iowa State University, adityar@iastate.edu

More information

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

ESE 570: Digital Integrated Circuits and VLSI Fundamentals ESE 570: Digital Integrated Circuits and VLSI Fundamentals Lec 19: March 29, 2018 Memory Overview, Memory Core Cells Today! Charge Leakage/Charge Sharing " Domino Logic Design Considerations! Logic Comparisons!

More information

NUMERICAL COMPUTATION OF THE CAPACITY OF CONTINUOUS MEMORYLESS CHANNELS

NUMERICAL COMPUTATION OF THE CAPACITY OF CONTINUOUS MEMORYLESS CHANNELS NUMERICAL COMPUTATION OF THE CAPACITY OF CONTINUOUS MEMORYLESS CHANNELS Justin Dauwels Dept. of Information Technology and Electrical Engineering ETH, CH-8092 Zürich, Switzerland dauwels@isi.ee.ethz.ch

More information

Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check Codes in the Presence of Burst Noise

Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check Codes in the Presence of Burst Noise Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 5-2012 Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check

More information

Binary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity 1

Binary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity 1 5 Conference on Information Sciences and Systems, The Johns Hopkins University, March 6 8, 5 inary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity Ahmed O.

More information

Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel

Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Brian M. Kurkoski, Paul H. Siegel, and Jack K. Wolf Department of Electrical and Computer Engineering

More information

Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes

Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes Single-Gaussian Messages and Noise Thresholds for Low-Density Lattice Codes Brian M. Kurkoski, Kazuhiko Yamaguchi and Kingo Kobayashi kurkoski@ice.uec.ac.jp Dept. of Information and Communications Engineering

More information

4 An Introduction to Channel Coding and Decoding over BSC

4 An Introduction to Channel Coding and Decoding over BSC 4 An Introduction to Channel Coding and Decoding over BSC 4.1. Recall that channel coding introduces, in a controlled manner, some redundancy in the (binary information sequence that can be used at the

More information

Advances in Error Control Strategies for 5G

Advances in Error Control Strategies for 5G Advances in Error Control Strategies for 5G Jörg Kliewer The Elisha Yegal Bar-Ness Center For Wireless Communications And Signal Processing Research 5G Requirements [Nokia Networks: Looking ahead to 5G.

More information

Joint Iterative Decoding of LDPC Codes and Channels with Memory

Joint Iterative Decoding of LDPC Codes and Channels with Memory Joint Iterative Decoding of LDPC Codes and Channels with Memory Henry D. Pfister and Paul H. Siegel University of California, San Diego 3 rd Int l Symposium on Turbo Codes September 1, 2003 Outline Channels

More information

Dr. Cathy Liu Dr. Michael Steinberger. A Brief Tour of FEC for Serial Link Systems

Dr. 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 information

! Charge Leakage/Charge Sharing. " Domino Logic Design Considerations. ! Logic Comparisons. ! Memory. " Classification. " ROM Memories.

! Charge Leakage/Charge Sharing.  Domino Logic Design Considerations. ! Logic Comparisons. ! Memory.  Classification.  ROM Memories. ESE 57: Digital Integrated Circuits and VLSI Fundamentals Lec 9: March 9, 8 Memory Overview, Memory Core Cells Today! Charge Leakage/ " Domino Logic Design Considerations! Logic Comparisons! Memory " Classification

More information

Belief-Propagation Decoding of LDPC Codes

Belief-Propagation Decoding of LDPC Codes LDPC Codes: Motivation Belief-Propagation Decoding of LDPC Codes Amir Bennatan, Princeton University Revolution in coding theory Reliable transmission, rates approaching capacity. BIAWGN, Rate =.5, Threshold.45

More information

An Introduction to Low Density Parity Check (LDPC) Codes

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 information

THE term rank modulation refers to the representation of information by permutations. This method

THE term rank modulation refers to the representation of information by permutations. This method Rank-Modulation Rewrite Coding for Flash Memories Eyal En Gad, Eitan Yaakobi, Member, IEEE, Anxiao (Andrew) Jiang, Senior Member, IEEE, and Jehoshua Bruck, Fellow, IEEE 1 Abstract The current flash memory

More information

The Channel Capacity of One and Two-Dimensional Constrained Codes. Xuerong Yong Department of Computer Science Hong Kong UST

The Channel Capacity of One and Two-Dimensional Constrained Codes. Xuerong Yong Department of Computer Science Hong Kong UST The Channel Capacity of One and Two-Dimensional Constrained Codes Xuerong Yong Department of Computer Science Hong Kong UST OUTLINE 1. Introduction 2. Capacity and Its Properties 3. Examples of Previous

More information

Practical Polar Code Construction Using Generalised Generator Matrices

Practical Polar Code Construction Using Generalised Generator Matrices Practical Polar Code Construction Using Generalised Generator Matrices Berksan Serbetci and Ali E. Pusane Department of Electrical and Electronics Engineering Bogazici University Istanbul, Turkey E-mail:

More information

A REDUCED COMPLEXITY TWO-DIMENSIONAL BCJR DETECTOR FOR HOLOGRAPHIC DATA STORAGE SYSTEMS WITH PIXEL MISALIGNMENT

A REDUCED COMPLEXITY TWO-DIMENSIONAL BCJR DETECTOR FOR HOLOGRAPHIC DATA STORAGE SYSTEMS WITH PIXEL MISALIGNMENT A REDUCED COMPLEXITY TWO-DIMENSIONAL BCJR DETECTOR FOR HOLOGRAPHIC DATA STORAGE SYSTEMS WITH PIXEL MISALIGNMENT 1 S. Iman Mossavat, 2 J.W.M.Bergmans 1 iman@nus.edu.sg 1 National University of Singapore,

More information

Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information

Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information 204 IEEE International Symposium on Information Theory Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information Omur Ozel, Kaya Tutuncuoglu 2, Sennur Ulukus, and Aylin Yener

More information

ELEC546 Review of Information Theory

ELEC546 Review of Information Theory ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random

More information

Performance of LDPC Codes Under Faulty Iterative Decoding

Performance of LDPC Codes Under Faulty Iterative Decoding Performance of LDPC Codes Under Faulty Iterative Decoding Lav R. Varshney 1 Abstract arxiv:0806.115v3 [cs.it] 8 May 010 Departing from traditional communication theory where decoding algorithms are assumed

More information

Multiple Gate CMOS and Beyond

Multiple Gate CMOS and Beyond Multiple CMOS and Beyond Dept. of EECS, KAIST Yang-Kyu Choi Outline 1. Ultimate Scaling of MOSFETs - 3nm Nanowire FET - 8nm Non-Volatile Memory Device 2. Multiple Functions of MOSFETs 3. Summary 2 CMOS

More information

Lecture 12. Block Diagram

Lecture 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 information

Developing IoT-Based Factory Automation Using F-RAM

Developing IoT-Based Factory Automation Using F-RAM Developing IoT-Based Factory Automation Using F-RAM Douglas Mitchell Flash Memory Summit 2018 Santa Clara, CA 1 INDUSTRIAL SYSTEMS TODAY Industry 4.0 The smart factory, Cyber-physical systems monitor factory

More information

CRYOGENIC DRAM BASED MEMORY SYSTEM FOR SCALABLE QUANTUM COMPUTERS: A FEASIBILITY STUDY

CRYOGENIC DRAM BASED MEMORY SYSTEM FOR SCALABLE QUANTUM COMPUTERS: A FEASIBILITY STUDY CRYOGENIC DRAM BASED MEMORY SYSTEM FOR SCALABLE QUANTUM COMPUTERS: A FEASIBILITY STUDY MEMSYS-2017 SWAMIT TANNU DOUG CARMEAN MOINUDDIN QURESHI Why Quantum Computers? 2 Molecule and Material Simulations

More information

5. Density evolution. Density evolution 5-1

5. Density evolution. Density evolution 5-1 5. Density evolution Density evolution 5-1 Probabilistic analysis of message passing algorithms variable nodes factor nodes x1 a x i x2 a(x i ; x j ; x k ) x3 b x4 consider factor graph model G = (V ;

More information

Redundant Array of Independent Disks

Redundant Array of Independent Disks Redundant Array of Independent Disks Yashwant K. Malaiya 1 Redundant Array of Independent Disks (RAID) Enables greater levels of performance and/or reliability How? By concurrent use of two or more hard

More information

Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes

Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel 2009 IEEE International

More information

Channel Capacity and Soft-Decision Decoding of LDPC Codes for Spin-Torque Transfer Magnetic Random Access Memory (STT-MRAM)

Channel Capacity and Soft-Decision Decoding of LDPC Codes for Spin-Torque Transfer Magnetic Random Access Memory (STT-MRAM) Journal of Communications Vol. 8, No. 4, April 3 Channel Capacity and Soft-Decision Decoding of LDPC Codes for Spin-Torque Transfer Magnetic Random Access Memory (STT-MRAM) Kui Cai, Zhiliang Qin, and Bingin

More information

APPLICATIONS. Quantum Communications

APPLICATIONS. Quantum Communications SOFT PROCESSING TECHNIQUES FOR QUANTUM KEY DISTRIBUTION APPLICATIONS Marina Mondin January 27, 2012 Quantum Communications In the past decades, the key to improving computer performance has been the reduction

More information

Digital communication system. Shannon s separation principle

Digital communication system. Shannon s separation principle Digital communication system Representation of the source signal by a stream of (binary) symbols Adaptation to the properties of the transmission channel information source source coder channel coder modulation

More information

Mapper & De-Mapper System Document

Mapper & 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 information

On the Rate-Limited Gelfand-Pinsker Problem

On the Rate-Limited Gelfand-Pinsker Problem On the Rate-Limited Gelfand-Pinsker Problem Ravi Tandon Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 74 ravit@umd.edu ulukus@umd.edu Abstract

More information

6.451 Principles of Digital Communication II Wednesday, May 4, 2005 MIT, Spring 2005 Handout #22. Problem Set 9 Solutions

6.451 Principles of Digital Communication II Wednesday, May 4, 2005 MIT, Spring 2005 Handout #22. Problem Set 9 Solutions 6.45 Principles of Digital Communication II Wednesda, Ma 4, 25 MIT, Spring 25 Hand #22 Problem Set 9 Solutions Problem 8.3 (revised) (BCJR (sum-product) decoding of SPC codes) As shown in Problem 6.4 or

More information

Dynamic Programming Model Integer Programming Model

Dynamic Programming Model Integer Programming Model Dynamic Programming Model Integer Programming Model D. L. Bricker Dept of Mechanical & Industrial Engineering The University of Iowa Optimal Redundancy 4/1/2002 page 1 of 26 One of the systems of a communication

More information

Computing and Communications 2. Information Theory -Entropy

Computing and Communications 2. Information Theory -Entropy 1896 1920 1987 2006 Computing and Communications 2. Information Theory -Entropy Ying Cui Department of Electronic Engineering Shanghai Jiao Tong University, China 2017, Autumn 1 Outline Entropy Joint entropy

More information

Histogram-Based Flash Channel Estimation

Histogram-Based Flash Channel Estimation Histogram-Based Flash Channel Estimation Haobo Wang, Tsung-Yi Chen, and Richard D. Wesel whb12@ucla.edu, tsungyi.chen@northwestern.edu, wesel@ee.ucla.edu Abstract Current generation Flash devices experience

More information

Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation

Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation Georg Böcherer, Patrick Schulte, Fabian Steiner Chair for Communications Engineering patrick.schulte@tum.de April 29, 2015

More information

On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming

On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming On the Joint Decoding of LDPC Codes and Finite-State Channels via Linear Programming Byung-Hak Kim (joint with Henry D. Pfister) Texas A&M University College Station International Symposium on Information

More information