An Efficient Algorithm to Improve the Success Threshold of Node-Based Verification-Based Algorithms in Compressed Sensing

In this letter, we introduce an algorithm to enhance the success threshold of node-based verification-based (NB-VB) algorithms in compressed sensing. The NB-VB algorithms have low computational complexity, and are generally classified as iterative message passing algorithms employed for signal recov...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE communications letters Ročník 20; číslo 8; s. 1487 - 1490
Hlavní autori: Khosravi, Sara, Asvadi, Reza, Ahmadian-Attari, Mahmoud
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York IEEE 01.08.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithm design and analysis
Algorithms
Channels
Complexity
Complexity theory
Compressed sensing (CS)
Decoding
Detection
Iterative decoding
Iterative methods
low-density parity-check (LDPC) code
node-based verification-based (NB-VB) algorithms
Sensors
Signal processing algorithms
stopping set
success threshold
Thresholds
ISSN:1089-7798, 1558-2558
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this letter, we introduce an algorithm to enhance the success threshold of node-based verification-based (NB-VB) algorithms in compressed sensing. The NB-VB algorithms have low computational complexity, and are generally classified as iterative message passing algorithms employed for signal recovery. However, similar to the standard iterative decoding of low-density parity-check codes over the binary erasure channel (BEC) in the context of channel coding, these algorithms become inefficient in the stopping sets. The proposed method, with the inspiration of improved decoding algorithms over the BEC, enhances the performance of NB-VB algorithms by guessing values of some unverified signal elements. Our simulation results indicate that although the proposed method improves the success threshold significantly, it does not cause any considerable increase in the complexity of standard NB-VB algorithms.
AbstractList In this letter, we introduce an algorithm to enhance the success threshold of node-based verification-based (NB-VB) algorithms in compressed sensing. The NB-VB algorithms have low computational complexity, and are generally classified as iterative message passing algorithms employed for signal recovery. However, similar to the standard iterative decoding of low-density parity-check codes over the binary erasure channel (BEC) in the context of channel coding, these algorithms become inefficient in the stopping sets. The proposed method, with the inspiration of improved decoding algorithms over the BEC, enhances the performance of NB-VB algorithms by guessing values of some unverified signal elements. Our simulation results indicate that although the proposed method improves the success threshold significantly, it does not cause any considerable increase in the complexity of standard NB-VB algorithms.
Author Asvadi, Reza
Khosravi, Sara
Ahmadian-Attari, Mahmoud
Author_xml – sequence: 1
  givenname: Sara
  surname: Khosravi
  fullname: Khosravi, Sara
  email: sara.khosravi@ee.kntu.ac.ir
  organization: Dept. of Electr. Eng., K.N. Toosi Univ. of Technol., Tehran, Iran
– sequence: 2
  givenname: Reza
  surname: Asvadi
  fullname: Asvadi, Reza
  email: rasvadi@uma.ac.ir
  organization: Dept. of Electr. Eng., Univ. of Mohaghegh Ardabili, Ardabil, Iran
– sequence: 3
  givenname: Mahmoud
  surname: Ahmadian-Attari
  fullname: Ahmadian-Attari, Mahmoud
  email: mahmoud@eetd.kntu.ac.ir
  organization: Dept. of Electr. Eng., K.N. Toosi Univ. of Technol., Tehran, Iran
