Joint Algorithm-Architecture Optimization of CABAC
Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Sze, Vivienne [verfasserIn] Chandrakasan, Anantha P. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2012 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of VLSI signal processing systems for signal, image and video technology - Springer Netherlands, 1989, 69(2012), 3 vom: 26. Mai, Seite 239-252 |
|---|---|
| Übergeordnetes Werk: |
volume:69 ; year:2012 ; number:3 ; day:26 ; month:05 ; pages:239-252 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11265-012-0678-2 |
|---|
| Katalog-ID: |
SPR018325726 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR018325726 | ||
| 003 | DE-627 | ||
| 005 | 20201124222410.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201006s2012 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11265-012-0678-2 |2 doi | |
| 035 | |a (DE-627)SPR018325726 | ||
| 035 | |a (SPR)s11265-012-0678-2-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Sze, Vivienne |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Joint Algorithm-Architecture Optimization of CABAC |
| 264 | 1 | |c 2012 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. | ||
| 650 | 4 | |a CABAC |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Arithmetic coding |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a H.264/AVC |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Video coding |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Architecture |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Entropy coding |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Chandrakasan, Anantha P. |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of VLSI signal processing systems for signal, image and video technology |d Springer Netherlands, 1989 |g 69(2012), 3 vom: 26. Mai, Seite 239-252 |w (DE-627)SPR018308090 |7 nnns |
| 773 | 1 | 8 | |g volume:69 |g year:2012 |g number:3 |g day:26 |g month:05 |g pages:239-252 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1007/s11265-012-0678-2 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2027 | ||
| 951 | |a AR | ||
| 952 | |d 69 |j 2012 |e 3 |b 26 |c 05 |h 239-252 | ||
| author_variant |
v s vs a p c ap apc |
|---|---|
| matchkey_str |
szeviviennechandrakasanananthap:2012----:onagrtmrhtcuepii |
| hierarchy_sort_str |
2012 |
| publishDate |
2012 |
| allfields |
10.1007/s11265-012-0678-2 doi (DE-627)SPR018325726 (SPR)s11265-012-0678-2-e DE-627 ger DE-627 rakwb eng Sze, Vivienne verfasserin aut Joint Algorithm-Architecture Optimization of CABAC 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. CABAC (dpeaa)DE-He213 Arithmetic coding (dpeaa)DE-He213 H.264/AVC (dpeaa)DE-He213 Video coding (dpeaa)DE-He213 Architecture (dpeaa)DE-He213 Entropy coding (dpeaa)DE-He213 Chandrakasan, Anantha P. verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 69(2012), 3 vom: 26. Mai, Seite 239-252 (DE-627)SPR018308090 nnns volume:69 year:2012 number:3 day:26 month:05 pages:239-252 https://dx.doi.org/10.1007/s11265-012-0678-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 69 2012 3 26 05 239-252 |
| spelling |
10.1007/s11265-012-0678-2 doi (DE-627)SPR018325726 (SPR)s11265-012-0678-2-e DE-627 ger DE-627 rakwb eng Sze, Vivienne verfasserin aut Joint Algorithm-Architecture Optimization of CABAC 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. CABAC (dpeaa)DE-He213 Arithmetic coding (dpeaa)DE-He213 H.264/AVC (dpeaa)DE-He213 Video coding (dpeaa)DE-He213 Architecture (dpeaa)DE-He213 Entropy coding (dpeaa)DE-He213 Chandrakasan, Anantha P. verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 69(2012), 3 vom: 26. Mai, Seite 239-252 (DE-627)SPR018308090 nnns volume:69 year:2012 number:3 day:26 month:05 pages:239-252 https://dx.doi.org/10.1007/s11265-012-0678-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 69 2012 3 26 05 239-252 |
| allfields_unstemmed |
10.1007/s11265-012-0678-2 doi (DE-627)SPR018325726 (SPR)s11265-012-0678-2-e DE-627 ger DE-627 rakwb eng Sze, Vivienne verfasserin aut Joint Algorithm-Architecture Optimization of CABAC 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. CABAC (dpeaa)DE-He213 Arithmetic coding (dpeaa)DE-He213 H.264/AVC (dpeaa)DE-He213 Video coding (dpeaa)DE-He213 Architecture (dpeaa)DE-He213 Entropy coding (dpeaa)DE-He213 Chandrakasan, Anantha P. verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 69(2012), 3 vom: 26. Mai, Seite 239-252 (DE-627)SPR018308090 nnns volume:69 year:2012 number:3 day:26 month:05 pages:239-252 https://dx.doi.org/10.1007/s11265-012-0678-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 69 2012 3 26 05 239-252 |
| allfieldsGer |
10.1007/s11265-012-0678-2 doi (DE-627)SPR018325726 (SPR)s11265-012-0678-2-e DE-627 ger DE-627 rakwb eng Sze, Vivienne verfasserin aut Joint Algorithm-Architecture Optimization of CABAC 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. CABAC (dpeaa)DE-He213 Arithmetic coding (dpeaa)DE-He213 H.264/AVC (dpeaa)DE-He213 Video coding (dpeaa)DE-He213 Architecture (dpeaa)DE-He213 Entropy coding (dpeaa)DE-He213 Chandrakasan, Anantha P. verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 69(2012), 3 vom: 26. Mai, Seite 239-252 (DE-627)SPR018308090 nnns volume:69 year:2012 number:3 day:26 month:05 pages:239-252 https://dx.doi.org/10.1007/s11265-012-0678-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 69 2012 3 26 05 239-252 |
| allfieldsSound |
10.1007/s11265-012-0678-2 doi (DE-627)SPR018325726 (SPR)s11265-012-0678-2-e DE-627 ger DE-627 rakwb eng Sze, Vivienne verfasserin aut Joint Algorithm-Architecture Optimization of CABAC 2012 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. CABAC (dpeaa)DE-He213 Arithmetic coding (dpeaa)DE-He213 H.264/AVC (dpeaa)DE-He213 Video coding (dpeaa)DE-He213 Architecture (dpeaa)DE-He213 Entropy coding (dpeaa)DE-He213 Chandrakasan, Anantha P. verfasserin aut Enthalten in Journal of VLSI signal processing systems for signal, image and video technology Springer Netherlands, 1989 69(2012), 3 vom: 26. Mai, Seite 239-252 (DE-627)SPR018308090 nnns volume:69 year:2012 number:3 day:26 month:05 pages:239-252 https://dx.doi.org/10.1007/s11265-012-0678-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 AR 69 2012 3 26 05 239-252 |
| language |
English |
| source |
Enthalten in Journal of VLSI signal processing systems for signal, image and video technology 69(2012), 3 vom: 26. Mai, Seite 239-252 volume:69 year:2012 number:3 day:26 month:05 pages:239-252 |
| sourceStr |
Enthalten in Journal of VLSI signal processing systems for signal, image and video technology 69(2012), 3 vom: 26. Mai, Seite 239-252 volume:69 year:2012 number:3 day:26 month:05 pages:239-252 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
CABAC Arithmetic coding H.264/AVC Video coding Architecture Entropy coding |
| isfreeaccess_bool |
false |
| container_title |
Journal of VLSI signal processing systems for signal, image and video technology |
| authorswithroles_txt_mv |
Sze, Vivienne @@aut@@ Chandrakasan, Anantha P. @@aut@@ |
| publishDateDaySort_date |
2012-05-26T00:00:00Z |
| hierarchy_top_id |
SPR018308090 |
| id |
SPR018325726 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR018325726</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124222410.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11265-012-0678-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR018325726</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11265-012-0678-2-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sze, Vivienne</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Joint Algorithm-Architecture Optimization of CABAC</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CABAC</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arithmetic coding</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">H.264/AVC</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Video coding</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Architecture</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Entropy coding</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chandrakasan, Anantha P.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of VLSI signal processing systems for signal, image and video technology</subfield><subfield code="d">Springer Netherlands, 1989</subfield><subfield code="g">69(2012), 3 vom: 26. Mai, Seite 239-252</subfield><subfield code="w">(DE-627)SPR018308090</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:69</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:3</subfield><subfield code="g">day:26</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:239-252</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11265-012-0678-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">69</subfield><subfield code="j">2012</subfield><subfield code="e">3</subfield><subfield code="b">26</subfield><subfield code="c">05</subfield><subfield code="h">239-252</subfield></datafield></record></collection>
|
| author |
Sze, Vivienne |
| spellingShingle |
Sze, Vivienne misc CABAC misc Arithmetic coding misc H.264/AVC misc Video coding misc Architecture misc Entropy coding Joint Algorithm-Architecture Optimization of CABAC |
| authorStr |
Sze, Vivienne |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)SPR018308090 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
Joint Algorithm-Architecture Optimization of CABAC CABAC (dpeaa)DE-He213 Arithmetic coding (dpeaa)DE-He213 H.264/AVC (dpeaa)DE-He213 Video coding (dpeaa)DE-He213 Architecture (dpeaa)DE-He213 Entropy coding (dpeaa)DE-He213 |
| topic |
misc CABAC misc Arithmetic coding misc H.264/AVC misc Video coding misc Architecture misc Entropy coding |
| topic_unstemmed |
misc CABAC misc Arithmetic coding misc H.264/AVC misc Video coding misc Architecture misc Entropy coding |
| topic_browse |
misc CABAC misc Arithmetic coding misc H.264/AVC misc Video coding misc Architecture misc Entropy coding |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Journal of VLSI signal processing systems for signal, image and video technology |
| hierarchy_parent_id |
SPR018308090 |
| hierarchy_top_title |
Journal of VLSI signal processing systems for signal, image and video technology |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)SPR018308090 |
| title |
Joint Algorithm-Architecture Optimization of CABAC |
| ctrlnum |
(DE-627)SPR018325726 (SPR)s11265-012-0678-2-e |
| title_full |
Joint Algorithm-Architecture Optimization of CABAC |
| author_sort |
Sze, Vivienne |
| journal |
Journal of VLSI signal processing systems for signal, image and video technology |
| journalStr |
Journal of VLSI signal processing systems for signal, image and video technology |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2012 |
| contenttype_str_mv |
txt |
| container_start_page |
239 |
| author_browse |
Sze, Vivienne Chandrakasan, Anantha P. |
| container_volume |
69 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Sze, Vivienne |
| doi_str_mv |
10.1007/s11265-012-0678-2 |
| author2-role |
verfasserin |
| title_sort |
joint algorithm-architecture optimization of cabac |
| title_auth |
Joint Algorithm-Architecture Optimization of CABAC |
| abstract |
Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. |
| abstractGer |
Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. |
| abstract_unstemmed |
Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_40 GBV_ILN_2006 GBV_ILN_2027 |
| container_issue |
3 |
| title_short |
Joint Algorithm-Architecture Optimization of CABAC |
| url |
https://dx.doi.org/10.1007/s11265-012-0678-2 |
| remote_bool |
true |
| author2 |
Chandrakasan, Anantha P. |
| author2Str |
Chandrakasan, Anantha P. |
| ppnlink |
SPR018308090 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11265-012-0678-2 |
| up_date |
2024-07-03T18:55:07.530Z |
| _version_ |
1803585226049323008 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">SPR018325726</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20201124222410.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201006s2012 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11265-012-0678-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR018325726</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s11265-012-0678-2-e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sze, Vivienne</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Joint Algorithm-Architecture Optimization of CABAC</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2012</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper uses joint algorithm and architecture design to enable high coding efficiency in conjunction with high processing speed and low area cost. Specifically, it presents several optimizations that can be performed on Context Adaptive Binary Arithmetic Coding (CABAC), a form of entropy coding used in H.264/AVC, to achieve the throughput necessary for real-time low power high definition video coding. The combination of syntax element partitions and interleaved entropy slices, referred to as Massively Parallel CABAC, increases the number of binary symbols that can be processed in a cycle. Subinterval reordering is used to reduce the cycle time required to process each binary symbol. Under common conditions using the JM12.0 software, the Massively Parallel CABAC, increases the bins per cycle by 2.7 to 32.8× at a cost of 0.25 to 6.84% coding loss compared with sequential single slice H.264/AVC CABAC. It also provides a 2× reduction in area cost, and reduces memory bandwidth. Subinterval reordering reduces the critical path delay by 14 to 22%, while modifications to context selection reduces the memory requirement by 67%. This work demonstrates that accounting for implementation cost during video coding algorithms design can enable higher processing speed and reduce hardware cost, while still delivering high coding efficiency in the next generation video coding standard.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CABAC</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arithmetic coding</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">H.264/AVC</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Video coding</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Architecture</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Entropy coding</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chandrakasan, Anantha P.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of VLSI signal processing systems for signal, image and video technology</subfield><subfield code="d">Springer Netherlands, 1989</subfield><subfield code="g">69(2012), 3 vom: 26. Mai, Seite 239-252</subfield><subfield code="w">(DE-627)SPR018308090</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:69</subfield><subfield code="g">year:2012</subfield><subfield code="g">number:3</subfield><subfield code="g">day:26</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:239-252</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1007/s11265-012-0678-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">69</subfield><subfield code="j">2012</subfield><subfield code="e">3</subfield><subfield code="b">26</subfield><subfield code="c">05</subfield><subfield code="h">239-252</subfield></datafield></record></collection>
|
| score |
7.400978 |