CN101800867A - Method, device and digital-television receiving terminal for realizing ring buffer - Google Patents
Method, device and digital-television receiving terminal for realizing ring buffer Download PDFInfo
- Publication number
- CN101800867A CN101800867A CN201010042859A CN201010042859A CN101800867A CN 101800867 A CN101800867 A CN 101800867A CN 201010042859 A CN201010042859 A CN 201010042859A CN 201010042859 A CN201010042859 A CN 201010042859A CN 101800867 A CN101800867 A CN 101800867A
- Authority
- CN
- China
- Prior art keywords
- pointer
- numerical value
- current
- buffer circle
- read
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F5/00—Methods or arrangements for data conversion without changing the order or content of the data handled
- G06F5/06—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor
- G06F5/10—Methods or arrangements for data conversion without changing the order or content of the data handled for changing the speed of data flow, i.e. speed regularising or timing, e.g. delay lines, FIFO buffers; over- or underrun control therefor having a sequence of storage locations each being individually accessible for both enqueue and dequeue operations, e.g. using random access memory
- G06F5/12—Means for monitoring the fill level; Means for resolving contention, i.e. conflicts between simultaneous enqueue and dequeue operations
- G06F5/14—Means for monitoring the fill level; Means for resolving contention, i.e. conflicts between simultaneous enqueue and dequeue operations for overflow or underflow handling, e.g. full or empty flags
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Information Transfer Systems (AREA)
- Communication Control (AREA)
Abstract
The embodiment of the invention discloses a method for realizing a ring buffer, which comprises the following steps: when reading data, judging whether the value of a current read pointer of the ring buffer is equal to the value of the current write pointer, if so, returning to null, otherwise reading data in the storage space pointed by the current read pointer of the ring buffer, and adding 1 to the value of the current read pointer after the read operation is carried out; and when writing data, subtracting the value of the current write pointer of the ring buffer from the value of the current read pointer, and judging whether the difference after the subtraction is less than the maximum storage value of the ring buffer, if so, writing the data into the storage space pointed by the current write pointer of the ring buffer and adding 1 to the value of the current write pointer after the write operation is carried out, otherwise returning to full. The invention can maximally utilize the message space of the ring buffer without degrading the system performance.
Description
Technical field
The present invention relates to electronic communication field, relate in particular to a kind of method and device of realizing buffer circle.
Background technology
Buffer circle is a kind of the most frequently used data structure, is being a kind of data structure of exempting to lock at some restrictive condition.And buffer circle is realized simple, and performance is very high, uses very extensive.
In the prior art, use to buffer circle mainly contains dual mode, a kind of be reserve a space need not, be used for distinguishing empty and full two states, such as certain buffer circle size is N, write pointer is W, and read pointer is R, and then this buffering area can only be put N-1 message at most, buffering area is that W equals R for empty condition, buffering area is that full condition equals H for (W+1) %N, and it is to waste a message space that the method has a not enough place, can cause the waste in space when message is bigger.Another uses the mode of buffer circle is to represent the message count of buffering area with a counter C, the initial value of counter C is 0, when writing thread and write a message, counter C increases by 1, when reading thread and read a message, counter C deducts 1, when usage counter is represented current number of messages available, all unit of this buffer circle can be used for depositing message, are that the buffering area of N can be deposited N message such as size.But because the read-write thread all can be revised counter C, so need add the mutual exclusion protection to the modification of counter C.So just reduced performance.
Summary of the invention
Embodiment of the invention technical problem to be solved is, a kind of method and device of realizing buffer circle is provided.Can realize the peak use rate of buffer circle.
In order to solve the problems of the technologies described above, the embodiment of the invention provides a kind of method that realizes buffer circle, comprising:
When reading of data, judge whether the numerical value of buffer circle current read pointer equals the numerical value of current write pointer, be judged as when being, return sky, when being judged as not, read the data in the described buffer circle current read pointer memory space pointed, the numerical value with described current read pointer behind the enforcement read operation adds one;
When writing data, when the numerical value of the current write pointer of described buffer circle greater than described current read pointer write data the time, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, the numerical value of the current write pointer of described buffer circle and the numerical value of described current read pointer are subtracted each other, judge that described difference after subtracting each other is whether less than the maximum storage value of described buffer circle, be judged as when being, described data are write the current write pointer of described buffer circle memory space pointed, numerical value with described current write pointer after the enforcement write operation adds one, when being judged as not, return full.
Correspondingly, the embodiment of the invention provides a kind of device of realizing buffer circle, comprising:
First judging unit is used for when reading of data, judges whether the numerical value of buffer circle current read pointer equals the numerical value of current write pointer,
When writing data, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, the numerical value of the current write pointer of described buffer circle and the numerical value of described current read pointer are subtracted each other, judge that described difference after subtracting each other is whether less than the maximum storage value of described buffer circle;
Performance element, when being used for reading of data, when described first judgment unit judges when being, return sky, when being judged as not, read the data in the described buffer circle current read pointer memory space pointed, numerical value with described current read pointer behind the enforcement read operation adds one
When writing data, when described first judgment unit judges when being, described data are write the current write pointer of described buffer circle memory space pointed, implement after the write operation will described current write pointer numerical value add one, when being judged as not, return completely.
The embodiment of the invention also provides a kind of receiving terminal for digital television, comprising:
Device as claim 5～7 realization buffer circle as described in each.
Implement the embodiment of the invention, have following beneficial effect:
Implement the present invention, can when realizing buffer circle, not need to establish in addition vacant message space with difference buffer circle sky or full situation, the maximized message space that utilizes buffer circle, do not need to establish the message count that counter writes down buffer circle in addition yet, thereby avoided the reduction of systematic function.
Description of drawings
Fig. 1 is the schematic flow sheet of an embodiment of a kind of method that realizes buffer circle of the present invention;
Fig. 2 is the schematic flow sheet during reading of data among the embodiment of a kind of method that realizes buffer circle of the present invention;
Fig. 3 is the schematic flow sheet when writing data among the embodiment of a kind of method that realizes buffer circle of the present invention;
Fig. 4 is a kind of structural representation of realizing device one embodiment of buffer circle of the present invention;
Fig. 5 is a kind of structural representation of realizing another embodiment of device of buffer circle of the present invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
Fig. 1 is the schematic flow sheet of the embodiment of a kind of method that realizes buffer circle of the present invention, and this method may further comprise the steps:
100, during reading of data, judge whether the numerical value of buffer circle current read pointer equals the numerical value of current write pointer, be judged as when being, return sky, and process ends, when being judged as not, read the data in the described buffer circle current read pointer memory space pointed, the numerical value with described current read pointer behind the enforcement read operation adds one;
When 101, writing data, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, the numerical value of the current write pointer of described buffer circle and the numerical value of described current read pointer are subtracted each other, judge that described difference after subtracting each other is whether less than the maximum storage value of described buffer circle, be judged as when being, described data are write the current write pointer of described buffer circle memory space pointed, numerical value with described current write pointer after the enforcement write operation adds one, when being judged as not, returning expires, and process ends.
Need illustrate there is not inevitable precedence relationship between 100 and 101.
Need to prove, finish when read/write operation, read to refer to count/will judge also whether described read pointer/write pointer overflows after the numerical value of write pointer adds one, when overflowing, will revise operation the described finger meter/write pointer of reading.
Also need to prove, need before reading and writing data first described buffer circle is carried out initialization operation, default described buffer circle parameter, i.e. the maximum read-write of definition pointer value, maximum number of messages, read-write state return value (OK (good, expression current annular buffering area is normal), FULL is (full, expression current annular buffering area is full), EMPTY (sky, expression current annular buffering area is empty), OVERFLOW (overflow, expression current annular buffering area overflows)), read and write pointer and initial value is set.
For example: the maximum read-write of #define MAX_NUM 0Xfffffff/* definition pointer value */
#define C10/* definition maximum number of messages */
#define OK 0/* definition read-write state return value */
#define FULL (1)/* definition read-write state return value */
#define EMPTY (2)/* definition read-write state return value */
#define OVERFLOW (3)/* definition read-write state return value */
typedef?BUF_ITEM?int；
typedef?BUF_RESULT?int；
BUF_ITEM?buffer[C]；
Unsigned int W=0; / * definition write pointer and establish initial value */
Unsigned int R=0; / * definition read pointer and establish initial value */
Carry out the idiographic flow schematic diagram of read data operation among the embodiment of the method that Fig. 2 realizes buffer circle for the present invention is a kind of, comprising:
200, when reading of data, judge whether the numerical value of buffer circle current read pointer equals the numerical value of current write pointer, be judged as when being, return sky, and process ends, when being judged as not, read the data in the described buffer circle current read pointer memory space pointed, numerical value with described current read pointer behind the enforcement read operation adds one, and execution in step 201.
201, whether the numerical value of judging described read pointer overflows, and when being judged as not, returns, and is judged as when being, returns after revising described read pointer.
For example, a buffer circle, initially default as follows:
The maximum read-write of #define MAX_NUM 0Xfffffff/* definition pointer value */
#define C 10/* definition maximum number of messages */
#define OK 0/* definition read-write state return value */
#define FULL (1)/* definition read-write state return value */
#define EMPTY (2)/* definition read-write state return value */
#define OVERFLOW (3)/* definition read-write state return value */
typedef?BUF_ITEM?int；
typedef?BUF_RESULT?int；
BUF_ITEM?buffer[C]；
Unsigned int W=0; / * definition write pointer and establish initial value */
Unsigned int R=0; / * definition read pointer and establish initial value */
Wherein, current W=3, R=5 is during reading of data, earlier judge whether W equates with R, be judged as not, then read the data in the R pointer memory space pointed, be specially, data=buffer[R%C], after reading, described R pointer data is added 1, promptly the R pointer value becomes 6.Judge again whether described R pointer overflows, and judges promptly whether R equals 0, be judged as not, return OK.
If the R pointer overflows, will revise the R pointer, be specially R=(MAX_NUM%C)+1, return OK after the correction again.
Carry out the idiographic flow schematic diagram of data writing operation among the embodiment of the method that Fig. 3 realizes buffer circle for the present invention is a kind of, comprising:
When 300, writing data, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, the numerical value of the current write pointer of described buffer circle and the numerical value of described current read pointer are subtracted each other, judge that described difference after subtracting each other is whether less than the maximum storage value of described buffer circle, be judged as when being, described data are write the current write pointer of described buffer circle memory space pointed, numerical value with described current write pointer after the enforcement write operation adds one, and execution in step 201, when being judged as not, return full.
Need to prove, when writing data,, represent that then a described ring level buffering area overflows when the numerical value of the current write pointer of described buffer circle during less than the numerical value of described current read pointer.
301, whether the numerical value of judging described write pointer overflows, and when being judged as not, returns, and is judged as when being, returns after revising described read pointer.
For example, a buffer circle, initially default as follows:
The maximum read-write of #define MAX_NUM 0Xfffffff/* definition pointer value */
#define C 10/* definition maximum number of messages */
#define OK 0/* definition read-write state return value */
#define FULL (1)/* definition read-write state return value */
#define EMPTY (2)/* definition read-write state return value */
#define OVERFLOW (3)/* definition read-write state return value */
typedef?BUF_ITEM?int；
typedef?BUF_RESULT?int；
BUF_ITEM?buffer[C]；
Unsigned int W=0; / * definition write pointer and establish initial value */
Unsigned int R=0; / * definition read pointer and establish initial value */
Wherein, current W=3, R=5 is when writing data, judge that earlier whether W and R subtract each other the maximum storage value less than buffer circle, be judged as and be, then data are write the data in the W pointer memory space pointed, be specially, buffer[W%C]=, after data reads, described W pointer data is added 1, promptly the W pointer value becomes 4.Judge again whether described W pointer overflows, and judges promptly whether W equals 0, be judged as not, return OK.
If the W pointer overflows, will revise the W pointer, be specially W=(MAX_NUM%C)+1, return OK after the correction again.
Fig. 4 is a kind of structural representation of realizing device one embodiment of buffer circle of the present invention, and this device can be applicable to receiving terminal for digital television, comprising:
First judging unit 1 is used for when reading of data, judges whether the numerical value of buffer circle current read pointer equals the numerical value of current write pointer,
When writing data, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, the numerical value of the current write pointer of described buffer circle and the numerical value of described current read pointer are subtracted each other, judge that described difference after subtracting each other is whether less than the maximum storage value of described buffer circle.
Need to prove, when writing data,, represent that then a described ring level buffering area overflows when the numerical value of the current write pointer of described buffer circle during less than the numerical value of described current read pointer.
When writing data, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, described first judging unit 1 is judged as when being, described data are write the current write pointer of described buffer circle memory space pointed, numerical value with described current write pointer after the enforcement write operation adds one, when being judged as not, return full.
Need to prove, need before reading and writing data first described buffer circle is carried out initialization operation, the maximum read-write of promptly default justice pointer value, the definition maximum number of messages, definition read-write state return value (OK, FULL, EMPTY, OVERFLOW), wherein OK, FULL, EMPTY, OVERFLOW represent respectively, full, empty, overflow, definition read-write pointer also is provided with initial value.
For example; The maximum read-write of #define MAX_NUM 0Xfffffff/* definition pointer value */
#define C 10/* definition maximum number of messages */
#define OK 0/* definition read-write state return value */
#define FULL (1)/* definition read-write state return value */
#define EMPTY (2)/* definition read-write state return value */
#define OVERFLOW (3)/* definition read-write state return value */
typedef?BUF_ITEM?int；
typedef?BUF_RESULT?int；
BUF_ITEM?buffer[C]；
Unsigned int W=0; / * definition write pointer and establish initial value */
Unsigned int R=0; / * definition read pointer and establish initial value */
Further, with reference to Fig. 5, a kind of another embodiment of device that realizes buffer circle of the present invention, described device also comprises:
Or implement write operation and numerical value that will described current write pointer and add the back and judge whether the numerical value of described write pointer overflows, be judged as when denying, return, be judged as when being, return after revising described read pointer.
For example, a buffer circle, it is initially default as follows to cross default unit 3:
The maximum read-write of #define MAX_NUM 0Xfffffff/* definition pointer value */
#define C 10/* definition maximum number of messages */
#define OK 0/* definition read-write state return value */
#define FULL (1)/* definition read-write state return value */
#define EMPTY (2)/* definition read-write state return value */
#define OVERFLOW (3)/* definition read-write state return value */
typedef?BUF_ITEM?int；
typedef?BUF_RESULT?int；
BUF_ITEM?buffer[C]；
Unsigned int W=0; / * definition write pointer and establish initial value */
Unsigned int R=0; / * definition read pointer and establish initial value */
Wherein, current W=3, R=5 is during reading of data, first judging unit 1 judges whether W equates with R earlier, be judged as not, then performance element 2 will read the data in the R pointer memory space pointed, be specially, data=buffer[R%C], after reading, performance element 2 adds 1 with described R pointer data, and promptly the R pointer value becomes 6.Second judging unit 4 judges whether described R pointer overflows, and judges promptly whether R equals 0 again, is judged as not, returns OK.
If second judging unit 4 judges that the R pointer overflows, will revise the R pointer, be specially R=(MAX_NUM%C)+1, return OK after the correction again.
When writing data, first judging unit 1 judges that whether W and R subtract each other the maximum storage value less than buffer circle, be judged as and be, then performance element 2 writes data in the W pointer memory space pointed with data, be specially buffer[W%C]=, after data reads, described W pointer data is added 1, and promptly the W pointer value becomes 4.Second judging unit 4 judges whether described W pointer overflows, and judges promptly whether W equals 0 again, is judged as not, returns OK.
If second judging unit 4 judges that the W pointer overflows, will revise the W pointer, be specially W=(MAX_NUM%C)+1, return OK after the correction again.
Need to prove that the device of the realization buffer circle that comprises among a kind of receiving terminal for digital television embodiment of the present invention is identical on structure and function with the device of the realization buffer circle shown in Fig. 4 and Fig. 5, is not described in detail in this.
Receiving terminal for digital television of the present invention includes but not limited to: and set-top box, network protocol television (InternetProtocol Television, IPTV), digital TV integrated machine, Digital Video Broadcasting Handheld etc. have the terminal of receiving digital television function.
As from the foregoing, implement the embodiment of the invention, can when realizing buffer circle, not need to establish in addition vacant message space with difference buffer circle sky or full situation, the maximized message space that utilizes buffer circle, do not need to establish the message count that counter writes down buffer circle in addition yet, thereby avoided the reduction of systematic function.
In addition, one of ordinary skill in the art will appreciate that all or part of flow process that realizes in the foregoing description method, be to instruct relevant hardware to finish by program, described program can be stored in the computer read/write memory medium, this program can comprise the flow process as the embodiment of above-mentioned each side method when carrying out.Wherein, described storage medium can be magnetic disc, CD, read-only storage memory body (Read-Only Memory, ROM) or at random store memory body (Radom Access Memory, RAM) etc.
Above disclosed is a kind of preferred embodiment of the present invention only, can not limit the present invention's interest field certainly with this, and therefore the equivalent variations of doing according to claim of the present invention still belongs to the scope that the present invention is contained.
Claims (8)
1. a method that realizes buffer circle is characterized in that, comprising:
When reading of data, judge whether the numerical value of buffer circle current read pointer equals the numerical value of current write pointer, be judged as when being, return sky, when being judged as not, read the data in the described buffer circle current read pointer memory space pointed, the numerical value with described current read pointer behind the enforcement read operation adds one;
When writing data, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, the numerical value of the current write pointer of described buffer circle and the numerical value of described current read pointer are subtracted each other, judge that described difference after subtracting each other is whether less than the maximum storage value of described buffer circle, be judged as when being, described data are write the current write pointer of described buffer circle memory space pointed, numerical value with described current write pointer after the enforcement write operation adds one, when being judged as not, return full.
2. the method for claim 1 is characterized in that, also comprises after behind the described enforcement read operation numerical value of described current read pointer being added one step:
Whether the numerical value of judging described read pointer overflows, and when not being judged as not, returns, and is judged as when being, returns after revising described read pointer.
3. the method for claim 1 is characterized in that, also comprises after after the described enforcement write operation numerical value of described current write pointer being added one step:
Whether the numerical value of judging described write pointer overflows, and when not being judged as not, returns, and is judged as when being, returns after revising described read pointer.
4. as each described method of claim 1～3, it is characterized in that, also comprise:
Default described buffer circle parameter.
5. a device of realizing buffer circle is characterized in that, comprising:
First judging unit is used for when reading of data, judges whether the numerical value of buffer circle current read pointer equals the numerical value of current write pointer,
When writing data, when the numerical value of the current write pointer of described buffer circle numerical value greater than described current read pointer, the numerical value of the current write pointer of described buffer circle and the numerical value of described current read pointer are subtracted each other, judge that described difference after subtracting each other is whether less than the maximum storage value of described buffer circle;
Performance element, when being used for reading of data, when described first judgment unit judges when being, return sky, when being judged as not, read the data in the described buffer circle current read pointer memory space pointed, numerical value with described current read pointer behind the enforcement read operation adds one
When writing data, when described first judgment unit judges when being, described data are write the current write pointer of described buffer circle memory space pointed, implement after the write operation will described current write pointer numerical value add one, when being judged as not, return completely.
6. method as claimed in claim 5 is characterized in that, also comprises:
Second judging unit is used to implement read operation and the numerical value of described current read pointer is added a back judge whether the numerical value of described read pointer overflows, and is judged as when denying, and returns, and is judged as when being, returns after revising described read pointer.
Or implement write operation and numerical value that will described current write pointer and add the back and judge whether the numerical value of described write pointer overflows, be judged as when denying, return, be judged as when being, return after revising described read pointer.
7. as claim 5 or 6 described methods, it is characterized in that, also comprise:
Default unit is used for default described buffer circle parameter.
8. receiving terminal for digital television is characterized in that:
Comprise device as claim 5～7 realization buffer circle as described in each.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010100428590A CN101800867B (en) | 2010-01-19 | 2010-01-19 | Method, device and digital-television receiving terminal for realizing ring buffer |
| PCT/CN2011/070354 WO2011088778A1 (en) | 2010-01-19 | 2011-01-18 | Method, apparatus and digital television receiving terminal for realizing circular buffer area |
| HK11101185.0A HK1147154A1 (en) | 2010-01-19 | 2011-02-08 | Method, device and digital-television receiving terminal for realization ring buffer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010100428590A CN101800867B (en) | 2010-01-19 | 2010-01-19 | Method, device and digital-television receiving terminal for realizing ring buffer |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101800867A true CN101800867A (en) | 2010-08-11 |
| CN101800867B CN101800867B (en) | 2011-09-28 |
Family
ID=42596331
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010100428590A Expired - Fee Related CN101800867B (en) | 2010-01-19 | 2010-01-19 | Method, device and digital-television receiving terminal for realizing ring buffer |
Country Status (3)
| Country | Link |
|---|---|
| CN (1) | CN101800867B (en) |
| HK (1) | HK1147154A1 (en) |
| WO (1) | WO2011088778A1 (en) |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102075376A (en) * | 2010-11-25 | 2011-05-25 | 广东雅达电子股份有限公司 | Multi-communication protocol detection method |
| WO2011088778A1 (en) * | 2010-01-19 | 2011-07-28 | 深圳市同洲电子股份有限公司 | Method, apparatus and digital television receiving terminal for realizing circular buffer area |
| CN102193882A (en) * | 2010-03-15 | 2011-09-21 | 京瓷美达株式会社 | Data processing apparatus and data processing method |
| CN102591815A (en) * | 2011-12-27 | 2012-07-18 | Tcl集团股份有限公司 | Method and device for using annular data buffer to read and write batch data |
| CN103064679A (en) * | 2012-12-25 | 2013-04-24 | 北京航天测控技术有限公司 | Buffer area management software implementation method for long-time continuous direct memory access (DMA) transmission |
| CN103391468A (en) * | 2012-05-08 | 2013-11-13 | 安凯(广州)微电子技术有限公司 | Network video data buffer control method and system based on mobile terminal |
| CN103530130A (en) * | 2013-10-28 | 2014-01-22 | 迈普通信技术股份有限公司 | Method and equipment for implementing multiple-input and multiple-output queues |
| CN103581611A (en) * | 2013-11-19 | 2014-02-12 | 北京兆维电子(集团)有限责任公司 | Implementation method for audio and video recording based on routing server and routing server |
| CN104063892A (en) * | 2013-03-20 | 2014-09-24 | 北京麒麟网文化股份有限公司 | Graph rendering method and system, and general game supporting platform |
| CN104298507A (en) * | 2014-09-26 | 2015-01-21 | 科大讯飞股份有限公司 | Resource processing method and device |
| CN104899151A (en) * | 2015-02-02 | 2015-09-09 | 上海小蚁科技有限公司 | Memory data read-write method and memory data read-write device |
| CN106559704A (en) * | 2015-09-28 | 2017-04-05 | 青岛海信电器股份有限公司 | A kind of processing method of voice data, device and system |
| CN106776393A (en) * | 2016-12-26 | 2017-05-31 | 北京旋极信息技术股份有限公司 | A kind of serial data method of reseptance and device without interruption |
| CN106909513A (en) * | 2017-03-20 | 2017-06-30 | 杭州朔天科技有限公司 | A kind of asynchronous asymmetrical read-write memory area management method |
| CN108958501A (en) * | 2017-05-23 | 2018-12-07 | 龙芯中科技术有限公司 | Character typing, output method and device, readable storage medium storing program for executing and electronic equipment |
| CN110032354A (en) * | 2018-01-12 | 2019-07-19 | 珠海全志科技股份有限公司 | A kind of single channel microphone multiplexing method and device |
| CN110554924A (en) * | 2019-07-30 | 2019-12-10 | 视联动力信息技术股份有限公司 | Message processing method and device |
| CN110557341A (en) * | 2018-05-31 | 2019-12-10 | 北京京东尚科信息技术有限公司 | Method and device for limiting data current |
| CN111865824A (en) * | 2020-06-19 | 2020-10-30 | 重庆川仪自动化股份有限公司 | Method and system for designing double-pointer annular buffer area in serial port communication |
| CN111966498A (en) * | 2020-08-27 | 2020-11-20 | 南京电研电力自动化股份有限公司 | Power distribution room Internet of things gateway data rapid processing method and system and storage medium |
| CN112148435A (en) * | 2019-06-28 | 2020-12-29 | 北京初速度科技有限公司 | Method and device for determining target module scheduling strategy for automatic driving system |
| CN112235204A (en) * | 2020-10-13 | 2021-01-15 | 中移（杭州）信息技术有限公司 | Data reporting method, system, electronic equipment and storage medium |
| CN112765054A (en) * | 2019-11-01 | 2021-05-07 | 中国科学院声学研究所 | High-speed data acquisition system and method based on FPGA |
| CN115934023A (en) * | 2021-08-31 | 2023-04-07 | 华为技术有限公司 | Data processing method, data processing device and related equipment |
| CN117407148A (en) * | 2022-07-08 | 2024-01-16 | 华为技术有限公司 | Data writing method, data reading device, electronic equipment and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5450544A (en) * | 1992-06-19 | 1995-09-12 | Intel Corporation | Method and apparatus for data buffering and queue management of digital motion video signals |
| CN1540523A (en) * | 2003-10-30 | 2004-10-27 | 中兴通讯股份有限公司 | Quick method for reading/writing buffer in single task |
| CN101526748B (en) * | 2009-01-13 | 2010-12-08 | 上海微电子装备有限公司 | Memory device, method and aligning control system for photoetching aligning data detection |
| CN101800867B (en) * | 2010-01-19 | 2011-09-28 | 深圳市同洲电子股份有限公司 | Method, device and digital-television receiving terminal for realizing ring buffer |
-
2010
- 2010-01-19 CN CN2010100428590A patent/CN101800867B/en not_active Expired - Fee Related
-
2011
- 2011-01-18 WO PCT/CN2011/070354 patent/WO2011088778A1/en active Application Filing
- 2011-02-08 HK HK11101185.0A patent/HK1147154A1/en not_active IP Right Cessation
Cited By (38)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2011088778A1 (en) * | 2010-01-19 | 2011-07-28 | 深圳市同洲电子股份有限公司 | Method, apparatus and digital television receiving terminal for realizing circular buffer area |
| US8661209B2 (en) | 2010-03-15 | 2014-02-25 | Kyocera Document Solutions Inc. | Data processing apparatus, data processing method, and computer-readable recording medium for writing and reading data to and from a storage |
| CN102193882A (en) * | 2010-03-15 | 2011-09-21 | 京瓷美达株式会社 | Data processing apparatus and data processing method |
| CN102193882B (en) * | 2010-03-15 | 2014-09-10 | 京瓷办公信息系统株式会社 | Data processing apparatus and data processing method |
| CN102075376B (en) * | 2010-11-25 | 2013-12-18 | 广东雅达电子股份有限公司 | Multi-communication protocol detection method |
| CN102075376A (en) * | 2010-11-25 | 2011-05-25 | 广东雅达电子股份有限公司 | Multi-communication protocol detection method |
| CN102591815B (en) * | 2011-12-27 | 2015-07-29 | Tcl集团股份有限公司 | A kind of method of loop data buffer read-write batch data and device |
| CN102591815A (en) * | 2011-12-27 | 2012-07-18 | Tcl集团股份有限公司 | Method and device for using annular data buffer to read and write batch data |
| CN103391468A (en) * | 2012-05-08 | 2013-11-13 | 安凯(广州)微电子技术有限公司 | Network video data buffer control method and system based on mobile terminal |
| CN103391468B (en) * | 2012-05-08 | 2016-12-14 | 安凯(广州)微电子技术有限公司 | The buffer control method of a kind of network video data based on mobile terminal and system |
| CN103064679A (en) * | 2012-12-25 | 2013-04-24 | 北京航天测控技术有限公司 | Buffer area management software implementation method for long-time continuous direct memory access (DMA) transmission |
| CN103064679B (en) * | 2012-12-25 | 2015-07-15 | 北京航天测控技术有限公司 | Buffer area management software implementation method for long-time continuous direct memory access (DMA) transmission |
| CN104063892A (en) * | 2013-03-20 | 2014-09-24 | 北京麒麟网文化股份有限公司 | Graph rendering method and system, and general game supporting platform |
| CN103530130A (en) * | 2013-10-28 | 2014-01-22 | 迈普通信技术股份有限公司 | Method and equipment for implementing multiple-input and multiple-output queues |
| CN103581611A (en) * | 2013-11-19 | 2014-02-12 | 北京兆维电子(集团)有限责任公司 | Implementation method for audio and video recording based on routing server and routing server |
| CN104298507A (en) * | 2014-09-26 | 2015-01-21 | 科大讯飞股份有限公司 | Resource processing method and device |
| CN104899151A (en) * | 2015-02-02 | 2015-09-09 | 上海小蚁科技有限公司 | Memory data read-write method and memory data read-write device |
| WO2017054379A1 (en) * | 2015-09-28 | 2017-04-06 | 青岛海信电器股份有限公司 | Audio data processing method, apparatus and system |
| CN106559704A (en) * | 2015-09-28 | 2017-04-05 | 青岛海信电器股份有限公司 | A kind of processing method of voice data, device and system |
| US10171868B2 (en) | 2015-09-28 | 2019-01-01 | Qingdao Hisense Electronics Co., Ltd. | Method for processing audio data, terminal and television |
| CN106559704B (en) * | 2015-09-28 | 2019-07-12 | 青岛海信电器股份有限公司 | A kind of processing method of audio data, device and system |
| CN106776393B (en) * | 2016-12-26 | 2020-01-31 | 北京旋极信息技术股份有限公司 | uninterrupted serial port data receiving method and device |
| CN106776393A (en) * | 2016-12-26 | 2017-05-31 | 北京旋极信息技术股份有限公司 | A kind of serial data method of reseptance and device without interruption |
| CN106909513A (en) * | 2017-03-20 | 2017-06-30 | 杭州朔天科技有限公司 | A kind of asynchronous asymmetrical read-write memory area management method |
| CN108958501B (en) * | 2017-05-23 | 2022-06-21 | 龙芯中科(山西)技术有限公司 | Character input method, character output method, character input device, character output device, readable storage medium and electronic equipment |
| CN108958501A (en) * | 2017-05-23 | 2018-12-07 | 龙芯中科技术有限公司 | Character typing, output method and device, readable storage medium storing program for executing and electronic equipment |
| CN110032354A (en) * | 2018-01-12 | 2019-07-19 | 珠海全志科技股份有限公司 | A kind of single channel microphone multiplexing method and device |
| CN110557341A (en) * | 2018-05-31 | 2019-12-10 | 北京京东尚科信息技术有限公司 | Method and device for limiting data current |
| CN112148435A (en) * | 2019-06-28 | 2020-12-29 | 北京初速度科技有限公司 | Method and device for determining target module scheduling strategy for automatic driving system |
| CN112148435B (en) * | 2019-06-28 | 2024-03-29 | 北京魔门塔科技有限公司 | Method and device for determining target module scheduling strategy for automatic driving system |
| CN110554924A (en) * | 2019-07-30 | 2019-12-10 | 视联动力信息技术股份有限公司 | Message processing method and device |
| CN112765054A (en) * | 2019-11-01 | 2021-05-07 | 中国科学院声学研究所 | High-speed data acquisition system and method based on FPGA |
| CN111865824A (en) * | 2020-06-19 | 2020-10-30 | 重庆川仪自动化股份有限公司 | Method and system for designing double-pointer annular buffer area in serial port communication |
| CN111966498B (en) * | 2020-08-27 | 2023-08-25 | 南京电研电力自动化股份有限公司 | Rapid processing method, system and storage medium for gateway data of Internet of things in power distribution room |
| CN111966498A (en) * | 2020-08-27 | 2020-11-20 | 南京电研电力自动化股份有限公司 | Power distribution room Internet of things gateway data rapid processing method and system and storage medium |
| CN112235204A (en) * | 2020-10-13 | 2021-01-15 | 中移（杭州）信息技术有限公司 | Data reporting method, system, electronic equipment and storage medium |
| CN115934023A (en) * | 2021-08-31 | 2023-04-07 | 华为技术有限公司 | Data processing method, data processing device and related equipment |
| CN117407148A (en) * | 2022-07-08 | 2024-01-16 | 华为技术有限公司 | Data writing method, data reading device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| HK1147154A1 (en) | 2011-07-29 |
| WO2011088778A1 (en) | 2011-07-28 |
| CN101800867B (en) | 2011-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101800867B (en) | Method, device and digital-television receiving terminal for realizing ring buffer | |
| CN101520792B (en) | Method and system for automatically mounting and recognizing system file | |
| CN102098575B (en) | Migration method compatible with multiple conditional access (CA) systems and CA method | |
| CN106803989B (en) | Multi-screen interaction method and device and terminal equipment | |
| CN105100876A (en) | Streaming media playing method and device | |
| EP2552140A1 (en) | Processing method and terminal for storing and authenticating data in parallel | |
| US20120174106A1 (en) | Mobile terminal and method for managing tasks at a platform level | |
| US9876744B2 (en) | Information sending method and information sending apparatus | |
| US9335946B2 (en) | Method and apparatus for managing memory | |
| CN103218137A (en) | Method and device for automatically adjusting controls according to user operation | |
| CN101281489B (en) | FIFO memory implementing method and apparatus | |
| US20170005965A1 (en) | Information sending method and information sending apparatus | |
| EP1967009A1 (en) | Hardware motion compensation for video decoding | |
| CN101437144A (en) | Mobile multimedia broadcast receiving terminal and method for previewing program | |
| CN106844070B (en) | Broadcast control method and device and mobile terminal | |
| CN101493759B (en) | Address control method of random capacity asynchronous first-in/first-out memory | |
| EP3144934B1 (en) | Audio play method and device | |
| CN101778273A (en) | Method and device for transcribing multimedia radio programs | |
| CN103391415A (en) | Video data frame loss processing method and system | |
| CN112911390B (en) | Video data playing method and terminal equipment | |
| CN102215433B (en) | User authorization method and safety device | |
| CN110515736B (en) | Method, device, terminal and storage medium for limiting background object | |
| CN116643870B (en) | Method, system and device for processing long-time task distribution and readable storage medium | |
| US6876664B1 (en) | Asynchronous data buffer and a method of use thereof | |
| US20050160448A1 (en) | Smartcard uart for minimizing processor demands in a conditional access system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1147154 Country of ref document: HK |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1147154 Country of ref document: HK |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110928 Termination date: 20150119 |
|
| EXPY | Termination of patent right or utility model |