CN100499782C - Bit stream management system and method for digital data - Google Patents
Bit stream management system and method for digital data Download PDFInfo
- Publication number
- CN100499782C CN100499782C CNB200410002082XA CN200410002082A CN100499782C CN 100499782 C CN100499782 C CN 100499782C CN B200410002082X A CNB200410002082X A CN B200410002082XA CN 200410002082 A CN200410002082 A CN 200410002082A CN 100499782 C CN100499782 C CN 100499782C
- Authority
- CN
- China
- Prior art keywords
- bit stream
- block
- bit
- capacity
- sub
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Image Processing (AREA)
Abstract
一种数字数据的位流管理系统，包含编码器、位流截断器及缓冲器，编码器是将数字数据编码成为多个位流，位流截断器基于该预定的位预算政策，将多个位流中每一个位流进行截断或不截断，以产生相对应的多个修正位流，缓冲器用以储存多个修正位流。
A bit stream management system for digital data includes an encoder, a bit stream truncation device and a buffer. The encoder encodes digital data into multiple bit streams. The bit stream truncation device truncates or does not truncate each of the multiple bit streams based on the predetermined bit budget policy to generate corresponding multiple modified bit streams. The buffer is used to store the multiple modified bit streams.
Description
Technical field
The present invention relates to a kind of bit stream (bitstreams) management system of numerical data, particularly meet digital recording specification (digital video specification, the bit stream management system of numerical data DV).
Background technology
The encoder of known image, be based on a predetermined coded format, as dynamic image compression (MovingPictures Experts Groups, MPEG), static image compression (Joint PhotographicExperts Groups, JPEG), or in 1993 by Sony, Matsushita, Philips, leading digital recording (DV) specification of promoting of manufacturers such as Thomson, with a numerical data via the conversion (transform), quantize (quantization) and variable length code (Variable Length Coding, step such as VLC), coding becomes a plurality of bit streams, should comply with its purposes by a plurality of bit streams again, carry out subsequent treatment.
When this encoder applies is in a DV device, these a plurality of bit streams according to the coded generation of DV specification, need in the corresponding sub-block of this each flow distribution to one (sub-block), to form a section (segment) at last through a distribution (bits assignment) device.This DV specification defines this section simultaneously and comprises 5 macro zone blocks (macroblock), each macro zone block comprises four brightness sub-block (luma sub-blocks) and two colourity sub-block (chroma sub-blocks), this each brightness sub-block comprises 112 positions, and this each colourity sub-block comprises 80 positions.
The allocation step of this bit allocation apparatus is partly as follows:
(1) judges whether the bits number of a bit stream that is assigned with in these a plurality of bit streams surpasses the bits number of this corresponding sub-block of institute's desire distribution
(2) if, an overriding price of this bit stream that is assigned with is blocked, this bit stream that is assigned with after will blocking again is dispensed in this corresponding sub-block, and is afterwards that this overriding price is temporary to an excess bits buffer (extra bits buffer); If not, the bit stream that then this is assigned with directly is dispensed in this corresponding sub-block;
(3) repeated execution of steps (1) and (2) all are assigned to corresponding sub-block up to these a plurality of bit streams;
(4) this overriding price is read from this excess bits buffer, and be dispensed in other sub-block that still has remaining space.
In known technology, for the consideration in economy and the practicality, general this excess bits buffer has only the memory capacity of 2 to 8K bytes (byte) approximately, therefore the bits number as if this overriding price that a bit stream is arranged is too big, will take most of capacity of this excess bits buffer, even all told, cause this overriding price of other bit stream to deposit in, and be rejected.By this, if this overriding price of other bit stream includes important message, will lose in the lump, cause follow-uply during with this numerical data reduction, the situation of distortion increases the weight of.
Summary of the invention
Main purpose of the present invention provides a kind of bit stream management system of numerical data, to solve the problem that known technology was occurred.
Bit stream management system of the present invention is based on a predetermined coded format at known this encoder, with this numerical data via conversion, steps such as quantification and variable length code, after coding becomes these a plurality of bit streams, by a predetermined position budgetary policy (bit budget policy), these a plurality of bit streams are revised, in order to reduce known bits number with this too big overriding price of bits number, produce corresponding a plurality of correction bit stream, this practice can avoid known if there is one the bits number of this overriding price too big, can take most of capacity of this excess bits buffer, even all told, the situation that causes other this overriding price to deposit in takes place.
The present invention is a kind of bit stream management system of numerical data, comprises an encoder, a bit stream cropper (bits stream truncator) and a buffer (buffer).This encoder is that this digital data coding is become a plurality of bit streams.This bit stream cropper is based on this predetermined position budgetary policy, should a plurality of bit streams in each bit stream block (truncate) or do not block, to produce corresponding these a plurality of correction bit streams.One buffer provides a budget capacity to store these a plurality of correction bit streams, and wherein, each revises the bit length of bit stream to this budgetary policy according to this budget calculation of capacity.
Can be further understood detailed description of the present invention in conjunction with the accompanying drawings about the advantages and spirit of the present invention.
Description of drawings
Fig. 1 is the schematic diagram of the bit stream management system of the present invention's first specific embodiment;
Fig. 2 is the operational flowchart of the predetermined position budgetary policy of first specific embodiment;
Fig. 3 is the schematic diagram of the bit stream management system of the present invention's second specific embodiment; With
Fig. 4 is the flow chart of the bit stream management system of second specific embodiment.
The drawing reference numeral explanation
10: bit stream management system 12: numerical data
14: revise bit stream 16: encoder
18: bit stream cropper 20: buffer
22: bit stream 24: the bit stream management system
26: bit stream 28: distribution module
30: excess bits buffer 32: revise bit stream
34: superfluous place value 36: section
Embodiment
See also Fig. 1, Fig. 1 is the schematic diagram of bit stream (bit streams) management system 10 of the present invention's first specific embodiment.The bit stream management system 10 of first specific embodiment comprises an encoder 16, a bit stream cropper (bits stream truncator) 18 and one buffer (buffer) 20.
See also Fig. 2, Fig. 2 is the operational flowchart of the position budgetary policy that should be scheduled to of first specific embodiment.A plurality of bit streams 22 amount to the M pen, and with the corresponding bit stream 22 of K bit stream 22 expressions, K=0～M-1 wherein, and K bit stream 22 comprises N
KData sample (sample), and represent a corresponding data sample, wherein L=0～N with L data sample
K-1, bit stream cropper 18 is handled this each data sample in each bit stream 22 and each bit stream 22 in regular turn, and step is as follows:
Step S135: calculate one the 0th residual capacity in the 0th the bit stream 22 corresponding buffers 20, computing formula is as follows:
E
0＝Capacity-M*Quota
E
0: the 0th residual capacity; Capacity: the total capacity of buffer 20; Quota: one guarantees bit length, and this guarantees that bit length is that buffer 20 keeps the fixed capacity of giving each bit stream 22 in advance.
Step S140: calculate a K budget capacity, K=0～M-1 wherein, computing formula is as follows:
B
K＝Quota+E
K
B
K: this K budget capacity; E
K: a K residual capacity.
Step S142: whether judge K less than M, if then carry out step S145; If not, then carry out step S200.
Step S145: with one the 0th temporary transient bit stream length (BK that revises
0) be made as 0.
Step S150: import a L data sample of K bit stream 22, wherein L=0～N
K-1.
Step S152: judge that whether L is less than N
KIf,, then carry out step S155; If not, then carry out step S185.
Step S155: calculate the temporary transient bit length of a L pen, computing formula is as follows:
TB
L＝BK
L+TE
L+EOB
TB
L: the temporary transient bit length of this L pen; BK
L: this L pen is temporarily revised bit stream length; TE
L: this L data sample; EOB: this closing tag.
Step S160: judge TB
LWhether greater than corresponding BK, if, then carry out step S165, if not, then carry out step S170.
Step S165: calculate this bit length of a K pen correction bit stream, computing formula is as follows:
FB
K＝BK
L+EOB
FB
K: this bit length of this K pen correction bit stream.Carry out step S185.
Step S170: calculate a L+1 pen and temporarily revise bit stream length, computing formula is as follows:
BK
L+1＝BK
L+TE
L
BK
L+1: this L+1 pen is temporarily revised bit stream length.
Step S172: repeating step S150, carry out the computing of L+1 data sample.
Step S185: import K+1 bit stream.
Step S190: calculate K+1 residual capacity, computing formula is as follows:
E
K+1＝B
K-FB
K
Step S195: repeating step S140, to calculate K+1 budget capacity.
Step S200: computing finishes.
See also Fig. 3, Fig. 3 is the schematic diagram of the bit stream management system 24 of the present invention's second specific embodiment.In second specific embodiment, bit stream management system 24 is applied among the DV, and a plurality of bit streams 26 meet a digital recording specification (digital video specification).Bit stream management system 24 further comprises a distribution module 28 except that encoder 16, bit stream cropper 18 and buffer 20 that Fig. 1 comprised, distribution module 28 comprises an excess bits buffer (extra bits buffer) 30.
The a plurality of bit streams 22 of M pen in Fig. 2 of the present invention, M can be 6, and promptly the program of blocking can be that six sub-block in the macro zone block are circulation at every turn, and M can also be 30, and promptly the program of blocking is to be circulation with 30 sub-block in the section at every turn.
See also Fig. 4, Fig. 4 is the flow chart of the bit stream management system 24 of second specific embodiment.Comprehensive the above, the process step of second specific embodiment is as follows:
Step S210: numerical data 12 codings are become a plurality of bit streams 26.
Step S215: based on this predetermined position budgetary policy, each bit stream 26 in a plurality of bit streams 26 is blocked (truncate) or do not block, to produce corresponding a plurality of correction bit stream 32.
Step S220: store a plurality of correction bit streams 32.
Step S225: judge whether the correction bit stream 32 that is distributed at present has superfluous place value 34, if, then carry out step 230, if not, then carry out step 240.
Step S230: from the correction bit stream 32 that is distributed at present, block superfluous place value 34, and the correction bit stream 32 after will blocking adds corresponding closing tag, be dispensed in this corresponding sub-block.
Step S235: excess of storage place value 34, carry out step 245.
Step S240: the correction bit stream 32 that will be distributed at present directly is dispensed to this corresponding sub-block.
Step S245: each superfluous place value 34 is dispensed in the sub-block that still has remaining space.
Step S240: the corresponding a plurality of sub-block of the institute of a plurality of correction bit streams 32 form section 36.
In known technology, after this numerical data became these a plurality of bit streams via this encoder encodes, this bit allocation apparatus directly carried out the batch operation of these a plurality of bit streams, also was about to this each flow distribution to this corresponding sub-block, formed this section at last.Therefore the bits number as if this overriding price that a bit stream is arranged in these a plurality of bit streams is too big, will take most of capacity of this excess bits buffer, even all told, cause other this overriding price to deposit in, and be rejected, cause follow-uply during with the reduction of this numerical data, the situation of distortion increases the weight of.Bit stream management system the 10, the 24th of the present invention is before distribution module 28 is carried out batch operation, the operation of a plurality of bit streams 22,26 being revised with this predetermined position budgetary policy earlier, produce corresponding a plurality of correction bit stream 14,32, by this step, but each bit stream 22,26 of precheck, and this too big overriding price of known bits number revised, in order to subsequent treatment.
By the above detailed description of preferred embodiments, be to wish to know more to describe feature of the present invention and spirit, and be not to come category of the present invention is limited with above-mentioned disclosed preferred embodiment.On the contrary, its objective is that hope can contain in the category that is arranged in claim of the present invention of various changes and tool equality.
Claims (16)
1. the bit stream management system of a numerical data comprises:
One encoder becomes a plurality of bit streams with this digital data coding;
One bit stream cropper, based on a predetermined position budgetary policy, should a plurality of bit streams in each bit stream block or do not block, to produce corresponding a plurality of correction bit stream; And
One buffer also stores these a plurality of correction bit streams in order to a budget capacity to be provided,
Wherein, each revises the bit length of bit stream to this budgetary policy according to this budget calculation of capacity.
2. the system as claimed in claim 1, this budget capacity guarantees bit length and a residual capacity based on one and produces, wherein this assurance bit length is that this buffer keeps the fixed capacity to each bit stream in advance, and this residual capacity is that the total capacity that is relevant to this buffer deducts the capacity that has used and needs the capacity of reservation in advance.
3. system as claimed in claim 2, wherein this budgetary policy is checked this each bit stream in regular turn, if when a present inspected bit stream does not meet this budgetary policy, promptly block this present inspected bit stream according to this budget capacity, and add a closing tag, form corresponding one and revise bit stream, when meeting this budgetary policy as if this present inspected bit stream, promptly do not block this present inspected bit stream, and it is output as corresponding this correction bit stream.
4. system as claimed in claim 3, this system further comprises:
One distribution module is respectively allocated to a corresponding sub-block in order to each is revised bit stream, and this corresponding sub-block comprises a block length.
5. system as claimed in claim 4, this distribution module further comprises:
One excess bits buffer, each revises the superfluous place value that bit stream surpasses the block length of this corresponding sub-block in order to store this.
6. system as claimed in claim 5, wherein these a plurality of bit streams meet a digital recording specification.
7. system as claimed in claim 6, corresponding a plurality of sub-block of these a plurality of correction bit streams form a section.
8. system as claimed in claim 7, wherein this section comprises 5 macro zone blocks, and each macro zone block comprises four brightness sub-block and two colourity sub-block, and this each brightness sub-block comprises 112 positions, and this each colourity sub-block comprises 80 positions.
9. the bit stream management method of a numerical data comprises:
One digital data coding is become a plurality of bit streams;
Based on a predetermined position budgetary policy, should a plurality of bit streams in each bit stream block or do not block, to produce corresponding a plurality of correction bit stream; And
Use a buffer, a budget capacity be provided and store these a plurality of correction bit streams,
Wherein, each revises the bit length of bit stream to this budgetary policy according to this budget calculation of capacity.
10. method as claimed in claim 9, this budget capacity guarantees bit length and a residual capacity based on one and produces, wherein this assurance bit length is that this buffer keeps the fixed capacity to each bit stream in advance, and this residual capacity is that the total capacity that is relevant to this buffer deducts the capacity that has used and needs the capacity of reservation in advance.
11. method as claimed in claim 10, wherein this budgetary policy is checked this each bit stream in regular turn, if when a present inspected bit stream does not meet this budgetary policy, promptly block this present inspected bit stream according to this budget capacity, and add a closing tag, form corresponding one and revise bit stream, when meeting this budgetary policy as if this present inspected bit stream, promptly do not block this present inspected bit stream, and it is output as corresponding this correction bit stream.
12. method as claimed in claim 11, this method further comprises:
Each is revised bit stream be respectively allocated to a corresponding sub-block.
13. method as claimed in claim 12, this method further comprises:
Each revises the superfluous place value that bit stream surpasses the block length of this corresponding sub-block to store this.
14. method as claimed in claim 13, wherein these a plurality of bit streams meet a digital recording specification.
15. method as claimed in claim 14, corresponding a plurality of sub-block of these a plurality of correction bit streams form a section.
16. method as claimed in claim 15, wherein this section comprises 5 macro zone blocks, and each macro zone block comprises four brightness sub-block and two colourity sub-block, and this each brightness sub-block comprises 112 positions, and this each colourity sub-block comprises 80 positions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410002082XA CN100499782C (en) | 2004-01-12 | 2004-01-12 | Bit stream management system and method for digital data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB200410002082XA CN100499782C (en) | 2004-01-12 | 2004-01-12 | Bit stream management system and method for digital data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1642254A CN1642254A (en) | 2005-07-20 |
| CN100499782C true CN100499782C (en) | 2009-06-10 |
Family
ID=34867266
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB200410002082XA Expired - Fee Related CN100499782C (en) | 2004-01-12 | 2004-01-12 | Bit stream management system and method for digital data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100499782C (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1251725A (en) * | 1996-10-11 | 2000-04-26 | 夸尔柯姆股份有限公司 | Adaptive rate control for digital video compression |
| JP2001268369A (en) * | 2000-01-11 | 2001-09-28 | Minolta Co Ltd | Device and method for encoding image data, recording medium and image forming device |
| US20020168004A1 (en) * | 2001-05-11 | 2002-11-14 | International Business Machines Corporation | Method for performing integer divides without propagation of truncation error |
| CN1437401A (en) * | 2002-12-23 | 2003-08-20 | 乐金电子（沈阳）有限公司 | Image converting encoder |
-
2004
- 2004-01-12 CN CNB200410002082XA patent/CN100499782C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1251725A (en) * | 1996-10-11 | 2000-04-26 | 夸尔柯姆股份有限公司 | Adaptive rate control for digital video compression |
| JP2001268369A (en) * | 2000-01-11 | 2001-09-28 | Minolta Co Ltd | Device and method for encoding image data, recording medium and image forming device |
| US20020168004A1 (en) * | 2001-05-11 | 2002-11-14 | International Business Machines Corporation | Method for performing integer divides without propagation of truncation error |
| CN1437401A (en) * | 2002-12-23 | 2003-08-20 | 乐金电子（沈阳）有限公司 | Image converting encoder |
Non-Patent Citations (2)
| Title |
|---|
| JPEG2000 EBCOT编码器的VLSI结构设计. 刘雷波，李德建，孟鸿鹰，张利，王志华，陈弘毅，夏宇闻.北京邮电大学学报，第26卷第4期. 2003 * |
| 新一代的静止图像压缩标准JPEG2000. 张晓娣，刘贵忠，曾召华，胡波.电信科学，第5期. 2001 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1642254A (en) | 2005-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1078428C (en) | Image coding method and apparatus therefor | |
| CN1148005C (en) | Fast Joint Photographic Experts Group Huffman Coding and Decoding Method | |
| US8005801B2 (en) | Aging and compressing multimedia content | |
| CN1726709B (en) | Method and device for encoding image of uncompressed digital video frequency sequence | |
| US7132963B2 (en) | Methods and apparatus for processing variable length coded data | |
| CN1917562A (en) | System and method for progressively transforming and coding digital data | |
| CN1825978A (en) | Frame compression with radix approximation or with differential and escape codes | |
| TW201406161A (en) | Improving decoder performance through quantization control | |
| DE112014000643T5 (en) | Image data encoding for access to raster and macroblock | |
| Krajcevski et al. | GST: GPU-decodable supercompressed textures | |
| JP2003032677A (en) | Video compression encoding device | |
| RU2394391C2 (en) | Controlling speed of scalable coded images | |
| CN100499782C (en) | Bit stream management system and method for digital data | |
| JP2011103665A (en) | Data compression encoding system | |
| CN1209894A (en) | Method for encoding with locale information | |
| US20140133552A1 (en) | Method and apparatus for encoding an image | |
| JPH099257A (en) | Variable bit rate video coding method | |
| CN1937748A (en) | Image compression method | |
| US7298297B1 (en) | Hardware-implemented Huffman decoder | |
| CN1280745A (en) | Method for controlling the compression rate of digital images | |
| CN1848960A (en) | Residual coding in compliance with a video standard using non-standardized vector quantization coder | |
| JPH03188768A (en) | image compression device | |
| US20070242749A1 (en) | Image frame compression of video stream with fast random accessing and decompressing | |
| WO2000021022A2 (en) | A system for building a data compression encoder | |
| JP2000049621A (en) | Huffman decoding method and data processing device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090610 Termination date: 20160112 |