A Two-Stage Maximum a Posterior Probability Method for Blind Identification of LDPC Codes
Blind identification of encoders has received increasing attention in recent years. In this letter, we focus on LDPC coded communication systems and study the problem of blind identification over a candidate set. We propose a blind identification method based on a two-stage maximum a posteriori prob...
Gespeichert in:
| Veröffentlicht in: | IEEE signal processing letters 2021, Vol.28, p.111-115 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 115 |
|---|---|
| container_issue | |
| container_start_page | 111 |
| container_title | IEEE signal processing letters |
| container_volume | 28 |
| creator | Li, Longqing Huang, Zhiping Zhou, Jing |
| description | Blind identification of encoders has received increasing attention in recent years. In this letter, we focus on LDPC coded communication systems and study the problem of blind identification over a candidate set. We propose a blind identification method based on a two-stage maximum a posteriori probability estimation. The first stage measures the parity-check relationship between the received vectors and the rows of the parity-check matrices in the candidate set, and the second stage deals with the effect of row weights. Moreover, We theoretically explained the mechanism by which row weight affects identification results and proved that the proposed method can considerably suppress the preference of the existing methods for low row weights. Simulation results show that the proposed method always has a higher probability of correct identification for parity-check matrices with high row weights in the candidate set than the existing methods. |
| doi_str_mv | 10.1109/LSP.2020.3047334 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_9306780</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9306780</ieee_id><sourcerecordid>2479892780</sourcerecordid><originalsourceid>FETCH-LOGICAL-c291t-2abb0f3c74afdb6b314bc1fbc6dbab89e494165b988dab8896b445afad4e64a53</originalsourceid><addsrcrecordid>eNo9kMtLwzAcx4MoOKd3wUvAc2fSpG1ynPU16LCwefBUkibRjK3RJEP335ux4en34PuADwDXGE0wRvyuWbSTHOVoQhCtCKEnYISLgmU5KfFp2lGFMs4ROwcXIawQQgyzYgTep3D547JFFB8azsWv3Ww3UMDWhai9dR623kkh7drGHZzr-OkUNOl9v7aDgjOlh2iN7UW0boDOwOahrWHtlA6X4MyIddBXxzkGb0-Py_ola16fZ_W0yfqc45jlQkpkSF9RYZQsJcFU9tjIvlSpl3FNOcVlITljKt2Ml5LSQhihqC6pKMgY3B5yv7z73uoQu5Xb-iFVdjmtOON5xVBSoYOq9y4Er0335e1G-F2HUbcH2CWA3R5gdwSYLDcHi9Va_8s5QeU-8A8nrGwj</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2479892780</pqid></control><display><type>article</type><title>A Two-Stage Maximum a Posterior Probability Method for Blind Identification of LDPC Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Li, Longqing ; Huang, Zhiping ; Zhou, Jing</creator><creatorcontrib>Li, Longqing ; Huang, Zhiping ; Zhou, Jing</creatorcontrib><description>Blind identification of encoders has received increasing attention in recent years. In this letter, we focus on LDPC coded communication systems and study the problem of blind identification over a candidate set. We propose a blind identification method based on a two-stage maximum a posteriori probability estimation. The first stage measures the parity-check relationship between the received vectors and the rows of the parity-check matrices in the candidate set, and the second stage deals with the effect of row weights. Moreover, We theoretically explained the mechanism by which row weight affects identification results and proved that the proposed method can considerably suppress the preference of the existing methods for low row weights. Simulation results show that the proposed method always has a higher probability of correct identification for parity-check matrices with high row weights in the candidate set than the existing methods.</description><identifier>ISSN: 1070-9908</identifier><identifier>EISSN: 1558-2361</identifier><identifier>DOI: 10.1109/LSP.2020.3047334</identifier><identifier>CODEN: ISPLEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>a posterior probability ; Binary phase shift keying ; Blind identification of encoders ; Coders ; Communications systems ; Conditional probability ; Gaussian distribution ; Identification ; Identification methods ; LDPC codes ; Mathematical analysis ; Matrix methods ; Maximum a posteriori estimation ; Parity ; Parity check codes ; Probability distribution ; Signal to noise ratio ; Transmitters</subject><ispartof>IEEE signal processing letters, 2021, Vol.28, p.111-115</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c291t-2abb0f3c74afdb6b314bc1fbc6dbab89e494165b988dab8896b445afad4e64a53</citedby><cites>FETCH-LOGICAL-c291t-2abb0f3c74afdb6b314bc1fbc6dbab89e494165b988dab8896b445afad4e64a53</cites><orcidid>0000-0003-0806-7587 ; 0000-0001-5492-2666 ; 0000-0001-8539-0199</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9306780$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,4009,27902,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9306780$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Li, Longqing</creatorcontrib><creatorcontrib>Huang, Zhiping</creatorcontrib><creatorcontrib>Zhou, Jing</creatorcontrib><title>A Two-Stage Maximum a Posterior Probability Method for Blind Identification of LDPC Codes</title><title>IEEE signal processing letters</title><addtitle>LSP</addtitle><description>Blind identification of encoders has received increasing attention in recent years. In this letter, we focus on LDPC coded communication systems and study the problem of blind identification over a candidate set. We propose a blind identification method based on a two-stage maximum a posteriori probability estimation. The first stage measures the parity-check relationship between the received vectors and the rows of the parity-check matrices in the candidate set, and the second stage deals with the effect of row weights. Moreover, We theoretically explained the mechanism by which row weight affects identification results and proved that the proposed method can considerably suppress the preference of the existing methods for low row weights. Simulation results show that the proposed method always has a higher probability of correct identification for parity-check matrices with high row weights in the candidate set than the existing methods.</description><subject>a posterior probability</subject><subject>Binary phase shift keying</subject><subject>Blind identification of encoders</subject><subject>Coders</subject><subject>Communications systems</subject><subject>Conditional probability</subject><subject>Gaussian distribution</subject><subject>Identification</subject><subject>Identification methods</subject><subject>LDPC codes</subject><subject>Mathematical analysis</subject><subject>Matrix methods</subject><subject>Maximum a posteriori estimation</subject><subject>Parity</subject><subject>Parity check codes</subject><subject>Probability distribution</subject><subject>Signal to noise ratio</subject><subject>Transmitters</subject><issn>1070-9908</issn><issn>1558-2361</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMtLwzAcx4MoOKd3wUvAc2fSpG1ynPU16LCwefBUkibRjK3RJEP335ux4en34PuADwDXGE0wRvyuWbSTHOVoQhCtCKEnYISLgmU5KfFp2lGFMs4ROwcXIawQQgyzYgTep3D547JFFB8azsWv3Ww3UMDWhai9dR623kkh7drGHZzr-OkUNOl9v7aDgjOlh2iN7UW0boDOwOahrWHtlA6X4MyIddBXxzkGb0-Py_ola16fZ_W0yfqc45jlQkpkSF9RYZQsJcFU9tjIvlSpl3FNOcVlITljKt2Ml5LSQhihqC6pKMgY3B5yv7z73uoQu5Xb-iFVdjmtOON5xVBSoYOq9y4Er0335e1G-F2HUbcH2CWA3R5gdwSYLDcHi9Va_8s5QeU-8A8nrGwj</recordid><startdate>2021</startdate><enddate>2021</enddate><creator>Li, Longqing</creator><creator>Huang, Zhiping</creator><creator>Zhou, Jing</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0003-0806-7587</orcidid><orcidid>https://orcid.org/0000-0001-5492-2666</orcidid><orcidid>https://orcid.org/0000-0001-8539-0199</orcidid></search><sort><creationdate>2021</creationdate><title>A Two-Stage Maximum a Posterior Probability Method for Blind Identification of LDPC Codes</title><author>Li, Longqing ; Huang, Zhiping ; Zhou, Jing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c291t-2abb0f3c74afdb6b314bc1fbc6dbab89e494165b988dab8896b445afad4e64a53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>a posterior probability</topic><topic>Binary phase shift keying</topic><topic>Blind identification of encoders</topic><topic>Coders</topic><topic>Communications systems</topic><topic>Conditional probability</topic><topic>Gaussian distribution</topic><topic>Identification</topic><topic>Identification methods</topic><topic>LDPC codes</topic><topic>Mathematical analysis</topic><topic>Matrix methods</topic><topic>Maximum a posteriori estimation</topic><topic>Parity</topic><topic>Parity check codes</topic><topic>Probability distribution</topic><topic>Signal to noise ratio</topic><topic>Transmitters</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Longqing</creatorcontrib><creatorcontrib>Huang, Zhiping</creatorcontrib><creatorcontrib>Zhou, Jing</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE signal processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Li, Longqing</au><au>Huang, Zhiping</au><au>Zhou, Jing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Two-Stage Maximum a Posterior Probability Method for Blind Identification of LDPC Codes</atitle><jtitle>IEEE signal processing letters</jtitle><stitle>LSP</stitle><date>2021</date><risdate>2021</risdate><volume>28</volume><spage>111</spage><epage>115</epage><pages>111-115</pages><issn>1070-9908</issn><eissn>1558-2361</eissn><coden>ISPLEM</coden><abstract>Blind identification of encoders has received increasing attention in recent years. In this letter, we focus on LDPC coded communication systems and study the problem of blind identification over a candidate set. We propose a blind identification method based on a two-stage maximum a posteriori probability estimation. The first stage measures the parity-check relationship between the received vectors and the rows of the parity-check matrices in the candidate set, and the second stage deals with the effect of row weights. Moreover, We theoretically explained the mechanism by which row weight affects identification results and proved that the proposed method can considerably suppress the preference of the existing methods for low row weights. Simulation results show that the proposed method always has a higher probability of correct identification for parity-check matrices with high row weights in the candidate set than the existing methods.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LSP.2020.3047334</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0003-0806-7587</orcidid><orcidid>https://orcid.org/0000-0001-5492-2666</orcidid><orcidid>https://orcid.org/0000-0001-8539-0199</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1070-9908 |
| ispartof | IEEE signal processing letters, 2021, Vol.28, p.111-115 |
| issn | 1070-9908 1558-2361 |
| language | eng |
| recordid | cdi_ieee_primary_9306780 |
| source | IEEE Electronic Library (IEL) |
| subjects | a posterior probability Binary phase shift keying Blind identification of encoders Coders Communications systems Conditional probability Gaussian distribution Identification Identification methods LDPC codes Mathematical analysis Matrix methods Maximum a posteriori estimation Parity Parity check codes Probability distribution Signal to noise ratio Transmitters |
| title | A Two-Stage Maximum a Posterior Probability Method for Blind Identification of 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-25T14%3A26%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Two-Stage%20Maximum%20a%20Posterior%20Probability%20Method%20for%20Blind%20Identification%20of%20LDPC%20Codes&rft.jtitle=IEEE%20signal%20processing%20letters&rft.au=Li,%20Longqing&rft.date=2021&rft.volume=28&rft.spage=111&rft.epage=115&rft.pages=111-115&rft.issn=1070-9908&rft.eissn=1558-2361&rft.coden=ISPLEM&rft_id=info:doi/10.1109/LSP.2020.3047334&rft_dat=%3Cproquest_RIE%3E2479892780%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2479892780&rft_id=info:pmid/&rft_ieee_id=9306780&rfr_iscdi=true |