Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)

Channel Coding for Flash Memories

Cite This

Files in this item

Checksum: MD5:012677b6345ada9654a7176553806579

SPINNER, Jens, 2019. Channel Coding for Flash Memories [Dissertation]. Konstanz: University of Konstanz

@phdthesis{Spinner2019Chann-47839, title={Channel Coding for Flash Memories}, year={2019}, author={Spinner, Jens}, address={Konstanz}, school={Universität Konstanz} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dspace:hasBitstream rdf:resource=""/> <dcterms:issued>2019</dcterms:issued> <dcterms:hasPart rdf:resource=""/> <dcterms:title>Channel Coding for Flash Memories</dcterms:title> <bibo:uri rdf:resource=""/> <dc:date rdf:datatype="">2019-12-05T09:35:39Z</dc:date> <dcterms:abstract xml:lang="eng">Flash memories are non-volatile memory devices. The rapid development of flash technologies leads to higher storage density, but also to higher error rates. This dissertation considers this reliability problem of flash memories and investigates suitable error correction codes, e.g. BCH-codes and concatenated codes. First, the flash cells, their functionality and error characteristics are explained. Next, the mathematics of the employed algebraic code are discussed. Subsequently, generalized concatenated codes (GCC) are presented. Compared to the commonly used BCH codes, concatenated codes promise higher code rates and lower implementation complexity. This complexity reduction is achieved by dividing a long code into smaller components, which require smaller Galois-Field sizes. The algebraic decoding algorithms enable analytical determination of the block error rate. Thus, it is possible to guarantee very low residual error rates for flash memories. Besides the complexity reduction, general concatenated codes can exploit soft information. This so-called soft decoding is not practicable for long BCH-codes. In this dissertation, two soft decoding methods for GCC are presented and analyzed. These methods are based on the Chase decoding and the stack algorithm. The last method explicitly uses the generalized concatenated code structure, where the component codes are nested subcodes. This property supports the complexity reduction. Moreover, the two-dimensional structure of GCC enables the correction of error patterns with statistical dependencies. One chapter of the thesis demonstrates how the concatenated codes can be used to correct two-dimensional cluster errors. Therefore, a two-dimensional interleaver is designed with the help of Gaussian integers. This design achieves the correction of cluster errors with the best possible radius. Large parts of this works are dedicated to the question, how the decoding algorithms can be implemented in hardware. These hardware architectures, their throughput and logic size are presented for long BCH-codes and generalized concatenated codes. The results show that generalized concatenated codes are suitable for error correction in flash memories, especially for three-dimensional NAND memory systems used in industrial applications, where low residual errors must be guaranteed.</dcterms:abstract> <dc:contributor>Spinner, Jens</dc:contributor> <dcterms:isPartOf rdf:resource=""/> <dc:rights>terms-of-use</dc:rights> <dcterms:available rdf:datatype="">2019-12-05T09:35:39Z</dcterms:available> <dspace:isPartOfCollection rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:rights rdf:resource=""/> <dc:creator>Spinner, Jens</dc:creator> <dc:language>eng</dc:language> </rdf:Description> </rdf:RDF>

Downloads since Dec 5, 2019 (Information about access statistics)

Spinner_2-1ro71he3fo8zt0.pdf 754

This item appears in the following Collection(s)

Search KOPS


My Account