YoVDO

Understand ECC Support for NAND Flash Devices in Linux

Offered By: Linux Foundation via YouTube

Tags

Linux Courses Embedded Systems Courses Data Storage Courses Error-Correcting Codes Courses Memory Management Courses Device Drivers Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intricacies of Error Correcting Code (ECC) support for NAND Flash devices in Linux through this informative 36-minute conference talk by Miquèl Raynal from Bootlin. Delve into the fundamentals of Error Correcting Codes, redundancy, and their applications in communications and storage. Gain insights into NAND technology, understanding the ECC engine's role in write and read paths. Learn about key algorithms like Hamming and Reed-Solomon, and their implementation in the raw NAND world. Examine the current landscape for serial NANDs, external/pipelined ECC engines, and the factors influencing engine configuration. Discover SPI-NAND Bindings and the structure of NAND ECC engines. Conclude with a glimpse into future developments in this critical area of Linux device support.

Syllabus

Intro
Error Correcting Codes
Redundancy
ECCs in communications
Simplest algorithms
ECC for storage
NAND technology 102
ECC engine mission: write path
ECC engine mission: read path
Hamming algorithm
Reed-Solomon algorithm
The ECC engine in the raw NAND world
Current situation for serial NANDS
External/pipelined ECC engine
What describes ECC engines?
How is the engine's configuration chosen?
Engine and configuration selection
SPI-NAND Bindings
The final NAND ECC engine structure
What's next? ?


Taught by

Linux Foundation

Tags

Related Courses

Linux kernel Module and driver Programming for x86
Udemy
How to Use USB FTDI D2XX Drivers for Computer I/O Applications
Kevin Darrah via YouTube
NuttX for Embedded Linux Developers
Linux Foundation via YouTube
A Dive into Zephyr Device Driver Model
Linux Foundation via YouTube
An Introduction to EdgeX Foundry
Linux Foundation via YouTube