CN105335747A - Data processing method and electronic equipment - Google Patents
Data processing method and electronic equipment Download PDFInfo
- Publication number
- CN105335747A CN105335747A CN201410379798.5A CN201410379798A CN105335747A CN 105335747 A CN105335747 A CN 105335747A CN 201410379798 A CN201410379798 A CN 201410379798A CN 105335747 A CN105335747 A CN 105335747A
- Authority
- CN
- China
- Prior art keywords
- register
- sub
- moving window
- data
- storage
- 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
Links
Abstract
The invention discloses a data processing method and electronic equipment. The electronic equipment comprises a register and a data selection unit, wherein the register is divided into Q sections of sub-registers. The data processing method comprises the following steps: a sliding window begins to slide from the head part of an hth sub-register, and storage data in the register corresponding to the sliding window is subjected to data processing on an xth sliding position of the sliding window; when the sliding window slides to the head part of an (h+1)th sub-register, the hth sub-register updates the storage data; when the sliding window slides to a Qth sub-register, if the Qth sub-register is on a yth sliding position, the storage data of the Qth sub-register can not fill in the sliding window, and the storage data in the first sub-register is used for filling in the sliding window; and when the sliding window completely slides to the first sub-register, the Qth sub-register updates the storage data.
Description
Technical field
The present invention relates to data processing technique, particularly relate to a kind of data processing method and electronic equipment.
Background technology
Fingerprint extraction is the pith in fingerprint identification technology, the process need of fingerprint extraction carries out a series of filtering process to fingerprint image data, current filtering algorithm is used to carry out filtering process to fingerprint image data, need to carry out a large amount of multiplyings, additive operation and digital independent frequently, the time needed for filtering process is longer.Based on this, how effectively to shorten the filtering processing time is the problem needing solution badly.
Summary of the invention
For solving the problems of the technologies described above, embodiments provide a kind of data processing method and electronic equipment.
The data processing method that the embodiment of the present invention provides is applied in electronic equipment, and described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described data processing method comprises:
Described moving window slides from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window is carried out data processing;
When described moving window slides into described h+1 sub-register head, described h sub-register pair stores data and upgrades;
When described moving window slides into described Q sub-register, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
When described moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
The electronic equipment that the embodiment of the present invention provides comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises: processing unit, updating block;
Described data selection unit, for described moving window is slided from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit;
Described processing unit, for carrying out data processing by the storage data in the described register corresponding to described moving window;
Described updating block, during for sliding into described h+1 sub-register head at described moving window, upgrades the storage data of described h sub-register;
Described data selection unit, time also for sliding into described Q sub-register at described moving window, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block, time also for sliding into completely at described moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
In the technical scheme of the embodiment of the present invention, the register storing data is divided into Q cross-talk register, the moving window of data selection unit is utilized to slide from sub-register head, when sliding into xth sliding position place, data processing is carried out to the storage data in the described register corresponding to moving window; When processing all data of this sub-register, upgrade the storage data of this sub-register, and continue the storage data in next sub-register of process, the process data of pipeline system like this, effectively can shorten handling duration.Further, when the data processing in last sub-register is complete, the data in circular treatment first sub-register, ensure the process of the uninterrupted formula of data, effectively shorten handling duration.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the data processing method of the embodiment of the present invention one;
Fig. 2 is the schematic flow sheet of the data processing method of the embodiment of the present invention two;
Fig. 3 is the schematic flow sheet of the data processing method of the embodiment of the present invention three;
Fig. 4 is the schematic flow sheet of the data processing method of the embodiment of the present invention four;
Fig. 5 is the schematic flow sheet of the data processing method of the embodiment of the present invention five;
Fig. 6 is the register of the embodiment of the present invention and the schematic diagram one of moving window;
Fig. 7 is the register of the embodiment of the present invention and the schematic diagram two of moving window;
Fig. 8 is the register of the embodiment of the present invention and the schematic diagram three of moving window;
Fig. 9 is the structure composition schematic diagram of the embodiment of the present invention one electronic equipment;
Figure 10 is the structure composition schematic diagram of the embodiment of the present invention two electronic equipment;
Figure 11 is the structure composition schematic diagram of the embodiment of the present invention three electronic equipment;
Figure 12 is the structure composition schematic diagram of the embodiment of the present invention four electronic equipment;
Figure 13 is the structure composition schematic diagram of the embodiment of the present invention five electronic equipment.
Embodiment
In order to feature and the technology contents of the embodiment of the present invention more at large can be understood, be described in detail below in conjunction with the realization of accompanying drawing to the embodiment of the present invention, the use of appended accompanying drawing explanation only for reference, be not used for limiting the embodiment of the present invention.
Fig. 1 is the schematic flow sheet of the data processing method of the embodiment of the present invention one, and the data processing method in this example is applied in electronic equipment, and described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; As shown in Figure 1, described data processing method comprises the following steps:
Step 101: described moving window slides from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window is carried out data processing.
In the embodiment of the present invention, electronic equipment collects the data with a certain size, such as, after the finger print data of 20K, described data are stored in storer, particularly, utilize the m × w in storer the data that data cell stores collects, w is positive integer.
In the embodiment of the present invention, electronic equipment comprises a register, and this register is used for the data that buffer memory collects, and this register comprises the capable r row of m m × r data storage cell altogether.Further, described register is divided into Q cross-talk register, and in each cross-talk register, data storage cell quantity is not necessarily identical, and preferably, every cross-talk register all comprises the capable r/Q row of m m × r/Q data storage cell altogether.
In the embodiment of the present invention, electronic equipment comprises a data selection unit, and the moving window that this data selection unit utilizes size to be m × n is selected the data in register; Particularly,
The register illustrated with reference to Fig. 6, Fig. 6 comprises 16 × 64 data storage cells; This register is divided into 2 cross-talk registers, and the size of every sub-register is 16 × 32; It is the moving window of 16 × 16 that data selection unit has 1 size; During initial time, register reads the data that size is 16 × 64 successively from storer; Then, moving window slides from the head of the 1st sub-register, and moving window is positioned at the 1st sliding position place of the 1st sub-register this moment; Afterwards, moving window slides to the right 1 column data storage unit at every turn, and correspondingly, moving window is positioned at the 2nd, 3,4 of the 1st sub-register successively ... 32 sliding position places; For each sliding position place, the storage data in the described register corresponding to described moving window are carried out data processing.
Step 102: when described moving window slides into described h+1 sub-register head, described h sub-register pair stores data and upgrades.
With reference to Fig. 6, when moving window slides into the 2nd sub-register head, moving window is positioned at the 1st sliding position place of the 2nd sub-register this moment; All data of the 1st sub-register are all processed, therefore, the storage data of the 1st sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 1st sub-register.Then, to slide to the right 1 column data storage unit at the 2nd sub-register by controlling moving window, with in the 2nd sub-register the 1st, the 2nd, 3,4 ... the storage data at 32 sliding position places carry out data processing at every turn.
Step 103: when described moving window slides into described Q sub-register, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register.
In the embodiment of the present invention, first of the 1st sub-register is connected with the terminal column logic of last sub-register.Particularly, with reference to Fig. 6, when moving window slides into last sub-register of register, such as during the 2nd sub-register, and when moving window is positioned at the 18th sliding position place of the 2nd sub-register, the storage data of the 2nd sub-register can not fill up moving window, need with storage data stuffing moving window updated in the 1st sub-register; Then, then to the storage data in the described register corresponding to moving window carry out data processing.In like manner, moving window is positioned at the 19th, 20,21 of the 2nd sub-register ... during 32 sliding position places, and poke data in the 1st sub-register are pushed away row to the right, successively to fill full moving window.
Step 104: when described moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades.
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
With reference to Fig. 6, when moving window slides in described 1st sub-register completely, also be the storage data in processed 2nd sub-register, therefore, storage data in 2nd sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 2nd sub-register.Afterwards, repeat step 101 to the process of step 104, till the data stored in storer all process.
The technical scheme of the embodiment of the present invention, when processing all data of current sub-register, the storage data of this sub-register are upgraded, and continue the storage data in next sub-register of process, the process data of pipeline system like this, effectively can shorten handling duration.Further, when the data processing in last sub-register is complete, the data in circular treatment first sub-register, ensure the process of the uninterrupted formula of data, effectively shorten handling duration.
Fig. 2 is the schematic flow sheet of the data processing method of the embodiment of the present invention two, and the data processing method in this example is applied in electronic equipment, and described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; It is the moving window of m × n that described data selection unit includes I size, and wherein, I is positive integer, and I is less than or equal to Q/2; As shown in Figure 2, described data processing method comprises the following steps:
Step 201: described i-th moving window slides from described q sub-register head, at a jth sliding position place of described i-th moving window, the storage data in the described register corresponding to described moving window is carried out data processing.
Wherein, the initial sliding position of the described different moving window at least sub-register in 1, interval.
In the embodiment of the present invention, electronic equipment collects the data with a certain size, such as, after the finger print data of 20K, described data are stored in storer, particularly, utilize the m × w in storer the data that data cell stores collects, w is positive integer.
In the embodiment of the present invention, electronic equipment comprises a register, and this register is used for the data that buffer memory collects, and this register comprises the capable r row of m m × r data storage cell altogether.Further, described register is divided into Q cross-talk register, and every cross-talk register all comprises the capable r/Q row of m m × r/Q data storage cell altogether.
In the embodiment of the present invention, electronic equipment comprises a data selection unit, and it is the moving window of m × n that this data selection unit includes I size, utilizes the moving window that this I size is m × n can to select the data in register; Particularly,
The register illustrated with reference to Fig. 7, Fig. 7 comprises 16 × 128 data storage cells; This register is divided into 4 cross-talk registers, and the size of every sub-register is 16 × 32; It is the moving window of 16 × 16 that data selection unit has 2 sizes; Further, the col width of the initial sliding position of these 2 moving windows at least 1 the sub-register in interval.
During initial time, register reads the data that size is 16 × 128 successively from storer; Then, the 1st moving window slides from the head of the 1st sub-register, and the 1st moving window is positioned at the 1st sliding position place of the 1st sub-register; 2nd moving window slides from the head of the 3rd sub-register, and the 2nd moving window is positioned at the 1st sliding position place of the 3rd sub-register; Afterwards, each moving window slides to the right 1 column data storage unit at every turn, and correspondingly, the 1st moving window is positioned at the 2nd, 3,4 of the 1st sub-register successively ... 32 sliding position places; 2nd moving window is positioned at the 2nd, 3,4 of the 3rd sub-register successively ... 32 sliding position places; For each sliding position place of the 1st moving window and the 2nd moving window, the storage data in the described register corresponding to described moving window are carried out data processing.
Step 202: when described i-th moving window slides into described q+1 sub-register head, described q sub-register pair stores data and upgrades.
With reference to Fig. 7, when the 1st moving window slides into the 2nd sub-register head, the 1st moving window is positioned at the 1st sliding position place of the 2nd sub-register this moment; All data of the 1st sub-register are all processed, therefore, the storage data of the 1st sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 1st sub-register.Then, to slide to the right 1 column data storage unit at the 2nd sub-register by controlling the 1st moving window, with in the 2nd sub-register the 1st, the 2nd, 3,4 ... the storage data at 32 sliding position places carry out data processing at every turn.
In like manner, when the 2nd moving window slides into the 4th sub-register head, the 2nd moving window is positioned at the 1st sliding position place of the 4th sub-register this moment; All data of the 3rd sub-register are all processed, therefore, the storage data of the 3rd sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 3rd sub-register.Then, to slide to the right 1 column data storage unit at the 4th sub-register by controlling the 2nd moving window, with in the 4th sub-register the 1st, the 2nd, 3,4 ... the storage data at 32 sliding position places carry out data processing at every turn.
Step 203: when a described kth moving window slides into described Q sub-register, if at t sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register.
In the embodiment of the present invention, first of the 1st sub-register is connected with the terminal column logic of last sub-register.Particularly, with reference to Fig. 7, when the 2nd moving window slides into last sub-register of register, such as during the 4th sub-register, and when the 2nd moving window is positioned at the 18th sliding position place of the 4th sub-register, the storage data of the 4th sub-register can not fill up the 2nd moving window, need with storage data stuffing the 2nd moving window updated in the 1st sub-register; Then, then to the storage data in the described register corresponding to the 2nd moving window carry out data processing.In like manner, the 2nd moving window is positioned at the 19th, 20,21 of the 4th sub-register ... during 32 sliding position places, poke data in the 1st sub-register are pushed away row to the right successively, to fill full 2nd moving window.
In like manner, when the 1st moving window slides into last sub-register of register, such as during the 4th sub-register, and when the 1st moving window is positioned at the 18th sliding position place of the 4th sub-register, the storage data of the 4th sub-register can not fill up the 1st moving window, need with storage data stuffing the 1st moving window updated in the 1st sub-register; Then, then to the storage data in the described register corresponding to the 1st moving window carry out data processing.In like manner, the 1st moving window is positioned at the 19th, 20,21 of the 4th sub-register ... during 32 sliding position places, poke data in the 1st sub-register are pushed away row to the right successively, to fill full 1st moving window.
Step 204: when a described kth moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades.
Wherein, described i, k, j, t, q are positive integer, and i, k are less than or equal to I, and q is less than or equal to Q.
With reference to Fig. 7, when 2nd moving window slides in described 1st sub-register completely, also be the storage data in processed 4th sub-register, therefore, storage data in 4th sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 4th sub-register.Afterwards, repeat step 201 to the process of step 204, till the data stored in storer all process.
The technical scheme of the embodiment of the present invention, when processing all data of current sub-register, the storage data of this sub-register are upgraded, and continue the storage data in next sub-register of process, the process data of pipeline system like this, effectively can shorten handling duration.Further, when the data processing in last sub-register is complete, the data in circular treatment first sub-register, ensure the process of the uninterrupted formula of data, effectively shorten handling duration.
Fig. 3 is the schematic flow sheet of the data processing method of the embodiment of the present invention three, and the data processing method in this example is applied in electronic equipment, and described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; As shown in Figure 3, described data processing method comprises the following steps:
Step 301: described moving window slides from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window is carried out convolutional filtering process.
In the embodiment of the present invention, electronic equipment collects the data with a certain size, such as, after the finger print data of 20K, described data are stored in storer, particularly, utilize the m × w in storer the data that data cell stores collects, w is positive integer.
In the embodiment of the present invention, electronic equipment comprises a register, and this register is used for the data that buffer memory collects, and this register comprises the capable r row of m m × r data storage cell altogether.Further, described register is divided into Q cross-talk register, and every cross-talk register all comprises the capable r/Q row of m m × r/Q data storage cell altogether.
In the embodiment of the present invention, electronic equipment comprises a data selection unit, and the moving window that this data selection unit utilizes size to be m × n is selected the data in register; Particularly,
The register illustrated with reference to Fig. 8, Fig. 8 comprises 16 × 128 data storage cells; This register is divided into 4 cross-talk registers, and the size of every sub-register is 16 × 128; It is the moving window of 16 × 16 that data selection unit has 1 size; During initial time, register reads the data that size is 16 × 128 successively from storer; Then, moving window slides from the head of the 1st sub-register, and moving window is positioned at the 1st sliding position place of the 1st sub-register this moment; Afterwards, moving window slides to the right 1 column data storage unit at every turn, and correspondingly, moving window is positioned at the 2nd, 3,4 of the 1st sub-register successively ... 32 sliding position places; For each sliding position place, the storage data in the described register corresponding to described moving window are carried out convolutional filtering process.
Here, by convolution filter, convolutional filtering process is carried out to storage data; Particularly, convolution mask parameter is adopted to make convolution algorithm, to carry out filtering process to storage data.
Step 302: when described moving window slides into described h+1 sub-register head, described h sub-register pair stores data and upgrades.
With reference to Fig. 8, when moving window slides into the 2nd sub-register head, moving window is positioned at the 1st sliding position place of the 2nd sub-register this moment; All data of the 1st sub-register are all processed, therefore, the storage data of the 1st sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 1st sub-register.Then, to slide to the right 1 column data storage unit at the 2nd sub-register by controlling moving window, with in the 2nd sub-register the 1st, the 2nd, 3,4 ... the storage data at 32 sliding position places carry out convolutional filtering process at every turn.
Step 303: when described moving window slides into described Q sub-register, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register.
In the embodiment of the present invention, first of the 1st sub-register is connected with the terminal column logic of last sub-register.Particularly, with reference to Fig. 8, when moving window slides into last sub-register of register, such as during the 4th sub-register, and when moving window is positioned at the 18th sliding position place of the 4th sub-register, the storage data of the 4th sub-register can not fill up moving window, need with storage data stuffing moving window updated in the 1st sub-register; Then, then to the storage data in the described register corresponding to moving window carry out convolutional filtering process.In like manner, moving window is positioned at the 19th, 20,21 of the 4th sub-register ... during 32 sliding position places, and poke data in the 1st sub-register are pushed away row to the right, successively to fill full moving window.
Step 304: when described moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades.
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
With reference to Fig. 8, when moving window slides in described 1st sub-register completely, also be the storage data in processed 4th sub-register, therefore, storage data in 4th sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 4th sub-register.Afterwards, repeat step 301 to the process of step 304, till the data stored in storer all process.
The technical scheme of the embodiment of the present invention, when processing all data of current sub-register, the storage data of this sub-register are upgraded, and continue the storage data in next sub-register of process, the process data of pipeline system like this, effectively can shorten handling duration.Further, when the data processing in last sub-register is complete, the data in circular treatment first sub-register, ensure the process of the uninterrupted formula of data, effectively shorten handling duration.
Fig. 4 is the schematic flow sheet of the data processing method of the embodiment of the present invention four, and the data processing method in this example is applied in electronic equipment, and described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises the first parameter storage unit for storage volume product module board parameter; As shown in Figure 4, described data processing method comprises the following steps:
Step 401: read described convolution mask parameter from described first parameter storage unit.
In the embodiment of the present invention, convolution mask parameter can represent by M in the matrix form, and this convolution mask parameter is the parameter pre-set.
Step 402: at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are made convolution algorithm, to carry out filtering process.
In the embodiment of the present invention, electronic equipment collects the data with a certain size, such as, after the finger print data of 20K, described data are stored in storer, particularly, utilize the m × w in storer the data that data cell stores collects, w is positive integer.
In the embodiment of the present invention, electronic equipment comprises a register, and this register is used for the data that buffer memory collects, and this register comprises the capable r row of m m × r data storage cell altogether.Further, described register is divided into Q cross-talk register, and every cross-talk register all comprises the capable r/Q row of m m × r/Q data storage cell altogether.
In the embodiment of the present invention, electronic equipment comprises a data selection unit, and the moving window that this data selection unit utilizes size to be m × n is selected the data in register; Particularly,
The register illustrated with reference to Fig. 8, Fig. 8 comprises 16 × 128 data storage cells; This register is divided into 4 cross-talk registers, and the size of every sub-register is 16 × 128; It is the moving window of 16 × 16 that data selection unit has 1 size; During initial time, register reads the data that size is 16 × 128 successively from storer; Then, moving window slides from the head of the 1st sub-register, and moving window is positioned at the 1st sliding position place of the 1st sub-register this moment; Afterwards, moving window slides to the right 1 column data storage unit at every turn, and correspondingly, moving window is positioned at the 2nd, 3,4 of the 1st sub-register successively ... 32 sliding position places; For each sliding position place, the storage data in the described register corresponding to described moving window are carried out convolutional filtering process.
Here, by convolution filter, convolutional filtering process is carried out to storage data; Particularly, convolution mask parameter is adopted to make convolution algorithm, to carry out filtering process to storage data.
Step 403: when described moving window slides into described h+1 sub-register head, described h sub-register pair stores data and upgrades.
With reference to Fig. 8, when moving window slides into the 2nd sub-register head, moving window is positioned at the 1st sliding position place of the 2nd sub-register this moment; All data of the 1st sub-register are all processed, therefore, the storage data of the 1st sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 1st sub-register.Then, to slide to the right 1 column data storage unit at the 2nd sub-register by controlling moving window, with in the 2nd sub-register the 1st, the 2nd, 3,4 ... the storage data at 32 sliding position places carry out convolutional filtering process at every turn.
Step 404: when described moving window slides into described Q sub-register, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register.
In the embodiment of the present invention, first of the 1st sub-register is connected with the terminal column logic of last sub-register.Particularly, with reference to Fig. 8, when moving window slides into last sub-register of register, such as during the 4th sub-register, and when moving window is positioned at the 18th sliding position place of the 4th sub-register, the storage data of the 4th sub-register can not fill up moving window, need with storage data stuffing moving window updated in the 1st sub-register; Then, then to the storage data in the described register corresponding to moving window carry out convolutional filtering process.In like manner, moving window is positioned at the 19th, 20,21 of the 4th sub-register ... during 32 sliding position places, and poke data in the 1st sub-register are pushed away row to the right, successively to fill full moving window.
Step 405: when described moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades.
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
With reference to Fig. 8, when moving window slides in described 1st sub-register completely, also be the storage data in processed 4th sub-register, therefore, storage data in 4th sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 4th sub-register.Afterwards, repeat step 401 to the process of step 405, till the data stored in storer all process.
The technical scheme of the embodiment of the present invention, when processing all data of current sub-register, the storage data of this sub-register are upgraded, and continue the storage data in next sub-register of process, the process data of pipeline system like this, effectively can shorten handling duration.Further, when the data processing in last sub-register is complete, the data in circular treatment first sub-register, ensure the process of the uninterrupted formula of data, effectively shorten handling duration.
Fig. 5 is the schematic flow sheet of the data processing method of the embodiment of the present invention five, and the data processing method in this example is applied in electronic equipment, and described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises the first parameter storage unit for storage volume product module board parameter; As shown in Figure 5, described data processing method comprises the following steps:
Step 501: obtain the first operation, described first operation is used for arranging described convolution mask parameter.
Step 502: based on described first operation, generate the first instruction.
Step 503: respond described first instruction, is stored to described first parameter storage unit by described convolution mask parameter.
Step 504: read described convolution mask parameter from described first parameter storage unit.
In the embodiment of the present invention, convolution mask parameter can represent by M in the matrix form, and this convolution mask parameter is the parameter pre-set.
Step 505: at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are made convolution algorithm, to carry out filtering process.
In the embodiment of the present invention, electronic equipment collects the data with a certain size, such as, after the finger print data of 20K, described data are stored in storer, particularly, utilize the m × w in storer the data that data cell stores collects, w is positive integer.
In the embodiment of the present invention, electronic equipment comprises a register, and this register is used for the data that buffer memory collects, and this register comprises the capable r row of m m × r data storage cell altogether.Further, described register is divided into Q cross-talk register, and every cross-talk register all comprises the capable r/Q row of m m × r/Q data storage cell altogether.
In the embodiment of the present invention, electronic equipment comprises a data selection unit, and the moving window that this data selection unit utilizes size to be m × n is selected the data in register; Particularly,
The register illustrated with reference to Fig. 8, Fig. 8 comprises 16 × 128 data storage cells; This register is divided into 4 cross-talk registers, and the size of every sub-register is 16 × 128; It is the moving window of 16 × 16 that data selection unit has 1 size; During initial time, register reads the data that size is 16 × 128 successively from storer; Then, moving window slides from the head of the 1st sub-register, and moving window is positioned at the 1st sliding position place of the 1st sub-register this moment; Afterwards, moving window slides to the right 1 column data storage unit at every turn, and correspondingly, moving window is positioned at the 2nd, 3,4 of the 1st sub-register successively ... 32 sliding position places; For each sliding position place, the storage data in the described register corresponding to described moving window are carried out convolutional filtering process.
Here, by convolution filter, convolutional filtering process is carried out to storage data; Particularly, convolution mask parameter is adopted to make convolution algorithm, to carry out filtering process to storage data.
Step 506: when described moving window slides into described h+1 sub-register head, described h sub-register pair stores data and upgrades.
With reference to Fig. 8, when moving window slides into the 2nd sub-register head, moving window is positioned at the 1st sliding position place of the 2nd sub-register this moment; All data of the 1st sub-register are all processed, therefore, the storage data of the 1st sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 1st sub-register.Then, to slide to the right 1 column data storage unit at the 2nd sub-register by controlling moving window, with in the 2nd sub-register the 1st, the 2nd, 3,4 ... the storage data at 32 sliding position places carry out convolutional filtering process at every turn.
Step 507: when described moving window slides into described Q sub-register, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register.
In the embodiment of the present invention, first of the 1st sub-register is connected with the terminal column logic of last sub-register.Particularly, with reference to Fig. 8, when moving window slides into last sub-register of register, such as during the 4th sub-register, and when moving window is positioned at the 18th sliding position place of the 4th sub-register, the storage data of the 4th sub-register can not fill up moving window, need with storage data stuffing moving window updated in the 1st sub-register; Then, then to the storage data in the described register corresponding to moving window carry out convolutional filtering process.In like manner, moving window is positioned at the 19th, 20,21 of the 4th sub-register ... during 32 sliding position places, and poke data in the 1st sub-register are pushed away row to the right, successively to fill full moving window.
Step 508: when described moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades.
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
With reference to Fig. 8, when moving window slides in described 1st sub-register completely, also be the storage data in processed 4th sub-register, therefore, storage data in 4th sub-register are upgraded, particularly, from storer, then read the data that size is 16 × 32, and by size be 16 × 32 data be stored in the 4th sub-register.Afterwards, repeat step 501 to the process of step 508, till the data stored in storer all process.
The technical scheme of the embodiment of the present invention, when processing all data of current sub-register, the storage data of this sub-register are upgraded, and continue the storage data in next sub-register of process, the process data of pipeline system like this, effectively can shorten handling duration.Further, when the data processing in last sub-register is complete, the data in circular treatment first sub-register, ensure the process of the uninterrupted formula of data, effectively shorten handling duration.
Fig. 9 is the structure composition schematic diagram of the electronic equipment of the embodiment of the present invention one, and described electronic equipment comprises and comprises register, the data selection unit 91 that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit 91 includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises: processing unit 92, updating block 93;
Described data selection unit 91, for described moving window is slided from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit 92;
Described processing unit 92, for carrying out data processing by the storage data in the described register corresponding to described moving window;
Described updating block 93, during for sliding into described h+1 sub-register head at described moving window, upgrades the storage data of described h sub-register;
Described data selection unit 91, time also for sliding into described Q sub-register at described moving window, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block 93, time also for sliding into completely at described moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
It will be appreciated by those skilled in the art that the practical function of each unit in the electronic equipment in the embodiment of the present invention can refer to the associated description of aforementioned data disposal route and understands.The function of each unit in the electronic equipment in the embodiment of the present invention realizes by the program run on processor, also realizes by concrete logical circuit.
Figure 10 is the structure composition schematic diagram of the electronic equipment of the embodiment of the present invention two, and described electronic equipment comprises and comprises register, the data selection unit 11 that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit 11 includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; It is the moving window of m × n that described data selection unit includes I size, and wherein, I is positive integer, and I is less than or equal to Q/2; Described electronic equipment also comprises: processing unit 12, updating block 13;
Described data selection unit 11, for described moving window is slided from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit 12;
Described processing unit 12, for carrying out data processing by the storage data in the described register corresponding to described moving window;
Described updating block 13, during for sliding into described h+1 sub-register head at described moving window, upgrades the storage data of described h sub-register;
Described data selection unit 11, time also for sliding into described Q sub-register at described moving window, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block 13, time also for sliding into completely at described moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
Preferably, described data selection unit 11, also for described i-th moving window is slided from described q sub-register head, at a jth sliding position place of described i-th moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit 12; Wherein, the initial sliding position of the described different moving window at least sub-register in 1, interval;
Described processing unit 12, also for the storage data in the described register corresponding to described moving window are carried out data processing;
Described updating block 13, time also for sliding into described q+1 sub-register head at described i-th moving window, upgrades the storage data of described q sub-register;
Described data selection unit 11, time also for sliding into described Q sub-register at a described kth moving window, if at t sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block 13, time also for sliding into completely at a described kth moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described i, k, j, t, q are positive integer, and i, k are less than or equal to I, and q is less than or equal to Q.
It will be appreciated by those skilled in the art that the practical function of each unit in the electronic equipment in the embodiment of the present invention can refer to the associated description of aforementioned data disposal route and understands.The function of each unit in the electronic equipment in the embodiment of the present invention realizes by the program run on processor, also realizes by concrete logical circuit.
Figure 11 is the structure composition schematic diagram of the electronic equipment of the embodiment of the present invention three, and described electronic equipment comprises and comprises register, the data selection unit 21 that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit 21 includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises: processing unit 22, updating block 23;
Described data selection unit 21, for described moving window is slided from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit 22;
Described processing unit 22, for carrying out data processing by the storage data in the described register corresponding to described moving window;
Described updating block 23, during for sliding into described h+1 sub-register head at described moving window, upgrades the storage data of described h sub-register;
Described data selection unit 21, time also for sliding into described Q sub-register at described moving window, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block 23, time also for sliding into completely at described moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
Preferably, the storage data in the described register corresponding to described moving window, also for the xth sliding position place at described moving window, are carried out convolutional filtering process by described processing unit 22.
It will be appreciated by those skilled in the art that the practical function of each unit in the electronic equipment in the embodiment of the present invention can refer to the associated description of aforementioned data disposal route and understands.The function of each unit in the electronic equipment in the embodiment of the present invention realizes by the program run on processor, also realizes by concrete logical circuit.
Figure 12 is the structure composition schematic diagram of the electronic equipment of the embodiment of the present invention four, and described electronic equipment comprises and comprises register, the data selection unit 31 that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit 31 includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises: processing unit 32, updating block 33;
Described data selection unit 31, for described moving window is slided from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit 32;
Described processing unit 32, for carrying out data processing by the storage data in the described register corresponding to described moving window;
Described updating block 33, during for sliding into described h+1 sub-register head at described moving window, upgrades the storage data of described h sub-register;
Described data selection unit 31, time also for sliding into described Q sub-register at described moving window, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block 33, time also for sliding into completely at described moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
Preferably, the storage data in the described register corresponding to described moving window, also for the xth sliding position place at described moving window, are carried out convolutional filtering process by described processing unit 32.
Preferably, described electronic equipment also comprises the first parameter storage unit for storage volume product module board parameter; Described electronic equipment also comprises reading unit 34;
Described reading unit 34, for reading described convolution mask parameter from described first parameter storage unit;
Storage data in described register corresponding to described moving window, also for the xth sliding position place at described moving window, are made convolution algorithm, to carry out filtering process by described processing unit 32.
It will be appreciated by those skilled in the art that the practical function of each unit in the electronic equipment in the embodiment of the present invention can refer to the associated description of aforementioned data disposal route and understands.The function of each unit in the electronic equipment in the embodiment of the present invention realizes by the program run on processor, also realizes by concrete logical circuit.
Figure 13 is the structure composition schematic diagram of the electronic equipment of the embodiment of the present invention five, and described electronic equipment comprises and comprises register, the data selection unit 41 that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit 41 includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises: processing unit 42, updating block 43;
Described data selection unit 41, for described moving window is slided from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit 42;
Described processing unit 42, for carrying out data processing by the storage data in the described register corresponding to described moving window;
Described updating block 43, during for sliding into described h+1 sub-register head at described moving window, upgrades the storage data of described h sub-register;
Described data selection unit 41, time also for sliding into described Q sub-register at described moving window, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block 43, time also for sliding into completely at described moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
Preferably, the storage data in the described register corresponding to described moving window, also for the xth sliding position place at described moving window, are carried out convolutional filtering process by described processing unit 42.
Preferably, described electronic equipment also comprises the first parameter storage unit for storage volume product module board parameter; Described electronic equipment also comprises reading unit 44;
Described reading unit 44, for reading described convolution mask parameter from described first parameter storage unit;
Storage data in described register corresponding to described moving window, also for the xth sliding position place at described moving window, are made convolution algorithm, to carry out filtering process by described processing unit 42.
Preferably, described electronic equipment also comprises acquiring unit 45, generation unit 46, storage unit 47;
Described acquiring unit 45, for obtaining the first operation, described first operation is used for arranging described convolution mask parameter;
Described generation unit 46, for based on described first operation, generates the first instruction;
Described storage unit 47, for responding described first instruction, is stored to described first parameter storage unit by described convolution mask parameter.
It will be appreciated by those skilled in the art that the practical function of each unit in the electronic equipment in the embodiment of the present invention can refer to the associated description of aforementioned data disposal route and understands.The function of each unit in the electronic equipment in the embodiment of the present invention realizes by the program run on processor, also realizes by concrete logical circuit.
Between technical scheme described in the embodiment of the present invention, when not conflicting, can combination in any.
In several embodiment provided by the present invention, should be understood that, disclosed method and smart machine, can realize by another way.Apparatus embodiments described above is only schematic, such as, the division of described unit, be only a kind of logic function to divide, actual can have other dividing mode when realizing, and as: multiple unit or assembly can be in conjunction with, maybe can be integrated into another system, or some features can be ignored, or do not perform.In addition, the coupling each other of shown or discussed each ingredient or direct-coupling or communication connection can be by some interfaces, and the indirect coupling of equipment or unit or communication connection can be electrical, machinery or other form.
The above-mentioned unit illustrated as separating component or can may not be and physically separates, and the parts as unit display can be or may not be physical location, namely can be positioned at a place, also can be distributed in multiple network element; Part or all of unit wherein can be selected according to the actual needs to realize the object of the present embodiment scheme.
In addition, each functional unit in various embodiments of the present invention can all be integrated in second processing unit, also can be each unit individually as a unit, also can two or more unit in a unit integrated; Above-mentioned integrated unit both can adopt the form of hardware to realize, and the form that hardware also can be adopted to add SFU software functional unit realizes.
The above; be only the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, is anyly familiar with those skilled in the art in the technical scope that the present invention discloses; change can be expected easily or replace, all should be encompassed within protection scope of the present invention.
Claims (10)
1. a data processing method, the method is applied in electronic equipment, and described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described data processing method comprises:
Described moving window slides from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window is carried out data processing;
When described moving window slides into described h+1 sub-register head, described h sub-register pair stores data and upgrades;
When described moving window slides into described Q sub-register, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
When described moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
2. data processing method according to claim 1, it is the moving window of m × n that described data selection unit includes I size, and wherein, I is positive integer, and I is less than or equal to Q/2; Described data processing method also comprises:
Described i-th moving window slides from described q sub-register head, at a jth sliding position place of described i-th moving window, storage data in described register corresponding to described moving window are carried out data processing, wherein, the initial sliding position of the described different moving window at least sub-register in 1, interval;
When described i-th moving window slides into described q+1 sub-register head, described q sub-register pair stores data and upgrades;
When a described kth moving window slides into described Q sub-register, if at t sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
When a described kth moving window slides in described 1st sub-register completely, described Q sub-register pair stores data and upgrades;
Wherein, described i, k, j, t, q are positive integer, and i, k are less than or equal to I, and q is less than or equal to Q.
3. data processing method according to claim 1, the storage data in the described register corresponding to described moving window are carried out data processing, are comprised by the described xth at a described moving window sliding position place:
At an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are carried out convolutional filtering process.
4. data processing method according to claim 3, described electronic equipment also comprises the first parameter storage unit for storage volume product module board parameter;
Storage data in described register corresponding to described moving window are carried out convolutional filtering process, are comprised by the described xth at a described moving window sliding position place:
Described convolution mask parameter is read from described first parameter storage unit;
At an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are made convolution algorithm, to carry out filtering process.
5. data processing method according to claim 4, described from described first parameter storage unit, read described convolution mask parameter before, described data processing method also comprises:
Obtain the first operation, described first operation is used for arranging described convolution mask parameter;
Based on described first operation, generate the first instruction;
Respond described first instruction, described convolution mask parameter is stored to described first parameter storage unit.
6. an electronic equipment, described electronic equipment comprises and comprises register, the data selection unit that the capable r row of m are total to m × r data storage cell; Wherein, described register is divided into Q cross-talk register, and described data selection unit includes the moving window that size is m × n; Wherein, m, r, Q, n are positive integer, and n is less than or equal to r/2; Described electronic equipment also comprises: processing unit, updating block;
Described data selection unit, for described moving window is slided from described h sub-register head, at an xth sliding position place of described moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit;
Described processing unit, for carrying out data processing by the storage data in the described register corresponding to described moving window;
Described updating block, during for sliding into described h+1 sub-register head at described moving window, upgrades the storage data of described h sub-register;
Described data selection unit, time also for sliding into described Q sub-register at described moving window, if at y sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block, time also for sliding into completely at described moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described h, x, y are positive integer, and h is less than or equal to Q.
7. electronic equipment according to claim 6, it is the moving window of m × n that described data selection unit includes I size, and wherein, I is positive integer, and I is less than or equal to Q/2;
Described data selection unit, also for described i-th moving window is slided from described q sub-register head, at a jth sliding position place of described i-th moving window, the storage data in the described register corresponding to described moving window are sent to described processing unit; Wherein, the initial sliding position of the described different moving window at least sub-register in 1, interval;
Described processing unit, also for the storage data in the described register corresponding to described moving window are carried out data processing;
Described updating block, time also for sliding into described q+1 sub-register head at described i-th moving window, upgrades the storage data of described q sub-register;
Described data selection unit, time also for sliding into described Q sub-register at a described kth moving window, if at t sliding position place, the storage data of described Q sub-register can not fill up moving window, then fill by the storage data in described 1st sub-register;
Described updating block, time also for sliding into completely at a described kth moving window in described 1st sub-register, upgrades the storage data of described Q sub-register;
Wherein, described i, k, j, t, q are positive integer, and i, k are less than or equal to I, and q is less than or equal to Q.
8. electronic equipment according to claim 6, the storage data in the described register corresponding to described moving window, also for the xth sliding position place at described moving window, are carried out convolutional filtering process by described processing unit.
9. electronic equipment according to claim 8, described electronic equipment also comprises the first parameter storage unit for storage volume product module board parameter; Described electronic equipment also comprises reading unit;
Described reading unit, for reading described convolution mask parameter from described first parameter storage unit;
Storage data in described register corresponding to described moving window, also for the xth sliding position place at described moving window, are made convolution algorithm, to carry out filtering process by described processing unit.
10. electronic equipment according to claim 9, described electronic equipment also comprises acquiring unit, generation unit, storage unit;
Described acquiring unit, for obtaining the first operation, described first operation is used for arranging described convolution mask parameter;
Described generation unit, for based on described first operation, generates the first instruction;
Described storage unit, for responding described first instruction, is stored to described first parameter storage unit by described convolution mask parameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410379798.5A CN105335747B (en) | 2014-08-04 | 2014-08-04 | A kind of data processing method and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410379798.5A CN105335747B (en) | 2014-08-04 | 2014-08-04 | A kind of data processing method and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105335747A true CN105335747A (en) | 2016-02-17 |
| CN105335747B CN105335747B (en) | 2019-03-29 |
Family
ID=55286263
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410379798.5A Active CN105335747B (en) | 2014-08-04 | 2014-08-04 | A kind of data processing method and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105335747B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108073548A (en) * | 2016-11-14 | 2018-05-25 | 耐能股份有限公司 | Convolution algorithm device and convolution algorithm method |
| US10936937B2 (en) | 2016-11-14 | 2021-03-02 | Kneron, Inc. | Convolution operation device and convolution operation method |
| US11836098B2 (en) | 2019-03-27 | 2023-12-05 | Wuxi Hisky Medical Technologies Co., Ltd. | Data storage apparatus and method, and readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5051947A (en) * | 1985-12-10 | 1991-09-24 | Trw Inc. | High-speed single-pass textual search processor for locating exact and inexact matches of a search pattern in a textual stream |
| CN1968023A (en) * | 2006-06-08 | 2007-05-23 | 华为技术有限公司 | A coding method of convolution code |
| US7840931B2 (en) * | 2004-05-28 | 2010-11-23 | Mentor Graphics Corporation | Loop manipulation if a behavioral synthesis tool |
| US20100303366A1 (en) * | 2008-05-22 | 2010-12-02 | Ji Zhang | Method for Identifying Motion Video/Audio Content |
| CN102325109A (en) * | 2011-06-13 | 2012-01-18 | 浙江大学 | Rapid FSK (Frequency Shift Keying) demodulation method and full-digital low-power-consumption device for realizing same |
-
2014
- 2014-08-04 CN CN201410379798.5A patent/CN105335747B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5051947A (en) * | 1985-12-10 | 1991-09-24 | Trw Inc. | High-speed single-pass textual search processor for locating exact and inexact matches of a search pattern in a textual stream |
| US7840931B2 (en) * | 2004-05-28 | 2010-11-23 | Mentor Graphics Corporation | Loop manipulation if a behavioral synthesis tool |
| CN1968023A (en) * | 2006-06-08 | 2007-05-23 | 华为技术有限公司 | A coding method of convolution code |
| US20100303366A1 (en) * | 2008-05-22 | 2010-12-02 | Ji Zhang | Method for Identifying Motion Video/Audio Content |
| CN102325109A (en) * | 2011-06-13 | 2012-01-18 | 浙江大学 | Rapid FSK (Frequency Shift Keying) demodulation method and full-digital low-power-consumption device for realizing same |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108073548A (en) * | 2016-11-14 | 2018-05-25 | 耐能股份有限公司 | Convolution algorithm device and convolution algorithm method |
| US10936937B2 (en) | 2016-11-14 | 2021-03-02 | Kneron, Inc. | Convolution operation device and convolution operation method |
| CN108073548B (en) * | 2016-11-14 | 2021-09-10 | 耐能股份有限公司 | Convolution operation device and convolution operation method |
| US11836098B2 (en) | 2019-03-27 | 2023-12-05 | Wuxi Hisky Medical Technologies Co., Ltd. | Data storage apparatus and method, and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105335747B (en) | 2019-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103473088B (en) | A kind of single-chip microcomputer online upgrading method and system | |
| CN104298605A (en) | Method of grouping blocks used for garbage collection action in solid state drive | |
| CN104933747B (en) | Vector animation is converted to the method and device of bitmaps animation | |
| CN108388598A (en) | Electronic device, date storage method and storage medium | |
| CN104794116A (en) | Layout method and device for elements in page | |
| CN104516828A (en) | Method and device for removing caching data | |
| CN105335747A (en) | Data processing method and electronic equipment | |
| CN104699622A (en) | Data storage device and data erasing method thereof | |
| CN103593447B (en) | Data processing method and device applied to database table | |
| CN106354653A (en) | Data storage device and data maintenance method thereof | |
| CN109558325A (en) | A kind of delay statistics method, apparatus and computer readable storage medium | |
| CN101783719B (en) | Rate matching and rate de-matching method, device and communication system | |
| CN106649210A (en) | Data conversion method and device | |
| CN104572994A (en) | Method and device for searching data | |
| CN105205019B (en) | NV parameter reading and writing system and methods based on high-pass platform mobile phone | |
| CN108228091A (en) | Configuration data subregion store method and system, configuration data method of calibration and system | |
| CN110399977A (en) | Pond arithmetic unit | |
| CN106775586B (en) | Data reordering method and device | |
| CN105204883B (en) | A kind of plug-in unit loading processing method and device | |
| CN103838638B (en) | Calibration method and device for FPGA plug-in storage | |
| CN103699049A (en) | PLC (Programmable Logic Controller) DI (Digital Input) point extension module and method | |
| CN103116549B (en) | Based on the flash memory storage method of maximum erasable number of times | |
| CN108491168A (en) | A kind of processing method and solid state disk of reading and writing command stream | |
| CN107769871A (en) | Satellite communication link delay analogy method, apparatus and system | |
| CN108614664A (en) | Read error treating method and apparatus based on NANDflash |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |