MP&A Mixed Decoding Algorithm for LDPC Codes
Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We first make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its de...
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 | 244 |
|---|---|
| container_issue | |
| container_start_page | 239 |
| container_title | |
| container_volume | |
| creator | Ho, C.L. Hsu-Hung Yang |
| description | Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We first make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its decoding gain is the same as that of A* method. Moreover, decoding complexity is slightly greater than that of MP one. For codeword length 96 bits and coding rate 1/2 and BER = 10 -5 , the hybrid structure outperforms 1.4 dB decoding gain than the MP method. This improvement only required 1% received sequences to be transferred to A* decoding block. Our newly designed hybrid structure can solve both of the high decoding gain and low decoding complexity while it has the ability to yield the optimum solution. |
| doi_str_mv | 10.1109/CNSR.2007.43 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4215518</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4215518</ieee_id><sourcerecordid>4215518</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-ac3777e58258dd166eb721df8e475a7fb05cfaa7119f25589ba49b05c25acc8e3</originalsourceid><addsrcrecordid>eNotjLtOxDAQAC0hJNCRjo7GFRUJXjubtcsox0vKPcSjPjnx-jC6Iyi5Av4eEEwz0hQjxDmoAkC562b59FhopagozZHIHFlFlUNtDboTkU3Tm_rBOGPBnoqrxfqylov0yUHOuR9Cet_KercdxnR43cs4jLKdrxvZDIGnM3Ec_W7i7N8z8XJ789zc5-3q7qGp2zwB4SH3vSEiRqvRhgBVxR1pCNFySegpdgr76D0BuKgRret86X6jRt_3ls1MXPx9EzNvPsa09-PXptSACNZ8Ay6FPnk</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>MP&A Mixed Decoding Algorithm for LDPC Codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ho, C.L. ; Hsu-Hung Yang</creator><creatorcontrib>Ho, C.L. ; Hsu-Hung Yang</creatorcontrib><description>Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We first make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its decoding gain is the same as that of A* method. Moreover, decoding complexity is slightly greater than that of MP one. For codeword length 96 bits and coding rate 1/2 and BER = 10 -5 , the hybrid structure outperforms 1.4 dB decoding gain than the MP method. This improvement only required 1% received sequences to be transferred to A* decoding block. Our newly designed hybrid structure can solve both of the high decoding gain and low decoding complexity while it has the ability to yield the optimum solution.</description><identifier>ISBN: 9780769528359</identifier><identifier>ISBN: 076952835X</identifier><identifier>DOI: 10.1109/CNSR.2007.43</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bit error rate ; Decoding ; Parity check codes ; Radio access networks</subject><ispartof>Fifth Annual Conference on Communication Networks and Services Research (CNSR '07), 2007, p.239-244</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/4215518$$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/4215518$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ho, C.L.</creatorcontrib><creatorcontrib>Hsu-Hung Yang</creatorcontrib><title>MP&A Mixed Decoding Algorithm for LDPC Codes</title><title>Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)</title><addtitle>CNSR</addtitle><description>Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We first make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its decoding gain is the same as that of A* method. Moreover, decoding complexity is slightly greater than that of MP one. For codeword length 96 bits and coding rate 1/2 and BER = 10 -5 , the hybrid structure outperforms 1.4 dB decoding gain than the MP method. This improvement only required 1% received sequences to be transferred to A* decoding block. Our newly designed hybrid structure can solve both of the high decoding gain and low decoding complexity while it has the ability to yield the optimum solution.</description><subject>Bit error rate</subject><subject>Decoding</subject><subject>Parity check codes</subject><subject>Radio access networks</subject><isbn>9780769528359</isbn><isbn>076952835X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjLtOxDAQAC0hJNCRjo7GFRUJXjubtcsox0vKPcSjPjnx-jC6Iyi5Av4eEEwz0hQjxDmoAkC562b59FhopagozZHIHFlFlUNtDboTkU3Tm_rBOGPBnoqrxfqylov0yUHOuR9Cet_KercdxnR43cs4jLKdrxvZDIGnM3Ec_W7i7N8z8XJ789zc5-3q7qGp2zwB4SH3vSEiRqvRhgBVxR1pCNFySegpdgr76D0BuKgRret86X6jRt_3ls1MXPx9EzNvPsa09-PXptSACNZ8Ay6FPnk</recordid><startdate>200705</startdate><enddate>200705</enddate><creator>Ho, C.L.</creator><creator>Hsu-Hung Yang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200705</creationdate><title>MP&A Mixed Decoding Algorithm for LDPC Codes</title><author>Ho, C.L. ; Hsu-Hung Yang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-ac3777e58258dd166eb721df8e475a7fb05cfaa7119f25589ba49b05c25acc8e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Bit error rate</topic><topic>Decoding</topic><topic>Parity check codes</topic><topic>Radio access networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Ho, C.L.</creatorcontrib><creatorcontrib>Hsu-Hung Yang</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>Ho, C.L.</au><au>Hsu-Hung Yang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>MP&A Mixed Decoding Algorithm for LDPC Codes</atitle><btitle>Fifth Annual Conference on Communication Networks and Services Research (CNSR '07)</btitle><stitle>CNSR</stitle><date>2007-05</date><risdate>2007</risdate><spage>239</spage><epage>244</epage><pages>239-244</pages><isbn>9780769528359</isbn><isbn>076952835X</isbn><abstract>Because the message passing (MP) method is suboptimum and optimum solutions are not guaranteed, we present a hybrid decoding method by combing the MP and the A* methods. We first make comparison between the MP and A* method and then show their combined performance. Using the hybrid structure, its decoding gain is the same as that of A* method. Moreover, decoding complexity is slightly greater than that of MP one. For codeword length 96 bits and coding rate 1/2 and BER = 10 -5 , the hybrid structure outperforms 1.4 dB decoding gain than the MP method. This improvement only required 1% received sequences to be transferred to A* decoding block. Our newly designed hybrid structure can solve both of the high decoding gain and low decoding complexity while it has the ability to yield the optimum solution.</abstract><pub>IEEE</pub><doi>10.1109/CNSR.2007.43</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 9780769528359 |
| ispartof | Fifth Annual Conference on Communication Networks and Services Research (CNSR '07), 2007, p.239-244 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_4215518 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Bit error rate Decoding Parity check codes Radio access networks |
| title | MP&A Mixed Decoding Algorithm for LDPC Codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T00%3A46%3A34IST&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=MP&A%20Mixed%20Decoding%20Algorithm%20for%20LDPC%20Codes&rft.btitle=Fifth%20Annual%20Conference%20on%20Communication%20Networks%20and%20Services%20Research%20(CNSR%20'07)&rft.au=Ho,%20C.L.&rft.date=2007-05&rft.spage=239&rft.epage=244&rft.pages=239-244&rft.isbn=9780769528359&rft.isbn_list=076952835X&rft_id=info:doi/10.1109/CNSR.2007.43&rft_dat=%3Cieee_6IE%3E4215518%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4215518&rfr_iscdi=true |