BookMark eNp9kctOAyEYhYnRxOsL6IbEjZupwMDALGtTL0nVhZfthDI_FjMFBWri24u2ceHCDRA45wPO2UfbPnhA6JiSEaWkPZ9N7m9vR4zQZsRE0wrZbqE9KoSqWBm2y5qotpKyVbtoP6VXQohigu6hz7HHU2udceAzHg8vIbq8WOIc8M3yLYYPwHkB-GFlDKSEHxcR0iIMPQ4W34UeqgudoMfPEF2B6OyC32z9shJ2Hk9CoRVCOXgAn5x_OUQ7Vg8JjjbzAXq6nD5OrqvZ_dXNZDyrTM1UrpRtlFXSSs7mAmrbg-aNabme10ZRpgXn85ZIqaWmAvraai25tiWElhpOeH2Aztbc8pv3FaTcLV0yMAzaQ1iljqpaNJJwWRfp6R_pa1hFX15XVCVmykqwRcXWKhNDShFs9xbdUsfPjpLuu43up43uu41u00YxqT8m4_JPXDlqN_xvPVlbHQD83iW5JELw-gsJzJqn
CODEN ICLEF6
CitedBy_id crossref_primary_10_3233_JIFS_179294
Cites_doi 10.1109/TIT.2002.1003839
10.1109/TIT.2012.2201344
10.1109/TIT.2012.2206368
10.1109/TIT.2011.2165813
10.1109/TIT.2005.862083
10.1109/ITW.2007.4313110
10.1109/ISIT.2012.6281807
10.1109/TIT.2009.2025573
10.1109/TIT.2006.871582
10.1109/TIT.2004.824918
10.1109/TIT.2008.2006466
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
F28
FR3
DOI 10.1109/LCOMM.2016.2569579
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database

Engineering Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2558
EndPage 1490
ExternalDocumentID 4145195231
10_1109_LCOMM_2016_2569579
7470554
Genre orig-research
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
AZLTO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
HZ~
H~9
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
RNS
TN5
VH1
AAYXX
CITATION
7SP
8FD
L7M
RIG
F28
FR3
ID FETCH-LOGICAL-c328t-8f68f87f742b5e3fdea46c94ab3c812a544b9077a7a15ed3faa74af56991c4043
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000384642900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1089-7798
IngestDate Thu Oct 02 10:25:26 EDT 2025
Mon Jun 30 10:12:11 EDT 2025
Sat Nov 29 06:26:37 EST 2025
Tue Nov 18 20:45:57 EST 2025
Wed Aug 27 02:48:12 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 8
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c328t-8f68f87f742b5e3fdea46c94ab3c812a544b9077a7a15ed3faa74af56991c4043
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
PQID 1810912579
PQPubID 85419
PageCount 4
ParticipantIDs proquest_miscellaneous_1835670473
crossref_citationtrail_10_1109_LCOMM_2016_2569579
proquest_journals_1810912579
crossref_primary_10_1109_LCOMM_2016_2569579
ieee_primary_7470554
PublicationCentury 2000
PublicationDate 2016-Aug.
2016-8-00
20160801
PublicationDateYYYYMMDD 2016-08-01
PublicationDate_xml – month: 08
  year: 2016
  text: 2016-Aug.
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE communications letters
PublicationTitleAbbrev COML
PublicationYear 2016
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref10
farhangdoust (ref12) 2015
ref2
ref1
sarvotham (ref11) 2006
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref10
  doi: 10.1109/TIT.2002.1003839
– ident: ref4
  doi: 10.1109/TIT.2012.2201344
– year: 2015
  ident: ref12
  article-title: Finite length analysis of verification-based message passing algorithms in compressed sensing
– ident: ref3
  doi: 10.1109/TIT.2012.2206368
– ident: ref5
  doi: 10.1109/TIT.2011.2165813
– ident: ref2
  doi: 10.1109/TIT.2005.862083
– start-page: 2804
  year: 2006
  ident: ref11
  article-title: Sudocodes-Fast measurement and reconstruction of sparse signals
  publication-title: Proc IEEE Int Symp Inf Theory (ISIT)
– ident: ref9
  doi: 10.1109/ITW.2007.4313110
– ident: ref6
  doi: 10.1109/ISIT.2012.6281807
– ident: ref13
  doi: 10.1109/TIT.2009.2025573
– ident: ref1
  doi: 10.1109/TIT.2006.871582
– ident: ref7
  doi: 10.1109/TIT.2004.824918
– ident: ref8
  doi: 10.1109/TIT.2008.2006466
