Practical codes for lossy compression when side information may be absent
Practical codes are developed for quadratic Gaussian lossy compression when side information may be absent by hybridizing successively refinable trellis coded quantization (SR-TCQ) and low-density parity-check (LDPC) codes. A 2-refinement level SR-TCQ is used to generate a common description for bot...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 3051 |
|---|---|
| container_issue | |
| container_start_page | 3048 |
| container_title | |
| container_volume | |
| creator | Ramanan, Sivagnanasundaram Walsh, John MacLaren |
| description | Practical codes are developed for quadratic Gaussian lossy compression when side information may be absent by hybridizing successively refinable trellis coded quantization (SR-TCQ) and low-density parity-check (LDPC) codes. A 2-refinement level SR-TCQ is used to generate a common description for both decoders and an individual description for the decoder with side information. Then, the common description is losslessly compressed while the individual description is compressed using a LDPC code which exploits the side information in a belief propagation decoder. Simulation results show that the practical codes require no more than 0.46 extra bits at moderate rates and no more than 0.7 extra bits at low rates from the theoretical bounds. |
| doi_str_mv | 10.1109/ICASSP.2011.5946301 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5946301</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5946301</ieee_id><sourcerecordid>5946301</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-5619510f27abdd018b4f82379ac4acbeba706d75398fa1d5a55caf299568934d3</originalsourceid><addsrcrecordid>eNo1UMtqwzAQVF9QN_UX5KIfsLtrW5Z0LKGPQKCBtNBbWFkSVYntYBmK_74OTfeyzOwwzCxjS4QcEfTDevW4223zAhBzoau6BLxgd1gJKUGUWl6ypCilzlDD5xVLtVT_NwXXLEFRQFZjpW9ZGuM3zFMXUgqdsPV2oGYMDR1401sXue8HfuhjnGbcHgcXY-g7_vPlOh6DdTx0s6Kl8cS2NHHjOJnouvGe3Xg6RJee94J9PD-9r16zzdvLnH-TBZRizESNWiD4QpKxFlCZyqtTeGoqaowzJKG2cm6lPKEVJERDvtBa1EqXlS0XbPnnG5xz--MQWhqm_fkr5S9VdFJy</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Practical codes for lossy compression when side information may be absent</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ramanan, Sivagnanasundaram ; Walsh, John MacLaren</creator><creatorcontrib>Ramanan, Sivagnanasundaram ; Walsh, John MacLaren</creatorcontrib><description>Practical codes are developed for quadratic Gaussian lossy compression when side information may be absent by hybridizing successively refinable trellis coded quantization (SR-TCQ) and low-density parity-check (LDPC) codes. A 2-refinement level SR-TCQ is used to generate a common description for both decoders and an individual description for the decoder with side information. Then, the common description is losslessly compressed while the individual description is compressed using a LDPC code which exploits the side information in a belief propagation decoder. Simulation results show that the practical codes require no more than 0.46 extra bits at moderate rates and no more than 0.7 extra bits at low rates from the theoretical bounds.</description><identifier>ISSN: 1520-6149</identifier><identifier>ISBN: 9781457705380</identifier><identifier>ISBN: 1457705389</identifier><identifier>EISSN: 2379-190X</identifier><identifier>EISBN: 1457705397</identifier><identifier>EISBN: 9781457705373</identifier><identifier>EISBN: 9781457705397</identifier><identifier>EISBN: 1457705370</identifier><identifier>DOI: 10.1109/ICASSP.2011.5946301</identifier><language>eng</language><publisher>IEEE</publisher><subject>Decoding ; Entropy ; LDPC codes ; Parity check codes ; Quantization ; Rate-distortion ; Source coding ; SR-TCQ ; Successive refinement</subject><ispartof>2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011, p.3048-3051</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5946301$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5946301$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ramanan, Sivagnanasundaram</creatorcontrib><creatorcontrib>Walsh, John MacLaren</creatorcontrib><title>Practical codes for lossy compression when side information may be absent</title><title>2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</title><addtitle>ICASSP</addtitle><description>Practical codes are developed for quadratic Gaussian lossy compression when side information may be absent by hybridizing successively refinable trellis coded quantization (SR-TCQ) and low-density parity-check (LDPC) codes. A 2-refinement level SR-TCQ is used to generate a common description for both decoders and an individual description for the decoder with side information. Then, the common description is losslessly compressed while the individual description is compressed using a LDPC code which exploits the side information in a belief propagation decoder. Simulation results show that the practical codes require no more than 0.46 extra bits at moderate rates and no more than 0.7 extra bits at low rates from the theoretical bounds.</description><subject>Decoding</subject><subject>Entropy</subject><subject>LDPC codes</subject><subject>Parity check codes</subject><subject>Quantization</subject><subject>Rate-distortion</subject><subject>Source coding</subject><subject>SR-TCQ</subject><subject>Successive refinement</subject><issn>1520-6149</issn><issn>2379-190X</issn><isbn>9781457705380</isbn><isbn>1457705389</isbn><isbn>1457705397</isbn><isbn>9781457705373</isbn><isbn>9781457705397</isbn><isbn>1457705370</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo1UMtqwzAQVF9QN_UX5KIfsLtrW5Z0LKGPQKCBtNBbWFkSVYntYBmK_74OTfeyzOwwzCxjS4QcEfTDevW4223zAhBzoau6BLxgd1gJKUGUWl6ypCilzlDD5xVLtVT_NwXXLEFRQFZjpW9ZGuM3zFMXUgqdsPV2oGYMDR1401sXue8HfuhjnGbcHgcXY-g7_vPlOh6DdTx0s6Kl8cS2NHHjOJnouvGe3Xg6RJee94J9PD-9r16zzdvLnH-TBZRizESNWiD4QpKxFlCZyqtTeGoqaowzJKG2cm6lPKEVJERDvtBa1EqXlS0XbPnnG5xz--MQWhqm_fkr5S9VdFJy</recordid><startdate>201105</startdate><enddate>201105</enddate><creator>Ramanan, Sivagnanasundaram</creator><creator>Walsh, John MacLaren</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201105</creationdate><title>Practical codes for lossy compression when side information may be absent</title><author>Ramanan, Sivagnanasundaram ; Walsh, John MacLaren</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-5619510f27abdd018b4f82379ac4acbeba706d75398fa1d5a55caf299568934d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Decoding</topic><topic>Entropy</topic><topic>LDPC codes</topic><topic>Parity check codes</topic><topic>Quantization</topic><topic>Rate-distortion</topic><topic>Source coding</topic><topic>SR-TCQ</topic><topic>Successive refinement</topic><toplevel>online_resources</toplevel><creatorcontrib>Ramanan, Sivagnanasundaram</creatorcontrib><creatorcontrib>Walsh, John MacLaren</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ramanan, Sivagnanasundaram</au><au>Walsh, John MacLaren</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Practical codes for lossy compression when side information may be absent</atitle><btitle>2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)</btitle><stitle>ICASSP</stitle><date>2011-05</date><risdate>2011</risdate><spage>3048</spage><epage>3051</epage><pages>3048-3051</pages><issn>1520-6149</issn><eissn>2379-190X</eissn><isbn>9781457705380</isbn><isbn>1457705389</isbn><eisbn>1457705397</eisbn><eisbn>9781457705373</eisbn><eisbn>9781457705397</eisbn><eisbn>1457705370</eisbn><abstract>Practical codes are developed for quadratic Gaussian lossy compression when side information may be absent by hybridizing successively refinable trellis coded quantization (SR-TCQ) and low-density parity-check (LDPC) codes. A 2-refinement level SR-TCQ is used to generate a common description for both decoders and an individual description for the decoder with side information. Then, the common description is losslessly compressed while the individual description is compressed using a LDPC code which exploits the side information in a belief propagation decoder. Simulation results show that the practical codes require no more than 0.46 extra bits at moderate rates and no more than 0.7 extra bits at low rates from the theoretical bounds.</abstract><pub>IEEE</pub><doi>10.1109/ICASSP.2011.5946301</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1520-6149 |
| ispartof | 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2011, p.3048-3051 |
| issn | 1520-6149 2379-190X |
| language | eng |
| recordid | cdi_ieee_primary_5946301 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Decoding Entropy LDPC codes Parity check codes Quantization Rate-distortion Source coding SR-TCQ Successive refinement |
| title | Practical codes for lossy compression when side information may be absent |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T05%3A30%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Practical%20codes%20for%20lossy%20compression%20when%20side%20information%20may%20be%20absent&rft.btitle=2011%20IEEE%20International%20Conference%20on%20Acoustics,%20Speech%20and%20Signal%20Processing%20(ICASSP)&rft.au=Ramanan,%20Sivagnanasundaram&rft.date=2011-05&rft.spage=3048&rft.epage=3051&rft.pages=3048-3051&rft.issn=1520-6149&rft.eissn=2379-190X&rft.isbn=9781457705380&rft.isbn_list=1457705389&rft_id=info:doi/10.1109/ICASSP.2011.5946301&rft_dat=%3Cieee_6IE%3E5946301%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457705397&rft.eisbn_list=9781457705373&rft.eisbn_list=9781457705397&rft.eisbn_list=1457705370&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5946301&rfr_iscdi=true |