• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History
  • ورود / ثبت نام

عنوان
Spatially-Coupled Codes for Modern Data Storage Systems

پدید آورنده
Esfahanizadeh, Homa

موضوع

رده

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

NATIONAL BIBLIOGRAPHY NUMBER

Number
TL3wp2m4bq

LANGUAGE OF THE ITEM

.Language of Text, Soundtrack etc
انگلیسی

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Spatially-Coupled Codes for Modern Data Storage Systems
General Material Designation
[Thesis]
First Statement of Responsibility
Esfahanizadeh, Homa
Subsequent Statement of Responsibility
Dolecek, Lara

.PUBLICATION, DISTRIBUTION, ETC

Name of Publisher, Distributor, etc.
UCLA
Date of Publication, Distribution, etc.
2019

DISSERTATION (THESIS) NOTE

Body granting the degree
UCLA
Text preceding or following the note
2019

SUMMARY OR ABSTRACT

Text of Note
The volume of data continues to rapidly grow as information pours from various platforms. The huge amount of data needs to be transferred and stored with extremely high reliability. The error correcting codes (ECCs) are an integral part of modern-day communication, computation, and data storage systems in order to safeguard data against the adverse effects of noise and interference. The spatially-coupled (SC) codes are a class of graph-based ECCs that have recently emerged as an excellent choice for error correction in modern data storage and communication due to their outstanding performance, low decoding latency, and simple implementation. An SC code is constructed by coupling several instances of a block code into a single coupled chain. In the asymptotic limit of large code lengths, SC codes enjoy capacity achieving performance. Due to simplifying assumptions and averaging effects, results from the asymptotic domain are not readily translatable to the practical, finite-length setting. Despite this chasm, finite-length analysis of SC codes is still largely unexplored. We tackle the problem of finite-length optimized design of SC codes in the context of various channel models.First, we present a systematic framework with low computational complexity for designing finite-length SC codes with superior error floor performance. Next, we tailor our design method for various channel models by targeting the combinatorial objects in the graph of SC codes that are detrimental over these settings. Then, we generalize our framework for the finite-length analysis and design of irregular SC codes. Finally, we increase the coupling dimensionality, and we present a novel systematic framework to efficiently connect several SC codes and construct multi-dimensional spatially-coupled (MD-SC) codes.In this research, we use advanced mathematical techniques from algebra, combinatorics, graph theory, probability theory, and optimization theory to develop algorithms and design frameworks with affordable complexity. Our frameworks are especially beneficial for modern storage applications, e.g. magnetic-recording and Flash memories.

PERSONAL NAME - PRIMARY RESPONSIBILITY

Esfahanizadeh, Homa

PERSONAL NAME - SECONDARY RESPONSIBILITY

Dolecek, Lara

CORPORATE BODY NAME - SECONDARY RESPONSIBILITY

UCLA

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

p

[Thesis]
276903

a
Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival