Fast Min-Sum Algorithms for Decoding of LDPC over GF(q)
In this paper, we present a fast min-sum algorithm for decoding LDPC codes over GF(q). Our algorithm is different from the one presented by David Declercq and Marc Fossorier (2005) only at the way of speeding up the horizontal scan in the min-sum algorithm. The Declercq and Fossorier's algorith...
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 | 99 |
|---|---|
| container_issue | |
| container_start_page | 96 |
| container_title | |
| container_volume | |
| creator | Xiaofei Huang Suquan Ding Zhixing Yang Youshou Wu |
| description | In this paper, we present a fast min-sum algorithm for decoding LDPC codes over GF(q). Our algorithm is different from the one presented by David Declercq and Marc Fossorier (2005) only at the way of speeding up the horizontal scan in the min-sum algorithm. The Declercq and Fossorier's algorithm speeds up the computation by reducing the number of configurations, while our algorithm uses the dynamic programming instead. Compared with the configuration reduction algorithm, the dynamic programming one is simpler at the design stage because it has less parameters to tune. Furthermore, it does not have the performance degradation problem caused by the configuration reduction because it searches the whole configuration space efficiently through dynamic programming. Both algorithms have the same level of complexity and use simple operations which are suitable for hardware implementations |
| doi_str_mv | 10.1109/ITW2.2006.323764 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4119262</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4119262</ieee_id><sourcerecordid>4119262</sourcerecordid><originalsourceid>FETCH-LOGICAL-i147t-99c22ebdbf3c4276ae4ac3cf4c238fa4e155216a3eb3f65f0fd602bd86b3f4163</originalsourceid><addsrcrecordid>eNpVjEFLwzAYhiMiKLN3wUuOemjN931p0hxHZ-egouDE40jTZEbWVdsp-O8t6MXn8vK8h4exCxAZgDA3q_ULZiiEyghJK3nEEqMLkCjldBZ0_M-1OmXJOL6JCTI5FOaM6cqOB34f9-nTZ8fnu20_xMNrN_LQD3zhXd_G_Zb3gdeLx5L3X37gy-rq4_qcnQS7G33ytzP2XN2uy7u0fliuynmdRpD6kBrjEH3TNoGcRK2sl9aRC9IhFcFKD3mOoCz5hoLKgwitEti0hZpcgqIZu_ztRu_95n2InR2-NxLAoEL6ARG8Re4</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fast Min-Sum Algorithms for Decoding of LDPC over GF(q)</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Xiaofei Huang ; Suquan Ding ; Zhixing Yang ; Youshou Wu</creator><creatorcontrib>Xiaofei Huang ; Suquan Ding ; Zhixing Yang ; Youshou Wu</creatorcontrib><description>In this paper, we present a fast min-sum algorithm for decoding LDPC codes over GF(q). Our algorithm is different from the one presented by David Declercq and Marc Fossorier (2005) only at the way of speeding up the horizontal scan in the min-sum algorithm. The Declercq and Fossorier's algorithm speeds up the computation by reducing the number of configurations, while our algorithm uses the dynamic programming instead. Compared with the configuration reduction algorithm, the dynamic programming one is simpler at the design stage because it has less parameters to tune. Furthermore, it does not have the performance degradation problem caused by the configuration reduction because it searches the whole configuration space efficiently through dynamic programming. Both algorithms have the same level of complexity and use simple operations which are suitable for hardware implementations</description><identifier>ISBN: 9781424400676</identifier><identifier>ISBN: 1424400678</identifier><identifier>EISBN: 9781424400683</identifier><identifier>EISBN: 1424400686</identifier><identifier>DOI: 10.1109/ITW2.2006.323764</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Decoding ; Degradation ; Digital video broadcasting ; Dynamic programming ; Galois fields ; Heuristic algorithms ; Parity check codes ; Satellite broadcasting ; Space technology</subject><ispartof>2006 IEEE Information Theory Workshop - ITW '06 Chengdu, 2006, p.96-99</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4119262$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4119262$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xiaofei Huang</creatorcontrib><creatorcontrib>Suquan Ding</creatorcontrib><creatorcontrib>Zhixing Yang</creatorcontrib><creatorcontrib>Youshou Wu</creatorcontrib><title>Fast Min-Sum Algorithms for Decoding of LDPC over GF(q)</title><title>2006 IEEE Information Theory Workshop - ITW '06 Chengdu</title><addtitle>ITW2</addtitle><description>In this paper, we present a fast min-sum algorithm for decoding LDPC codes over GF(q). Our algorithm is different from the one presented by David Declercq and Marc Fossorier (2005) only at the way of speeding up the horizontal scan in the min-sum algorithm. The Declercq and Fossorier's algorithm speeds up the computation by reducing the number of configurations, while our algorithm uses the dynamic programming instead. Compared with the configuration reduction algorithm, the dynamic programming one is simpler at the design stage because it has less parameters to tune. Furthermore, it does not have the performance degradation problem caused by the configuration reduction because it searches the whole configuration space efficiently through dynamic programming. Both algorithms have the same level of complexity and use simple operations which are suitable for hardware implementations</description><subject>Algorithm design and analysis</subject><subject>Decoding</subject><subject>Degradation</subject><subject>Digital video broadcasting</subject><subject>Dynamic programming</subject><subject>Galois fields</subject><subject>Heuristic algorithms</subject><subject>Parity check codes</subject><subject>Satellite broadcasting</subject><subject>Space technology</subject><isbn>9781424400676</isbn><isbn>1424400678</isbn><isbn>9781424400683</isbn><isbn>1424400686</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVjEFLwzAYhiMiKLN3wUuOemjN931p0hxHZ-egouDE40jTZEbWVdsp-O8t6MXn8vK8h4exCxAZgDA3q_ULZiiEyghJK3nEEqMLkCjldBZ0_M-1OmXJOL6JCTI5FOaM6cqOB34f9-nTZ8fnu20_xMNrN_LQD3zhXd_G_Zb3gdeLx5L3X37gy-rq4_qcnQS7G33ytzP2XN2uy7u0fliuynmdRpD6kBrjEH3TNoGcRK2sl9aRC9IhFcFKD3mOoCz5hoLKgwitEti0hZpcgqIZu_ztRu_95n2InR2-NxLAoEL6ARG8Re4</recordid><startdate>200610</startdate><enddate>200610</enddate><creator>Xiaofei Huang</creator><creator>Suquan Ding</creator><creator>Zhixing Yang</creator><creator>Youshou Wu</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200610</creationdate><title>Fast Min-Sum Algorithms for Decoding of LDPC over GF(q)</title><author>Xiaofei Huang ; Suquan Ding ; Zhixing Yang ; Youshou Wu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i147t-99c22ebdbf3c4276ae4ac3cf4c238fa4e155216a3eb3f65f0fd602bd86b3f4163</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithm design and analysis</topic><topic>Decoding</topic><topic>Degradation</topic><topic>Digital video broadcasting</topic><topic>Dynamic programming</topic><topic>Galois fields</topic><topic>Heuristic algorithms</topic><topic>Parity check codes</topic><topic>Satellite broadcasting</topic><topic>Space technology</topic><toplevel>online_resources</toplevel><creatorcontrib>Xiaofei Huang</creatorcontrib><creatorcontrib>Suquan Ding</creatorcontrib><creatorcontrib>Zhixing Yang</creatorcontrib><creatorcontrib>Youshou Wu</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xiaofei Huang</au><au>Suquan Ding</au><au>Zhixing Yang</au><au>Youshou Wu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fast Min-Sum Algorithms for Decoding of LDPC over GF(q)</atitle><btitle>2006 IEEE Information Theory Workshop - ITW '06 Chengdu</btitle><stitle>ITW2</stitle><date>2006-10</date><risdate>2006</risdate><spage>96</spage><epage>99</epage><pages>96-99</pages><isbn>9781424400676</isbn><isbn>1424400678</isbn><eisbn>9781424400683</eisbn><eisbn>1424400686</eisbn><abstract>In this paper, we present a fast min-sum algorithm for decoding LDPC codes over GF(q). Our algorithm is different from the one presented by David Declercq and Marc Fossorier (2005) only at the way of speeding up the horizontal scan in the min-sum algorithm. The Declercq and Fossorier's algorithm speeds up the computation by reducing the number of configurations, while our algorithm uses the dynamic programming instead. Compared with the configuration reduction algorithm, the dynamic programming one is simpler at the design stage because it has less parameters to tune. Furthermore, it does not have the performance degradation problem caused by the configuration reduction because it searches the whole configuration space efficiently through dynamic programming. Both algorithms have the same level of complexity and use simple operations which are suitable for hardware implementations</abstract><pub>IEEE</pub><doi>10.1109/ITW2.2006.323764</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9781424400676 |
| ispartof | 2006 IEEE Information Theory Workshop - ITW '06 Chengdu, 2006, p.96-99 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_4119262 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Algorithm design and analysis Decoding Degradation Digital video broadcasting Dynamic programming Galois fields Heuristic algorithms Parity check codes Satellite broadcasting Space technology |
| title | Fast Min-Sum Algorithms for Decoding of LDPC over GF(q) |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T10%3A41%3A28IST&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=Fast%20Min-Sum%20Algorithms%20for%20Decoding%20of%20LDPC%20over%20GF(q)&rft.btitle=2006%20IEEE%20Information%20Theory%20Workshop%20-%20ITW%20'06%20Chengdu&rft.au=Xiaofei%20Huang&rft.date=2006-10&rft.spage=96&rft.epage=99&rft.pages=96-99&rft.isbn=9781424400676&rft.isbn_list=1424400678&rft_id=info:doi/10.1109/ITW2.2006.323764&rft_dat=%3Cieee_6IE%3E4119262%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424400683&rft.eisbn_list=1424400686&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4119262&rfr_iscdi=true |