{"id":"https://openalex.org/W2655082533","doi":"https://doi.org/10.1109/icassp.2017.7952751","title":"Heuristic methods for designing unimodular code sequences with performance guarantees","display_name":"Heuristic methods for designing unimodular code sequences with performance guarantees","publication_year":2017,"publication_date":"2017-03-01","ids":{"openalex":"https://openalex.org/W2655082533","doi":"https://doi.org/10.1109/icassp.2017.7952751","mag":"2655082533"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2017.7952751","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2017.7952751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5052915033","display_name":"Shankarachary Ragi","orcid":"https://orcid.org/0000-0002-5511-4334"},"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":"Shankarachary Ragi","raw_affiliation_strings":["School of Mathematical and Statistical Sciences, Arizona State University, Tempe, 85287-1804, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical and Statistical Sciences, Arizona State University, Tempe, 85287-1804, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070385137","display_name":"Edwin K. P. Chong","orcid":"https://orcid.org/0000-0002-7622-4815"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edwin K. P. Chong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, 80523-1373, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, 80523-1373, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048520206","display_name":"Hans D. Mittelmann","orcid":"https://orcid.org/0000-0003-1961-657X"},"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":"Hans D. Mittelmann","raw_affiliation_strings":["School of Mathematical and Statistical Sciences, Arizona State University, Tempe, 85287-1804, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical and Statistical Sciences, Arizona State University, Tempe, 85287-1804, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3221","last_page":"3225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unimodular-matrix","display_name":"Unimodular matrix","score":0.7726613283157349},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6599785089492798},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6122474074363708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5865758061408997},{"id":"https://openalex.org/keywords/gramian-matrix","display_name":"Gramian matrix","score":0.5475689768791199},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4359242618083954},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4288903772830963},{"id":"https://openalex.org/keywords/hermitian-matrix","display_name":"Hermitian matrix","score":0.4271845817565918},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.42476823925971985},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4121135175228119},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4112023115158081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3368110656738281},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16516587138175964}],"concepts":[{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.7726613283157349},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6599785089492798},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6122474074363708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5865758061408997},{"id":"https://openalex.org/C77246614","wikidata":"https://www.wikidata.org/wiki/Q1409400","display_name":"Gramian matrix","level":3,"score":0.5475689768791199},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4359242618083954},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4288903772830963},{"id":"https://openalex.org/C94940","wikidata":"https://www.wikidata.org/wiki/Q652941","display_name":"Hermitian matrix","level":2,"score":0.4271845817565918},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.42476823925971985},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4121135175228119},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4112023115158081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3368110656738281},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16516587138175964},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2017.7952751","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2017.7952751","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1919051935","https://openalex.org/W1967790992","https://openalex.org/W2003508782","https://openalex.org/W2007104311","https://openalex.org/W2023351415","https://openalex.org/W2091075671","https://openalex.org/W2130773372","https://openalex.org/W2131033694","https://openalex.org/W2545965423","https://openalex.org/W3104299892"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2979334915"],"abstract_inverted_index":{"We":[0,94,139],"develop":[1],"polynomial-time":[2],"heuristic":[3,56,105,151],"methods":[4,57],"to":[5,15,47,61,112,123,145],"solve":[6,62],"unimodular":[7],"quadratic":[8,25],"programming":[9],"(UQP)":[10],"approximately,":[11],"which":[12],"is":[13,69,75,110],"known":[14],"be":[16],"NP-hard.":[17],"In":[18],"the":[19,63,73,79,83,87,91,124,130,147],"UQP":[20,64,92],"framework,":[21],"we":[22,52],"maximize":[23],"a":[24,28,97,107,114,134],"function":[26,132],"of":[27,30,82,86,117,149],"vector":[29],"complex":[31,80],"variables":[32],"with":[33,58,121],"unit":[34],"modulus.":[35],"Several":[36],"problems":[37],"in":[38,90],"active":[39],"sensing":[40],"and":[41],"wireless":[42],"communication":[43],"applications":[44],"boil":[45],"down":[46],"UQP.":[48],"With":[49],"this":[50,101],"motivation,":[51],"present":[53,141],"two":[54],"new":[55],"polynomial":[59],"complexity":[60],"approximately.":[65],"The":[66,103],"first":[67],"method":[68],"called":[70,136],"dominant-eigenvector-matching;":[71],"here":[72],"solution":[74],"picked":[76],"that":[77,129],"matches":[78],"arguments":[81],"dominant":[84],"eigenvector":[85],"Hermitian":[88],"matrix":[89],"formulation.":[93],"also":[95,140],"provide":[96,113],"performance":[98,115,148],"guarantee":[99,116],"for":[100],"method.":[102],"second":[104],"method,":[106],"greedy":[108],"strategy,":[109],"shown":[111],"(1":[118],"-":[119],"1/e)":[120],"respect":[122],"optimal":[125],"objective":[126,131],"value":[127],"given":[128],"possesses":[133],"property":[135],"string":[137],"submodularity.":[138],"results":[142],"from":[143],"simulations":[144],"demonstrate":[146],"these":[150],"methods.":[152]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}