DocumentCode
939709
Title
On the capacity of permanent memory
Author
Heegard, Chris
Volume
31
Issue
1
fYear
1985
fDate
1/1/1985 12:00:00 AM
Firstpage
34
Lastpage
42
Abstract
Many forms of digital memory have been developed for the permanent storage of information. These include keypunch cards, paper tapes, PROMs, photographic film and, more recently, digital optical disks. All these "write-once" memories have the property that once a "one" is written in a particular cell, this cell becomes irreversibly set at one. Thus, the ability to rewrite information in the memory is hampered by the existence of previously written ones. The problem of storing temporary data in permanent memory is examined here. Consider storing a sequence of
messages
in such a device. Let each message
consist of
bits and let the memory contain n cells. We say that a rate
-tuple
is achievable if we can store a sequence of messages at these rates for some
. The capacity
is the closure of the set of achievable rates. The capacity
for an optical disk-type memory is determined. This result is related to the work of Rivest and Shamir. A more general model for permanent memory is introduced. This model allows for the possibility of random disturbances (noise), larger input and output alphabets, more possible cell states, and a more flexible set of state transitions. An inner bound on the capacity region
for this model is presented. It is shown that this bound describes
in several instances.
messages
in such a device. Let each message
consist of
bits and let the memory contain n cells. We say that a rate
-tuple
is achievable if we can store a sequence of messages at these rates for some
. The capacity
is the closure of the set of achievable rates. The capacity
for an optical disk-type memory is determined. This result is related to the work of Rivest and Shamir. A more general model for permanent memory is introduced. This model allows for the possibility of random disturbances (noise), larger input and output alphabets, more possible cell states, and a more flexible set of state transitions. An inner bound on the capacity region
for this model is presented. It is shown that this bound describes
in several instances.Keywords
Coding/decoding; Memory management; Optical memories; Chromium; Costs; Information theory; Optical films; Optical noise; PROM;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1985.1056994
Filename
1056994
Link To Document