CN111356094B - SIM short message processing method and device - Google Patents
SIM short message processing method and device Download PDFInfo
- Publication number
- CN111356094B CN111356094B CN202010014716.2A CN202010014716A CN111356094B CN 111356094 B CN111356094 B CN 111356094B CN 202010014716 A CN202010014716 A CN 202010014716A CN 111356094 B CN111356094 B CN 111356094B
- Authority
- CN
- China
- Prior art keywords
- short message
- state value
- sequence number
- sim
- search sequence
- 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.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims description 11
- 238000000034 method Methods 0.000 claims abstract description 21
- 238000012545 processing Methods 0.000 claims abstract description 13
- 238000004891 communication Methods 0.000 claims description 3
- 238000012217 deletion Methods 0.000 abstract description 9
- 230000037430 deletion Effects 0.000 abstract description 9
- 230000002093 peripheral effect Effects 0.000 description 4
- PENWAFASUFITRC-UHFFFAOYSA-N 2-(4-chlorophenyl)imidazo[2,1-a]isoquinoline Chemical compound C1=CC(Cl)=CC=C1C1=CN(C=CC=2C3=CC=CC=2)C3=N1 PENWAFASUFITRC-UHFFFAOYSA-N 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
- H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/35—Clustering; Classification
- G06F16/355—Class or cluster creation or modification
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
- H04W8/183—Processing at user equipment or user record carrier
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a method for processing an SIM short message, which comprises the following steps: determining element values in the byte array corresponding to the search sequence number i, and judging whether the state value corresponding to the current element is a first state value; if yes, writing the short message content into a storage position corresponding to the index in the SIM; if not, increasing the search sequence number; if the search sequence number reaches the preset maximum value, traversing the byte array, and judging whether the state value corresponding to the current element is a second state value; if the element is found, reading the record of the position corresponding to the SIM according to the index, if the short message is not stored, executing the writing operation of the short message, and changing the state value corresponding to the element into a third state value; and if the short message is stored, judging the next element with the second state value. The method aims to provide quick operations of writing and classifying deletion of the short message SIM, changes 2 USIM operations into 1 operation, and greatly improves the efficiency of writing and classifying deletion of the short message SIM.
Description
Technical Field
The present invention relates to the field of SIM short message processing technologies, and in particular, to a method and an apparatus for processing an SIM short message.
Background
The method for storing the short message on the SIM comprises the steps of firstly finding a free record on a short message storage file of the SIM, wherein the first byte on each short message record is the state of recording the short message, and the states of the short message mainly comprise unread/read/unsent/sent and the like. The first bit of this byte is used to indicate whether this record is occupied or not. The process of searching for free records is to go through all records, read the first byte of all records, check if the first bit is 1, and determine if the position can be used to store the short message.
The same applies to the operation of deleting classified short messages, for example, only deleting read, unread, sent, and unsent short messages, it is necessary to read each short message record to obtain its short message status byte, and then determine whether deletion is needed.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a method and a device for processing a short message SIM (subscriber identity module), aiming at providing quick operation of writing and classifying and deleting the short message SIM, changing 2 USIM operations into 1 operation and greatly improving the efficiency of writing and classifying and deleting the short message SIM.
The invention is realized by the following steps:
the invention provides a method for processing an SIM short message, which comprises the following steps:
receiving a short message write command;
setting an index initial search sequence number i according to the index sequence;
determining element values in a byte array corresponding to the search sequence number i, wherein the element values in the byte array are any one of a first state value, a second state value and a third state value, and the index represents a corresponding storage position number of the SIM;
judging whether a state value corresponding to a current element is a first state value, wherein the first state value is represented as an unoccupied state;
if yes, writing the content of the short message into a storage position corresponding to the index in the SIM, and updating the state value of the element to be a third state value;
if not, increasing the search sequence number, and returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value;
if the search sequence number reaches the preset maximum value, traversing each element in the byte array according to the index sequence, and judging whether the state value corresponding to the current element is a second state value, wherein the second state is an initial value;
if the short message is found, reading the record of the position corresponding to the SIM according to the index, judging whether the short message is stored, if the short message is not stored, executing the writing operation of the short message, and changing the state value corresponding to the element into a third state value; and if the short message is stored, judging the next element which is the second state value, and returning to the step of reading the record of the position corresponding to the SIM according to the index.
In one implementation manner, the step of increasing the search sequence number and returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value includes:
and taking i +1 as a new search sequence number i, judging whether the current search sequence number i reaches the maximum value, if not, returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i.
In one implementation, the method further comprises:
traversing the search sequence number, and if the corresponding state value is not the second state value, determining whether the stored short message value is matched with the type of the short message to be deleted;
if the short message is matched with the first state value, deleting the short message, and updating the state value in the record _ flag array to be the first state value;
if the corresponding state value is the second state value, the record corresponding to the index sequence number in the SIM is read to determine whether to delete the record, and the state value is updated at the same time.
In one implementation, the method further comprises:
receiving a reading instruction;
setting an index initial search sequence number i according to the index sequence;
determining element values in the byte array corresponding to the search sequence number i;
judging whether the state value corresponding to the current element is a third state value, reading the short message corresponding to the storage position, and determining whether the short message is the required short message according to the search condition;
if yes, acquiring the short message, if not, taking i +1 as a new search sequence number i, and returning to execute the step of judging whether the state value corresponding to the current element is a third state value;
or,
judging whether the state value corresponding to the current element is a second state value, reading the short message corresponding to the storage position, and determining whether the short message is the required short message according to the search condition;
if yes, the short message is obtained, if not, i +1 is used as a new search sequence number i, and the step of judging whether the state value corresponding to the current element is the second state value is returned.
And also discloses a SIM short message processing device, which comprises a processor and a memory connected with the processor through a communication bus; wherein,
the memory is used for storing the SIM short message processing program;
the processor is configured to execute the SIM short message processing program to implement:
receiving a short message write command;
setting an index initial search sequence number i according to the index sequence;
determining element values in a byte array corresponding to the search sequence number i, wherein the element values in the byte array are any one of a first state value, a second state value and a third state value, and the index represents a corresponding storage position number of the SIM;
judging whether a state value corresponding to a current element is a first state value, wherein the first state value is represented as an unoccupied state;
if yes, writing the content of the short message into a storage position corresponding to the index in the SIM, and updating the state value of the element to be a third state value;
if not, increasing the search sequence number, and returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value;
if the search sequence number reaches the preset maximum value, traversing each element in the byte array according to the index sequence, and judging whether the state value corresponding to the current element is a second state value, wherein the second state is an initial value;
if the short message is found, reading the record of the position corresponding to the SIM according to the index, judging whether the short message is stored, if the short message is not stored, executing the writing operation of the short message, and changing the state value corresponding to the element into a third state value; if the short message is stored, the next element which is the second state value is judged, the step of reading the record of the position corresponding to the SIM according to the index is returned to be executed,
and any step corresponding to the SIM short message processing method.
The SIM short message processing method and the device have the following beneficial effects that:
1. the method and the device provide rapid operation of writing and classifying deletion of the short message SIM, change 2 USIM operations into 1 operation, and greatly improve the efficiency of writing and classifying deletion of the short message SIM.
2. The invention is not only suitable for SIM short message writing and classified deletion, but also suitable for other peripheral equipment, such as NV (FLASH), and the writing and classified deletion operation of the content similar to the short message. An array is opened up in the CPU memory for each recorded state of the peripheral. When the values in the array have known effective values, the peripheral does not need to be accessed, the number of times of accessing the peripheral can be greatly reduced, and the read-write efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic flow chart of a method for processing a SIM short message according to an embodiment of the present invention;
fig. 2 is a schematic view of an application scenario of a SIM short message processing method according to an embodiment of the present invention;
fig. 3 is a schematic view of another application scenario of the SIM short message processing method according to the embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1 and fig. 2, an embodiment of the present invention provides a method for processing a SIM short message, where the method includes:
s101, receiving a short message write command.
The command may be sent by the user or processed automatically by the SIM short message processing.
S102, setting an index initial search sequence number i according to the index sequence.
Corresponding to the short message record in each SIM card, establishing a byte array record _ flag [ MAX _ REC _ NUM ] in a CPU memory, wherein each array element corresponds to a short message record in the SIM to form one-to-one correspondence, for example, record _ flag [1], and the short message state of the record with the position of 1 in the SIM is corresponding; and (3) recording _ flag [ n ], corresponding to the recorded short message state with the position of n in the SIM, wherein the arbitrary ith position is recording _ flag [ i ], and the search sequence number can be i.
S103, determining element values in the byte array corresponding to the search sequence number i, wherein the element values in the byte array are any one of a first state value, a second state value and a third state value, and the index represents a corresponding storage position number of the SIM.
It is understood that, if the search sequence number is i, the record corresponding to the search sequence number, that is, the element of the byte array, is a fixed value, and may be formed by setting or may be a default value.
For example, since record _ flag [ i ] ═ 0, or record _ flag [ i ] ═ 1, or record _ flag [ i ] ═ 0xFF, where 0xFF is an initial value ungown, and when 0, it indicates an unoccupied record, and when 1, it indicates a used state, three state values are included.
In the embodiment of the invention, the search sequence number can correspond to different storage positions in the SIM, so that the combination of the storage positions corresponding to the SIM card and the storage states thereof is formed.
For example, if record _ flag [ i ] ≦ 1 indicates that the i-th storage area of the SIM is used, if record _ flag [ n ] ≦ 0 indicates that the n-th storage area of the SIM is unused, and if record _ flag [ P ] ≦ 0xFF indicates that the P-th storage area of the SIM is set to the initial value unkown.
S104, judging whether a state value corresponding to the current element is a first state value, wherein the first state value is represented as an unoccupied state; if yes, go to S105, if no, go to S106.
In the embodiment of the present invention, it is specified that the first state value is an unoccupied state, and when a short message write command is received, a record _ flag [ MAX _ REC _ NUM ] is traversed first, where MAX _ REC _ NUM is a sequence number, that is, a search sequence number index is referred to.
S105, writing the content of the short message into a storage position corresponding to the index in the SIM, and updating the state value of the element to be a third state value; if not, S105 is performed.
If all elements have a record with no unoccupied record (record _ flag [ index ] &0xff ═ 0), a short message is written into the record, and the state value of the position is updated to be used, that is, to be the third state value.
And S106, increasing the search sequence number, and returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value.
And if the maximum value of index is not reached in the traversal process, continuing to perform i +1 processing on i, assigning a value to i, and performing the next iteration process. If the traversal result does not find an unoccupied element, then it is seen whether there is a storage area that can be used by looking up the original value.
And S107, if the search sequence number reaches the preset maximum value, traversing each element in the byte array according to the index sequence, and judging whether the state value corresponding to the current element is a second state value, wherein the second state is an initial value.
Then, starting with index of 1, find the element of 0xFF-unknown in record _ flag [ MAX _ REC _ NUM ].
S108, if the element is found, reading the record of the position corresponding to the SIM according to the index, judging whether the short message is stored, if the short message is not stored, executing the writing operation of the short message, and changing the state value corresponding to the element into a third state value; and if the short message is stored, judging the next element which is the second state value, and returning to the step of reading the record of the position corresponding to the SIM according to the index.
If record _ flag [ index ] is 0xFF, reading the record with the position corresponding to the SIM as the index, acquiring whether the record position has the short message, if not, writing the content of the short message into the record, and updating the value of record _ flag [ index ] as the state of the written short message. And if so, continuously reading the SIM record at the corresponding position of the next 0xFF-unkown element in the record _ flag [ MAX _ REC _ NUM ] array. The short message content can be written until a free record is found
In an implementation manner of the present invention, the method further includes: traversing the search sequence number, and if the corresponding state value is not the second state value, determining whether the stored short message value is matched with the type of the short message to be deleted; if the short state value is matched with the short state value, deleting the short state value, and updating the state value in the record _ flag array to be the first state value; if the corresponding state value is the second state value, the record corresponding to the index sequence number in the SIM is read to determine whether to delete the record, and the state value is updated at the same time.
For the classified deletion operation, similar operation can be performed, and first the record _ flag [ MAX _ REC _ NUM ] is traversed, if the value is not the 0xFF-unknown value, whether the value matches the short message type to be deleted is judged, if the value matches the short message type to be deleted, the short message type is deleted, and meanwhile, the value in the record _ flag array is updated to be 0. If record _ flag [ index ] ═ 0xFF, read the index record in USIM to decide whether to delete operation, and update the record _ flag [ index ] value. The algorithm flow for sorting and deleting is shown with reference to fig. 3.
In one implementation, the method further comprises:
receiving a reading instruction; setting an index initial search sequence number i according to the index sequence; determining element values in the byte array corresponding to the search sequence number i; judging whether the state value corresponding to the current element is a third state value, reading the short message corresponding to the storage position, and determining whether the short message is the required short message according to the search condition; if yes, acquiring the short message, if not, taking i +1 as a new search sequence number i, and returning to execute the step of judging whether the state value corresponding to the current element is a third state value;
or, judging whether the state value corresponding to the current element is the second state value, reading the short message corresponding to the storage position, and determining whether the short message is the required short message according to the search condition; if yes, the short message is obtained, if not, i +1 is used as a new search sequence number i, and the step of judging whether the state value corresponding to the current element is the second state value is returned.
And simultaneously, other short message operation commands such as reading also synchronously update the value in the record _ flag [ MAX _ REC _ NUM ] array. Thus, the more frequent the SIM operation is, the more excellent the algorithm is. When the element value in the record _ flag [ MAX _ REC _ NUM ] does not have 0xFF-unknown, the operations of writing and classification deletion can be really changed from 2 operations to 1 operation, so that the efficiency is improved by 1 time, even by far more than 1 time.
And also discloses a SIM short message processing device, which comprises a processor and a memory connected with the processor through a communication bus; wherein,
the memory is used for storing the SIM short message processing program;
the processor is configured to execute the SIM short message processing program to implement:
receiving a short message write command;
setting an index initial search sequence number i according to the index sequence;
determining element values in a byte array corresponding to the search sequence number i, wherein the element values in the byte array are any one of a first state value, a second state value and a third state value, and the index represents a corresponding storage position number of the SIM;
judging whether a state value corresponding to a current element is a first state value, wherein the first state value is represented as an unoccupied state;
if yes, writing the content of the short message into a storage position corresponding to the index in the SIM, and updating the state value of the element to be a third state value;
if not, increasing the search sequence number, and returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value;
if the search sequence number reaches the preset maximum value, traversing each element in the byte array according to the index sequence, and judging whether the state value corresponding to the current element is a second state value, wherein the second state is an initial value;
if the short message is found, reading the record of the position corresponding to the SIM according to the index, judging whether the short message is stored, if the short message is not stored, executing the writing operation of the short message, and changing the state value corresponding to the element into a third state value; if the short message is stored, the next element which is the second state value is judged, the step of reading the record of the position corresponding to the SIM according to the index is returned to be executed,
and any step corresponding to the SIM short message processing method.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (5)
1. A method for processing a short message of a SIM (subscriber identity module), the method comprising:
receiving a short message write command;
setting an index initial search sequence number i according to the index sequence;
determining element values in a byte array corresponding to the search sequence number i, wherein the element values in the byte array are any one of a first state value, a second state value and a third state value, and the index represents a corresponding storage position number of the SIM;
judging whether a state value corresponding to a current element is a first state value, wherein the first state value is represented as an unoccupied state;
if yes, writing the content of the short message into a storage position corresponding to the index in the SIM, and updating the state value of the element to be a third state value;
if not, increasing the search sequence number, and returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value;
if the search sequence number reaches the preset maximum value, traversing each element in the byte array according to the index sequence, and judging whether the state value corresponding to the current element is a second state value, wherein the second state is an initial value;
if the short message is found, reading the record of the position corresponding to the SIM according to the index, judging whether the short message is stored, if the short message is not stored, executing the writing operation of the short message, and changing the state value corresponding to the element into a third state value; and if the short message is stored, judging the next element which is the second state value, and returning to the step of reading the record of the position corresponding to the SIM according to the index.
2. The SIM short message processing method according to claim 1, wherein the step of increasing the search sequence number and returning to determine the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value comprises:
and taking i +1 as a new search sequence number i, judging whether the current search sequence number i reaches the maximum value, if not, returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i.
3. The SIM short message processing method according to claim 1 or 2, characterized in that the method further comprises:
traversing the search sequence number, and if the corresponding state value is not the second state value, determining whether the stored short message value is matched with the type of the short message to be deleted;
if the short message is matched with the first state value, deleting the short message, and updating the state value in the record _ flag array to be the first state value;
if the corresponding state value is the second state value, the record corresponding to the index sequence number in the SIM is read to determine whether to delete the record, and the state value is updated at the same time.
4. The SIM short message processing method according to claim 3, wherein the method further comprises:
receiving a reading instruction;
setting an index initial search sequence number i according to the index sequence;
determining element values in the byte array corresponding to the search sequence number i;
judging whether the state value corresponding to the current element is a third state value, reading the short message corresponding to the storage position, and determining whether the short message is the required short message according to the search condition;
if yes, acquiring the short message, if not, taking i +1 as a new search sequence number i, and returning to execute the step of judging whether the state value corresponding to the current element is a third state value;
or,
judging whether the state value corresponding to the current element is a second state value, reading the short message corresponding to the storage position, and determining whether the short message is the required short message according to the search condition;
if yes, the short message is obtained, if not, i +1 is used as a new search sequence number i, and the step of judging whether the state value corresponding to the current element is the second state value is returned.
5. A SIM short message processing apparatus, characterized in that the apparatus comprises a processor, and a memory connected with the processor through a communication bus; wherein,
the memory is used for storing the SIM short message processing program;
the processor is configured to execute the SIM short message processing program to implement:
receiving a short message write command;
setting an index initial search sequence number i according to the index sequence;
determining element values in a byte array corresponding to the search sequence number i, wherein the element values in the byte array are any one of a first state value, a second state value and a third state value, and the index represents a corresponding storage position number of the SIM;
judging whether a state value corresponding to a current element is a first state value, wherein the first state value is represented as an unoccupied state;
if yes, writing the content of the short message into a storage position corresponding to the index in the SIM, and updating the state value of the element to be a third state value;
if not, increasing the search sequence number, and returning to execute the step of determining the element value in the byte array corresponding to the search sequence number i when the search sequence number is not the preset maximum value;
if the search sequence number reaches the preset maximum value, traversing each element in the byte array according to the index sequence, and judging whether the state value corresponding to the current element is a second state value, wherein the second state is an initial value;
if the short message is found, reading the record of the position corresponding to the SIM according to the index, judging whether the short message is stored, if the short message is not stored, executing the writing operation of the short message, and changing the state value corresponding to the element into a third state value; if the short message is stored, the next element which is the second state value is judged, the step of reading the record of the position corresponding to the SIM according to the index is returned to be executed,
and the steps corresponding to the SIM short message processing method of any of claims 2 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010014716.2A CN111356094B (en) | 2020-01-07 | 2020-01-07 | SIM short message processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010014716.2A CN111356094B (en) | 2020-01-07 | 2020-01-07 | SIM short message processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111356094A CN111356094A (en) | 2020-06-30 |
| CN111356094B true CN111356094B (en) | 2021-09-03 |
Family
ID=71196975
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010014716.2A Active CN111356094B (en) | 2020-01-07 | 2020-01-07 | SIM short message processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111356094B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112599172B (en) * | 2020-12-24 | 2024-05-17 | 潍柴动力股份有限公司 | Data writing method and device of electronic control unit and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101404797A (en) * | 2008-11-07 | 2009-04-08 | 中兴通讯股份有限公司 | Storage method, storage management apparatus and storage system for long message |
| CN101931695A (en) * | 2010-08-03 | 2010-12-29 | 中兴通讯股份有限公司 | Wireless network card and short message storing and reading method thereof |
| CN101932133A (en) * | 2010-08-17 | 2010-12-29 | 中兴通讯股份有限公司 | Short message storage method and wireless communication terminal |
| CN102402511A (en) * | 2010-09-08 | 2012-04-04 | 中兴通讯股份有限公司 | Method and system for storing service data |
| EP2584862A4 (en) * | 2010-06-18 | 2014-01-22 | Zte Corp | Method and terminal for processing short message |
| CN103677655A (en) * | 2012-09-26 | 2014-03-26 | 北京信威通信技术股份有限公司 | Method and device for reading and writing two-dimensional array data flows into storage device |
| CN104703154A (en) * | 2015-01-29 | 2015-06-10 | 烽火通信科技股份有限公司 | Short message storage method and system of LTE uplink home gateway |
| CN106326384A (en) * | 2016-08-16 | 2017-01-11 | 中国科学院长春光学精密机械与物理研究所 | File storage method suitable for high-speed mass storage based on FPGA (Field Programmable Gate Array) |
| CN106844716A (en) * | 2017-02-08 | 2017-06-13 | 上海熙菱信息技术有限公司 | A kind of mass data automated storing method based on Solr indexes and Oracle storages |
| CN109032533A (en) * | 2018-08-29 | 2018-12-18 | 新华三技术有限公司 | A kind of date storage method, device and equipment |
-
2020
- 2020-01-07 CN CN202010014716.2A patent/CN111356094B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101404797A (en) * | 2008-11-07 | 2009-04-08 | 中兴通讯股份有限公司 | Storage method, storage management apparatus and storage system for long message |
| EP2584862A4 (en) * | 2010-06-18 | 2014-01-22 | Zte Corp | Method and terminal for processing short message |
| CN101931695A (en) * | 2010-08-03 | 2010-12-29 | 中兴通讯股份有限公司 | Wireless network card and short message storing and reading method thereof |
| CN101932133A (en) * | 2010-08-17 | 2010-12-29 | 中兴通讯股份有限公司 | Short message storage method and wireless communication terminal |
| CN102402511A (en) * | 2010-09-08 | 2012-04-04 | 中兴通讯股份有限公司 | Method and system for storing service data |
| CN103677655A (en) * | 2012-09-26 | 2014-03-26 | 北京信威通信技术股份有限公司 | Method and device for reading and writing two-dimensional array data flows into storage device |
| CN104703154A (en) * | 2015-01-29 | 2015-06-10 | 烽火通信科技股份有限公司 | Short message storage method and system of LTE uplink home gateway |
| CN106326384A (en) * | 2016-08-16 | 2017-01-11 | 中国科学院长春光学精密机械与物理研究所 | File storage method suitable for high-speed mass storage based on FPGA (Field Programmable Gate Array) |
| CN106844716A (en) * | 2017-02-08 | 2017-06-13 | 上海熙菱信息技术有限公司 | A kind of mass data automated storing method based on Solr indexes and Oracle storages |
| CN109032533A (en) * | 2018-08-29 | 2018-12-18 | 新华三技术有限公司 | A kind of date storage method, device and equipment |
Non-Patent Citations (1)
| Title |
|---|
| 嵌入式应用中接收GSM短消息的两种方法;刘海涛;《单片机与嵌入式系统应用》;20130301;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111356094A (en) | 2020-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101826107A (en) | Hash data processing method and device | |
| CN111400099B (en) | Flash memory data rereading method, device, equipment and computer readable storage medium | |
| CN106598504B (en) | data storage method and device | |
| CN111356094B (en) | SIM short message processing method and device | |
| CN112466378A (en) | Solid state disk operation error correction method and device and related components | |
| CN112347001A (en) | Flash memory garbage recovery verification method and device and electronic equipment | |
| CN117390029B (en) | Table entry inserting method and device, electronic equipment and storage medium | |
| US20070162707A1 (en) | Information recording medium data processing apparatus and data recording method | |
| CN112181275A (en) | Data processor and data processing method | |
| CN111913890B (en) | Random read-write method of nonvolatile memory based on security module | |
| CN101131649A (en) | Updating speed improving method for read-only memory of device with flash memory | |
| CN114360628B (en) | Flash memory detection method and device | |
| US6735680B2 (en) | Method and apparatus for deleting objects from memory within a smart card | |
| CN116225317A (en) | Data read-write method and device for user identification card, user identification card and medium | |
| CN110119252B (en) | Management method and device for universal flash memory storage array | |
| CN114691612A (en) | Data writing method and device and data reading method and device | |
| US20100077147A1 (en) | Methods for caching directory structure of a file system | |
| KR100479170B1 (en) | Access control device for memory and method thereof | |
| CN113625938A (en) | Metadata storage method and equipment thereof | |
| CN110837345A (en) | Bad block table storage method and device | |
| CN114816833B (en) | Writing method, device and system of flash data | |
| CN116055464B (en) | Download preservation path selection method, device and medium | |
| CN112947862B (en) | Device, Flash memory and data storage method thereof | |
| CN114063935B (en) | Method and device for processing data | |
| KR100521155B1 (en) | Apparatus and method for writing data in flash memory |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240619 Address after: Room 504, 2nd Floor, Building 2, Xianduyuan, No. 254 Qinchuan Road, Tailaoshan Town, Fuding City, Ningde City, Fujian Province, 355200 Patentee after: Fuding Zhuoyue Intellectual Property Management Co.,Ltd. Country or region after: China Address before: Room 1001 and 1002, zone B, Jinqiu international building, No. 6, Zhichun Road, Haidian District, Beijing 100088 Patentee before: BEIJING SIMPLIGHT NANOELECTRONICS Co.,Ltd. Country or region before: China |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240703 Address after: Room 302-2, Building C2, Qingdao National University Science and Technology Park, No. 127 Huizhiqiao Road, High tech Zone, Qingdao City, Shandong Province, China 266000 Patentee after: Qingdao Zhongqing Media Technology Co.,Ltd. Country or region after: China Address before: Room 504, 2nd Floor, Building 2, Xianduyuan, No. 254 Qinchuan Road, Tailaoshan Town, Fuding City, Ningde City, Fujian Province, 355200 Patentee before: Fuding Zhuoyue Intellectual Property Management Co.,Ltd. Country or region before: China |
|
| TR01 | Transfer of patent right |