Hareedy et al., 2019 - Google Patents
Asymmetric LOCO codes: Constrained codes for Flash memoriesHareedy et al., 2019
View PDF- Document ID
- 60064749623564764
- Author
- Hareedy A
- Calderbank R
- Publication year
- Publication venue
- 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
External Links
Snippet
In data storage and data transmission, certain patterns are more likely to be subject to error when written (transmitted) onto the media. In magnetic recording systems with binary data and bipolar non-return-to-zero signaling, patterns that have insufficient separation between …
- 230000015654 memory 0 title description 12
Classifications
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M5/00—Conversion of the form of the representation of individual digits
- H03M5/02—Conversion to or from representation by pulses
- H03M5/04—Conversion to or from representation by pulses the pulses having two levels
- H03M5/14—Code representation, e.g. transition, for a given bit cell depending on the information in one or more adjacent bit cells, e.g. delay modulation code, double density code
- H03M5/145—Conversion to or from block codes or representations thereof
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/14—Digital recording or reproducing using self-clocking codes
- G11B20/1403—Digital recording or reproducing using self-clocking codes characterised by the use of two levels
- G11B20/1423—Code representation depending on subsequent bits, e.g. delay modulation, double density code, Miller code
- G11B20/1426—Code representation depending on subsequent bits, e.g. delay modulation, double density code, Miller code conversion to or from block codes or representations thereof
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/10009—Improvement or modification of read or write signals
- G11B20/10046—Improvement or modification of read or write signals filtering or equalising, e.g. setting the tap weights of an FIR filter
-
- G—PHYSICS
- G11—INFORMATION STORAGE
- G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
- G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
- G11B20/10—Digital recording or reproducing
- G11B20/14—Digital recording or reproducing using self-clocking codes
- G11B20/1488—Digital recording or reproducing using self-clocking codes characterised by the use of three levels
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/65—Purpose and implementation aspects
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/38—Synchronous or start-stop systems, e.g. for Baudot code
- H04L25/40—Transmitting circuits; Receiving circuits
- H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels; Baseband coding techniques specific to data transmission systems
-
- H—ELECTRICITY
- H03—BASIC ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; Arrangements for supplying electrical power along data transmission lines
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101114057B1 (en) | Rll encoding | |
| Hareedy et al. | Asymmetric LOCO codes: Constrained codes for Flash memories | |
| Hareedy et al. | LOCO codes: Lexicographically-ordered constrained codes | |
| CN101341658B (en) | A coder and a method of coding for codes with a parity-complementary word assignment having a constraint of d='1', r='2' | |
| KR20060061261A (en) | Techniques for Applying Modulation Constraints to Data Using Periodically Changing Symbol Mappings | |
| JP2004289520A (en) | Encoding device and encoding method, recording medium, and program | |
| Hareedy et al. | The secret arithmetic of patterns: A general method for designing constrained codes based on lexicographic indexing | |
| Horiguchi et al. | An optimization of modulation codes in digital recording | |
| KR101211244B1 (en) | Modulation coding and decoding | |
| de Souza et al. | Constrained systems with unconstrained positions | |
| Centers et al. | Power spectra of constrained codes with level-based signaling: Overcoming finite-length challenges | |
| US7786905B2 (en) | Modulation coding and decoding | |
| JP5011116B2 (en) | Method and system for performing information encoding and decoding using modulation constraints and error control | |
| İrimağzı et al. | Protecting the future of information: LOCO coding with error detection for DNA data storage | |
| Cai et al. | On the design of spectrum shaping codes for high-density data storage | |
| Özbayrak et al. | Low-complexity constrained coding schemes for two-dimensional magnetic recording | |
| KR19980031982A (en) | PRML code generation method of data storage device | |
| Hareedy et al. | Q-ary asymmetric LOCO codes: Constrained codes supporting flash evolution | |
| Hareedy et al. | Read-and-run constrained coding for modern flash devices | |
| Hareedy et al. | A new family of constrained codes with applications in data storage | |
| US6574773B1 (en) | Cost-effective high-throughput enumerative ENDEC employing a plurality of segmented compare tables | |
| Immink | Constructions of almost block-decodable runlength-limited codes | |
| Immink | Error detecting runlength-limited sequences | |
| Chaichanavong et al. | Optimal block-type-decodable encoders for constrained systems | |
| McLaughlin et al. | One-pairs codes for partial response magnetic recording |