Data programming circuit and method for OTP memory

摘要

A data programming circuit is provided. A one-time-programmable (OTP) stores a first version of encoding data corresponding to a first version of a read-only memory (ROM) code. A control unit stores a second version of the ROM code into the OTP memory, wherein the control unit obtains a matching table according to the first version of the encoding data and the second version of the ROM code. The control unit obtains a first data segment of the first version of the encoding data and a second data segment of the second version of the ROM code that have the same content, according to the matching table. The control unit encodes the second data segment as a specific address, and the specific address points to the first data segment of the first version of the encoding data in the OTP memory.

主权项

1. A data programming circuit, comprising:
a one-time-programmable (OTP) memory, storing a first version of the encoding data corresponding to a first version of a read-only memory (ROM) code; and a control unit, storing a second version of the ROM code into the OTP memory, wherein the control unit obtains a matching table according to the first version of the encoding data and the second version of the ROM code, and obtains a first data segment of the first version of the encoding data and a second data segment of the second version of the ROM code that have the same content, according to the matching table, wherein the control unit encodes the second data segment as a specific address, and the specific address points to the first data segment of the first version of the encoding data in the OTP memory, wherein the control unit obtains a plurality of matching data segments having the same content between the first version of the encoding data and the second version of the ROM code according to the lookup table, wherein a data length of each of the plurality of matching data segments is larger than a specific threshold length, wherein the control unit calculates a weight of each path in the second version of the ROM code from a first data block to a second data block through the matching data segments, so as to find out a shortest path haying a minimum weight from the paths and to find the second data segment corresponding to the shortest path from the matching data segments, wherein each of the matching data segments comprises a plurality of data blocks and the data length of each of the matching data segments is a quantity of the plurality of data blocks.