The disclosed embodiments of the present invention relate to video/image processing, and more particularly, to a buffering apparatus for buffering a multi-partition video/image bitstream and related method thereof.
VP8 is an open video compression format released by Google®. Like many modern video compression schemes, VP8 is based on decomposition of frames into square subblocks of pixels, prediction of such subblocks using previously constructed blocks, and adjustment of such predictions (as well as synthesis of unpredicted blocks) using a discrete cosine transform (DCT). In one special case, however, VP8 uses a Walsh-Hadamard transform (WHT) instead of the commonly used DCT.
WebP is an image format developed by Google® according to VP8. Specifically, WebP is based on VP8's intra-frame coding and uses a container based on resource interchange file format (RIFF). Besides, WebP is announced to be a new open standard that provides lossy compression for photographic images. In a large scale study of 900,000 web images, WebP images are found 39.8% smaller than joint Photographic Experts Group (JPEG) images of similar quality. Webmasters, web developers and browser developers therefore can use the WebP format to create smaller, better looking images that can help to improve user's web surfing.
In accordance with the VP8/WebP specification, the input to a VP8/WebP decoder is a sequence of compressed frames whose order matches their order in time. Besides, every compressed frame has multiple partitions included therein. As the VP8/WebP bitstream is configured to transmit compressed frames each having a plurality of partitions included therein, how to efficiently buffer and decode each compressed frame of a multi-partition VP8/WebP bitstream becomes an important issue in this technical field.
In accordance with exemplary embodiments of the present invention, a buffering apparatus for buffering a multi-partition video/image bitstream and related method thereof are proposed to solve the above-mentioned problem.
According to a first aspect of the present invention, a buffering apparatus for buffering a multi-partition video/image bitstream is disclosed. The multi-partition video/image bitstream transmits a plurality of compressed frames each having a plurality of partitions. The buffering apparatus includes a first bitstream buffer and a second bitstream buffer. The first bitstream buffer is arranged to buffer data of a first partition of the partitions of a specific compressed frame. The second bitstream buffer is arranged to buffer data of a second partition of the partitions of the specific compressed frame.
According to a second aspect of the present invention, a method for buffering a multi-partition video/image bitstream is disclosed. The multi-partition video/image bitstream transmits a plurality of compressed frames each having a plurality of partitions. The method includes: utilizing a first bitstream buffer to buffer data of a first partition of the partitions of a specific compressed frame; and utilizing a second bitstream buffer to buffer data of a second partition of the partitions of the specific compressed frame.
According to a third aspect of the present invention, a buffering apparatus for buffering a multi-partition video/image bitstream is disclosed. The multi-partition video/image bitstream transmits a plurality of compressed frames each having a plurality of partitions. The buffering apparatus includes a bitstream buffer and a prefetch circuit. The bitstream buffer is arranged to buffer data of the partitions of a specific compressed frame. The prefetch circuit includes a storage unit and a prefetch unit. The prefetch unit is arranged to prefetch data of a first partition of the partitions of the specific compressed frame from the bitstream buffer and store the prefetched data into the storage unit while a decoding apparatus is decoding a second partition of the partitions of the specific compressed frame, wherein the prefetched data stored in the prefetch unit is read by the decoding apparatus when the decoding apparatus starts decoding the second partition.
These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.
Certain terms are used throughout the description and following claims to refer to particular components. As one skilled in the art will appreciate, manufacturers may refer to a component by different names. This document does not intend to distinguish between components that differ in name but not function. In the following description and in the claims, the terms “include” and “comprise” are used in an open-ended fashion, and thus should be interpreted to mean “include, but not limited to . . . ”. Also, the term “couple” is intended to mean either an indirect or direct electrical connection. Accordingly, if one device is electrically connected to another device, that connection may be through a direct electrical connection, or through an indirect electrical connection via other devices and connections.
In accordance with the VP8/WebP specification, the input to a VP8/WebP decoder is a sequence of compressed frames each having 2-9 partitions. These partitions begin and end on byte boundaries. The leading partition of a compressed frame (i.e., the partition that is transmitted first) has two subsections: header information that applies to the compressed frame as a whole and per-macroblock prediction information that includes prediction information of each macroblock in the compressed frame. The remaining partitions (1, 2, 4 or 8) contain transform coefficients (e.g., DCT/WHT coefficients) of the residue signal.
Please refer to
However, VP8/WebP packs the DCT/WHT coefficients from macroblock (MB) rows into separate partitions. Please refer to
However, switching between different partitions would lower the decoding speed due to the time period needed for loading the requested data. Thus, to improve the efficiency of decoding each compressed frame of a multi-partition VP8/WebP bitstream, the present invention therefore proposes an innovative buffer maintenance and control mechanism. Further details are described as below.
In this exemplary embodiment, the bitstream buffers 312_1-312_N may be continuous/discontinuous ring buffers dedicated to buffering data of the partitions 102_1-102_N, respectively, and data is allowed to be fed into a ring buffer when the ring buffer has free storage space (i.e., the write pointer does not catch up the read pointer yet). In one exemplary design, the buffer controller 314 is arranged to monitor the write pointers WPTR_1-WPTR_N and the read pointers RPTR_1-RPTR_N of all bitstream buffers 312_1-312_N at the same time. Therefore, when the buffer controller 314 detects any bitstream buffer that has free space for receiving more data that is not buffered yet, the buffer controller 314 adjusts the corresponding write pointer and allows data that is not buffered yet to be filled into the bitstream buffer.
In another exemplary design, the buffer controller 314 is arranged to only monitor the write pointer and the read pointer of a currently used bitstream buffer in which the buffered data is being decoded. Therefore, when the buffer controller 314 detects that the currently used bitstream buffer has free space for receiving more data that is not buffered yet, the buffer controller 314 adjusts the corresponding write pointer and allows data that is not buffered yet to be filled into the currently used bitstream buffer.
In above-mentioned exemplary designs, a read pointer and a write pointer of a specific bitstream buffer are used to determine/detect whether the specific bitstream buffer is full or empty or to determine/detect how much free storage space remained in the specific bitstream buffer. However, this is for illustrative purposes only, and is not meant to be a limitation of the present invention. Using other means capable of determining/detecting whether the specific bitstream buffer is full or empty or to determining/detecting how much free storage space remained in the specific bitstream buffer is also feasible.
Regarding the decoding apparatus 304, it includes a plurality of bitstream direct memory access (DMA) controllers 316, 317, and a plurality of barrel shifters 318, 319. The bitstream DMA controller 316 is arranged to transmit buffered bitstream data (i.e., header information/per-macroblock prediction information) from the bitstream buffer 312_1 to the barrel shifter 318 via DMA manner, and the barrel shifter 318 is arranged to parse the bitstream data provided by the preceding bitstream DMA controller 316. The bitstream DMA controller 316 is arranged to transmit buffered bitstream data (i.e., coefficient data) from one of the bitstream buffers 312_2-312_N to the barrel shifter 319 via DMA manner, and the barrel shifter 319 is arranged to parse the bitstream data provided by the preceding bitstream DMA controller 317. Therefore, the decoding apparatus 304 shown in
As only one of the coefficient partitions (i.e., partitions 102_2-102_N) is allowed to be decoded by the decoding apparatus 302, the buffering apparatus 302 therefore uses the multiplexer 315 to select one of the bitstream buffers 312_2-312_N as a data source to be accessed by the bitstream DMA controller 317. For example, when the coefficient data of the partition 102_2 is required to be processed at a first time point, the multiplexer 315 couples the bitstream buffer 312_2 to the bitstream DMA controller 317. However, when the coefficient data of the partition 102_3 is required to be processed at a second time point, the multiplexer 315 couples the bitstream buffer 312_3 to the bitstream DMA controller 317. As the requested coefficient data may be guaranteed to be available in the bitstream buffers (e.g., ring buffers) 312_2-312_N if each of the bitstream buffer 312_2-312_N is properly controlled to buffer data to be decoded when there is free storage space, the buffering apparatus 302 is not required to release buffered data of one partition and load requested data in another partition. To put it another way, the decoding performance may be greatly improved due to the buffering mechanism which employs multiple bitstream buffers dedicated to buffering partial data of respective partitions, thus avoiding frequent releasing of buffered data and loading of requested data.
Please note that the circuit configuration shown in
The decoding performance of the decoding apparatus 304 may be further improved by utilizing a buffering apparatus with a prefetch mechanism employed therein. Please refer to
In the exemplary embodiment shown in
In above exemplary embodiments, the buffering apparatus with the prefetch mechanism employed therein has N bitstream buffers dedicated to buffering data of respective partitions, where N may any positive integer greater than 1. However, the proposed prefetch mechanism may also be employed in a buffering apparatus with a single bitstream buffer used for buffering data of a plurality of partitions.
Please refer to
Moreover, no matter what the buffer size of the single bitstream buffer 612 is (e.g. smaller than/bigger than/equal to the bitstream size of the compressed frame 100), the use of the prefetch circuit 404 is still capable of speeding up the overall decoding process. As a person skilled in the art should readily understand operations of the decoding apparatus 604 and the prefetch circuit 404 after reading above paragraphs, further description is omitted here for brevity.
Moreover, no matter what the buffer size of the single bitstream buffer 612 is (e.g. smaller than/bigger than/equal to the bitstream size of the compressed frame 100), the use of the prefetch circuit 404 is still capable of speeding up the overall decoding process. As a person skilled in the art should readily understand operations of the decoding apparatus 604 and the prefetch circuit 404 after reading above paragraphs, further description is omitted here for brevity.
Please note that the above-mentioned exemplary embodiments are directed to buffering and decoding a multi-partition VP8/WebP bitstream. However, this is not meant to be a limitation of the present invention. The proposed buffering mechanism and/or prefetch mechanism may be employed for processing any multi-partition based bitstream.
Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.
This application claims the benefit of U.S. provisional application No. 61/433,272, filed on Jan. 17, 2011 and incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5504823 | Yoon | Apr 1996 | A |
5802052 | Venkataraman | Sep 1998 | A |
6320909 | Takabatake | Nov 2001 | B1 |
6538583 | Hallmark | Mar 2003 | B1 |
6625740 | Datar | Sep 2003 | B1 |
6741256 | Emberling | May 2004 | B2 |
7298297 | Li | Nov 2007 | B1 |
7583851 | Kudo | Sep 2009 | B2 |
7746401 | Wu et al. | Jun 2010 | B2 |
7813431 | MacInnis | Oct 2010 | B2 |
8300699 | Stivers et al. | Oct 2012 | B2 |
20020085424 | Trivedi et al. | Jul 2002 | A1 |
20030112758 | Pang | Jun 2003 | A1 |
20030126226 | Ramey | Jul 2003 | A1 |
20030155944 | Verdoorn et al. | Aug 2003 | A1 |
20040066852 | MacInnis | Apr 2004 | A1 |
20040143380 | Stam | Jul 2004 | A1 |
20040189623 | Dunn et al. | Sep 2004 | A1 |
20050053290 | Wada | Mar 2005 | A1 |
20050175250 | Watanabe | Aug 2005 | A1 |
20050276325 | Sato | Dec 2005 | A1 |
20060140498 | Kudo et al. | Jun 2006 | A1 |
20070070830 | Weng | Mar 2007 | A1 |
20070088829 | Shima et al. | Apr 2007 | A1 |
20070133674 | Garnier | Jun 2007 | A1 |
20080049240 | Yamamoto | Feb 2008 | A1 |
20080240234 | Hung | Oct 2008 | A1 |
20090002379 | Baeza | Jan 2009 | A1 |
20090003446 | Wu | Jan 2009 | A1 |
20090003447 | Christoffersen | Jan 2009 | A1 |
20090217004 | Van De Waerdt | Aug 2009 | A1 |
20090224950 | Xu | Sep 2009 | A1 |
20100021142 | Minami | Jan 2010 | A1 |
20100061455 | Xu et al. | Mar 2010 | A1 |
20100061461 | Bankoski et al. | Mar 2010 | A1 |
20100061645 | Wilkins et al. | Mar 2010 | A1 |
20100134330 | Sakaguchi | Jun 2010 | A1 |
20100226441 | Tung | Sep 2010 | A1 |
20100265260 | Swic | Oct 2010 | A1 |
20100284456 | Frank | Nov 2010 | A1 |
20110164685 | Zhang | Jul 2011 | A1 |
20110216834 | Zhou | Sep 2011 | A1 |
20120294366 | Eliyahu | Nov 2012 | A1 |
20130328896 | Belanger | Dec 2013 | A1 |
Number | Date | Country |
---|---|---|
1798236 | Jul 2006 | CN |
1881445 | Dec 2006 | CN |
1984329 | Jun 2007 | CN |
101057224 | Oct 2007 | CN |
101087410 | Dec 2007 | CN |
101137052 | Mar 2008 | CN |
101448061 | Jun 2009 | CN |
101543082 | Sep 2009 | CN |
1 478 186 | Nov 2004 | EP |
200913723 | Mar 2009 | TW |
200931983 | Jul 2009 | TW |
Entry |
---|
“International Search Report” mailed on Feb. 28, 2013 for International application No. PCT/CN2012/085145, International filing date: Nov. 23, 2012. |
“International Search Report” mailed on Dec. 20, 2012 for International application No. PCT/CN2012/081288, International filing date: Sep. 12, 2012. |
Peter Pirsch et al., “VLSI Implementations of Image and Video Multimedia Processing Systems”, IEEE Transactions on Circuits and Systems for Video Technology, Nov. 1, 1998, pp. 878-891, XP011014520, vol. 8. No. 7, IEEE, NJ, US. |
Jim Bankoski et al., “Technical Overview of VP8, an Open Source Video CODEC for the Web”, Jul. 11, 2011, XP031964900, IEEE, CA, USA. |
Jason Garrett-Glaser, Diary of an x264 Developer, The first in-depth technical analysis of VP8, May 19, 2010, XP055133960, URL:http://x264dev.multimedia.cx/archives/377. |
Marpe et al., “Context-Based Adaptive Binary Arithmetic Coding in the H.264/AVC Video Compression Standard”, IEEE Trans. on Circuits and Systems for Video Technology, Jul. 2003, vol. 13, No. 7, p. 620-636. |
Chia-Yun Cheng et al., Title: Apparatus and Method for Buffering Context Arrays Referenced for Performing Entropy Decoding Upon Multi-Tile Encoded Picture and Related Entropy Decoder, pending U.S. Appl. No. 14/343,388, filed Mar. 7, 2014. |
Gordon Clare et al., Picture Raster Scan Decoding in the presence of multiple tiles, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 9th Meeting, Apr. 27-May 7, 2012, pp. 1-5, Document: JCTVC-10158, XP030111921, Geneva, CH. |
Chih-Wei Hsu et al., AHG4: Low latency CABAC initialization for dependent tiles, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 7th Meeting, Nov. 21-30, 2011, pp. 1-8, Document: JCTVC-G197, XP030110181, Geneva, CH. |
Kiran Misra et al., Tiles, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 5th Meeting, Mar. 16-23, 2011, pp. 1-4, Document: JCTVC-E412, XP030008918, Geneva, CH. |
Gordon Clare et al., Wavefront Parallel Processing for HEVC Encoding and Decoding, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6th Meeting, Jul. 14-22, 2011, pp. 1-16, Document: JCTVC-F274, XP030009297, Torino, IT. |
Stephan Wenger et al., “FMO 101”, Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6), 4th Meeting: Klagenfurt, Austria, Jul. 22-26, 2002, pp. 1-11, JVT-D063, XP030005337. |
Olivier Cantineau et al., “Architecture of a Memory Manager for an MPEG-2 Video Decoding Circuit”, 1998, pp. 251-265, Journal of VLSI Signal Processing 20, 1998 Kluwer Academic Publishers. Manufactured in the Netherlands, XP000788432. |
Number | Date | Country | |
---|---|---|---|
20120185620 A1 | Jul 2012 | US |
Number | Date | Country | |
---|---|---|---|
61433272 | Jan 2011 | US |