{"id":"https://openalex.org/W4415367980","doi":"https://doi.org/10.1109/isit63088.2025.11195431","title":"Sequential Interval Passing for Compressed Sensing","display_name":"Sequential Interval Passing for Compressed Sensing","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367980","doi":"https://doi.org/10.1109/isit63088.2025.11195431"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105684528","display_name":"Salman Habib","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Salman Habib","raw_affiliation_strings":["School of Electrical, Computer and Energy Engineering, Arizona State University"],"affiliations":[{"raw_affiliation_string":"School of Electrical, Computer and Energy Engineering, Arizona State University","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101925384","display_name":"Taejoon Kim","orcid":"https://orcid.org/0000-0002-4017-9530"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Taejoon Kim","raw_affiliation_strings":["School of Electrical, Computer and Energy Engineering, Arizona State University"],"affiliations":[{"raw_affiliation_string":"School of Electrical, Computer and Energy Engineering, Arizona State University","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047776960","display_name":"R\u00e9mi A. Chou","orcid":"https://orcid.org/0000-0003-4431-3175"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R\u00e9mi A. Chou","raw_affiliation_strings":["University of Texas at Arlington,Department of Computer Science and Engineering"],"affiliations":[{"raw_affiliation_string":"University of Texas at Arlington,Department of Computer Science and Engineering","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5105684528"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40416327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11749","display_name":"Iterative Learning Control Systems","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11749","display_name":"Iterative Learning Control Systems","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11429","display_name":"Semiconductor Lasers and Optical Devices","score":0.9739000201225281,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/underdetermined-system","display_name":"Underdetermined system","score":0.7523999810218811},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.7240999937057495},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.722100019454956},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.5899999737739563},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5339999794960022},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42309999465942383},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.41990000009536743},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4074000120162964},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.3968999981880188},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.3804999887943268}],"concepts":[{"id":"https://openalex.org/C179690561","wikidata":"https://www.wikidata.org/wiki/Q4316110","display_name":"Underdetermined system","level":2,"score":0.7523999810218811},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.7240999937057495},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.722100019454956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.670799970626831},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.5899999737739563},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5339999794960022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5299000144004822},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42309999465942383},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.41990000009536743},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4074000120162964},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3968999981880188},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34630000591278076},{"id":"https://openalex.org/C70958404","wikidata":"https://www.wikidata.org/wiki/Q7512728","display_name":"Signal reconstruction","level":4,"score":0.33340001106262207},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.3057999908924103},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2939000129699707},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C86426650","wikidata":"https://www.wikidata.org/wiki/Q7452504","display_name":"Sequential estimation","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.2599000036716461},{"id":"https://openalex.org/C186594467","wikidata":"https://www.wikidata.org/wiki/Q1429176","display_name":"Flooding (psychology)","level":2,"score":0.25760000944137573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195431","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1604314845","https://openalex.org/W1986931325","https://openalex.org/W1991971747","https://openalex.org/W2006334021","https://openalex.org/W2011697680","https://openalex.org/W2040924759","https://openalex.org/W2133068391","https://openalex.org/W2142244720","https://openalex.org/W2164452299","https://openalex.org/W2610971674","https://openalex.org/W2892280452","https://openalex.org/W2963206527","https://openalex.org/W3005255970","https://openalex.org/W3097725224","https://openalex.org/W4250955649","https://openalex.org/W4384787527","https://openalex.org/W4386047748"],"related_works":[],"abstract_inverted_index":{"The":[0,47,139],"reconstruction":[1,34,178],"of":[2,9,24,82,106,166,180],"sparse":[3,32],"signals":[4],"from":[5],"a":[6,12,18,71,115,143,163],"limited":[7],"set":[8],"measurements":[10],"poses":[11],"significant":[13],"challenge":[14],"as":[15,38,120],"it":[16],"necessitates":[17],"solution":[19],"to":[20,58,64,122,150],"an":[21,53,107],"underdetermined":[22],"system":[23],"linear":[25,39],"equations.":[26],"Compressed":[27],"sensing":[28],"(CS)":[29],"deals":[30],"with":[31],"signal":[33,161],"using":[35],"techniques":[36],"such":[37],"programming":[40],"(LP)":[41],"and":[42,155,160,174],"iterative":[43],"message":[44,146],"passing":[45,49,127,147],"schemes.":[46],"interval":[48,126],"algorithm":[50],"(IPA)":[51],"is":[52,75,111,168,183],"attractive":[54],"CS":[55],"approach":[56,128],"due":[57],"its":[59],"low":[60],"complexity":[61,148,164],"when":[62],"compared":[63,149],"LP.":[65],"In":[66,94],"this":[67],"paper,":[68],"we":[69],"propose":[70],"sequential":[72,78,96,140,189],"IPA":[73,152,182],"that":[74,176],"inspired":[76],"by":[77,186],"belief":[79],"propagation":[80],"decoding":[81],"low-density-parity-check":[83],"(LDPC)":[84],"codes":[85],"used":[86],"for":[87,156],"forward":[88],"error":[89],"correction":[90],"in":[91,102,117,129],"channel":[92],"coding.":[93],"the":[95,103,123,177,181],"setting,":[97],"each":[98],"check":[99],"node":[100],"(CN)":[101],"Tanner":[104],"graph":[105],"LDPC":[108],"measurement":[109,158],"matrix":[110,159],"scheduled":[112,134],"one":[113],"at":[114,135],"time":[116],"every":[118],"iteration,":[119],"opposed":[121],"standard":[124],"\u201cflooding\u201d":[125],"which":[130],"all":[131],"CNs":[132],"are":[133],"once":[136],"per":[137],"iteration.":[138],"scheme":[141],"offers":[142],"significantly":[144],"lower":[145],"flooding":[151],"on":[153],"average,":[154],"some":[157],"sparsity,":[162],"reduction":[165],"36%":[167],"achieved.":[169],"We":[170],"show":[171],"both":[172],"analytically":[173],"numerically":[175],"accuracy":[179],"not":[184],"compromised":[185],"adopting":[187],"our":[188],"scheduling":[190],"approach.":[191]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}