CN101339536B - Quake-proof system data processing method - Google Patents
Quake-proof system data processing method Download PDFInfo
- Publication number
- CN101339536B CN101339536B CN2007101227629A CN200710122762A CN101339536B CN 101339536 B CN101339536 B CN 101339536B CN 2007101227629 A CN2007101227629 A CN 2007101227629A CN 200710122762 A CN200710122762 A CN 200710122762A CN 101339536 B CN101339536 B CN 101339536B
- Authority
- CN
- China
- Prior art keywords
- sequence
- sector
- data
- processing method
- data processing
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
The invention relates to a data processing method of an anti-shock system, which utilizes one computing control flow to execute format conversion between two different storage resources in the anti-shock system and effectively searches the corresponding data position between the two different storage resources. The invention does not need to convert the format between the two different storage resources in the anti-shock system in a table building-in way, at the same time, the corresponding data position between the storage resources can be found out by faster speed as well as less computation and variable.
Description
Technical field
The present invention relates to a kind of data processing method, particularly a kind of data processing method that is applied in the electronic shock system.
Background technology
The consumer has a kind of tangible trend in the demand side to message equipment, promptly for portable requirement.For mancarried device; CD system particularly because user's the vibrations that moving situation caused, and makes the situation of CD system generation data read errors through regular meeting; and then cause played songs or audio-visual discontinuous situation, will influence the user like this and listen to music or view and admire audio-visual quality.
For avoiding the generation of above-mentioned situation, portable CD system needs the measure that shakes of preventing when data read.General earthquake counter measure can be divided into mechanical type and electronic type, and at present, there is the trend of more and more popularizing in the electronic anti-vibration system.The basic demand of electronic anti-vibration is the length of time, promptly having under the vibration situation of not stopping, can keep legato maximum duration, and the time is long more, and shockproof effect is good more.Therefore, under limited storage resources, need manage to prolong the shockproof time.
Based on the consideration of total system, need design that the data that a kind of efficient flow process controls anti-shock system obtain, data compression, data storing and data search.Anti-shock system is when data produce again, need a kind of efficient method, two kinds of different storage resources of data storage resource end after can linking up the Data Source end and producing again, it needs the quick and unique position of determination data in two kinds of different storage resources.Secondly, aspect data search,, have lot of data and exist in the storage resources when shockproof time lengthening.If use traditional method for searching, will too slowly and expend calculation resources.Therefore, need high efficiency search pattern.
Yet the communication between two kinds of different storage resources can run into the problem of format conversion.In different storage resources, have different unit lengths, if directly apply mechanically the form of first kind of storage resources, efficient can reduce.Secondly, in the electronic shock system, the data in second kind of storage resources need compression, and this can cause the form of form length and first kind of storage resources inconsistent.See also Fig. 1, existing Data Format Transform is with shown in the search synoptic diagram, and the general in the past practice is converting form 11 of construction, but will take the components of system as directed storage resources like this.In addition, (i=1～(j=1～m), it need search all m sequence sequence Si in first kind of storage resources, even use the binary search method, efficient is still not high n) to desire to try to achieve sequence Nj corresponding in second kind of storage resources.
Summary of the invention
The objective of the invention is to, a kind of data processing method of anti-shock system is provided, effectively utilize storage resources and efficient method for searching is provided in anti-shock system, to provide.
To achieve these goals, the invention provides a kind of data processing method of anti-shock system, in anti-shock system, determine corresponding data area in one first sequence and one second sequence, to solve two kinds of inconsistent problems of storage resources form, and do not need a built-in converting form, to save storage resources, may further comprise the steps: at first, obtain a sector position M of this first sequence; And provide the sector unit length L1 of this first sequence and the sector unit length L2 of this second sequence; Then, the sector unit length L1 of this first sequence is multiplied by the sector position M of this first sequence, to draw the data volume of desiring to write this second sequence; Then, result after will multiplying each other is divided by the sector unit length L2 of this second sequence, try to achieve the number of pages r that next sector position Q+1 of writing sector position Q in full sector number Q and this second sequence in this second sequence is write, write in regular turn in this second sequence with data with this first sequence; At last, this sector position M of this first sequence is corresponded in the sector position (Q+1) in this second sequence the position of mobile number of pages r backward, thereby determine corresponding data area in this first sequence and this second sequence.
To achieve these goals, the present invention also provides a kind of data processing method of anti-shock system, search corresponding data in one first sequence in anti-shock system and one second sequence, may further comprise the steps: the data of this first sequence are stored in this second sequence in regular turn; Then, store the minimum sector position A of the data of this first sequence in temporary this second sequence; Then, obtain a sector position M of this first sequence of desire search; Then, provide the sector unit length L1 of this first sequence and the sector unit length L2 of this second sequence; Then, the sector unit length Ls of this first sequence is multiplied by the sector position M of this first sequence; Result after will multiplying each other again is divided by the sector unit length L2 of this second sequence, in the hope of writing full sector number Q in this second sequence; Then, deduct minimum sector position A in this second sequence with writing full sector number Q in this second sequence, in the hope of a movement value Q-A; At last, this sector position M with this first sequence corresponds to the sector position that the minimum sector position A of this second sequence down calculates this movement value Q-A.
Describe the present invention below in conjunction with the drawings and specific embodiments, but not as a limitation of the invention.
Description of drawings
Fig. 1 is existing Data Format Transform and search synoptic diagram;
Fig. 2 is two kinds of different-format storage resources of the present invention corresponding method synoptic diagram;
Fig. 3 A is 1 o'clock synoptic diagram for the present invention's second sequence minimum value;
Fig. 3 B is 2 o'clock synoptic diagram for the present invention's second sequence minimum value;
Fig. 3 C is 3 o'clock synoptic diagram for the present invention's second sequence minimum value;
Fig. 4 is the synoptic diagram of data processing first preferred embodiment of anti-shock system of the present invention;
Fig. 5 is the synoptic diagram of data processing second preferred embodiment of anti-shock system of the present invention.
Wherein, Reference numeral:
The 11-converting form
Sequence in first kind of storage resources of Si-
Sequence in second kind of storage resources of Nj-
21,41,51-first sequence
22,32,42,52-second sequence
1～15-sector
The L1-first sequence sector unit length
The L2-second sequence sector unit length
Embodiment
For the inconsistent problem of form in two kinds of storage resources in the anti-shock system, the present invention proposes a kind of mode that does not need built-in form, it can save the storage space that stores form, also can reach the effect of elastification.Because present compress technique progress is quick, if can not use the mode of built-in form, in the time will changing new form, only need correction a little, do not need to revise built-in form.
When first sequence in the anti-shock system is wanted corresponding second sequence, need not pass through built-in form, utilize the mode of formula L1 * M=L2 * Q+r, can uniquely determine corresponding page (page) in first sequence and second sequence.Wherein, L1 represents the unit length of first sequence, L2 represents the unit length of second sequence nucleotide sequence, M represents position, M sector (sector) in first sequence, Q represents that the sector number that can be filled with in second sequence, r represent to contain in the next sector position (Q+1) of sector position Q in second sequence r page or leaf of data.
See also Fig. 2, this is two kinds of different-format storage resources of the present invention corresponding method synoptic diagram.Suppose that first sequence 21 is the sector unit length L1=1176 of general CD, second sequence 22 is the sector unit length L2=1152 of MPEG1, by formula L1 * M=L2 * Q+r 3 sectors of data correspondences of first sequence 21 are stored to second sequence 22, can be shown in second sequence 22 among Fig. 2, fill up 3 sectors (Q=3) in second sequence 22, and store the data of 72 pages (r=72) in the 4th sector (Q+1).
So, two kinds of different-format storage resources need not be as prior art in anti-shock system, utilize the mode of built-in form to link up, thereby can save the storage space of system, and can make the operation elastification of change of format, need not because of the change of the saving format loaded down with trivial details like this operation of built-in form of will going to make amendment.
After the storage corresponding method that two kinds of different-format storage resources are provided, a kind of method is provided again, be used between two kinds of different-format storage resources, finding out corresponding data.
After the aforesaid storage corresponding method of utilization, utilize a parameter A to store the minimum value of second sequence, sector in each second sequence 22 is provided with a position (bit) represents whether this sector is minimum value, if be minimum then be made as 1, and other be made as 0, the design of similar high-speed cache (cache).And minimum value stores the sector value of the minimum of these data when to be data in first sequence 21 write second sequence 22 in second sequence 22.
Please join Fig. 3 A, 3B and 3C, to explain the definition of the present invention's second sequence minimum value.At first see also Fig. 3 A, suppose that second sequence has 1～10 sector, write (or preceding) when full when 10 sectors in second sequence 32, then the stored minimum value of parameter A is 1, and sector 1 will be set as 1, and all the other are 0.Please consult Fig. 3 B again,, also have data to continue to write if after 1～10 sector has all been write, then will need the 11st sector, will erase sector 1 for the writing of data this moment, and the stored minimum value of parameter A then is 2, sector 2 will be set as 1, and all the other are 0.In like manner, Fig. 3 C figure is depicted as, if data continue to write, when needing the 12nd sector, is just erased in sector 2, and so that new data is write, the stored minimum value of parameter A then is 3, and sector 3 will be set as 1, and all the other are 0.
In sum, after the Q value and parameter A in trying to achieve formula L1 * M=L2 * Q+r, try to achieve the numerical value of Q-A, corresponding position is set at 1 sector position (being the position of minimum value) and moves down Q-A sector, can try to achieve the first sequence sector position M the sector position of corresponding second sequence.
Then, illustrate with an embodiment data processing method of anti-shock system of the present invention to see also Fig. 4 that this is the synoptic diagram of data processing first preferred embodiment of anti-shock system of the present invention.Suppose that first sequence 41 is the sector unit length L1=1176 of general CD, second sequence 42 is the sector unit length L2=1152 of MPEG1, by formula L1 * M=L2 * Q+r 8 sectors of data correspondences of first sequence 41 are stored to second sequence 42, distribution that can be shown in second sequence 42 among Fig. 4; Suppose that second sequence 42 is the sequence of 10 sectors, and sector 1 is a minimum value, so parameter A is 1, simultaneously, sector 1 is expressed the position of minimum value and is represented that with 1 all the other are made as 0.
Then, if desire is selected the sector position of 3 correspondence second sequences 42 in sector of first sequence 41, by formula L1 * M=L2 * Q+r as can be known, M=3, Q=3, r=72.So, be set at 1 sector position (being the position of minimum value) by corresponding position and move down Q-A sector, it is the position that sector 1 moves down Q-A=3-1=2 sector, just try to achieve 3 corresponding first sequences, 41 sectors 3, second sequence, 42 sectors, in other words, can find the data of first sequence, 41 sectors 3 in second sequence, 42 sectors 3.
Then, if desire is selected the sector position of 8 correspondence second sequences 42 in sector of first sequence 41, by formula L1 * M=L2 * Q+r as can be known, M=8, Q=8, r=192.Method according to aforesaid search corresponding data, be set at 1 sector position (being the position of minimum value) by corresponding position and move down Q-A sector, it is the position that sector 1 moves down Q-A=8-1=7 sector, just try to achieve 8 corresponding first sequences, 41 sectors 8, second sequence, 42 sectors, in other words, can find the data of first sequence, 41 sectors 8 in second sequence, 42 sectors 8.
See also Fig. 5, this is the synoptic diagram of data processing second preferred embodiment of anti-shock system of the present invention.Suppose that first sequence 51 is the sector unit length L1=1176 of general CD, second sequence 52 is the sector unit length L2=1152 of MPEG1, by formula L1 * M=L2 * Q+r 15 sectors of data correspondences of first sequence 51 are stored to second sequence 52, promptly can be the distribution shown in second sequence 52 among Fig. 5, because second sequence 52 is the sequence of 10 sectors, and be 15 according to its Q value of formula result of calculation, r is 360, so when sector 1 10 is write when full to the sector, to erase sector 1 to sector 6 and come storage data, and the sector position of minimum value will be sector 7 at this moment, so parameter A is 7, simultaneously, the position of minimum value is expressed with 1 expression in sector 7, and all the other are made as 0.
Then, if desire is selected the sector position of 15 correspondence second sequences 52 in sector of first sequence 51, method according to aforesaid search corresponding data, be set at 1 sector position (being the position of minimum value) by corresponding position and move down Q-A sector, it is the position that sector 7 moves down Q-A=15-7=8 sector, just try to achieve 5 corresponding first sequences, 51 sectors 15, second sequence, 52 sectors, in other words, can find the data of first sequence, 51 sectors 15 in second sequence, 52 sectors 5.
In sum, by the data processing method of anti-shock system of the present invention, can simply link up two kinds of different-format storage resources, need not be as prior art, use the mode of built-in form to link up, thereby save the storage space of system, and can make the comparatively elastification of operation of change of format.Simultaneously, by data search method provided by the present invention, comparable binary search method is more quick, operand still less, promptly use variable still less can find target.Wherein, method particularly suitable of the present invention is on circulating memory buffer (circularbuffer).
Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection domain of the appended claim of the present invention.
Claims (8)
1. the data processing method of an anti-shock system determines corresponding data area in one first sequence and one second sequence in anti-shock system, it is characterized in that, may further comprise the steps:
Obtain the sector unit length L1 of this first sequence and the sector unit length L2 of this second sequence;
Obtain a sector position M of this first sequence;
The sector unit length L1 of this first sequence is multiplied by the sector position M of this first sequence, desires to write the data volume of this second sequence in the hope of this first sequence;
Result after will multiplying each other is divided by the sector unit length L2 of this second sequence, try to achieve the number of pages r that next sector position Q+1 of writing sector position Q in full sector number Q and this second sequence in this second sequence is write, with the data of this first sequence data to being write in should second sequence in regular turn.
2. data processing method as claimed in claim 1, it is characterized in that, the data that all transmitted by this first sequence when all sectors of this second sequence are write full, and it is fashionable not finish writing of first all data of sequence as yet, this first sector of second sequence rebound, by the required sector of storage data that begins to erase in regular turn, this first sector, continue to write for the data of this first sequence.
3. data processing method as claimed in claim 1 is characterized in that, its step also comprises provides respectively to each sector in this second sequence whether a position is a minimum value to set this sector.
4. data processing method as claimed in claim 1 is characterized in that, this first sequence and/or this second sequence are a kind of circulating memory buffer.
5. the data processing method of an anti-shock system is searched corresponding data in one first sequence in anti-shock system and one second sequence, it is characterized in that, may further comprise the steps:
The data of this first sequence are stored in this second sequence in regular turn;
Provide respectively to each sector in this second sequence whether a position is a minimum value to set this sector, and store the sector position of the minimum value in this second sequence with parameter A;
Obtain a sector position M of this first sequence of desire search;
Obtain the sector unit length L1 of this first sequence and the sector unit length L2 of this second sequence;
The sector unit length L1 of this first sequence is multiplied by the sector position M of this first sequence;
Result after will multiplying each other is divided by the sector unit length L2 of this second sequence, in the hope of writing full sector number Q in this second sequence;
With writing the sector position of the minimum value in this second sequence that full sector number Q deducts parameter A storage in this second sequence, in the hope of a movement value Q-A;
The sector position that this sector position M of this first sequence is corresponded to this second sequence minimum value sector position behind this movement value Q-A that moves down.
6. data processing method as claimed in claim 5, it is characterized in that, the position of the sector of the minimum value in this second sequence is to be denoted as 1, and the position of all the other sectors in this second sequence is to be denoted as 0, for obtaining of the sector position A of the minimum value in this second sequence.
7. data processing method as claimed in claim 5 is characterized in that, this first sequence and/or this second sequence are a kind of circulating memory buffer.
8. data processing method as claimed in claim 5, it is characterized in that, the data that all transmitted by this first sequence when all sectors of this second sequence are write full, and it is fashionable not finish writing of first all data of sequence as yet, this first sector of second sequence rebound, by the required sector of storage data that begins to erase in regular turn, this first sector, continue to write for the data of this first sequence.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101227629A CN101339536B (en) | 2007-07-04 | 2007-07-04 | Quake-proof system data processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007101227629A CN101339536B (en) | 2007-07-04 | 2007-07-04 | Quake-proof system data processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101339536A CN101339536A (en) | 2009-01-07 |
| CN101339536B true CN101339536B (en) | 2010-07-14 |
Family
ID=40213607
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007101227629A Expired - Fee Related CN101339536B (en) | 2007-07-04 | 2007-07-04 | Quake-proof system data processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101339536B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1101046C (en) * | 1995-06-07 | 2003-02-05 | 松下电器产业株式会社 | Replay device for light disc |
| CN1416124A (en) * | 2002-12-18 | 2003-05-07 | 威盛电子股份有限公司 | Memory possessing function of shockproof and accessing method thereof |
| US6714371B1 (en) * | 2001-08-31 | 2004-03-30 | Western Digital Technologies, Inc. | Method and disk drive for shock estimation and write termination control |
| CN1162856C (en) * | 2000-06-30 | 2004-08-18 | 三洋电机株式会社 | Signal processing circuits |
| CN1612251A (en) * | 2003-10-31 | 2005-05-04 | 晶展科技股份有限公司 | Efficiency increasing method for electronic shock preventing system |
-
2007
- 2007-07-04 CN CN2007101227629A patent/CN101339536B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1101046C (en) * | 1995-06-07 | 2003-02-05 | 松下电器产业株式会社 | Replay device for light disc |
| CN1162856C (en) * | 2000-06-30 | 2004-08-18 | 三洋电机株式会社 | Signal processing circuits |
| US6714371B1 (en) * | 2001-08-31 | 2004-03-30 | Western Digital Technologies, Inc. | Method and disk drive for shock estimation and write termination control |
| CN1416124A (en) * | 2002-12-18 | 2003-05-07 | 威盛电子股份有限公司 | Memory possessing function of shockproof and accessing method thereof |
| CN1612251A (en) * | 2003-10-31 | 2005-05-04 | 晶展科技股份有限公司 | Efficiency increasing method for electronic shock preventing system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101339536A (en) | 2009-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101727395A (en) | Flash memory device and management system and method thereof | |
| CN103744694B (en) | Dynamic partition searcher and its method based on Nand flash memories | |
| CN102651009B (en) | Method and equipment for retrieving data in storage system | |
| CN101236487B (en) | Method and circuit for multiple-word transfer into/from memory subsystems | |
| CN102819408B (en) | The implementation method of the RAID 0 of dynamic adjustment stripe depth and system | |
| CN102662869B (en) | Memory pool access method in virtual machine and device and finger | |
| TWI434175B (en) | Method for performing block management, and associated memory device and controller thereof | |
| CN102662690A (en) | Method and apparatus for starting application program | |
| CN101777061A (en) | JAVA card object management method and JAVA card | |
| CN114138193B (en) | Data writing method, device and equipment for partition naming space solid state disk | |
| CN103827818A (en) | FIFO load instruction | |
| CN100349108C (en) | Physical interface of NAND gate quick flashing storage, interface method and management equipment | |
| CN103246609A (en) | Method and device for cold-hot data discrimination management in flash memory device | |
| CN100377086C (en) | Method for realizing operating procedure directly from file system in embedded system | |
| CN103793332B (en) | Date storage method based on internal memory, device, processor and electronic equipment | |
| CN115756312A (en) | Data access system, data access method, and storage medium | |
| CN104657285A (en) | System and method for caching data | |
| CN101320344A (en) | Multi-core or numerous-core processor function verification device and method | |
| CN101339536B (en) | Quake-proof system data processing method | |
| CN104020982A (en) | Branch target buffer with efficient return prediction capability | |
| CN101799832A (en) | Method for rapidly writing mass data into database once | |
| CN103246615A (en) | Method and device for data management in flash memory device | |
| CN102945148A (en) | Method for realizing parallel instruction set | |
| CN101510160A (en) | Program operation control method of embedded equipment applying function and embedded equipment | |
| CN100525133C (en) | Sorting device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100714 Termination date: 20150704 |
|
| EXPY | Termination of patent right or utility model |