EP0220718A2 - IC card - Google Patents

IC card Download PDF

Info

Publication number
EP0220718A2
EP0220718A2 EP86114972A EP86114972A EP0220718A2 EP 0220718 A2 EP0220718 A2 EP 0220718A2 EP 86114972 A EP86114972 A EP 86114972A EP 86114972 A EP86114972 A EP 86114972A EP 0220718 A2 EP0220718 A2 EP 0220718A2
Authority
EP
European Patent Office
Prior art keywords
sector
data
field
file
memory
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
EP86114972A
Other languages
German (de)
French (fr)
Other versions
EP0220718B1 (en
EP0220718A3 (en
Inventor
Yoshikazu Yorimoto
Masashi Takahashi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Toppan Inc
Original Assignee
Toppan Printing Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=17088969&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=EP0220718(A2) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Toppan Printing Co Ltd filed Critical Toppan Printing Co Ltd
Publication of EP0220718A2 publication Critical patent/EP0220718A2/en
Publication of EP0220718A3 publication Critical patent/EP0220718A3/en
Application granted granted Critical
Publication of EP0220718B1 publication Critical patent/EP0220718B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G11INFORMATION STORAGE
    • G11CSTATIC STORES
    • G11C29/00Checking stores for correct operation ; Subsequent repair; Testing stores during standby or offline operation
    • G11C29/70Masking faults in memories by using spares or by reconfiguring
    • G11C29/76Masking faults in memories by using spares or by reconfiguring using address translation or modifications
    • G11C29/765Masking faults in memories by using spares or by reconfiguring using address translation or modifications in solid state disks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/78Architectures of general purpose stored program computers comprising a single central processing unit
    • G06F15/7807System on chip, i.e. computer system on a single chip; System in package, i.e. computer system on one or more chips in a single package
    • G06F15/7814Specially adapted for real time processing, e.g. comprising hardware timers
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1008Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
    • G06F11/1068Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices in sector programmable memories, e.g. flash disk

Definitions

  • This invention relates to an IC (integrated cir­cuit) card, and more particularly to an IC card which contains a rewritable semiconductor memory.
  • IC card with data processing function has re­cently been put into practical use.
  • This IC card con­tains a central processing unit (CPU) and a rewritable data memory, such as an electrically erasable program­mable read only memory (EEPROM), or a random access memory (RAM) which is backed up by the battery.
  • the data memory is connected to the CPU.
  • the IC card has on its surface terminals for data transfer with the exter­nal device such as the terminal devices. The terminals are not necessary if data transfer is a non-contact type, for example, via a microwave or an optical beam.
  • This type of IC card can be considered to be a microcomputer in the shape of a card.
  • the IC card used for multi-purposes called a multi-use type IC card has been proposed.
  • the multi-use type IC a plurality of files are stored in the data memory, and the file access and file control must be controlled effectively.
  • the data memory in an IC card has been used in the following two ways.
  • the way (1) of the IC card memory has the following drawbacks.
  • the way (2) also involves the above problems (a) to (c).
  • An object of this invention is to provide an IC card with a rewritable data memory which can effectively use the memory.
  • Another object of this invention is to provide an IC card in which, in the data memory, the new file can be easily prepared, and the existing file can be easily expanded.
  • Yet another object of this invention is to provide an IC card which provides an exact and quick access to the files in the data memory.
  • a further object of this invention is to provide an IC card, in which, when there is a defective address, another normal address is used in place of the defective address, and therefore no abnormality can be seen from outside.
  • An additional object of this invention is to pro­vide an IC card which keeps high security among a plu­rality of files stored in the data memory.
  • an IC card comprising: a rewritable memory which is segmented into a plu­rality of sectors, and means for controlling the input and output of data to and from the memory, the control means including: means for chaining a plurality of sectors in accord­ance with the length of a file to be recorded, means for registering, in a predetermined sector, the sector chaining data of each file, and means for accessing a file based on the sector chaining data.
  • Fig. 1 is a block diagram illustrating an arrange­ment of IC card 10.
  • CPU 11 is connected to data bus 18 and address bus 19.
  • Data memory 12 is connected to data bus 18 via first port 15, and to address bus 19 via second port 16.
  • Data memory 12 is a rewritable memory such as an EEPROM or an RAM which is backed up by a bat­tery. Its memory capacity is 192 bytes and the memory area is segmented into 16 sectors each of 12 bytes. The capacity of 192 bytes is used here for ease of explana­tion, but it can be 16 K bytes, 64 K bytes, etc.
  • Data bus 18 and address bus 19 are also connected to program memory 13, RAM 14 and third port 17.
  • Program memory 13 is a read only memory.
  • RAM 14 is a memory for providing a working area when CPU 11 executes the program stored in program memory 13.
  • Third port 17 is connected to external processing unit 20 (so-called a terminal device) via serial I/O line 21.
  • Terminal device 20 feeds to IC card 10 clock pulse CLK, reset pluses RES, and power supply voltage Vcc. It also feeds write voltage Vpp when the write voltage other than Vcc is required and ground voltage GND.
  • Terminal device 20 and IC card 10 are electrically connected via the con­nector installed on the surface of IC card 10.
  • Terminal device 20 sends a processing instruction to third port 17 via I/O line 21.
  • CPU 11 receives the processing instruction via data bus 18, decodes the contents of the instruction, reads the necessary program from program memory 13, and then executes the program.
  • terminal device 20 accesses data memory 12 contain­ed in IC card 10
  • the logical address has to be used.
  • CPU 11 accesses data memory 12, the absolute ad­dress has to be used.
  • CPU 11 performs logical-absolute address conversion, using a formula (1) to be described later and outputs the absolute address to address bus 19 to access data memory 12.
  • the I/O data is transferred between CPU 11 and terminal device 20 via bidirectional data bus 18 and third port 17.
  • CPU 11 supplies to terminal device 20 the result of each processing, via data bus 18, third port 17 and I/O bus 21.
  • data memory 12 is seg­mented into 16 sectors each consisting of 12 bytes. These sectors are functionally classified into a data sector, a directory sector, an FCA (file control area) sector and an MCA (memory control area) sector. If necessary, a plurality of sectors are coupled in a chain fashion.
  • first to eighth bytes are data fields. Ninth and tenth bytes are PS and SS fields which store the numbers of the sectors preceding to and succeeding to that sector. Eleventh and twelfth bytes form SUM field for checking if each byte of that sector is proper or not.
  • the SUM field may be CRC-16, and EX-OR, CRC-8 or mere arithmetic sum. If EX-OR, CRC-8 or arithmetic sum is used, the SUM field may be constructed with one byte, not two bytes.
  • Fig. 2 shows a layout of the data sector.
  • Data field 30 is the field freely used by the user and the system.
  • the application file is constructed by chaining a plurality of data sectors, if necessary.
  • Fig. 3 shows a layout of the directory sector where the data of the application file is registered.
  • the directory sector is used to improve the speed of file access, and enables the quick calculation of file volume.
  • the directory sector can be used equivalent to the data sector, and therefore its size or the number of sectors can be expanded.
  • file name field 1 (1 byte)
  • TS top sector
  • LS last sector
  • US used sector
  • the top and last of a file are indicated by setting FF in PS field 5 and SS field 6.
  • Fig. 4 shows a layout of the memory control area (MCA) for storing the data how the entire memory area of the data memory is used.
  • Data fields necessary for the MCA sector are FTS fields 31 (1 byte), FLS field 32 (1 byte), NFS field 33 (1 byte) and DFF field 34 (1 byte), and needs the total of 4 bytes.
  • the data field contains the unused empty field of fifth to eighth bytes.
  • the top sector number of the unused sectors is registered in FTS field 31.
  • the last sector number of the unused sectors is registered in FLS field 32.
  • the total number of unused sectors are registered in NFS field 33.
  • DEF field 34 registers the sector number of the sector having a directory of the directory file, i.e., the file control area FCA.
  • the directory is for the purpose of improving the speed of file access.
  • the format of FCA is the same as that of the directory (Fig. 3).
  • each sec­tor has a PS and an SS for sector chaining. Therefore, even if the chain between sectors has been disconnected for some reason, if the disconnection is only one, it is possible to find and repair the disconnection by tracing the sector chain, starting from TS and LS, while refer­ring to SS and PS.
  • FIG. 5 shows a flowchart illustrating the initialization of data memory 12.
  • Fig. 6 is a memory map of data memory 12 after its initialization.
  • step S1 FF is written into all the addresses in data memory 12. Here, one byte equals one address. At this time, the sectors where error occurred are regis­tered in RAM 14. In step S2, the top sector of all the sectors that proved to be normal (sector 0 in the exam­ple in Fig. 6) is reserved as the MCA sector.
  • step S3 the second normal sector (sector 1 in Fig. 6) is set to the FCA sector.
  • D is written into the file name of FCA sector, the third normal sector's number (sector 2 in Fig. 6) into TS, TS into LS, 01 into US, FF into PS and FF to SS.
  • the sector designated as TS is reserved as the dummy direc­tory.
  • the registered sector number of FCA (sector 1 in Fig. 1) is written into the DEF of MCS sec­tor.
  • step S4 the remaining normal sectors are chained. More specifically, the numbers of the normal sectors preceding and succeeding to and coupled with one sector are registered in PS and SS fields of the sector and reserved as unused files. At this time, the sectors where write errors occurred (sector 6 in Fig. 6) is registered in RAM 14 as defective sectors, and at the same time they are omitted from the chain.
  • step S5 based on the numbers of the defective sectors registered in RAM 14, FTS, FLS and NFS are calculated and the calculated ones are written into a predetermined area. At this point, the initializing operation ends.
  • Fig. 7 is the memory map of the data memory when file A consisting of three data sectors 8a, 8b and 8c (data fields of a1, a2,a3) and file B consisting of one data sector 9a (data field of b1) are formed anew in the IC card.
  • the data is registered in directory sector 7a, which was a dummy in Fig. 6.
  • FTS, FLS and NFS in MCA are renewed. Further, data sectors in file A are coupl­ed together, and the chain of the normal sectors are partially corrected.
  • file C is formed anew, which consists of a data sector 10a (data field of c1), and file B is expanded with 9b and 9c (data fields of b2 and b3). Since file C is registered anew, the directory file, which consisted of one sector has now expanded to have two sectors 7a and 7b. The expanded directory file 7b is coupled directly with the existing directory file 7a.
  • the data sectors included in file B are coupled with one another. With this coupling, the directory file of file B is also updated. The coupling of the unused normal sectors is also partially corrected.
  • Sector B has a write error when data b3 was expanded. Therefore, it is omitted from the sector chain, as a defective sector.
  • the data is fed back to MCA of sec­tor 0, and then FTS and NFS are updated.
  • Fig. 9 is a flowchart illustrating the accessing (read/write) operation to data memory 12.
  • step S10 the address included in the processing instruction which is supplied to third port 17 in IC card 10 via I/O line 21 from the external processing unit 20, is written into RAM 14.
  • This address is a logical address which starts at "0" for every file.
  • the addressing between CPU 11 and data memory 12 is performed by the absolute ad­dress, as the hardware requires it. For this reason, the logical to absolute address conversion is performed in CPU 11.
  • This process is programmed into a subrou­tine. In step S20, by using this subroutine, the ad­dressing of data memory 12 is performed via second port 16 and address bus 19.
  • step S30 it is determined whether or not write errors occurred in MCA and FCA at the time of this ad­dressing. If any write error occurred, the abnormal end signal is output to third port 17 in step S90, and this signal is supplied to external processing unit 20 via I/O line 21 to terminate processing.
  • step S20 When there are no errors, the memory location as addressed in step S20 is accessed via first port 15 and data bus 18 at step S40.
  • step S50 it is determined whether or not there were any write errors during this read/write operation. If there were none, the normal end signal is output to third port 17 in step S80, and is supplied to external processing device 20 to terminate the processing.
  • step S60 If there was a write error, the sector skip opera­tion is done in step S60. This sector skip processing is also programmed into a subroutine.
  • step S70 it is determined whether or not there were any write error during the sector skip processing. If there were any, the abnormal end signal is output in step S90, and the processing is terminated.
  • Fig. 10 is a flowchart illustrating the addressing subroutine in step S20 of Fig. 9.
  • step S100 CPU 11 sequentially searches the directory file containing the name of the processed file.
  • the file name is included in the processing instruction which is input from external processing device 20.
  • step S110 it is judged whether the directory file containing the name of the processed file exists in data memory 12.
  • step S160 If not exist, a new file is registered in step S160.
  • the process of preparing a new file is also pro­grammed into a subroutine.
  • step S110 when it is judged that the directory file has been stored in data memory 12, and when in step S170, it is judged that there is no write error, the address pointer is set to the top address of the file using the TS of the directory file found in step S100, in step S115.
  • the absolute address indicated by the logical address is searched in step S120.
  • the address pointer as set in step S115 is advanced until the logical address as set in step S10 (in the main routine) is reached.
  • the sector number in which the address pointer will finally be set, and the offset value from the top of that sector of the address pointer are obtained.
  • the advancing of the ad­dress pointer is executed as follows:
  • step S130 CPU judges whether or not the file area must be expanded. It is determined whether or not the input logical address designates the area outside the existed file area. If so, the file area expanding processing is executed in step S190. This expanding processing is also programmed into a subroutine.
  • step S200 After the expanding processing, it is judged whe­ther or not a write error is present in step S200. If the write error is present, control goes to step S180 where an abnormal end status flag is set and, returns to the main routine. In step S200, if the write error is not present, control is returned to step S115.
  • step S130 If it is judged that there is need for expanding the file area in step S130, the logical address is con­verted into an absolute address according to the follow­ing formula in step S140, and the absolute address is stored in RAM 14.
  • step S150 a normal end status flag is set, and the control is returned to the main routine.
  • Absolute address SEC x 12 + OFT ...(1)
  • SEC indicates the number of the sector into which the address pointer is to finally be set
  • OFT is an offset value from the top of the SEC sector of the address pointer.
  • Figs. 11A and 11B cooperatively show a flowchart of a new file registration subroutine (step S160) in Fig. 10.
  • step S210 the NFS of MCA is read.
  • step S220 it is determined whether or not free sector re­mains. If it is determined that there is no free sec­tor, the abnormal end flag is set in step S400, and control is returned to the main routine. If it is de­termined that a free sector is present, the top address of the free sector (FTS of MCA) is read in step S230.
  • step 240 the sector number of a free sector suc­ceeding to the free sector as obtained in step S230 is set to FTS, and a value representing the result of sub­traction of 1 from the NFS at that time is set to NFS.
  • step S250 whether or not a write error occurs during this processing is judged. If the write error occurs, the abnormal end status flag is set in step S400.
  • FF is set in the SS of the free sector as obtained in step S230 in step S260, and this free file is reserved as a new file area.
  • step S270 if a write error is present or not during this process is judged. If the write error is present, control is returned to step S230. If the write error is not present, the subroutine for reconstructing the free area is executed in step S280.
  • step S290 whether or not a write error is present during this processing is judged. If the write error is present, the abnormal end status flag is set in step S400 and control is returned to the main program.
  • step S300 If the write error is not present, the LS of FCA is read in step S300.
  • the contents of sector LS is checked in step S310. That is to say, it is judged whether or not the area to form the directory file for a new file is present in the directory file.
  • step S320 it is checked whether or not the directory file area is to be expanded.
  • step S330 If the answer is yes, the file expanding subroutine is executed in step S330. It is determined whether or not a write error occurs during this processing in step S340. If the write error occurs, the abnormal end status flag is set in step S400, and control is returned to the main program.
  • step S320 It is determined that there is no need for the file area expanding in step S320 and it is determined that no write error occurs in step S340, the data as shown be­low, is written into the area as reserved as the direc­tory preparation area, to register the directory file in step S350.
  • File name File name as designated by terminal device 20.
  • TS Sector number as reserved in step S260.
  • LS TS US : 1
  • PS Sector number of the sector preceding to and coupled with the sector.
  • SS FF
  • step S360 it is determined whether or not a write error occurs during this processing. If the write error is not present, the normal end status flag is set in step S370 and control is returned to the main pro­gram.
  • step S380 If the write error is present, the sector skip routine is executed in step S380. In step S390, if the write error occurs or not during this processing, is checked. If no write error is present, control is re­turned to step S350.
  • step S390 If it is found that the write error is present in step S390, the abnormal end status flag is set in step S400, and control is returned to the main program.
  • Fig. 12 shows a flowchart for reconstructing the free area (step S280) in Fig. 11A, (step S600) in Fig. 13B, and (step S800) in Fig. 14B.
  • the subroutine is for setting FF in the PS of the sector indicated by the FTS, and defines the top sector of the unused file.
  • step S410 the NFS of MCA is read. It is judged whether or not a free sector remains in step S420. If there is no free sector, the abnormal end status flag is set in step S470, and control is returned to the main routine.
  • step S440 check is made as to whether or not the write error is present during this processing. If the write error is present, the FTS and NFS of MCA are updated in step S460, and control is returned to step S410. If the write error is not present, the normal end status flag is set in step S450 and control is returned to the main routine.
  • Figs. 13A and 13B cooperatively show a flowchart of the file area expanding subroutine in Figs. 11A and 11B.
  • step S500 MCA and NFS are read.
  • step S510 it is determined whether or not a free sector remains in data memory 12. If the free sector does not remain, the abnormal end status flag is set in step S650 and control is returned to the main program.
  • step S520 If the free sector remains, the top address of the free sector (FTS of MCA) is read in step S520.
  • the FTS is set in the SS of the last sector in the file in step S530. It is determined in step S540 whether or not there is a write error during this processing. If the write error is present, the sector skip subroutine is executed in step S570, and control is returned to step S520.
  • step S550 the FTS and NFS of MCA are updated in step S550 on the basis of the re­sult of the file area expanding processing.
  • step S560 it is checked whether or not a write error is present during this processing. If the write error is present, control is returned to step S520. If the write error is not present, the sector number as obtained in step S530 is set in the PS of the expanded sector of that file, and FF is set in the SS of that sector in step S580. At this point, the chaining of the sectors is completed.
  • step S590 it is checked whether or not there is a write error during this processing. If a write error is present, control is returned to step S520. If there is no write error, the subroutine for reconstructing a free area is executed in step S600.
  • step S610 it is checked whether or not there is a write error during this processing. If the write error is present, the abnormal end status flag is set in step S650, and control is returned to the main pro­gram.
  • step S620 If there is no write error, MCA, FCA, and the data as have been stored in the directory of the file are up­dated in step S620 on the basis of the contents of the data memory at the end of the step S610 execution.
  • step S630 the presence or absence of a write error during this process is checked. If no write error is present, a normal end status flag is set in step S640, and control is returned to the main program. If the write error is present, the abnormal end status flag is set in step S650, and control is returned to the main program.
  • Figs. 14A and 14B show a flowchart of the sector skip subroutine (step S60) in Fig. 9, (step S380) in Fig. 11B, and (step S570) in Fig. 13A.
  • the NFS of MCA is read in step S700. It is deter­mined whether or not the free sector of data memory 12 remains in step S710. If the free sector does not re­main, the abnormal end status flag is set in step S850 and control is returned to the main program.
  • step S720 the top address of the free sector (FTS of MCA) is read in step S720.
  • step S730 the sector number of the sector succeeding to that as obtained in step S720 is set into FTS and a value representing the result of the subtraction of 1 from the NFS at that point is set in NFS.
  • step S740 It is determined in step S740 whether or not a write error occurs during this processing. If the write error is present, the abnormal end status flag is set in S850, and the control is returned to the main program.
  • step S750 the status of the sector with the error before its error correction is read out and is copied into the sector as obtained in step S720.
  • step S760 the presence or absence of the write error during this process is checked. If the error is present, control is returned to step S720. If it is not present, the preceding sector, in step S770, is search­ed, using the PS of the copied sector, and the sector number of the sector prepared anew in step S750 is set in SS of the preceding sector. In step S780, the pre­sence or absence of the write error during this pro­cessing is checked. If the write error is present, the abnormal end status flag is set in step S850, and control is returned to the main program.
  • step S800 the subroutine for re­constructing the free area is executed.
  • step S810 the presence or absence of the write error during this processing is checked. If the write error is present, the abnormal end status flag is set in step S850 and the control is returned to the main program.
  • step S820 MCA, FCA and directory are updated.
  • step S830 the presence or absence of the write error during this processing is checked. If the write error is not present, the normal end status flag is set in step S840, and control is returned to the main rou­tine. If it is present, the abnormal end status flag is set in step S850, and control is returned to the main routine.
  • the data memory is segmented into a plurality of sectors.
  • the sectors are chained for each application, and the data relating to the chain is stored in the directory.
  • the data memory can be effectively used.
  • the file area can readily be expanded and contracted by changing the chain of sectors.
  • the SS field of the sector h re­presents sector i , but the PS field of the sector i represents sector k .
  • the PS field of the sector i represents sector k .
  • the SS field of sector i re­presents sector k and the PS field of sector j repre­sents sector i . Since the SUM field of sector i is improper and the SUM filed of sector j is proper, it can be understood that the sector j should succeed to sector i .
  • the chain data of the PS and SS fields are rewritten as shown in Fig. 15B.
  • step S900 the top sector of the file to be accessed is read out according to the TS of the direc­tory.
  • the succeeding sector to be coupled is read out on the basis of the SS field of the read out sector.
  • step S920 the PS field of the succeeding sector is read out, and then whether or not the coupl­ing of sectors is proper or not is checked depending on whether or not the SS and PS fields are coincident with each other. If these fields are coincident with each other and the coupling of sectors is proper, control is returned to step S910.
  • the repair processing is executed. It is determined whether or not the SS field is proper referring to the SUM field, in step S930. When the SS field is proper (in the case of sectors h and i in Fig. 15A), the PS field is rewritten in step S940. When the SS field is improper, it is determined whether or not the PS field is proper or not in step S950. If the PS field is pro­per (in the case of sectors i and j in Fig. 15A), what the SS field of the abnormal sector should be rewritten to, is unknown, and it is impossible to immediately rewrite that SS field. Therefore, the sector chaining data is traced in the reverse direction to search the normal sector succeeding the abnormal sector, and re­write the SS field.
  • step S950 when the PS field is also improper, the repair is impossible.
  • step S1000 the abnormal end status flag is set, and the processing is completed.
  • step S970 After rewriting either of the PS and SS fields, in step S970, it is checked whether or not the succeeding sector is the last sector of the file depends on whether the SS field is FF or not. If it is not the last one, control is returned to step S910, and the succeeding sector is read out according to the SS field.
  • step S980 the sectors of the file are traced from its top sector, and the number of sectors is counted.
  • step S990 it is checked whether or not the count is equal to the US of the directory. When these are equal, CPU proceeds with no further processing and stops the processing. When these are not equal, the abnormal end status flag is set in step S1000, and the processing is completed.
  • the preceding and succeeding sector numbers are both stored, as described above. Therefore, it is possible to check whether or not the chaining data is proper, by comparing the chain­ing data of the two sectors. If the two data are not coincident with each other, the chaining data is restor­ed into the correct one on the basis of the check sum of each sector.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Microelectronics & Electronic Packaging (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Credit Cards Or The Like (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)

Abstract

In an IC (integrated circuit) card (10), a CPU (central processing unit) (11) is connected to a data bus (18) and an address bus (19). A data memory (12) is connected to the data bus (18) and the address bus (19). The data memory (12) is a rewritable memory, such as EEPROM (electrically erasable programmable read only memory) or battery backed-up RAM (random access memory). The data memory (12) is segmented into a predetermined number of sectors each consisting of predetermined bytes. An external processing device (20), such as a terminal device is connected to the data bus (18) and the address bus (19), via a one-bit I/O line (21) and a port (17). The terminal device (20) supplies a pro­cessing instruction via the I/O line (21) to the third port (17). The CPU (11) receives the processing in­struction via the data bus (18), analyzes the instruc­tion, and reads out and executes the necessary program. The CPU (11) supplies the results of each processing to the terminal device (20), by way of the data bus (18), the port (17) and the I/O bus (21). The sectors of the data memory (12) are functionally classified into the data sector, the directory sector, the file control sec­tor, and the memory control sector. These sectors, if necessary, are chained with one another. The data re­lating to the sector chain is registered in each sector. The directory sector stores the data concerning each application file. The memory control sector stores the data indicating how the entire memory area of the data memory is used. The file control sector stores the sec­tor number of the directory file.

Description

  • This invention relates to an IC (integrated cir­cuit) card, and more particularly to an IC card which contains a rewritable semiconductor memory.
  • An IC card with data processing function has re­cently been put into practical use. This IC card con­tains a central processing unit (CPU) and a rewritable data memory, such as an electrically erasable program­mable read only memory (EEPROM), or a random access memory (RAM) which is backed up by the battery. The data memory is connected to the CPU. The IC card has on its surface terminals for data transfer with the exter­nal device such as the terminal devices. The terminals are not necessary if data transfer is a non-contact type, for example, via a microwave or an optical beam. This type of IC card can be considered to be a microcomputer in the shape of a card. However, the major difference of this type of IC card from the ordinary microcomputer resides in that, because of its card-like shape, the CPU and the data memory of the IC card are physically limited. Therefore, the capacity of the data memory has also a limit. It follows that an efficient use of the memory is required.
  • Recently, the IC card used for multi-purposes, called a multi-use type IC card has been proposed. In the multi-use type IC, a plurality of files are stored in the data memory, and the file access and file control must be controlled effectively.
  • The data memory in an IC card has been used in the following two ways.
    • (1) The entire memory space is sequential. The memory addressing is based on the absolute address supplied from the external device.
    • (2) The memory is segmented into a plurality of blocks. The memory addressing is performed by the logi­cal address, viz., the offset value from the top address of the block.
  • The way (1) of the IC card memory has the following drawbacks.
    • (a) The layout of the memory has to be determined in system design. When it is requested later to expand the file or to register a new file, it is difficult to satisfy such a request.
    • (b) The memory area for each file must have a larger area than the expected maximum file. It often entails unnecessary use of the memory.
    • (c) For defective addresses (memory cells), if present, the IC card cannot take any measure by itself.
    • (d) Addressing is complicated.
  • The way (2) also involves the above problems (a) to (c).
  • An object of this invention is to provide an IC card with a rewritable data memory which can effectively use the memory.
  • Another object of this invention is to provide an IC card in which, in the data memory, the new file can be easily prepared, and the existing file can be easily expanded.
  • Yet another object of this invention is to provide an IC card which provides an exact and quick access to the files in the data memory.
  • A further object of this invention is to provide an IC card, in which, when there is a defective address, another normal address is used in place of the defective address, and therefore no abnormality can be seen from outside.
  • An additional object of this invention is to pro­vide an IC card which keeps high security among a plu­rality of files stored in the data memory.
  • According to this invention, there is provided an IC card comprising:
    a rewritable memory which is segmented into a plu­rality of sectors, and
    means for controlling the input and output of data to and from the memory, the control means including:
    means for chaining a plurality of sectors in accord­ance with the length of a file to be recorded,
    means for registering, in a predetermined sector, the sector chaining data of each file, and
    means for accessing a file based on the sector chaining data.
  • This invention can be more fully understood from the following detailed description when taken in con­junction with the accompanying drawings, in which:
    • Fig. 1 is a block diagram illustrating an arrange­ment of an embodiment of an IC card according to this invention;
    • Fig. 2 shows a view illustrating the layout of a data sector in the data memory of this embodiment;
    • Fig. 3 shows a view illustrating the layout of a directory sector and a file control area (FCA) sector in the data memory in this embodiment;
    • Fig. 4 shows a view illustrating the layout of the memory control area (MCA) sector in the data memory;
    • Fig. 5 shows a flowchart illustrating the initiali­zation of the data memory of the embodiment;
    • Fig. 6 shows a memory map of the initialized data memory;
    • Fig. 7 shows a memory map of the data memory when a file is prepared in the data memory;
    • Fig. 8 shows a memory map of the data memory when another file is made in the data memory;
    • Fig. 9 shows a flowchart illustrating the read/­write operation of the memory;
    • Fig. 10 shows a flowchart illustrating the address­ing of the memory shown in Fig. 9;
    • Figs. 11A and 11B cooperatively show flowcharts for registering a new file;
    • Fig. 12 shows a flowchart for reconstructing the free area shown in Figs. 10, 11A, and 11B;
    • Figs. 13A and 13B cooperatively show a flowchart for expanding a file area shown in Figs. 10, 11A, and 11B;
    • Figs. 14A and 14B cooperatively show a flowchart of sector skipping shown in Figs. 10 and 11B;
    • Figs. 15A and 15B show a layout of the sectors use­ful in explaining the repair of sector chaining; and
    • Fig. 16 shows a flowchart useful in explaining the repair of sector chaining.
  • An embodiment of the IC card according to this invention will be described referring to the following drawings.
  • Fig. 1 is a block diagram illustrating an arrange­ment of IC card 10. CPU 11 is connected to data bus 18 and address bus 19. Data memory 12 is connected to data bus 18 via first port 15, and to address bus 19 via second port 16. Data memory 12 is a rewritable memory such as an EEPROM or an RAM which is backed up by a bat­tery. Its memory capacity is 192 bytes and the memory area is segmented into 16 sectors each of 12 bytes. The capacity of 192 bytes is used here for ease of explana­tion, but it can be 16 K bytes, 64 K bytes, etc.
  • Data bus 18 and address bus 19 are also connected to program memory 13, RAM 14 and third port 17. Program memory 13 is a read only memory. RAM 14 is a memory for providing a working area when CPU 11 executes the program stored in program memory 13. Third port 17 is connected to external processing unit 20 (so-called a terminal device) via serial I/O line 21. Terminal device 20 feeds to IC card 10 clock pulse CLK, reset pluses RES, and power supply voltage Vcc. It also feeds write voltage Vpp when the write voltage other than Vcc is required and ground voltage GND. Terminal device 20 and IC card 10 are electrically connected via the con­nector installed on the surface of IC card 10.
  • Terminal device 20 sends a processing instruction to third port 17 via I/O line 21. CPU 11 receives the processing instruction via data bus 18, decodes the contents of the instruction, reads the necessary program from program memory 13, and then executes the program. When terminal device 20 accesses data memory 12 contain­ed in IC card 10, the logical address has to be used. When CPU 11 accesses data memory 12, the absolute ad­dress has to be used. For this purpose, CPU 11 performs logical-absolute address conversion, using a formula (1) to be described later and outputs the absolute address to address bus 19 to access data memory 12.
  • The I/O data is transferred between CPU 11 and terminal device 20 via bidirectional data bus 18 and third port 17.
  • CPU 11 supplies to terminal device 20 the result of each processing, via data bus 18, third port 17 and I/O bus 21.
  • The memory map of data memory 12 will be now de­scribed. As explained earlier, data memory 12 is seg­mented into 16 sectors each consisting of 12 bytes. These sectors are functionally classified into a data sector, a directory sector, an FCA (file control area) sector and an MCA (memory control area) sector. If necessary, a plurality of sectors are coupled in a chain fashion. In each sector, first to eighth bytes are data fields. Ninth and tenth bytes are PS and SS fields which store the numbers of the sectors preceding to and succeeding to that sector. Eleventh and twelfth bytes form SUM field for checking if each byte of that sector is proper or not. The SUM field may be CRC-16, and EX-OR, CRC-8 or mere arithmetic sum. If EX-OR, CRC-8 or arithmetic sum is used, the SUM field may be constructed with one byte, not two bytes.
  • Fig. 2 shows a layout of the data sector. Data field 30 is the field freely used by the user and the system. The application file is constructed by chaining a plurality of data sectors, if necessary.
  • Fig. 3 shows a layout of the directory sector where the data of the application file is registered. The directory sector is used to improve the speed of file access, and enables the quick calculation of file volume. The directory sector can be used equivalent to the data sector, and therefore its size or the number of sectors can be expanded. As the directory data for a file, file name field 1 (1 byte), TS (top sector) field 2 (1 byte), LS (last sector) field 3 (1 byte) and US (used sector) field (1 byte), or total of 4 bytes are necessary. Therefore, directory data for two ap­plication files are registered in the data field of one directory sector. Registered to TS field 2 is the num­ber of the top sector from which the application file is registered. Registered to LS field 3 is the number of the last sector in which the last of the application file is registered. The size of the application file (or the number of files) is registered in US field 4.
  • The top and last of a file are indicated by setting FF in PS field 5 and SS field 6.
  • Fig. 4 shows a layout of the memory control area (MCA) for storing the data how the entire memory area of the data memory is used. Data fields necessary for the MCA sector are FTS fields 31 (1 byte), FLS field 32 (1 byte), NFS field 33 (1 byte) and DFF field 34 (1 byte), and needs the total of 4 bytes. The data field contains the unused empty field of fifth to eighth bytes. The top sector number of the unused sectors is registered in FTS field 31. The last sector number of the unused sectors is registered in FLS field 32. The total number of unused sectors are registered in NFS field 33. DEF field 34 registers the sector number of the sector having a directory of the directory file, i.e., the file control area FCA. The directory is for the purpose of improving the speed of file access. The format of FCA is the same as that of the directory (Fig. 3).
  • In the data file and the directory file, each sec­tor has a PS and an SS for sector chaining. Therefore, even if the chain between sectors has been disconnected for some reason, if the disconnection is only one, it is possible to find and repair the disconnection by tracing the sector chain, starting from TS and LS, while refer­ring to SS and PS.
  • The operation of this embodiment will now be de­scribed. Before using the IC card, or writing into data memory 12, data memory has to be initialized. Fig. 5 shows a flowchart illustrating the initialization of data memory 12. Fig. 6 is a memory map of data memory 12 after its initialization.
  • In step S1, FF is written into all the addresses in data memory 12. Here, one byte equals one address. At this time, the sectors where error occurred are regis­tered in RAM 14. In step S2, the top sector of all the sectors that proved to be normal (sector 0 in the exam­ple in Fig. 6) is reserved as the MCA sector.
  • In step S3, the second normal sector (sector 1 in Fig. 6) is set to the FCA sector. D is written into the file name of FCA sector, the third normal sector's number (sector 2 in Fig. 6) into TS, TS into LS, 01 into US, FF into PS and FF to SS. By this writing, the sector designated as TS is reserved as the dummy direc­tory. At this time, the registered sector number of FCA (sector 1 in Fig. 1) is written into the DEF of MCS sec­tor.
  • In step S4, the remaining normal sectors are chained. More specifically, the numbers of the normal sectors preceding and succeeding to and coupled with one sector are registered in PS and SS fields of the sector and reserved as unused files. At this time, the sectors where write errors occurred (sector 6 in Fig. 6) is registered in RAM 14 as defective sectors, and at the same time they are omitted from the chain.
  • In step S5, based on the numbers of the defective sectors registered in RAM 14, FTS, FLS and NFS are calculated and the calculated ones are written into a predetermined area. At this point, the initializing operation ends.
  • Fig. 7 is the memory map of the data memory when file A consisting of three data sectors 8a, 8b and 8c (data fields of a1, a2,a3) and file B consisting of one data sector 9a (data field of b1) are formed anew in the IC card. In Fig. 7, the data is registered in directory sector 7a, which was a dummy in Fig. 6. In accordance with the generation of files, FTS, FLS and NFS in MCA are renewed. Further, data sectors in file A are coupl­ed together, and the chain of the normal sectors are partially corrected.
  • In the memory map illustrated in Fig. 8, file C is formed anew, which consists of a data sector 10a (data field of c1), and file B is expanded with 9b and 9c (data fields of b2 and b3). Since file C is registered anew, the directory file, which consisted of one sector has now expanded to have two sectors 7a and 7b. The expanded directory file 7b is coupled directly with the existing directory file 7a.
  • The data sectors included in file B are coupled with one another. With this coupling, the directory file of file B is also updated. The coupling of the unused normal sectors is also partially corrected. Sector B has a write error when data b3 was expanded. Therefore, it is omitted from the sector chain, as a defective sector. The data is fed back to MCA of sec­tor 0, and then FTS and NFS are updated.
  • Fig. 9 is a flowchart illustrating the accessing (read/write) operation to data memory 12. In step S10, the address included in the processing instruction which is supplied to third port 17 in IC card 10 via I/O line 21 from the external processing unit 20, is written into RAM 14.
  • This address is a logical address which starts at "0" for every file. However, the addressing between CPU 11 and data memory 12 is performed by the absolute ad­dress, as the hardware requires it. For this reason, the logical to absolute address conversion is performed in CPU 11. This process is programmed into a subrou­tine. In step S20, by using this subroutine, the ad­dressing of data memory 12 is performed via second port 16 and address bus 19.
  • In step S30, it is determined whether or not write errors occurred in MCA and FCA at the time of this ad­dressing. If any write error occurred, the abnormal end signal is output to third port 17 in step S90, and this signal is supplied to external processing unit 20 via I/O line 21 to terminate processing.
  • When there are no errors, the memory location as addressed in step S20 is accessed via first port 15 and data bus 18 at step S40.
  • In step S50, it is determined whether or not there were any write errors during this read/write operation. If there were none, the normal end signal is output to third port 17 in step S80, and is supplied to external processing device 20 to terminate the processing.
  • If there was a write error, the sector skip opera­tion is done in step S60. This sector skip processing is also programmed into a subroutine.
  • In step S70, it is determined whether or not there were any write error during the sector skip processing. If there were any, the abnormal end signal is output in step S90, and the processing is terminated.
  • When it is judged that there are no write errors, control is returned to step S40.
  • Fig. 10 is a flowchart illustrating the addressing subroutine in step S20 of Fig. 9.
  • In step S100, CPU 11 sequentially searches the directory file containing the name of the processed file. The file name is included in the processing instruction which is input from external processing device 20.
  • In step S110, it is judged whether the directory file containing the name of the processed file exists in data memory 12.
  • If not exist, a new file is registered in step S160. The process of preparing a new file is also pro­grammed into a subroutine.
  • After the new file is made, it is judged whether or not there are any write errors in S170. If there are, an abnormal end status flag is set and control goes back to the main routine.
  • In step S110, when it is judged that the directory file has been stored in data memory 12, and when in step S170, it is judged that there is no write error, the address pointer is set to the top address of the file using the TS of the directory file found in step S100, in step S115. The absolute address indicated by the logical address is searched in step S120. During this searching process, the address pointer as set in step S115 is advanced until the logical address as set in step S10 (in the main routine) is reached. The sector number in which the address pointer will finally be set, and the offset value from the top of that sector of the address pointer are obtained. The advancing of the ad­dress pointer is executed as follows:
    • 1. To trace only the data field.
    • 2. To read the SS of that sector at the end of one sector, and to set the address pointer at the top of the succeeding sector.
  • In step S130, CPU judges whether or not the file area must be expanded. It is determined whether or not the input logical address designates the area outside the existed file area. If so, the file area expanding processing is executed in step S190. This expanding processing is also programmed into a subroutine.
  • After the expanding processing, it is judged whe­ther or not a write error is present in step S200. If the write error is present, control goes to step S180 where an abnormal end status flag is set and, returns to the main routine. In step S200, if the write error is not present, control is returned to step S115.
  • If it is judged that there is need for expanding the file area in step S130, the logical address is con­verted into an absolute address according to the follow­ing formula in step S140, and the absolute address is stored in RAM 14. In step S150, a normal end status flag is set, and the control is returned to the main routine.
  • Absolute address = SEC x 12 + OFT ...(1)
    where SEC indicates the number of the sector into which the address pointer is to finally be set, and OFT is an offset value from the top of the SEC sector of the address pointer.
  • Figs. 11A and 11B cooperatively show a flowchart of a new file registration subroutine (step S160) in Fig. 10.
  • In step S210, the NFS of MCA is read. In step S220, it is determined whether or not free sector re­mains. If it is determined that there is no free sec­tor, the abnormal end flag is set in step S400, and control is returned to the main routine. If it is de­termined that a free sector is present, the top address of the free sector (FTS of MCA) is read in step S230. In step 240, the sector number of a free sector suc­ceeding to the free sector as obtained in step S230 is set to FTS, and a value representing the result of sub­traction of 1 from the NFS at that time is set to NFS.
  • In step S250, whether or not a write error occurs during this processing is judged. If the write error occurs, the abnormal end status flag is set in step S400.
  • If the write error does not occur, FF is set in the SS of the free sector as obtained in step S230 in step S260, and this free file is reserved as a new file area.
  • In step S270, if a write error is present or not during this process is judged. If the write error is present, control is returned to step S230. If the write error is not present, the subroutine for reconstructing the free area is executed in step S280.
  • In step S290, whether or not a write error is present during this processing is judged. If the write error is present, the abnormal end status flag is set in step S400 and control is returned to the main program.
  • If the write error is not present, the LS of FCA is read in step S300. The contents of sector LS is checked in step S310. That is to say, it is judged whether or not the area to form the directory file for a new file is present in the directory file. In step S320, it is checked whether or not the directory file area is to be expanded.
  • If the answer is yes, the file expanding subroutine is executed in step S330. It is determined whether or not a write error occurs during this processing in step S340. If the write error occurs, the abnormal end status flag is set in step S400, and control is returned to the main program.
  • It is determined that there is no need for the file area expanding in step S320 and it is determined that no write error occurs in step S340, the data as shown be­low, is written into the area as reserved as the direc­tory preparation area, to register the directory file in step S350.
  • File name : File name as designated by terminal device 20.
    TS : Sector number as reserved in step S260.
    LS : TS
    US : 1
    PS : Sector number of the sector preceding to and coupled with the sector.
    SS : FF
  • In step S360, it is determined whether or not a write error occurs during this processing. If the write error is not present, the normal end status flag is set in step S370 and control is returned to the main pro­gram.
  • If the write error is present, the sector skip routine is executed in step S380. In step S390, if the write error occurs or not during this processing, is checked. If no write error is present, control is re­turned to step S350.
  • If it is found that the write error is present in step S390, the abnormal end status flag is set in step S400, and control is returned to the main program.
  • Fig. 12 shows a flowchart for reconstructing the free area (step S280) in Fig. 11A, (step S600) in Fig. 13B, and (step S800) in Fig. 14B. The subroutine is for setting FF in the PS of the sector indicated by the FTS, and defines the top sector of the unused file. In step S410, the NFS of MCA is read. It is judged whether or not a free sector remains in step S420. If there is no free sector, the abnormal end status flag is set in step S470, and control is returned to the main routine.
  • If the free sector remains, FF is set in the PS of the sector indicated by the FTS in step S430. In step S440, check is made as to whether or not the write error is present during this processing. If the write error is present, the FTS and NFS of MCA are updated in step S460, and control is returned to step S410. If the write error is not present, the normal end status flag is set in step S450 and control is returned to the main routine.
  • Figs. 13A and 13B cooperatively show a flowchart of the file area expanding subroutine in Figs. 11A and 11B.
  • In step S500, MCA and NFS are read. In step S510, it is determined whether or not a free sector remains in data memory 12. If the free sector does not remain, the abnormal end status flag is set in step S650 and control is returned to the main program.
  • If the free sector remains, the top address of the free sector (FTS of MCA) is read in step S520. The FTS is set in the SS of the last sector in the file in step S530. It is determined in step S540 whether or not there is a write error during this processing. If the write error is present, the sector skip subroutine is executed in step S570, and control is returned to step S520.
  • If the write error is not present, the FTS and NFS of MCA are updated in step S550 on the basis of the re­sult of the file area expanding processing.
  • In step S560, it is checked whether or not a write error is present during this processing. If the write error is present, control is returned to step S520. If the write error is not present, the sector number as obtained in step S530 is set in the PS of the expanded sector of that file, and FF is set in the SS of that sector in step S580. At this point, the chaining of the sectors is completed.
  • In step S590, it is checked whether or not there is a write error during this processing. If a write error is present, control is returned to step S520. If there is no write error, the subroutine for reconstructing a free area is executed in step S600.
  • In step S610, it is checked whether or not there is a write error during this processing. If the write error is present, the abnormal end status flag is set in step S650, and control is returned to the main pro­gram.
  • If there is no write error, MCA, FCA, and the data as have been stored in the directory of the file are up­dated in step S620 on the basis of the contents of the data memory at the end of the step S610 execution.
  • In step S630, the presence or absence of a write error during this process is checked. If no write error is present, a normal end status flag is set in step S640, and control is returned to the main program. If the write error is present, the abnormal end status flag is set in step S650, and control is returned to the main program.
  • Figs. 14A and 14B show a flowchart of the sector skip subroutine (step S60) in Fig. 9, (step S380) in Fig. 11B, and (step S570) in Fig. 13A.
  • The NFS of MCA is read in step S700. It is deter­mined whether or not the free sector of data memory 12 remains in step S710. If the free sector does not re­main, the abnormal end status flag is set in step S850 and control is returned to the main program.
  • If the free sector remains, the top address of the free sector (FTS of MCA) is read in step S720. In step S730, the sector number of the sector succeeding to that as obtained in step S720 is set into FTS and a value representing the result of the subtraction of 1 from the NFS at that point is set in NFS.
  • It is determined in step S740 whether or not a write error occurs during this processing. If the write error is present, the abnormal end status flag is set in S850, and the control is returned to the main program.
  • If the write error does not occur, in step S750, the status of the sector with the error before its error correction is read out and is copied into the sector as obtained in step S720.
  • In step S760, the presence or absence of the write error during this process is checked. If the error is present, control is returned to step S720. If it is not present, the preceding sector, in step S770, is search­ed, using the PS of the copied sector, and the sector number of the sector prepared anew in step S750 is set in SS of the preceding sector. In step S780, the pre­sence or absence of the write error during this pro­cessing is checked. If the write error is present, the abnormal end status flag is set in step S850, and control is returned to the main program.
  • If the error is not present, the logical address is converted into the absolute address using the formula (1) in step S790. In step S800, the subroutine for re­constructing the free area is executed.
  • In step S810, the presence or absence of the write error during this processing is checked. If the write error is present, the abnormal end status flag is set in step S850 and the control is returned to the main program.
  • If the write error is not present, in step S820 MCA, FCA and directory are updated.
  • In step S830, the presence or absence of the write error during this processing is checked. If the write error is not present, the normal end status flag is set in step S840, and control is returned to the main rou­tine. If it is present, the abnormal end status flag is set in step S850, and control is returned to the main routine.
  • As described above, in this embodiment, the data memory is segmented into a plurality of sectors. The sectors are chained for each application, and the data relating to the chain is stored in the directory. With this feature, the data memory can be effectively used. The file area can readily be expanded and contracted by changing the chain of sectors.
  • The restoring processing of the chain data in the PS and SS fields of the sector, which contain an error, will be described, using the SUM field at the 11th and 12th bytes in one sector. Reference is made to Figs. 15A and 15B.
  • In the figure, the SS field of the sector h re­presents sector i, but the PS field of the sector i represents sector k. At this stage, it is unobvious whether one or both contain error. Since the SUM field of sector h is proper and the SUM field of sector i is improper, it can be seen that sector h should succeed to sector i. Similarly, the SS field of sector i re­presents sector k and the PS field of sector j repre­sents sectori. Since the SUM field of sector i is improper and the SUM filed of sector j is proper, it can be understood that the sector j should succeed to sector i. As a result, the chain data of the PS and SS fields are rewritten as shown in Fig. 15B.
  • A chart illustrating a flow of the restoring pro­cessing of the sector chaining data is illustrated in Fig. 16. In step S900, the top sector of the file to be accessed is read out according to the TS of the direc­tory. In step S910, the succeeding sector to be coupled is read out on the basis of the SS field of the read out sector. In step S920, the PS field of the succeeding sector is read out, and then whether or not the coupl­ing of sectors is proper or not is checked depending on whether or not the SS and PS fields are coincident with each other. If these fields are coincident with each other and the coupling of sectors is proper, control is returned to step S910.
  • On the other hand, if these are not coincident with each other, and the sector coupling is improper, the repair processing is executed. It is determined whether or not the SS field is proper referring to the SUM field, in step S930. When the SS field is proper (in the case of sectors h and i in Fig. 15A), the PS field is rewritten in step S940. When the SS field is improper, it is determined whether or not the PS field is proper or not in step S950. If the PS field is pro­per (in the case of sectors i and j in Fig. 15A), what the SS field of the abnormal sector should be rewritten to, is unknown, and it is impossible to immediately rewrite that SS field. Therefore, the sector chaining data is traced in the reverse direction to search the normal sector succeeding the abnormal sector, and re­write the SS field.
  • In step S950, when the PS field is also improper, the repair is impossible. In step S1000, the abnormal end status flag is set, and the processing is completed.
  • After rewriting either of the PS and SS fields, in step S970, it is checked whether or not the succeeding sector is the last sector of the file depends on whether the SS field is FF or not. If it is not the last one, control is returned to step S910, and the succeeding sector is read out according to the SS field.
  • If it is the last one, in step S980, the sectors of the file are traced from its top sector, and the number of sectors is counted. In step S990, it is checked whether or not the count is equal to the US of the directory. When these are equal, CPU proceeds with no further processing and stops the processing. When these are not equal, the abnormal end status flag is set in step S1000, and the processing is completed.
  • As for the sector chaining data, the preceding and succeeding sector numbers are both stored, as described above. Therefore, it is possible to check whether or not the chaining data is proper, by comparing the chain­ing data of the two sectors. If the two data are not coincident with each other, the chaining data is restor­ed into the correct one on the basis of the check sum of each sector.
  • As described above, according to this invention an improved IC card is provided. This invention is not limited to the particular embodiment described above and can be modified within the scope and spirit thereof.

Claims (11)

1. An IC (integrated circuit) card comprising:
rewritable memory means (12) with a plurality of sectors; and characterized by comprising
memory control means (11) for writing into said memory means, data file supplied to the IC card from a processing device outside the IC card, said memory con­trol means including means for chaining a plurality of sectors according to the length of the data file, means for writing chain data of each sector into a predeter­mined portion of the sector, and means for writing for each data file data relating to the sectors constituting the data file into a predetermined sector.
2. The IC card according to claim 1, characterized in that said memory means includes a data sector consti­tuting the data file, a directory sector for storing data relating to the sectors constituting each data file, a file control sector for storing data relating to the directory sector, and a memory control sector for storing data relating to unused data sector, and each of said sectors including the chain data (5, 6) relating to the sectors preceding and succeeding to one sector, and data (7) for indicating that the data in said sector is normal.
3. The IC card according to claim 2, characterized in that said data sector includes a data field (30), a preceding sector field (5) for storing the preceding sector number, and a succeeding sector field (6) for storing the succeeding sector number,
said directory sector includes a file name storing field (1), a top sector field (2) for storing a top sec­tor number of said file, a last sector field (3) for storing a last sector number of said file, a used sector field (4) for storing the size of said file (the number of sectors), the preceding sector field (5), the suc­ceeding sector field (6), and a check field (7) for storing check data, and
said memory control sector includes a free top field (31) for storing a top sector number of unused sectors, a free last sector field (32) for storing a last sector number of the unused sectors, a sector num­ber field (33) for storing the size of the unused sec­tors (the number of sectors), a defining field (34) for storing the sector number of said file control sector, the preceding sector field (5), the succeeding sector field (6), and the check field (7).
4. The IC card according to claim 3, characteriz­ed in that said memory control means initializes said memory means before said memory means is used, said initializing including the steps of:
writing zero into all the addresses of said memory means;
storing the sectors in which error occurs;
reserving the top sector of those normal sectors as a memory control sector;
reserving the normal sector succeeding to the memo­ry control sector, as a file control sector, setting "directory" into the file name storing field of said file control sector, the number of the next normal sec­tor succeeding to said file control sector into the top sector field, said number of the next normal sector into the last sector field, one into the used sector field, zero into said preceding sector field, and zero into said succeeding sector field, and reserving said next normal sector as a dummy directory sector;
setting the sector number of said file control sector into the defining field of said memory control sector;
chaining the remaining normal sectors (i.e. regis­tering the numbers of the normal sectors preceding and succeeding to one sector into said preceding and suc­ceeding sector fields of each sector), said chained nor­mal sectors being reserved as an unused file, the sector in which write error occurs being stored as a defective sector and being excluded from the sector chain; and
setting data into the free top sector field, and free last sector field, and the sector number field of said memory control sector according to the number of the stored defective sectors.
5. The IC card according to claim 1, characterized in that said memory means is an EEPROM (electrically erasable programmable read only memory) or battery backed-up RAM (random access memory).
6. The IC card according to claim 1, characterized in that said memory control means converts a logical address as externally supplied into an absolute address and accesses said memory means with the absolute ad­dress.
7. The IC card according to claim 1, characterized in that said memory control means skips the defective sector when a new file is formed in said memory means.
8. An IC card comprising:
rewritable memory means (12) including a plurality of chained data sectors constituting a data file, a directory sector for storing data relating to the sec­tors constituting each data file, a file control sector for storing data relating to said directory sector, each sector having a field for storing data relating to the sector preceding and succeeding to one sector, and the data indicating that the data in the sector is normal; and
memory control means (11) for reading the data file from said memory means, said memory control means in­cluding means for reading out a top sector of the data file, using the directory file and the memory control sector, means for reading out one sector succeeding to and chained with the read-out sector from the data re­lating to said succeeding sector, means for checking the coincidence and noncoincidence of the data relating to the succeeding sector of said read-out sector with the data relating to the preceding sector of said suc­ceeding sector, and means for correcting, when the check result shows noncoincidence, the data relating to said preceding and succeeding sectors according to the data indicating that the data in the sector is normal.
9. The IC card according to claim 8, characterized in that said data sector includes a data field (30), a preceding sector field (5) for storing the preceding sector number, and a succeeding sector field (6) for storing the succeeding sector number,
said directory sector includes a file name storing field (1), a top sector field (2) for storing a top sec­tor number of said file, a last sector field (3) for storing a last sector number of said file, a used sector field (4) for storing the size of said file (the number of sectors), the preceding sector field (5), the suc­ceeding sector field (6), and a check field (7) for storing check data, and
said memory control sector includes a free top field (31) for storing a top sector number of unused sectors, a free last sector field (32) for storing a last sector number of the unused sectors, a sector number field (33) for storing the size of the unused sectors, a defining field (34) for storing the sector number of said file control sector, the preceding sector field (5), the succeeding sector field (6), and the check field (7).
10. The IC card according to claim 8, character­ized in that said memory means is an EEPROM (electri­cally erasable programmable read only memory) or battery backed-up RAM (random access memory).
11. The IC card according to claim 8, character­ized in that said memory control means converts a logi­cal address as externally supplied into an absolute address and accesses said memory means with the absolute address.
EP86114972A 1985-10-29 1986-10-28 IC card Expired - Lifetime EP0220718B1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP60242429A JP2664137B2 (en) 1985-10-29 1985-10-29 IC card
JP242429/85 1985-10-29

Publications (3)

Publication Number Publication Date
EP0220718A2 true EP0220718A2 (en) 1987-05-06
EP0220718A3 EP0220718A3 (en) 1991-12-04
EP0220718B1 EP0220718B1 (en) 1995-03-08

Family

ID=17088969

Family Applications (1)

Application Number Title Priority Date Filing Date
EP86114972A Expired - Lifetime EP0220718B1 (en) 1985-10-29 1986-10-28 IC card

Country Status (5)

Country Link
US (1) US4748320A (en)
EP (1) EP0220718B1 (en)
JP (1) JP2664137B2 (en)
DE (1) DE3650258T2 (en)
NO (1) NO174646C (en)

Cited By (42)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2633743A1 (en) * 1988-06-30 1990-01-05 Nec Corp Semiconductor memory unit simulating a magnetic disc unit
FR2635607A1 (en) * 1988-08-16 1990-02-23 Dresden Forschzent Mikroelekt INTERNAL METHOD FOR PROGRAMMING AUTOMATIC CONTROL AND REDUNDANCY FOR MEMORY CIRCUITS AND APPARATUS FOR APPLYING THE METHOD
EP0376486A2 (en) * 1988-12-30 1990-07-04 Pitney Bowes, Inc. EPM having an improvement in non-volatile memory organization
EP0464988A2 (en) * 1990-06-25 1992-01-08 International Business Machines Corporation Personal Computer system
EP0617363A2 (en) * 1989-04-13 1994-09-28 Sundisk Corporation Defective cell substitution in EEprom array
WO1995004321A1 (en) * 1993-07-28 1995-02-09 National Semiconductor Corporation Distributed directory for information stored on audio quality memory devices
US5535328A (en) * 1989-04-13 1996-07-09 Sandisk Corporation Non-volatile memory system card with flash erasable sectors of EEprom cells including a mechanism for substituting defective cells
GB2300286A (en) * 1995-04-27 1996-10-30 Samsung Electronics Co Ltd IC card memory arrangement for recording and reproducing audio and/or video data concurrently and separately
US5663901A (en) * 1991-04-11 1997-09-02 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US5778418A (en) * 1991-09-27 1998-07-07 Sandisk Corporation Mass computer storage system having both solid state and rotating disk types of memory
US5838614A (en) * 1995-07-31 1998-11-17 Lexar Microsystems, Inc. Identification and verification of a sector within a block of mass storage flash memory
US5907856A (en) * 1995-07-31 1999-05-25 Lexar Media, Inc. Moving sectors within a block of information in a flash memory mass storage architecture
US5928370A (en) * 1997-02-05 1999-07-27 Lexar Media, Inc. Method and apparatus for verifying erasure of memory blocks within a non-volatile memory structure
US5930815A (en) * 1995-07-31 1999-07-27 Lexar Media, Inc. Moving sequential sectors within a block of information in a flash memory mass storage architecture
US6034897A (en) * 1999-04-01 2000-03-07 Lexar Media, Inc. Space management for managing high capacity nonvolatile memory
US6076137A (en) * 1997-12-11 2000-06-13 Lexar Media, Inc. Method and apparatus for storing location identification information within non-volatile memory devices
US6081878A (en) * 1997-03-31 2000-06-27 Lexar Media, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US6115785A (en) * 1995-07-31 2000-09-05 Lexar Media, Inc. Direct logical block addressing flash memory mass storage architecture
US6122195A (en) * 1997-03-31 2000-09-19 Lexar Media, Inc. Method and apparatus for decreasing block write operation times performed on nonvolatile memory
US6125435A (en) * 1995-09-13 2000-09-26 Lexar Media, Inc. Alignment of cluster address to block addresses within a semiconductor non-volatile mass storage memory
US6141249A (en) * 1999-04-01 2000-10-31 Lexar Media, Inc. Organization of blocks within a nonvolatile memory unit to effectively decrease sector write operation time
US6262918B1 (en) 1999-04-01 2001-07-17 Lexar Media, Inc. Space management for managing high capacity nonvolatile memory
US6374337B1 (en) 1998-11-17 2002-04-16 Lexar Media, Inc. Data pipelining method and apparatus for memory control circuit
US6411546B1 (en) 1997-03-31 2002-06-25 Lexar Media, Inc. Nonvolatile memory using flexible erasing methods and method and system for using same
US6426893B1 (en) 2000-02-17 2002-07-30 Sandisk Corporation Flash eeprom system with simultaneous multiple data sector programming and storage of physical block characteristics in other designated blocks
US6567307B1 (en) 2000-07-21 2003-05-20 Lexar Media, Inc. Block management for mass storage
US6728851B1 (en) 1995-07-31 2004-04-27 Lexar Media, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US6757800B1 (en) 1995-07-31 2004-06-29 Lexar Media, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US6801979B1 (en) 1995-07-31 2004-10-05 Lexar Media, Inc. Method and apparatus for memory control circuit
US6813678B1 (en) 1998-01-22 2004-11-02 Lexar Media, Inc. Flash memory system
US6898662B2 (en) 2001-09-28 2005-05-24 Lexar Media, Inc. Memory system sectors
US7190617B1 (en) 1989-04-13 2007-03-13 Sandisk Corporation Flash EEprom system
WO2007110426A2 (en) 2006-03-28 2007-10-04 Vodafone Holding Gmbh Memory management of chip cards
US7725628B1 (en) 2004-04-20 2010-05-25 Lexar Media, Inc. Direct secondary device interface by a host
US7743290B2 (en) 2004-08-27 2010-06-22 Lexar Media, Inc. Status of overall health of nonvolatile memory
US7865659B2 (en) 2004-04-30 2011-01-04 Micron Technology, Inc. Removable storage device
US7908426B2 (en) 1995-07-31 2011-03-15 Lexar Media, Inc. Moving sectors within a block of information in a flash memory mass storage architecture
US7917709B2 (en) 2001-09-28 2011-03-29 Lexar Media, Inc. Memory system for data storage and retrieval
US7944762B2 (en) 2001-09-28 2011-05-17 Micron Technology, Inc. Non-volatile memory control
US7949822B2 (en) 2004-08-27 2011-05-24 Micron Technology, Inc. Storage capacity status
US8171203B2 (en) 1995-07-31 2012-05-01 Micron Technology, Inc. Faster write operations to nonvolatile memory using FSInfo sector manipulation
US8386695B2 (en) 2001-09-28 2013-02-26 Micron Technology, Inc. Methods and apparatus for writing data to non-volatile memory

Families Citing this family (51)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2618002B1 (en) * 1987-07-10 1991-07-05 Schlumberger Ind Sa METHOD AND SYSTEM FOR AUTHENTICATING ELECTRONIC MEMORY CARDS
US5307494A (en) * 1987-08-05 1994-04-26 Fuji Xerox Co., Ltd. File name length augmentation method
WO1989001663A1 (en) * 1987-08-17 1989-02-23 Maximum Storage, Inc. System for accessing information stored as a link-list with back-pointers on an optical disk by using the back-pointers to generate a directory
JPH01150879A (en) * 1987-12-08 1989-06-13 Nissan Motor Co Ltd Radio type production management information medium
EP0336432B1 (en) * 1988-04-08 1993-06-30 Toppan Printing Co., Ltd. Information card system communicable in contactless manner
DK174975B1 (en) * 1988-05-06 2004-04-05 Toppan Printing Co Ltd Integrated circuit board
US5268319A (en) * 1988-06-08 1993-12-07 Eliyahou Harari Highly compact EPROM and flash EEPROM devices
JP2501874B2 (en) * 1988-06-30 1996-05-29 三菱電機株式会社 IC card
JPH0758502B2 (en) * 1988-06-30 1995-06-21 三菱電機株式会社 IC card
US5247164A (en) * 1989-01-26 1993-09-21 Hitachi Maxell, Ltd. IC card and portable terminal
JPH02214994A (en) * 1989-02-15 1990-08-27 Hitachi Maxell Ltd Ic card
JP2776929B2 (en) * 1989-03-29 1998-07-16 株式会社日立製作所 Card data processing system and card data processing method
US7447069B1 (en) 1989-04-13 2008-11-04 Sandisk Corporation Flash EEprom system
WO1990014626A1 (en) * 1989-05-15 1990-11-29 Dallas Semiconductor Corporation Systems with data-token/one-wire-bus
IL96808A (en) * 1990-04-18 1996-03-31 Rambus Inc Integrated circuit i/o using a high performance bus interface
JP3110035B2 (en) * 1990-06-07 2000-11-20 株式会社東芝 Portable electronic devices
JPH0474225A (en) * 1990-07-17 1992-03-09 Meisei Electric Co Ltd Copying method and adaptor for system data
US5517015A (en) * 1990-11-19 1996-05-14 Dallas Semiconductor Corporation Communication module
US5994770A (en) * 1991-07-09 1999-11-30 Dallas Semiconductor Corporation Portable electronic data carrier
US5638418A (en) * 1993-02-05 1997-06-10 Dallas Semiconductor Corporation Temperature detector systems and methods
US5552999A (en) * 1991-07-09 1996-09-03 Dallas Semiconductor Corp Digital histogram generator systems and methods
JP3391495B2 (en) * 1993-01-27 2003-03-31 大日本印刷株式会社 Method of managing memory area in IC card
FR2704677B1 (en) * 1993-04-29 1995-06-23 Alcatel Business Systems Programming method and device for electrically reprogrammable non-volatile memory.
US5351302A (en) * 1993-05-26 1994-09-27 Leighton Frank T Method for authenticating objects identified by images or other identifying information
JPH0744672A (en) * 1993-07-28 1995-02-14 Oki Electric Ind Co Ltd Ic card and ic card system
US5491827A (en) * 1994-01-14 1996-02-13 Bull Hn Information Systems Inc. Secure application card for sharing application data and procedures among a plurality of microprocessors
US5848541A (en) * 1994-03-30 1998-12-15 Dallas Semiconductor Corporation Electrical/mechanical access control systems
US5831827A (en) * 1994-04-28 1998-11-03 Dallas Semiconductor Corporation Token shaped module for housing an electronic circuit
JP3154892B2 (en) * 1994-05-10 2001-04-09 株式会社東芝 IC memory card and inspection method of the IC memory card
US5604343A (en) * 1994-05-24 1997-02-18 Dallas Semiconductor Corporation Secure storage of monetary equivalent data systems and processes
US5679944A (en) * 1994-06-15 1997-10-21 Dallas Semiconductor Corporation Portable electronic module having EPROM memory, systems and processes
US5615130A (en) * 1994-12-14 1997-03-25 Dallas Semiconductor Corp. Systems and methods to gather, store and transfer information from electro/mechanical tools and instruments
JP3691871B2 (en) * 1995-03-20 2005-09-07 富士通株式会社 Card type storage medium
US5864231A (en) * 1995-06-02 1999-01-26 Intel Corporation Self-compensating geometry-adjusted current mirroring circuitry
US5706239A (en) * 1996-02-27 1998-01-06 Centennial Technologies, Inc. Rechargeable SRAM/flash PCMCIA card
JPH1079000A (en) * 1996-09-03 1998-03-24 Hitachi Ltd Program writable ic card
US6488211B1 (en) * 1997-05-15 2002-12-03 Mondex International Limited System and method for flexibly loading in IC card
JP3574317B2 (en) * 1998-01-12 2004-10-06 株式会社デンソーウェーブ Non-contact IC card control system and IC card control method
US7102671B1 (en) 2000-02-08 2006-09-05 Lexar Media, Inc. Enhanced compact flash memory card
US7167944B1 (en) 2000-07-21 2007-01-23 Lexar Media, Inc. Block management for mass storage
US6700076B2 (en) * 2000-09-28 2004-03-02 Eic Corporation Multi-layer interconnect module and method of interconnection
GB0123421D0 (en) * 2001-09-28 2001-11-21 Memquest Ltd Power management system
GB0123419D0 (en) 2001-09-28 2001-11-21 Memquest Ltd Data handling system
GB0123417D0 (en) 2001-09-28 2001-11-21 Memquest Ltd Improved data processing
US6957295B1 (en) 2002-01-18 2005-10-18 Lexar Media, Inc. File management of one-time-programmable nonvolatile memory devices
US6950918B1 (en) 2002-01-18 2005-09-27 Lexar Media, Inc. File management of one-time-programmable nonvolatile memory devices
US7231643B1 (en) 2002-02-22 2007-06-12 Lexar Media, Inc. Image rescue system including direct communication between an application program and a device driver
US6676022B1 (en) * 2002-10-04 2004-01-13 Mobile-Mind, Inc. Smart card system with command queuing
CA2426354A1 (en) * 2003-04-25 2004-10-25 Gemofor Inc. Overload clutch to protect a power transmission line against overload
EP1695304A4 (en) 2003-12-17 2011-09-28 Lexar Media Inc Electronic equipment point-of-sale activation to avoid theft
EP2506486A1 (en) * 2004-02-23 2012-10-03 Lexar Media, Inc. Secure compact flash

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5998395A (en) * 1982-11-29 1984-06-06 Dainippon Printing Co Ltd Ic card

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SE425704B (en) * 1981-03-18 1982-10-25 Loefberg Bo DATABERARE
JPS57162193A (en) * 1981-03-29 1982-10-05 Fujitsu Ltd Large capacity memory device
JPS5868296A (en) * 1981-10-16 1983-04-23 Nec Corp Storage device

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5998395A (en) * 1982-11-29 1984-06-06 Dainippon Printing Co Ltd Ic card

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IBM TECHNICAL DISCLOSURE BULLETIN. vol. 13, no. 7, December 1970, NEW YORK US pages 1956 - 1960; D.R. HOLLOMAN: 'Forward and backward chaining of data areas ' *
PATENT ABSTRACTS OF JAPAN vol. 8, no. 215 (P-305)(1652) October 2, 1984 & JP 59098395 A (DAINIPPON INATSU K.K. ) June 6, 1984 *

Cited By (93)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2633743A1 (en) * 1988-06-30 1990-01-05 Nec Corp Semiconductor memory unit simulating a magnetic disc unit
FR2635607A1 (en) * 1988-08-16 1990-02-23 Dresden Forschzent Mikroelekt INTERNAL METHOD FOR PROGRAMMING AUTOMATIC CONTROL AND REDUNDANCY FOR MEMORY CIRCUITS AND APPARATUS FOR APPLYING THE METHOD
EP0376486A3 (en) * 1988-12-30 1992-03-04 Pitney Bowes, Inc. Epm having an improvement in non-volatile memory organization
EP0376486A2 (en) * 1988-12-30 1990-07-04 Pitney Bowes, Inc. EPM having an improvement in non-volatile memory organization
US5877986A (en) * 1989-04-13 1999-03-02 Sandisk Corporation Multi-state Flash EEprom system on a card that includes defective cell substitution
EP0617363A2 (en) * 1989-04-13 1994-09-28 Sundisk Corporation Defective cell substitution in EEprom array
EP0618535A2 (en) * 1989-04-13 1994-10-05 Sundisk Corporation EEprom card with defective cell substitution
US5671229A (en) * 1989-04-13 1997-09-23 Sandisk Corporation Flash eeprom system with defect handling
EP0618535A3 (en) * 1989-04-13 1995-03-08 Sundisk Corp EEprom card with defective cell substitution.
EP0617363A3 (en) * 1989-04-13 1995-03-08 Sundisk Corp Defective cell substitution in EEprom array.
US5535328A (en) * 1989-04-13 1996-07-09 Sandisk Corporation Non-volatile memory system card with flash erasable sectors of EEprom cells including a mechanism for substituting defective cells
US5862080A (en) * 1989-04-13 1999-01-19 Sandisk Corporation Multi-state flash EEprom system with defect handling
US5602987A (en) * 1989-04-13 1997-02-11 Sandisk Corporation Flash EEprom system
US7190617B1 (en) 1989-04-13 2007-03-13 Sandisk Corporation Flash EEprom system
EP0464988A3 (en) * 1990-06-25 1992-07-01 International Business Machines Corporation Personal computer system
EP0464988A2 (en) * 1990-06-25 1992-01-08 International Business Machines Corporation Personal Computer system
US7355874B2 (en) 1991-04-11 2008-04-08 Sandisk Corporation Computer memory cards using flash EEprom integrated circuit chips and memory-controller systems
US5663901A (en) * 1991-04-11 1997-09-02 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US6628537B1 (en) 1991-04-11 2003-09-30 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US6011741A (en) * 1991-04-11 2000-01-04 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US5867417A (en) * 1991-04-11 1999-02-02 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US6252791B1 (en) 1991-04-11 2001-06-26 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US6947332B2 (en) 1991-04-11 2005-09-20 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US7106609B2 (en) 1991-04-11 2006-09-12 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US6434034B1 (en) 1991-04-11 2002-08-13 Sandisk Corporation Computer memory cards using flash EEPROM integrated circuit chips and memory-controller systems
US5778418A (en) * 1991-09-27 1998-07-07 Sandisk Corporation Mass computer storage system having both solid state and rotating disk types of memory
US6016530A (en) * 1991-09-27 2000-01-18 Sandisk Corporation Mass computer storage system having both solid state and rotating disk types of memory
WO1995004321A1 (en) * 1993-07-28 1995-02-09 National Semiconductor Corporation Distributed directory for information stored on audio quality memory devices
US5600821A (en) * 1993-07-28 1997-02-04 National Semiconductor Corporation Distributed directory for information stored on audio quality memory devices
US5911031A (en) * 1995-04-27 1999-06-08 Samsung Electronics Co., Ltd. IC card memory for recording and reproducing audio and/or video data concurrently or separately and a control method thereof
GB2300286B (en) * 1995-04-27 1997-09-24 Samsung Electronics Co Ltd IC card memory for recording and reproducing audio and/or video data concurrently and separately and controlling method thereof
GB2300286A (en) * 1995-04-27 1996-10-30 Samsung Electronics Co Ltd IC card memory arrangement for recording and reproducing audio and/or video data concurrently and separately
US5930815A (en) * 1995-07-31 1999-07-27 Lexar Media, Inc. Moving sequential sectors within a block of information in a flash memory mass storage architecture
US7774576B2 (en) 1995-07-31 2010-08-10 Lexar Media, Inc. Direct logical block addressing flash memory mass storage architecture
US6757800B1 (en) 1995-07-31 2004-06-29 Lexar Media, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US6128695A (en) * 1995-07-31 2000-10-03 Lexar Media, Inc. Identification and verification of a sector within a block of mass storage flash memory
US8078797B2 (en) 1995-07-31 2011-12-13 Micron Technology, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US8032694B2 (en) 1995-07-31 2011-10-04 Micron Technology, Inc. Direct logical block addressing flash memory mass storage architecture
US6145051A (en) * 1995-07-31 2000-11-07 Lexar Media, Inc. Moving sectors within a block of information in a flash memory mass storage architecture
US6172906B1 (en) 1995-07-31 2001-01-09 Lexar Media, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US6223308B1 (en) 1995-07-31 2001-04-24 Lexar Media, Inc. Identification and verification of a sector within a block of mass STO rage flash memory
US6115785A (en) * 1995-07-31 2000-09-05 Lexar Media, Inc. Direct logical block addressing flash memory mass storage architecture
US7908426B2 (en) 1995-07-31 2011-03-15 Lexar Media, Inc. Moving sectors within a block of information in a flash memory mass storage architecture
US8171203B2 (en) 1995-07-31 2012-05-01 Micron Technology, Inc. Faster write operations to nonvolatile memory using FSInfo sector manipulation
US8554985B2 (en) 1995-07-31 2013-10-08 Micron Technology, Inc. Memory block identified by group of logical block addresses, storage device with movable sectors, and methods
US6393513B2 (en) 1995-07-31 2002-05-21 Lexar Media, Inc. Identification and verification of a sector within a block of mass storage flash memory
US8793430B2 (en) 1995-07-31 2014-07-29 Micron Technology, Inc. Electronic system having memory with a physical block having a sector storing data and indicating a move status of another sector of the physical block
US9026721B2 (en) 1995-07-31 2015-05-05 Micron Technology, Inc. Managing defective areas of memory
US6801979B1 (en) 1995-07-31 2004-10-05 Lexar Media, Inc. Method and apparatus for memory control circuit
US6728851B1 (en) 1995-07-31 2004-04-27 Lexar Media, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US5907856A (en) * 1995-07-31 1999-05-25 Lexar Media, Inc. Moving sectors within a block of information in a flash memory mass storage architecture
US6912618B2 (en) 1995-07-31 2005-06-28 Lexar Media, Inc. Direct logical block addressing flash memory mass storage architecture
US5838614A (en) * 1995-07-31 1998-11-17 Lexar Microsystems, Inc. Identification and verification of a sector within a block of mass storage flash memory
US6125435A (en) * 1995-09-13 2000-09-26 Lexar Media, Inc. Alignment of cluster address to block addresses within a semiconductor non-volatile mass storage memory
US5928370A (en) * 1997-02-05 1999-07-27 Lexar Media, Inc. Method and apparatus for verifying erasure of memory blocks within a non-volatile memory structure
US6411546B1 (en) 1997-03-31 2002-06-25 Lexar Media, Inc. Nonvolatile memory using flexible erasing methods and method and system for using same
US6587382B1 (en) 1997-03-31 2003-07-01 Lexar Media, Inc. Nonvolatile memory using flexible erasing methods and method and system for using same
US6122195A (en) * 1997-03-31 2000-09-19 Lexar Media, Inc. Method and apparatus for decreasing block write operation times performed on nonvolatile memory
US6081878A (en) * 1997-03-31 2000-06-27 Lexar Media, Inc. Increasing the memory performance of flash memory devices by writing sectors simultaneously to multiple flash memory devices
US6076137A (en) * 1997-12-11 2000-06-13 Lexar Media, Inc. Method and apparatus for storing location identification information within non-volatile memory devices
US6327639B1 (en) 1997-12-11 2001-12-04 Lexar Media, Inc. Method and apparatus for storing location identification information within non-volatile memory devices
US6813678B1 (en) 1998-01-22 2004-11-02 Lexar Media, Inc. Flash memory system
US6374337B1 (en) 1998-11-17 2002-04-16 Lexar Media, Inc. Data pipelining method and apparatus for memory control circuit
US6141249A (en) * 1999-04-01 2000-10-31 Lexar Media, Inc. Organization of blocks within a nonvolatile memory unit to effectively decrease sector write operation time
US6034897A (en) * 1999-04-01 2000-03-07 Lexar Media, Inc. Space management for managing high capacity nonvolatile memory
US6134151A (en) * 1999-04-01 2000-10-17 Lexar Media, Inc. Space management for managing high capacity nonvolatile memory
US6262918B1 (en) 1999-04-01 2001-07-17 Lexar Media, Inc. Space management for managing high capacity nonvolatile memory
US6426893B1 (en) 2000-02-17 2002-07-30 Sandisk Corporation Flash eeprom system with simultaneous multiple data sector programming and storage of physical block characteristics in other designated blocks
US6580638B2 (en) 2000-02-17 2003-06-17 Sandisk Corporation Flash EEPROM system with simultaneous multiple data sector programming and storage of physical block characteristics in other designated blocks
US6567307B1 (en) 2000-07-21 2003-05-20 Lexar Media, Inc. Block management for mass storage
US8386695B2 (en) 2001-09-28 2013-02-26 Micron Technology, Inc. Methods and apparatus for writing data to non-volatile memory
US8208322B2 (en) 2001-09-28 2012-06-26 Micron Technology, Inc. Non-volatile memory control
US9489301B2 (en) 2001-09-28 2016-11-08 Micron Technology, Inc. Memory systems
US7917709B2 (en) 2001-09-28 2011-03-29 Lexar Media, Inc. Memory system for data storage and retrieval
US9032134B2 (en) 2001-09-28 2015-05-12 Micron Technology, Inc. Methods of operating a memory system that include outputting a data pattern from a sector allocation table to a host if a logical sector is indicated as being erased
US6898662B2 (en) 2001-09-28 2005-05-24 Lexar Media, Inc. Memory system sectors
US7944762B2 (en) 2001-09-28 2011-05-17 Micron Technology, Inc. Non-volatile memory control
US8135925B2 (en) 2001-09-28 2012-03-13 Micron Technology, Inc. Methods of operating a memory system
US8694722B2 (en) 2001-09-28 2014-04-08 Micron Technology, Inc. Memory systems
US8090886B2 (en) 2004-04-20 2012-01-03 Micron Technology, Inc. Direct secondary device interface by a host
US8316165B2 (en) 2004-04-20 2012-11-20 Micron Technology, Inc. Direct secondary device interface by a host
US7725628B1 (en) 2004-04-20 2010-05-25 Lexar Media, Inc. Direct secondary device interface by a host
US8151041B2 (en) 2004-04-30 2012-04-03 Micron Technology, Inc. Removable storage device
US8612671B2 (en) 2004-04-30 2013-12-17 Micron Technology, Inc. Removable devices
US7865659B2 (en) 2004-04-30 2011-01-04 Micron Technology, Inc. Removable storage device
US9576154B2 (en) 2004-04-30 2017-02-21 Micron Technology, Inc. Methods of operating storage systems including using a key to determine whether a password can be changed
US10049207B2 (en) 2004-04-30 2018-08-14 Micron Technology, Inc. Methods of operating storage systems including encrypting a key salt
US8296545B2 (en) 2004-08-27 2012-10-23 Micron Technology, Inc. Storage capacity status
US7743290B2 (en) 2004-08-27 2010-06-22 Lexar Media, Inc. Status of overall health of nonvolatile memory
US7949822B2 (en) 2004-08-27 2011-05-24 Micron Technology, Inc. Storage capacity status
WO2007110426A3 (en) * 2006-03-28 2009-03-05 Vodafone Holding Gmbh Memory management of chip cards
WO2007110426A2 (en) 2006-03-28 2007-10-04 Vodafone Holding Gmbh Memory management of chip cards
US8090922B2 (en) 2006-03-28 2012-01-03 Vodafone Holding Gmbh Chip cards and related method for memory management

Also Published As

Publication number Publication date
EP0220718B1 (en) 1995-03-08
NO864309L (en) 1987-04-30
DE3650258T2 (en) 1995-07-27
DE3650258D1 (en) 1995-04-13
JPS62102386A (en) 1987-05-12
NO174646B (en) 1994-02-28
EP0220718A3 (en) 1991-12-04
NO174646C (en) 1994-06-08
US4748320A (en) 1988-05-31
NO864309D0 (en) 1986-10-28
JP2664137B2 (en) 1997-10-15

Similar Documents

Publication Publication Date Title
US4748320A (en) IC card
US6792501B2 (en) Universal serial bus flash memory integrated circuit device
KR940002754B1 (en) Control method in a semiconductor integrated circuit device
JP3706167B2 (en) Semiconductor disk device
EP0907142B1 (en) Memory card apparatus
US7617352B2 (en) Memory controller, flash memory system having memory controller and method for controlling flash memory device
US5958079A (en) Memory card with error correction scheme requiring reducing memory capacity
KR0121800B1 (en) Memory card device
US20010012222A1 (en) Memory controller for flash memory system and method for accessing flash memory device
US5483491A (en) Memory card device
US20050055531A1 (en) Non-volatile memory control device capable of recovering data even when data writing is interrupted
US4949240A (en) Data storage system having circuitry for dividing received data into sequential wards each stored in storage region identified by chain data
US6993601B2 (en) Interface card including selectable data transmission route modes including first transmission route mode via memory buffer and second transmission route mode not via memory buffer
US4975872A (en) Dual port memory device with tag bit marking
JPS61248132A (en) Batch file processing
JP3122222B2 (en) Memory card device
US6286757B1 (en) Portable electronic apparatus
KR100273614B1 (en) Ic card
JP3471842B2 (en) Data management device, data storage device, and data management method
JP2808358B2 (en) IC card
JP2001005928A (en) Ic card
JP2850049B2 (en) IC card
JPH0435780B2 (en)
KR100264758B1 (en) Microcomputer
JPS639587A (en) Ic card

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): CH DE FR GB LI

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

AK Designated contracting states

Kind code of ref document: A3

Designated state(s): CH DE FR GB LI

17P Request for examination filed

Effective date: 19920311

17Q First examination report despatched

Effective date: 19930525

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): CH DE FR GB LI

ET Fr: translation filed
REF Corresponds to:

Ref document number: 3650258

Country of ref document: DE

Date of ref document: 19950413

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

26N No opposition filed
REG Reference to a national code

Ref country code: GB

Ref legal event code: IF02

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20051010

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20051020

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20051026

Year of fee payment: 20

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: CH

Payment date: 20051027

Year of fee payment: 20

REG Reference to a national code

Ref country code: GB

Ref legal event code: PE20

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GB

Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION

Effective date: 20061027

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL