A high throughput cabac algorithm using syntax element partitioning
Enabling parallel processing is becoming increasingly necessary for video decoding as performance requirements continue to rise due to growing resolution and frame rate demands. It is important to address known bottlenecks in the video decoder such as entropy decoding, specifically the highly serial...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2011
|
| Online Access: | http://hdl.handle.net/1721.1/62199 https://orcid.org/0000-0002-5977-2748 https://orcid.org/0000-0003-4841-3990 |
| _version_ | 1811095439399714816 |
|---|---|
| author | Sze, Vivienne Chandrakasan, Anantha P. |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Sze, Vivienne Chandrakasan, Anantha P. |
| author_sort | Sze, Vivienne |
| collection | MIT |
| description | Enabling parallel processing is becoming increasingly necessary for video decoding as performance requirements continue to rise due to growing resolution and frame rate demands. It is important to address known bottlenecks in the video decoder such as entropy decoding, specifically the highly serial Context-based Adaptive Binary Arithmetic Coding (CABAC) algorithm. Concurrency must be enabled with minimal cost to coding efficiency, power, area and delay. This work proposes a new CABAC algorithm for the next generation standard in which binary symbols are grouped by syntax elements and assigned to different partitions which can be decoded in parallel. Furthermore, since the distribution of binary symbols changes with quantization, an adaptive binary symbol allocation scheme is proposed to maximize throughput. Application of this next generation CABAC algorithm on five 720p sequences shows a throughput increase of up to 3x can be achieved with negligible impact on coding efficiency (0.06% to 0.37%), which is a 2 to 4x reduction in coding penalty compared with H.264/AVC and entropy slices. Area cost is also reduced by 2x. This increased throughput can be traded-off for low power consumption in mobile applications. |
| first_indexed | 2024-09-23T16:16:47Z |
| format | Article |
| id | mit-1721.1/62199 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:16:47Z |
| publishDate | 2011 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/621992022-09-29T19:19:19Z A high throughput cabac algorithm using syntax element partitioning Sze, Vivienne Chandrakasan, Anantha P. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Microsystems Technology Laboratories Chandrakasan, Anantha P. Sze, Vivienne Chandrakasan, Anantha P. Enabling parallel processing is becoming increasingly necessary for video decoding as performance requirements continue to rise due to growing resolution and frame rate demands. It is important to address known bottlenecks in the video decoder such as entropy decoding, specifically the highly serial Context-based Adaptive Binary Arithmetic Coding (CABAC) algorithm. Concurrency must be enabled with minimal cost to coding efficiency, power, area and delay. This work proposes a new CABAC algorithm for the next generation standard in which binary symbols are grouped by syntax elements and assigned to different partitions which can be decoded in parallel. Furthermore, since the distribution of binary symbols changes with quantization, an adaptive binary symbol allocation scheme is proposed to maximize throughput. Application of this next generation CABAC algorithm on five 720p sequences shows a throughput increase of up to 3x can be achieved with negligible impact on coding efficiency (0.06% to 0.37%), which is a 2 to 4x reduction in coding penalty compared with H.264/AVC and entropy slices. Area cost is also reduced by 2x. This increased throughput can be traded-off for low power consumption in mobile applications. Texas Instruments Incorporated Natural Sciences and Engineering Research Council of Canada 2011-04-13T19:50:38Z 2011-04-13T19:50:38Z 2009-11 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-5655-0 978-1-4244-5653-6 1522-4880 INSPEC Accession Number: 11151021 http://hdl.handle.net/1721.1/62199 Sze, V., and A.P. Chandrakasan. “A High Throughput CABAC Algorithm Using Syntax Element Partitioning.” Image Processing (ICIP), 2009 16th IEEE International Conference On. 2009. 773-776. Copyright © 2009, IEEE https://orcid.org/0000-0002-5977-2748 https://orcid.org/0000-0003-4841-3990 en_US http://dx.doi.org/10.1109/ICIP.2009.5414245 IEEE International Conference on Image Processing (ICIP) Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers IEEE |
| spellingShingle | Sze, Vivienne Chandrakasan, Anantha P. A high throughput cabac algorithm using syntax element partitioning |
| title | A high throughput cabac algorithm using syntax element partitioning |
| title_full | A high throughput cabac algorithm using syntax element partitioning |
| title_fullStr | A high throughput cabac algorithm using syntax element partitioning |
| title_full_unstemmed | A high throughput cabac algorithm using syntax element partitioning |
| title_short | A high throughput cabac algorithm using syntax element partitioning |
| title_sort | high throughput cabac algorithm using syntax element partitioning |
| url | http://hdl.handle.net/1721.1/62199 https://orcid.org/0000-0002-5977-2748 https://orcid.org/0000-0003-4841-3990 |
| work_keys_str_mv | AT szevivienne ahighthroughputcabacalgorithmusingsyntaxelementpartitioning AT chandrakasanananthap ahighthroughputcabacalgorithmusingsyntaxelementpartitioning AT szevivienne highthroughputcabacalgorithmusingsyntaxelementpartitioning AT chandrakasanananthap highthroughputcabacalgorithmusingsyntaxelementpartitioning |