{"id":"https://openalex.org/W2801107318","doi":"https://doi.org/10.1109/iscas.2018.8351138","title":"Least-Squares Multiple Frequency Estimation using Recursive Regression Sum of Squares","display_name":"Least-Squares Multiple Frequency Estimation using Recursive Regression Sum of Squares","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2801107318","doi":"https://doi.org/10.1109/iscas.2018.8351138","mag":"2801107318"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2018.8351138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2018.8351138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Circuits and Systems (ISCAS)","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/A5029232546","display_name":"S.S. Abeysekera","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Saman S. Abeysekera","raw_affiliation_strings":["School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029232546"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.8257,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.7253199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9998000264167786,"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9993000030517578,"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/T10534","display_name":"Structural Health Monitoring Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/recursion","display_name":"Recursion (computer science)","score":0.5929281115531921},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.568373441696167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5601915717124939},{"id":"https://openalex.org/keywords/covariance-matrix","display_name":"Covariance matrix","score":0.5522131323814392},{"id":"https://openalex.org/keywords/generalized-least-squares","display_name":"Generalized least squares","score":0.538788914680481},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.5198898315429688},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.48677587509155273},{"id":"https://openalex.org/keywords/non-linear-least-squares","display_name":"Non-linear least squares","score":0.4744090735912323},{"id":"https://openalex.org/keywords/total-least-squares","display_name":"Total least squares","score":0.47354382276535034},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.47296279668807983},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.4203493297100067},{"id":"https://openalex.org/keywords/maximum-likelihood-sequence-estimation","display_name":"Maximum likelihood sequence estimation","score":0.4183701276779175},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3908415734767914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3765987157821655},{"id":"https://openalex.org/keywords/regression","display_name":"Regression","score":0.32349637150764465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16486412286758423}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5929281115531921},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.568373441696167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5601915717124939},{"id":"https://openalex.org/C185142706","wikidata":"https://www.wikidata.org/wiki/Q1134404","display_name":"Covariance matrix","level":2,"score":0.5522131323814392},{"id":"https://openalex.org/C188649462","wikidata":"https://www.wikidata.org/wiki/Q2246261","display_name":"Generalized least squares","level":3,"score":0.538788914680481},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.5198898315429688},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.48677587509155273},{"id":"https://openalex.org/C45923927","wikidata":"https://www.wikidata.org/wiki/Q3319230","display_name":"Non-linear least squares","level":3,"score":0.4744090735912323},{"id":"https://openalex.org/C169241690","wikidata":"https://www.wikidata.org/wiki/Q7828122","display_name":"Total least squares","level":3,"score":0.47354382276535034},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.47296279668807983},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.4203493297100067},{"id":"https://openalex.org/C191462741","wikidata":"https://www.wikidata.org/wiki/Q6795902","display_name":"Maximum likelihood sequence estimation","level":3,"score":0.4183701276779175},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3908415734767914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3765987157821655},{"id":"https://openalex.org/C83546350","wikidata":"https://www.wikidata.org/wiki/Q1139051","display_name":"Regression","level":2,"score":0.32349637150764465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16486412286758423},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2018.8351138","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2018.8351138","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Circuits and Systems (ISCAS)","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":23,"referenced_works":["https://openalex.org/W210359992","https://openalex.org/W250076511","https://openalex.org/W1952629836","https://openalex.org/W2001188690","https://openalex.org/W2007829753","https://openalex.org/W2011939091","https://openalex.org/W2012125608","https://openalex.org/W2034829035","https://openalex.org/W2062817358","https://openalex.org/W2066218102","https://openalex.org/W2086188282","https://openalex.org/W2113638573","https://openalex.org/W2127271355","https://openalex.org/W2128131274","https://openalex.org/W2135046866","https://openalex.org/W2139748108","https://openalex.org/W2149755721","https://openalex.org/W2160044474","https://openalex.org/W2343448572","https://openalex.org/W2587100683","https://openalex.org/W2594759396","https://openalex.org/W2759685642","https://openalex.org/W6734444680"],"related_works":["https://openalex.org/W2030255580","https://openalex.org/W2123913166","https://openalex.org/W4380487384","https://openalex.org/W2034819163","https://openalex.org/W3150673294","https://openalex.org/W2388513917","https://openalex.org/W2394396033","https://openalex.org/W1959514624","https://openalex.org/W2368940260","https://openalex.org/W2374560502"],"abstract_inverted_index":{"An":[0],"accurate":[1],"frequency":[2],"estimation":[3,48,60],"method":[4,16],"from":[5,31],"a":[6,41,50],"signal":[7],"consisting":[8],"of":[9,19,23,34,52],"multiple":[10],"complex":[11],"sinusoids":[12],"is":[13,61],"presented.":[14],"The":[15],"avoids":[17],"inversion":[18],"data":[20,36],"dependent":[21],"matrices":[22],"large":[24],"dimensions,":[25],"and":[26],"hence":[27],"do":[28],"not":[29],"suffer":[30],"rank":[32],"deficiency":[33],"the":[35],"covariance":[37],"matrix.":[38],"Using":[39],"recursion,":[40],"procedure":[42],"to":[43,49],"reduce":[44],"mw/t/-dimensional":[45],"maximum":[46],"likelihood":[47],"series":[51],"one-dimensional":[53],"optimization":[54],"while":[55],"achieving":[56],"Cramer-Rao":[57],"bounds":[58],"for":[59],"proposed.":[62]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}