Learning to Reconfigure: Using Device Status to Select the Right Constrained Coding Scheme
Not on the map. Why?
Abstract (arXiv)
In the age of data revolution, a modern storage~or transmission system typically requires different levels of protection. For example, the coding technique used to fortify data in a modern storage system when the device is fresh cannot be the same as that used when the device ages. Therefore, providing reconfigurable coding schemes and devising an effective way to perform this reconfiguration are key to extending the device lifetime. We focus on constrained coding schemes for the emerging two-dimensional magnetic recording (TDMR) technology. Recently, we have designed efficient lexicographically-ordered constrained (LOCO) coding schemes for various stages of the TDMR device lifetime, focusing on the elimination of isolation patterns, and demonstrated remarkable gains by using them. LOCO codes are naturally reconfigurable, and we exploit this feature in our work. Reconfiguration based on predetermined time stamps, which is what the industry adopts, neglects the actual device status. Instead, we propose offline and online learning methods to perform this task based on the device status. In offline learning, training data is assumed to be available throughout the time span of interest, while in online learning, we only use training data at specific time intervals to make consequential decisions. We fit the training data to polynomial equations that give the bit error rate in terms of TD density, then design an optimization problem in order to reach the optimal reconfiguration decisions to switch from a coding scheme to another. The objective is to maximize the storage capacity and/or minimize the decoding complexity. The problem reduces to a linear programming problem. We show that our solution is the global optimal based on problem characteristics, and we offer various experimental results that demonstrate the effectiveness of our approach in TDMR systems.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 34 references that are in the map. First posted on arXiv 24 Dec 2025.
Builds on
6 of 34 references.
References · 6
- 2020Non-Binary Constrained Codes for Two-Dimensional Magnetic Recordingcited by 1
- 2020The Secret Arithmetic of Patterns: A General Method for Designing Constrained Codes Based on Lexicographic Indexingcited by 1
- 2023Efficient Constrained Codes That Enable Page Separation in Modern Flash Memoriescited by 1
- 2023Eliminating Media Noise While Preserving Storage Capacity: Reconfigurable Constrained Codes for Two-Dimensional Magnetic Recordingcited by 1
- 2024Deep Transfer Learning-based Detection for Flash Memory Channelscited by 1
- 2025Adapt or Regress: Rate-Memory-Compatible Spatially-Coupled Codescited by 1
Built on by
Not cited yet.