SSID ssj0008251
Score 2.1651728
Snippet In this letter, we introduce an algorithm to enhance the success threshold of node-based verification-based (NB-VB) algorithms in compressed sensing. The NB-VB...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1487
SubjectTerms Algorithm design and analysis
Algorithms
Channels
Complexity
Complexity theory
Compressed sensing (CS)
Decoding
Detection
Iterative decoding
Iterative methods
low-density parity-check (LDPC) code
node-based verification-based (NB-VB) algorithms
Sensors
Signal processing algorithms
stopping set
success threshold
Thresholds
Title An Efficient Algorithm to Improve the Success Threshold of Node-Based Verification-Based Algorithms in Compressed Sensing
URI https://ieeexplore.ieee.org/document/7470554
https://www.proquest.com/docview/1810912579
https://www.proquest.com/docview/1835670473
Volume 20
WOSCitedRecordID wos000384642900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2558
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008251
  issn: 1089-7798
  databaseCode: RIE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4B6qEcgBZQF2jlStzagPOyneOCQD2ULRIUcYsce0xXggTtZiv13zN2slErEFJvUWJPLH-2Z8bzAjjEDFOHcRI5E2deQUmiSlWC1jIXRc5tanMTik3IyUTd3haXK_B1iIVBxOB8hkf-MdjybWMW_qrsmERfTuxvFValFF2s1nDq-hDMzpm-IImxUMsAGV4cfz_9cXHhvbjEETF4b5f6hwmFqirPjuLAX843_29kW7DRy5Fs3AH_Dlawfg_rf2UX3IY_45qdhQwR1JeN7--a2bT99cDahnVXCchI-mNXi1AzkV0TqnNvjGKNY5PGYnRCHM6yGyLn-pu9_tVAa86mNfNHSkhBbtmVd4ev73bg5_nZ9em3qK-0EJk0UW2knFBOSUd6cpUTeBZ1JkyR6So1JAHoPMsq0qKlljrO0aZOa5lpR5NZxMbn59mFtbqp8QOwxAphiBpPNClfiJXgWiaJMsI4bowaQbyc-tL0ach9NYz7MqgjvCgDXKWHq-zhGsGXoc9jl4Tj1dbbHqChZY_NCA6WCJf9Pp2XJN-QwJSEXp-Hz7TDvNlE19gsfJs0F5JnMt17mfI-vPX_79wCD2CtnS3wI7wxv9vpfPYpLNMnwL7lqQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwED-NgcR44GtMKwwwEm-QzXESx3nspk1DtAVpBe0tcuzzqLQlqE2R-O85O2k0BELiLXLsk-Wf7bvzfQG8xRQTh7GInIlTr6CIqFKVpL3MZZFxm9jMhGIT-WymLi-Lz1vwfoiFQcTgfIaH_jPY8m1j1v6p7IhEX07s7w7czdJU8C5aa7h3fRBm505fkMxYqE2IDC-OJiefplPvxyUPicV7y9RvbCjUVfnjMg4c5uzR_83tMTzsJUk27qB_AltYP4UHt_IL7sLPcc1OQ44IGsvG11fNctF-u2Ftw7rHBGQk_7GLdaiayOaE68qbo1jj2KyxGB0Tj7PsK5Fz_dte3zTQWrFFzfylEpKQW3bhHeLrq2fw5ex0fnIe9bUWIpMI1UbKSeVU7khTrjKCz6JOpSlSXSWGZABNC16RHp3rXMcZ2sRpnafa0WIWsfEZevZgu25q3AcmrJSGqHGhSf1CrCTXuRDKSOO4MWoE8WbpS9MnIvf1MK7LoJDwogxwlR6usodrBO-GMd-7NBz_7L3rARp69tiM4GCDcNmf1FVJEg6JTCKMejP8pjPmDSe6xmbt-ySZzHmaJ8__Tvk13D-fTyfl5MPs4wvY8XPpnAQPYLtdrvEl3DM_2sVq-Sps2V_Vm-jw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Efficient+Algorithm+to+Improve+the+Success+Threshold+of+Node-Based+Verification-Based+Algorithms+in+Compressed+Sensing&rft.jtitle=IEEE+communications+letters&rft.au=Khosravi%2C+Sara&rft.au=Asvadi%2C+Reza&rft.au=Ahmadian-Attari%2C+Mahmoud&rft.date=2016-08-01&rft.issn=1089-7798&rft.volume=20&rft.issue=8&rft.spage=1487&rft.epage=1490&rft_id=info:doi/10.1109%2FLCOMM.2016.2569579&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_LCOMM_2016_2569579
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-7798&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-7798&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-7798&client=summon