{"id":"https://openalex.org/W2083637137","doi":"https://doi.org/10.1109/iccomm.2014.6866673","title":"Cramer-Rao bound for a sparse complex model","display_name":"Cramer-Rao bound for a sparse complex model","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2083637137","doi":"https://doi.org/10.1109/iccomm.2014.6866673","mag":"2083637137"},"language":"en","primary_location":{"id":"doi:10.1109/iccomm.2014.6866673","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccomm.2014.6866673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Communications (COMM)","raw_type":"proceedings-article"},"type":"preprint","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/A5034344056","display_name":"Anisia Florescu","orcid":"https://orcid.org/0000-0002-1362-909X"},"institutions":[{"id":"https://openalex.org/I3122748864","display_name":"\"Dunarea de Jos\" University of Galati","ror":"https://ror.org/052sta926","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122748864"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Anisia Florescu","raw_affiliation_strings":["Electronics and Telecommunications Dept., Dun\u00e5rea de Jos University, Gala\u0163i, Rom\u00e2nia","Electron. & Telecommun. Dept., Dunarea de Jos Univ., Galat\u0327i, Romania"],"affiliations":[{"raw_affiliation_string":"Electronics and Telecommunications Dept., Dun\u00e5rea de Jos University, Gala\u0163i, Rom\u00e2nia","institution_ids":["https://openalex.org/I3122748864"]},{"raw_affiliation_string":"Electron. & Telecommun. Dept., Dunarea de Jos Univ., Galat\u0327i, Romania","institution_ids":["https://openalex.org/I3122748864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062777204","display_name":"\u00c9milie Chouzenoux","orcid":"https://orcid.org/0000-0003-3631-6093"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Emilie Chouzenoux","raw_affiliation_strings":["Universit\u00e9 Paris-Est, UMR CNRS, Marne-la-Vall\u00e9e, France","LIGM, Univ. Paris Est, Marne-la-Vallee, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Est, UMR CNRS, Marne-la-Vall\u00e9e, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIGM, Univ. Paris Est, Marne-la-Vallee, France","institution_ids":["https://openalex.org/I4210152518"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062845079","display_name":"Jean\u2010Christophe Pesquet","orcid":"https://orcid.org/0000-0002-5943-8061"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Christophe Pesquet","raw_affiliation_strings":["Universit\u00e9 Paris-Est, UMR CNRS, Marne-la-Vall\u00e9e, France","LIGM, Univ. Paris Est, Marne-la-Vallee, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Est, UMR CNRS, Marne-la-Vall\u00e9e, France","institution_ids":["https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LIGM, Univ. Paris Est, Marne-la-Vallee, France","institution_ids":["https://openalex.org/I4210152518"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070256554","display_name":"Silviu Ciochin\u0103","orcid":"https://orcid.org/0000-0003-3982-1837"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]},{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Silviu Ciochina","raw_affiliation_strings":["Telecommunications Dept., Politehnica University of Bucharest, Rom\u00e2nia","Telecommun. Dept., \u201cPoliteh.\u201d Univ. of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Telecommunications Dept., Politehnica University of Bucharest, Rom\u00e2nia","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Telecommun. Dept., \u201cPoliteh.\u201d Univ. of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5034344056"],"corresponding_institution_ids":["https://openalex.org/I3122748864"],"apc_list":null,"apc_paid":null,"fwci":0.31650458,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62393764,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11210","display_name":"Mathematical Analysis and Transform Methods","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7515354156494141},{"id":"https://openalex.org/keywords/uncountable-set","display_name":"Uncountable set","score":0.7435888051986694},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.6191715598106384},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5947995185852051},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5685461163520813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5533773303031921},{"id":"https://openalex.org/keywords/cram\u00e9r\u2013rao-bound","display_name":"Cram\u00e9r\u2013Rao bound","score":0.49921393394470215},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47430089116096497},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35932376980781555},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35638344287872314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3415840268135071},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23607495427131653},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.17480388283729553}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7515354156494141},{"id":"https://openalex.org/C142399903","wikidata":"https://www.wikidata.org/wiki/Q1128796","display_name":"Uncountable set","level":3,"score":0.7435888051986694},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.6191715598106384},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5947995185852051},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5685461163520813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5533773303031921},{"id":"https://openalex.org/C4978587","wikidata":"https://www.wikidata.org/wiki/Q1138810","display_name":"Cram\u00e9r\u2013Rao bound","level":3,"score":0.49921393394470215},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47430089116096497},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35932376980781555},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35638344287872314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3415840268135071},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23607495427131653},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.17480388283729553},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccomm.2014.6866673","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccomm.2014.6866673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 10th International Conference on Communications (COMM)","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":20,"referenced_works":["https://openalex.org/W1525535255","https://openalex.org/W1740216830","https://openalex.org/W1946620893","https://openalex.org/W1965392255","https://openalex.org/W1980454827","https://openalex.org/W2018962290","https://openalex.org/W2028781966","https://openalex.org/W2109515693","https://openalex.org/W2119667497","https://openalex.org/W2122759946","https://openalex.org/W2134477752","https://openalex.org/W2143148420","https://openalex.org/W2152044198","https://openalex.org/W2159071216","https://openalex.org/W2165394398","https://openalex.org/W2626540006","https://openalex.org/W4233159434","https://openalex.org/W4302561155","https://openalex.org/W6657826333","https://openalex.org/W6739499536"],"related_works":["https://openalex.org/W3019662020","https://openalex.org/W2058498852","https://openalex.org/W2100222222","https://openalex.org/W2512721618","https://openalex.org/W2600675026","https://openalex.org/W3139954723","https://openalex.org/W2480446702","https://openalex.org/W4242301765","https://openalex.org/W4297571715","https://openalex.org/W1519257018"],"abstract_inverted_index":{"Complex-valued":[0],"data":[1],"play":[2],"a":[3,7,32,39,58,64,90],"prominent":[4],"role":[5],"in":[6,94],"number":[8],"of":[9,17,37,42,50,54,97],"signal":[10],"and":[11],"image":[12],"processing":[13],"applications.":[14],"The":[15],"aim":[16],"this":[18],"paper":[19],"is":[20],"to":[21,68,80],"establish":[22],"some":[23],"theoretical":[24],"results":[25,86],"concerning":[26],"the":[27,46,82,95],"Cramer-Rao":[28],"bound":[29],"for":[30],"estimating":[31],"sparse":[33],"complex-valued":[34],"vector.":[35],"Instead":[36],"considering":[38],"countable":[40],"dictionary":[41],"vectors,":[43],"we":[44],"address":[45],"more":[47],"challenging":[48],"case":[49,96],"an":[51,70],"uncountable":[52],"set":[53],"vectors":[55],"parameterized":[56],"by":[57],"real":[59],"variable.":[60],"We":[61],"also":[62],"present":[63],"proximal":[65],"forward-backward":[66],"algorithm":[67],"minimize":[69],"\u2113":[71],"<sub":[72],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[73],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">0</sub>":[74],"penalized":[75],"cost,":[76],"which":[77],"allows":[78],"us":[79],"approach":[81],"derived":[83],"bounds.":[84],"These":[85],"are":[87],"illustrated":[88],"on":[89],"spectrum":[91],"analysis":[92],"problem":[93],"irregularly":[98],"sampled":[99],"observations.":[100]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}