Published July 2011
| Submitted
Book Section - Chapter
Open
Compressed Encoding for Rank Modulation
Abstract
Rank modulation has been recently proposed as a scheme for storing information in flash memories. While rank modulation has advantages in improving write speed and endurance, the current encoding approach is based on the "push to the top" operation that is not efficient in the general case. We propose a new encoding procedure where a cell level is raised to be higher than the minimal necessary subset -instead of all - of the other cell levels. This new procedure leads to a significantly more compressed (lower charge levels) encoding. We derive an upper bound for a family of codes that utilize the proposed encoding procedure, and consider code constructions that achieve that bound for several special cases.
Additional Information
© 2011 IEEE. Date of Current Version:03 October 2011. This work was supported in part by the NSF CAREER Award CCF-0747415, the NSF grant ECCS-0802107, and by an NSF-NRI award.Attached Files
Submitted - 1108.2741.pdf
Files
1108.2741.pdf
Files
(205.2 kB)
Name | Size | Download all |
---|---|---|
md5:b3d75ab0183f781d1103a30d7f563f92
|
205.2 kB | Preview Download |
Additional details
- Eprint ID
- 29995
- DOI
- 10.1109/ISIT.2011.6034264
- Resolver ID
- CaltechAUTHORS:20120405-104551517
- CCF-0747415
- NSF
- ECCS-0802107
- NSF
- Created
-
2012-04-05Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 12289202