Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes
Date
2019-08-01
Author
Hareedy, Ahmed
Kuditipudi, Rohith
Calderbank, Robert
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
120
views
0
downloads
Cite This
© 2019 IEEE.In order to meet the demands of data-hungry applications, data storage devices are required to be increasingly denser. Various sources of error appear with this increase in density. Multi-dimensional (MD) graph-based codes are capable of mitigating error sources like interference and channel non-uniformity in dense storage devices. Recently, a technique was proposed to enhance the performance of MD spatially-coupled codes that are based on circulants. The technique carefully relocates circulants to minimize the number of short cycles. However, cycles become more detrimental when they combine together to form more advanced objects, e.g., absorbing sets, including low-weight codewords. In this paper, we show how MD relocations can be exploited to minimize the number of detrimental objects in the graph of an MD code. Moreover, we demonstrate the savings in the number of relocation arrangements earned by focusing on objects rather than cycles. Our technique is applicable to a wide variety of one-dimensional (OD) codes. Simulation results reveal significant lifetime gains in practical Flash systems achieved by MD codes designed using our technique compared with OD codes having similar parameters.
URI
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081098259&origin=inward
https://hdl.handle.net/11511/98349
DOI
https://doi.org/10.1109/itw44776.2019.8989395
Conference Name
2019 IEEE Information Theory Workshop, ITW 2019
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Managing Device Lifecycle: Reconfigurable Constrained Codes for M/T/Q/P-LC Flash Memories
Hareedy, Ahmed; Dabak, Beyza; Calderbank, Robert (2021-01-01)
© 1963-2012 IEEE.Flash memory devices are winning the competition for storage density against magnetic recording devices. This outcome results from advances in physics that allow storage of more than one bit per cell, coupled with advances in signal processing that reduce the effect of physical instabilities. Constrained codes are used in storage to avoid problematic patterns, and thus prevent errors from happening. Recently, we introduced binary symmetric lexicographically-ordered constrained codes (LOCO c...
Improving performance of network intrusion detection systems through concurrent mechanisms
Atakan, Mustafa; Şener, Cevat; Department of Computer Engineering (2003)
As the bandwidth of present networks gets larger than the past, the demand of Network Intrusion Detection Systems (NIDS) that function in real time becomes the major requirement for high-speed networks. If these systems are not fast enough to process all network traffic passing, some malicious security violations may take role using this drawback. In order to make that kind of applications schedulable, some concurrency mechanism is introduced to the general flowchart of their algorithm. The principal aim is...
Boosting the efficiency of organic solar cells via plasmonic gold nanoparticles and thiol functionalized conjugated polymer
Karakurt, Oğuzhan; Alemdar, Eda; Erer, Mert Can; Cevher, Duygu; Gulmez, Selin; Taylan, Umut; Cevher, Sevki Can; Ozsoy, Gonul Hizalan; Ortac, Bulend; Çırpan, Ali (2022-12-01)
© 2022 Elsevier LtdConjugated polymers are promising low-cost, lightweight, and flexible candidates for scalable photovoltaic applications to establish decarbonized energy technologies. However, they possess deficiencies in terms of their lower charge mobility and exciton diffusion length compared to their inorganic counterparts, impeding the efficient charge extraction at high active layer thickness values. In this manner, active layer composition should be tuned to improve light harvesting enabling effici...
Online embedding and clustering of data streams
Zubaroǧlu, Alaettin; Atalay, Mehmet Volkan (2019-11-20)
© 2019 Association for Computing Machinery.Number of connected devices is steadily increasing and these devices continuously generate data streams. These data streams are often high dimensional and contain concept drift. Real-time processing of data streams is arousing interest despite many challenges. Clustering is a method that does not need labeled instances (it is unsupervised) and it can be applied with less prior information about the data. These properties make clustering one of the most suitable met...
Improving data freshness in random access channels
Atabay, Doğa Can; Uysal, Elif; Department of Electrical and Electronics Engineering (2019)
The conventional network performance metrics such as throughput and delay do not accurately reflect the needs of some applications. Age of information (AoI) is a newly proposed metric that indicates the freshness of information from the receiver’s perspective. In this work, a network of multiple transmitter devices continuously updating a central station over an error-free multiaccess channel is studied. The average AoI expressions are derived for Round-Robin, Slotted ALOHA, and a proposed random access str...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Hareedy, R. Kuditipudi, and R. Calderbank, “Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes,” presented at the 2019 IEEE Information Theory Workshop, ITW 2019, Visby, İsveç, 2019, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85081098259&origin=inward.