{"id":"https://openalex.org/W1851527318","doi":"https://doi.org/10.1109/icassp.1982.1171578","title":"Direct coherence estimation via a constrained least-squares linear-predictive fast algorithm","display_name":"Direct coherence estimation via a constrained least-squares linear-predictive fast algorithm","publication_year":2005,"publication_date":"2005-03-24","ids":{"openalex":"https://openalex.org/W1851527318","doi":"https://doi.org/10.1109/icassp.1982.1171578","mag":"1851527318"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.1982.1171578","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171578","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing","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/A5061240977","display_name":"A. Nuttal","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Nuttal","raw_affiliation_strings":["Naval Underwater Systems Center, New London, Connecticut, USA"],"affiliations":[{"raw_affiliation_string":"Naval Underwater Systems Center, New London, Connecticut, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061240977"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2718,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.79172467,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"7","issue":null,"first_page":"1104","last_page":"1107"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9988999962806702,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9988999962806702,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9939000010490417,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7369054555892944},{"id":"https://openalex.org/keywords/coherence","display_name":"Coherence (philosophical gambling strategy)","score":0.6876248717308044},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6400309801101685},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6243478655815125},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.5716542601585388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45613083243370056},{"id":"https://openalex.org/keywords/non-linear-least-squares","display_name":"Non-linear least squares","score":0.4524402320384979},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4430379271507263},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41615164279937744},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4137207269668579},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3953559994697571},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.291881263256073},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.284591943025589},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.2131078839302063}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7369054555892944},{"id":"https://openalex.org/C2781181686","wikidata":"https://www.wikidata.org/wiki/Q4226068","display_name":"Coherence (philosophical gambling strategy)","level":2,"score":0.6876248717308044},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6400309801101685},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6243478655815125},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.5716542601585388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45613083243370056},{"id":"https://openalex.org/C45923927","wikidata":"https://www.wikidata.org/wiki/Q3319230","display_name":"Non-linear least squares","level":3,"score":0.4524402320384979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4430379271507263},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41615164279937744},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4137207269668579},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3953559994697571},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.291881263256073},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.284591943025589},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.2131078839302063},{"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/icassp.1982.1171578","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.1982.1171578","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing","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":6,"referenced_works":["https://openalex.org/W340530909","https://openalex.org/W1728107461","https://openalex.org/W1867503201","https://openalex.org/W1934364122","https://openalex.org/W1942692681","https://openalex.org/W2167287423"],"related_works":["https://openalex.org/W2082821409","https://openalex.org/W2026673180","https://openalex.org/W2049605497","https://openalex.org/W1959514624","https://openalex.org/W200101083","https://openalex.org/W2939592218","https://openalex.org/W2142947426","https://openalex.org/W2359835307","https://openalex.org/W327962130","https://openalex.org/W2093919938"],"abstract_inverted_index":{"Estimation":[0],"of":[1,17,21,101,107,109],"multi-channel":[2],"auto-spectra,":[3],"cross-spectra,":[4],"and":[5,73],"coherences":[6],"via":[7,95],"linear-predictive":[8,47],"techniques":[9],"suffers":[10],"from":[11,36,53],"cross-feed":[12],"between":[13,28],"the":[14,26,44,59,99,110],"limited":[15],"number":[16],"data":[18,56,114],"points":[19],"available":[20],"each":[22],"channel":[23],"process.":[24],"Here,":[25],"coherence":[27,71,118],"two":[29],"channels":[30],"is":[31,63,91,93],"estimated":[32],"directly,":[33],"without":[34],"diversion":[35],"auto-spectra":[37],"estimation,":[38],"so":[39,65],"as":[40,66],"to":[41,67,112],"minimize":[42],"only":[43],"valid":[45],"computable":[46],"errors":[48],"that":[49,90],"can":[50,74],"be":[51,75],"formed":[52],"given":[54],"finite":[55],"records.":[57],"Furthermore,":[58],"least-squares":[60],"minimization":[61],"procedure":[62],"constrained":[64],"yield":[68],"physically-consistent":[69],"magnitude-squared":[70],"estimates,":[72],"accomplished":[76],"by":[77],"a":[78,82,96],"fast":[79],"algorithm":[80],"in":[81],"recursive":[83],"fashion.":[84],"The":[85],"resulting":[86],"nonlinear":[87],"programming":[88],"problem":[89],"encountered":[92],"solvable":[94],"recursion":[97],"employing":[98],"Hessian":[100],"an":[102],"unconstrained":[103],"error":[104],"measure.":[105],"Examples":[106],"application":[108],"technique":[111],"short":[113],"records":[115],"yields":[116],"good":[117],"estimates.":[119]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}