Trudy SPIIRAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Informatics and Automation:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy SPIIRAN, 2019, Issue 18, volume 5, Pages 1149–1181
DOI: https://doi.org/10.15622/sp.2019.18.5.1149-1181
(Mi trspy1077)
 

This article is cited in 2 scientific papers (total in 2 papers)

Information Security

Concatenated coding for multilevel flash memory with low error correction capabilities in outer stage

F. A. Taubin, A. N. Trofimov

Saint Petersburg State University of Aerospace Instrumentation (SUAI)
Abstract: One of the approaches to organization of error correcting coding for multilevel flash memory is based on concatenated construction, in particular, on multidimensional lattices for inner coding. A characteristic feature of such structures is the dominance of the complexity of the outer decoder in the total decoder complexity. Therefore the concatenated construction with low-complexity outer decoder may be attractive since in practical applications the decoder complexity is the crucial limitation for the usage of the error correction coding.
We consider a concatenated coding scheme for multilevel flash memory with the Barnes-Wall lattice based codes as an inner code and the Reed–Solomon code with correction up to 4…5 errors as an outer one.
Performance analysis is fulfilled for a model characterizing the basic physical features of a flash memory cell with non-uniform target voltage levels and noise variance dependent on the recorded value (input-dependent additive Gaussian noise, ID-AGN). For this model we develop a modification of our approach for evaluation the error probability for the inner code. This modification uses the parallel structure of the inner code trellis which significantly reduces the computational complexity of the performance estimation. We present numerical examples of achievable recording density for the Reed–Solomon codes with correction up to four errors as the outer code for wide range of the retention time and number of write/read cycles.
Keywords: concatenated code, Barnes–Wall lattices, Reed–Solomon code, multilevel flash memory, decoding error probability, decoding complexity.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 2.2716.2014/К
2.9214.2017/ БЧ
This research is supported by the Ministry of Education and Science of the Russian Federation in the framework of the project part of the government task in the field of scientific activity on assignment No. 2.2716.2014/K, and within the framework of the government task in the field of scientific activity for 2017–2019 on assignment No. 2.9214.2017/БЧ.
Received: 02.04.2019
Bibliographic databases:
Document Type: Article
UDC: 621.391
Language: Russian
Citation: F. A. Taubin, A. N. Trofimov, “Concatenated coding for multilevel flash memory with low error correction capabilities in outer stage”, Tr. SPIIRAN, 18:5 (2019), 1149–1181
Citation in format AMSBIB
\Bibitem{TauTro19}
\by F.~A.~Taubin, A.~N.~Trofimov
\paper Concatenated coding for multilevel flash memory with low error correction capabilities in outer stage
\jour Tr. SPIIRAN
\yr 2019
\vol 18
\issue 5
\pages 1149--1181
\mathnet{http://mi.mathnet.ru/trspy1077}
\crossref{https://doi.org/10.15622/sp.2019.18.5.1149-1181}
\elib{https://elibrary.ru/item.asp?id=40938368}
Linking options:
  • https://www.mathnet.ru/eng/trspy1077
  • https://www.mathnet.ru/eng/trspy/v18/i5/p1149
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Informatics and Automation
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025