CN108268381A - A kind of method of application solutions data immediate addressing - Google Patents
A kind of method of application solutions data immediate addressing Download PDFInfo
- Publication number
- CN108268381A CN108268381A CN201711371592.8A CN201711371592A CN108268381A CN 108268381 A CN108268381 A CN 108268381A CN 201711371592 A CN201711371592 A CN 201711371592A CN 108268381 A CN108268381 A CN 108268381A
- Authority
- CN
- China
- Prior art keywords
- data
- address
- addressing
- region
- host computer
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/0292—User address space allocation, e.g. contiguous or non contiguous base addressing using tables or multilevel address translation means
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Programmable Controllers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
A kind of method of application solutions data immediate addressing of the present invention, belongs to field of computer technology.In computer systems, it needs quickly to read certain data, corresponding address can be searched by input data here to realize quick access；In network transmission system, router is sent according to the MAC Address determination data received from which port, and data are identified and classified by inputting mac address information here.With the development of the times, system gives the time of address search more harsh requirement, but can be quantified there is no a kind of effective measures, the completion data immediate addressing of safety.In order to solve the above problems in data immediate addressing, the present invention proposes a kind of technology of application solutions data immediate addressing.According to data length and addressing data time requirement configuration data storage area and data address under programming mode, data recombination technology and address recombinant technique realize data immediate addressing under cooperating pattern.
Description
Technical field
A kind of method of application solutions data immediate addressing of the present invention, belongs to field of computer technology.
Background technology
In computer systems, it needs quickly to read certain data, can be searched here by input data
Quick access is realized in corresponding address；In network transmission system, router according to the MAC Address determination data received from
Which port is sent, and data are identified and classified by inputting mac address information here.With the development of the times, system
It gives more harsh requirement for the time of address search, but can not quantified there is no a kind of effective measures, safety
Complete data immediate addressing.
In order to solve the above problems in data immediate addressing, the present invention proposes a kind of application solutions data immediate addressing
Technology.According to data length and addressing data time requirement configuration data storage area and data address under programming mode, match
It closes data recombination technology and address recombinant technique under operating mode and realizes data immediate addressing.Coordinate self-test skill proposed by the present invention
Art, data recombination technology and address recombinant technique ensure that data in storage area are correct and the immediate addressing of data.
Invention content
The purpose of the present invention proposes a kind of technology of application solutions data immediate addressing, with solve current big data quantity,
Addressing data problem caused by big address space.
Technical scheme of the present invention：A kind of method of application solutions data immediate addressing, the method take following steps：
Step 1：Addressing data initializes；
According to the preset data volume of system, data, data address and addressing data time, region of data storage is carried out
Planning, concrete operations are：Calculating single clock cycle according to the addressing data time needs the correction data number N carried out, obtains new
Data width numerical value (W2) for N* data widths (W1), while establish data (B1), data address (A1) and new data
(B2) between new data address (A2)
B1=B2 [(W1+1) * mod (A1, N) -1：W1*mod (A1, N)]
Step 2：Programming mode；
Under programming mode, host computer sends out programming mode order to region of data storage, after region of data storage is ready to complete,
Region of data storage judges whether itself is programming mode, and mould is written in region of data storage turn-on data if programming mode is judged as
Formula, host computer carry out region of data storage write operation, and the data address of operation is translated into new by the write operation of host computer automatically
Data address；
Step 3：Operating mode；
In the operational mode, region of data storage carries out addressing data work automatically, and region of data storage is automatically with needing to carry out
The data polling of comparison compares, if compared correctly, according to data width, data address and the new data in step 1)
For operation relation between width and new data address into row decoding, region of data storage gives host computer output data address, and
Completion signal will be compared and be output to host computer；If poll full number all compares consistent results according to space without generating, should
Data in the data and region of data storage that are compared mismatch, then region of data storage feeds back to unmatched result
Host computer.
The correction data number that single clock cycle needs carry out in the method is N, N >=2 and N=2m, wherein m is just whole
Number.
In the method between data (B1), data address (A1) and new data (B2) and new data address (A2)
The concrete operation relationship of operation relation formula (1) is as shown in the table：
| Host computer | Address data |
| Address/data n1 ' b0/n2 ' d (1) | 1’b0/{n2*(2n-1)’hx,n2’d(1)} |
| Address/data n1 ' b1/n2 ' d (2) | 1’b0/{n2*(2n-2)’hx,n2’d(2),n2’hx} |
| Address/data n1 ' b10/n2 ' d (3) | 1’b0/{n2*(2n-3)’hx,n2’d(3),2*n2’hx} |
| …… | … |
| Address/data n1 ' b11 ... 1/n2 ' d (2n) | 1’b0/{n2’d(1),n2*(2n-1)’hx} |
Wherein n1 is data address (A1) width, and n2 is data (B1) width, and item is indifferent in hx expressions.
The method is further comprising the steps of：Checking mode：Be written data after the retaking of a year or grade write-in at once data and into
Row comparison if comparison is consistent, could carry out the write order that next host computer provides, and after completing programming mode, closing avoids it
Rewrite data storage area during his state.
The present invention has the advantage that and advantageous effect：
1) present invention can assess addressing space, time and resource in advance according to system requirements and amount of hardware resources；
2) the addressing data volume that can be carried out with dynamic configuration single clock cycle；
3) retaking of a year or grade compares the safety that mechanism ensures write-in data；
4) the addressing time at least reduces more than 50 percent compared with conventional addressing data technology.
Description of the drawings
Fig. 1 is designing scheme system level diagram of the present invention.
Fig. 2 is specific programming mode state transition figure.
Fig. 3 is that specific operational mode state redirects figure.
Specific embodiment
A kind of method of application solutions data immediate addressing, the method take following steps：
Step 1：Addressing data initializes；
According to the preset data volume of system, data, data address and addressing data time, region of data storage is carried out
Planning, concrete operations are：Calculating single clock cycle according to the addressing data time needs the correction data number N carried out, obtains new
Data width numerical value (W2) for N* data widths (W1), while establish data (B1), data address (A1) and new data
(B2) operation relation between new data address (A2), the operation relation is referring to formula (1), to carry out addressing data；
B1=B2 [(W1+1) * mod (A1, N) -1：W1*mod (A1, N)]
Step 2：Programming mode；
Under programming mode, host computer sends out programming mode order to region of data storage, after region of data storage is ready to complete,
Region of data storage judges whether itself is programming mode, and mould is written in region of data storage turn-on data if programming mode is judged as
Formula, host computer carry out region of data storage write operation, and the data address of operation is translated into new by the write operation of host computer automatically
Data address；
Step 3：Operating mode；
In the operational mode, region of data storage carries out addressing data work automatically, and region of data storage is automatically with needing to carry out
The data polling of comparison compares, if compared correctly, according to data width, data address and the new data in step 1)
For operation relation between width and new data address into row decoding, region of data storage gives host computer output data address, and
Completion signal will be compared and be output to host computer；If poll full number all compares consistent results according to space without generating, should
Data in the data and region of data storage that are compared mismatch, then region of data storage feeds back to unmatched result
Host computer.
The correction data number that single clock cycle needs carry out in the method is N, N >=2 and N=2m, wherein m is just whole
Number.
In the method between data (B1), data address (A1) and new data (B2) and new data address (A2)
The concrete operation relationship of operation relation formula (1) is as shown in the table：
| Host computer | Address data | |
| Address/data | n1’b0/n2’d(1) | 1’b0/{n2*(2n-1)’hx,n2’d(1)} |
| Address/data | n1’b1/n2’d(2) | 1’b0/{n2*(2n-2)’hx,n2’d(2),n2’hx} |
| Address/data | n1’b10/n2’d(3) | 1’b0/{n2*(2n-3)’hx,n2’d(3),2*n2’hx} |
| … | … | … |
| Address/data | n1’b11…1/n2’d(2n) | 1’b0/{n2’d(1),n2*(2n-1)’hx} |
Wherein n1 is data address (A1) width, and n2 is data (B1) width, and item is indifferent in hx expressions.
The method is further comprising the steps of：Checking mode：Be written data after the retaking of a year or grade write-in at once data and into
Row comparison if comparison is consistent, could carry out the write order that next host computer provides, and after completing programming mode, closing avoids it
Rewrite data storage area during his state.
The present invention will be described in detail for following combination attached drawing.
The principle of the present invention：Data are changed into new data mode, establish data, data address and new data, new number
According to the operation relation between address, the data volume that increase single clock cycle is compared is so as to reduce the entire addressing data time.
A kind of method of application solutions data immediate addressing, the method take following steps：
1) addressing data initializes；
According to the preset data volume of system, data, data address and addressing data time, region of data storage is carried out
Planning, concrete operations are：Calculating single clock cycle (T) according to the addressing data time (t) needs the correction data number carried out
(N), wherein N=t/T obtains new data width numerical value (W2) as N* data widths (W1), while establishes data (B1), data
Operation relation between address (A1) and new data (B2) and new data address (A2), the operation relation referring to formula (1),
To carry out addressing data；
B1=B2 [(W1+1) * mod (A1, N) -1：W1*mod (A1, N)]
2) programming mode；
2 pairs of programming modes are described in detail below in conjunction with the accompanying drawings：Host computer sends out programming mode to region of data storage
Order and close write it is enabled, region of data storage itself be prepared with original state judge, if itself complete preparation,
Judge whether to enter programming mode；Opened if into programming mode write it is enabled, to upper if programming mode is not entered into
Machine feeds back the information for not entering into programming mode；After writing enabled open, host computer can be directly by data (B1), data address
(A1) region of data storage is written, region of data storage can form new data (B2), new number into row decoding automatically according to formula (1)
According to address (A2)；Region of data storage often carries out the data of the retaking of a year or grade write-in at once after a data write operation, if compared identical
Next data write operation is then carried out, incorrect information will be compared if difference is compared and uploads host computer, writes all data
And it compares and data is correctly write into information upload host computer；Host computer receives region of data storage data initialization and completes mark
Or region of data storage be not on the permanent staff journey pattern when can give region of data storage order, region of data storage is enabled to be prepared and close and is write
It is enabled.
3) operating mode；
3 pairs of operating modes are described in detail below in conjunction with the accompanying drawings：Host computer sends out operating mode to region of data storage
Start order, region of data storage itself is prepared to be judged with init state, if itself completes preparation, is judged whether
Into operating mode；The information of operating mode is not entered into host computer feedback if operating mode is not entered into；Into work
After operation mode, region of data storage to host computer provide normal work information, at this time host computer to region of data storage output need into
The data of row addressing, while new address information (A2) is zeroed, and new data (B2) are read simultaneously from region of data storage
And comparing is carried out with the data for needing to be addressed according to formula (1), if meeting formula (1), region of data storage in comparing
To host computer output data address (A1) and compare correct information；If corresponding new data (B2) in new data address (A2)
In do not have with needing the Data Matching that is addressed, then new data address (A2) plus 1 and read out corresponding new data
(B2) and continue with the Data Matching for needing to be addressed until Data Matching, after the completion of Data Matching, according to formula
(1), region of data storage to host computer output data address (A1) and compares correct information；If poll full number is according to storage area sky
Between all without generate compare it is consistent as a result, data mismatch in illustrating data and region of data storage that needs are addressed,
Then unmatched result is fed back to host computer by region of data storage.
The single clock cycle needs correction data number N >=2 carried out and N=2m, wherein m be positive integer, this be by
In computer realm usually using binary system carry out data processing；If correction data number is 2 in address decoding is carried out
Conversion of the m power then between data address (A1) and new data address (A2) new data address (A2) etc. can be reduced to
Remove minimum m positions in data address (A1).
The operation relation of the data address and new data address is shown in following table：
| Host computer | Address data | |
| Address/data | n1’b0/n2’d(1) | 1’b0/{n2*(2n-1)’hx,n2’d(1)} |
| Address/data | n1’b1/n2’d(2) | 1’b0/{n2*(2n-2)’hx,n2’d(2),n2’hx} |
| Address/data | n1’b10/n2’d(3) | 1’b0/{n2*(2n-3)’hx,n2’d(3),2*n2’hx} |
| … | … | … |
| Address/data | n1’b11…1/n2’d(2n) | 1’b0/{n2’d(1),n2*(2n-1)’hx} |
Wherein n1 is data address (A1) width, and n2 is data (B1) width, and item is indifferent in hx expressions.
The method is further comprising the steps of：
Checking mode：It the data of the retaking of a year or grade write-in at once and is compared after write-in data, if comparison is consistent, Cai Nengjin
The write order that the next host computer of row provides after completing programming mode, closes rewrite data storage area when avoiding other states.
Embodiment one
Here provide a simple example illustrate data address (A1), data (B1) and new data address (A2),
Relationship between new data (B2) and the decoding process during Practical Project.
In the example, correction data number N=8, data address (A1) is respectively 3 ' b000,3 ' b001,3 ' b010,3 '
B011,3 ' b100,3 ' b101,3 ' b110 and 3 ' b111, wherein data address (A1) width n1=3；During according to systems organization list
The clock period need the correction data number N=4 that carries out obtain new data address (A2) remove equal to data address (A1) it is minimum
M=2 positions.Therefore new data address (A2) is 1 ' b0 and 1 ' b1, wherein data address (A2) width n2=1；According to formula
(1) it can establish shown in following table：
| Host computer | Address data | |
| Address/data | 3’b000/8’h1 | 1’b0/{24’hx,8’h1} |
| Address/data | 3’b001/8’h2 | 1’b0/{16’hx,8’h2,8’hx} |
| Address/data | 3’b010/8’h3 | 1’b0/{8’hx,8’h3,16’hx} |
| Address/data | 3’b011/8’h4 | 1’b0/{8’h4,24’hx} |
| Address/data | 3’b100/8’h5 | 1’b1/{24’hx,8’h5} |
| Address/data | 3’b101/8’h6 | 1’b1/{16’hx,8’h6,8’hx} |
| Address/data | 3’b110/8’h7 | 1’b1/{8’hx,8’h7,16’hx} |
| Address/data | 3’b111/8’h8 | 1’b1/{8’h8,24’hx} |
Host computer is according to requiring address listed in host computer in table and data write-in, data storage under programming mode
Data that area can be decoded as in addressing data according to setting and address and to be written into region of data storage for use, in this process
Middle region of data storage can complete corresponding checking mode and upload host computer by the way that data are write information after checking mode.
Host computer will need 8 ' the h8 input datas storage area of data compared and ask to compare, data in the operational mode
Storage area is compared 8 ' h8 according to formula (1), obtains new data address (A2=1 ' b1) and data address (A1=3 '
B111), region of data storage uploads comparing correct information to host computer and provides data address (A1=3 ' b111) at this time.
If not using the method for the invention, which needs 8 clock cycle, is using the method for the invention,
Comparison process becomes 2 clock cycle, and comparison time is reduced to the 25% of script process, is greatly improved the effect of addressing data
Rate.
Embodiment two
Here provide a simple example illustrate data address (A1) under most fast addressing data, data (B1) with it is new
Data address (A2), the relationship between new data (B2) and the decoding process during Practical Project.
In the example, correction data number N=8, data address (A1) is respectively 3 ' b000,3 ' b001,3 ' b010,3 '
B011,3 ' b100,3 ' b101,3 ' b110 and 3 ' b111, wherein data address (A1) width n1=3；During according to systems organization list
The clock period need the correction data number N=8 that carries out obtain new data address (A2) remove equal to data address (A1) it is minimum
M=3 positions.Therefore new data address (A2=0), wherein new data address (A2) width n2=0, i.e., do not consider new number
According to address；It can be established shown in following table according to formula (1)：
| Host computer | Address data | |
| Address/data | 3’b000/8’h1 | {56’hx,8’h1} |
| Address/data | 3’b001/8’h2 | {48’hx,8’h2,8’hx} |
| Address/data | 3’b010/8’h3 | {40’hx,8’h3,16’hx} |
| Address/data | 3’b011/8’h4 | {32’hx,8’h4,24’hx} |
| Address/data | 3’b100/8’h5 | {24’hx,8’h5,32’hx} |
| Address/data | 3’b101/8’h6 | {16’hx,8’h6,40’hx} |
| Address/data | 3’b110/8’h7 | {8’hx,8’h7,48’hx} |
| Address/data | 3’b111/8’h8 | {8’h8,56’hx} |
Host computer is according to requiring address listed in host computer in table and data write-in, data storage under programming mode
Data that area can be decoded as in addressing data according to setting and address and to be written into region of data storage for use, in this process
Middle region of data storage can complete corresponding checking mode and upload host computer by the way that data are write information after checking mode.
Host computer will need 8 ' the h8 input datas storage area of data compared and ask to compare, data in the operational mode
Storage area is compared 8 ' h8 according to formula (1), obtains new data address (A2=0) and data address (A1=3 '
B111), region of data storage uploads comparing correct information to host computer and provides data address (A1=3 ' b111) at this time.
If not using the method for the invention, which needs 8 clock cycle, is using the method for the invention,
Comparison process becomes 1 clock cycle, and comparison time is reduced to the 12.5% of script process, is greatly improved the effect of addressing data
Rate.
Claims (4)
1. a kind of method of application solutions data immediate addressing, the method take following steps：
Step 1：Addressing data initializes；
According to the preset data volume of system, data, data address and addressing data time, to region of data storage into professional etiquette
It draws, concrete operations are：Calculating single clock cycle according to the addressing data time needs the correction data number N carried out, obtains new
Data width numerical value (W2) is N* data widths (W1), while establishes data (B1), data address (A1) and new data (B2)
Operation relation between new data address (A2), the operation relation is referring to formula (1), to carry out addressing data；
B1=B2 [(W1+1) * mod (A1, N) -1:W1*mod(A1,N)]
Step 2：Programming mode；
Under programming mode, host computer sends out programming mode order, after region of data storage is ready to complete, data to region of data storage
Storage area judges whether itself is programming mode, the region of data storage turn-on data write mode if programming mode is judged as, on
Position machine carries out write operation to region of data storage, and the data address of operation with being translated into new data by the write operation of host computer automatically
Location；
Step 3：Operating mode；
In the operational mode, region of data storage carries out addressing data work automatically, and region of data storage is automatically with being compared
Data polling compare, if compare it is correct, according to data width, data address and the new data width in step 1)
For operation relation between new data address into row decoding, region of data storage gives host computer output data address, and will compare
Host computer is output to completing signal；If poll full number all compares consistent results, the needs according to space without generating
Data in the data and region of data storage that are compared mismatch, then region of data storage feeds back to unmatched result upper
Machine.
2. a kind of method of application solutions data immediate addressing as described in claim 1, which is characterized in that when single in the method
It is N, N >=2 and N=2 that the clock period, which needs the correction data number carried out,m, wherein m is positive integer.
A kind of 3. method of application solutions data immediate addressing as described in claim 1, which is characterized in that data in the method
(B1), the operation relation formula (1) between data address (A1) and new data (B2) and new data address (A2) is specific
Operation relation is as shown in the table：
Wherein n1 is data address (A1) width, and n2 is data (B1) width, and item is indifferent in hx expressions.
4. a kind of method of application solutions data immediate addressing as described in claim 1, which is characterized in that the method further includes
Following steps：Checking mode：It the data of the retaking of a year or grade write-in at once and is compared after write-in data, if comparison is consistent, ability
The write order that next host computer provides is carried out, after completing programming mode, closes rewrite data storage area when avoiding other states.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711371592.8A CN108268381B (en) | 2017-12-15 | 2017-12-15 | Method for safely realizing fast addressing of data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711371592.8A CN108268381B (en) | 2017-12-15 | 2017-12-15 | Method for safely realizing fast addressing of data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108268381A true CN108268381A (en) | 2018-07-10 |
| CN108268381B CN108268381B (en) | 2021-12-24 |
Family
ID=62772274
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711371592.8A Active CN108268381B (en) | 2017-12-15 | 2017-12-15 | Method for safely realizing fast addressing of data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108268381B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1313991A (en) * | 1998-09-07 | 2001-09-19 | 德国汤姆森-布兰特有限公司 | Method for addressing a bitstream recording |
| CN1831791A (en) * | 2006-04-12 | 2006-09-13 | 北京中星微电子有限公司 | Method for quickly changing address by software |
| US20060271763A1 (en) * | 2005-05-31 | 2006-11-30 | Ronny Pedersen | Extracted-index addressing of byte-addressable memories |
| CN102004711A (en) * | 2010-11-17 | 2011-04-06 | 北京理工大学 | Single-interrupt real-time data transmission method based on FPGA (Field Programmable Gate Array) |
| CN102340317A (en) * | 2010-07-21 | 2012-02-01 | 中国科学院微电子研究所 | High throughput rate decoder structure and method for structured LDPC code |
| CN102521160A (en) * | 2011-12-22 | 2012-06-27 | 上海交通大学 | Write buffer detector, addressing method of written data and parallel channel write method |
| CN102929801A (en) * | 2012-10-25 | 2013-02-13 | 华为技术有限公司 | Disk addressing method and device |
| US9424315B2 (en) * | 2007-08-27 | 2016-08-23 | Teradata Us, Inc. | Methods and systems for run-time scheduling database operations that are executed in hardware |
| CN106462495A (en) * | 2014-05-21 | 2017-02-22 | 高通股份有限公司 | Memory controllers employing memory capacity and/or bandwidth compression with next read address prefetching, and related processor-based systems and methods |
-
2017
- 2017-12-15 CN CN201711371592.8A patent/CN108268381B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1313991A (en) * | 1998-09-07 | 2001-09-19 | 德国汤姆森-布兰特有限公司 | Method for addressing a bitstream recording |
| US20060271763A1 (en) * | 2005-05-31 | 2006-11-30 | Ronny Pedersen | Extracted-index addressing of byte-addressable memories |
| CN1831791A (en) * | 2006-04-12 | 2006-09-13 | 北京中星微电子有限公司 | Method for quickly changing address by software |
| US9424315B2 (en) * | 2007-08-27 | 2016-08-23 | Teradata Us, Inc. | Methods and systems for run-time scheduling database operations that are executed in hardware |
| CN102340317A (en) * | 2010-07-21 | 2012-02-01 | 中国科学院微电子研究所 | High throughput rate decoder structure and method for structured LDPC code |
| CN102004711A (en) * | 2010-11-17 | 2011-04-06 | 北京理工大学 | Single-interrupt real-time data transmission method based on FPGA (Field Programmable Gate Array) |
| CN102521160A (en) * | 2011-12-22 | 2012-06-27 | 上海交通大学 | Write buffer detector, addressing method of written data and parallel channel write method |
| CN102929801A (en) * | 2012-10-25 | 2013-02-13 | 华为技术有限公司 | Disk addressing method and device |
| CN106462495A (en) * | 2014-05-21 | 2017-02-22 | 高通股份有限公司 | Memory controllers employing memory capacity and/or bandwidth compression with next read address prefetching, and related processor-based systems and methods |
Non-Patent Citations (2)
| Title |
|---|
| YIH-KAI LIN 等: "A fast algorithm for Huffman decoding based on a recursion Huffman tree", 《THE JOURNAL OF SYSTEMS AND SOFTWARE》 * |
| 邱永成 等: "基于MPC8270的处理器板卡设计", 《计算机测量与控制》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108268381B (en) | 2021-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11899747B2 (en) | Techniques to embed a data object into a multidimensional frame | |
| US9921569B2 (en) | Field device commissioning system and method | |
| CN103838672A (en) | Automated testing method and device for all-purpose financial statements | |
| CN108923997B (en) | Cloud service node automatic testing method and device based on python | |
| CN110554893B (en) | Multi-language adaptation method, device and equipment for software system and readable storage medium | |
| CN112445729B (en) | Operation address determination method, PCIe system, electronic device and storage medium | |
| US20230282299A1 (en) | Chip test method, apparatus, and device, and storage medium | |
| CN102981882B (en) | Analytic method and device | |
| CN104778135A (en) | Device compatible method and system | |
| CN115794641A (en) | Method, device and equipment for making number based on business process and storage medium | |
| CN110689914B (en) | Solid state disk reading error correction method, device, equipment and storage medium | |
| US11380356B2 (en) | Flexible on-cylinder limit for drive performance management | |
| CN111723009A (en) | Framework system of python automated testing series products | |
| CN104516896A (en) | Method and system for processing hot spot region in map | |
| CN112732556B (en) | Automatic testing method, device, equipment and storage medium of distributed system | |
| CN108268381A (en) | A kind of method of application solutions data immediate addressing | |
| CN112800735A (en) | Construction method of data filling system | |
| CN108829443B (en) | Design method, loading method and application of terminal equipment configuration data | |
| CN113377683B (en) | Software test case generation method, system, device, terminal, medium and application | |
| CN111027196B (en) | Simulation analysis task processing method and device for power equipment and storage medium | |
| JP2018535495A (en) | Application user interface automatic test method, electronic device, system, and storage medium | |
| CN114020636A (en) | Application APP test method and device, electronic equipment and storage medium | |
| CN115687338A (en) | Method and device for adding identification information to projects in batch and terminal | |
| CN111881234A (en) | Land planning method and device, terminal equipment and storage medium | |
| TW202013211A (en) | Method of training artificial intelligence to correct log-likelihood ratio for storage device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |