{"id":"https://openalex.org/W2089675128","doi":"https://doi.org/10.1109/ncc.2015.7084883","title":"Successive approximation algorithm for LPC estimation using sparse residual constraint","display_name":"Successive approximation algorithm for LPC estimation using sparse residual constraint","publication_year":2015,"publication_date":"2015-02-01","ids":{"openalex":"https://openalex.org/W2089675128","doi":"https://doi.org/10.1109/ncc.2015.7084883","mag":"2089675128"},"language":"en","primary_location":{"id":"doi:10.1109/ncc.2015.7084883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2015.7084883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Twenty First National Conference on Communications (NCC)","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/A5004929413","display_name":"Srikanth Raj Chetupalli","orcid":"https://orcid.org/0000-0002-2186-5420"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Srikanth Raj Chetupalli","raw_affiliation_strings":["Department of Electrical Communication Engineering, Indian Institute Of Science, Bangalore, India","Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India-560012"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Communication Engineering, Indian Institute Of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India-560012","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103524858","display_name":"Sreenivas Thippur V.","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sreenivas Thippur V.","raw_affiliation_strings":["Department of Electrical Communication Engineering, Indian Institute Of Science, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Communication Engineering, Indian Institute Of Science, Bangalore, India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004929413"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":0.3344,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61994029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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":0.9998999834060669,"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.9997000098228455,"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/T10860","display_name":"Speech and Audio Processing","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.7513744235038757},{"id":"https://openalex.org/keywords/matching-pursuit","display_name":"Matching pursuit","score":0.6740112900733948},{"id":"https://openalex.org/keywords/linear-prediction","display_name":"Linear prediction","score":0.6411169767379761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.596760630607605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5376334190368652},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5366328358650208},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4521132707595825},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4517173767089844},{"id":"https://openalex.org/keywords/impulse-response","display_name":"Impulse response","score":0.4463120698928833},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4229361116886139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3790349066257477},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.27987828850746155},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.17824724316596985}],"concepts":[{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.7513744235038757},{"id":"https://openalex.org/C156872377","wikidata":"https://www.wikidata.org/wiki/Q6786281","display_name":"Matching pursuit","level":3,"score":0.6740112900733948},{"id":"https://openalex.org/C131109320","wikidata":"https://www.wikidata.org/wiki/Q581012","display_name":"Linear prediction","level":2,"score":0.6411169767379761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.596760630607605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5376334190368652},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5366328358650208},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4521132707595825},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4517173767089844},{"id":"https://openalex.org/C72279823","wikidata":"https://www.wikidata.org/wiki/Q1139726","display_name":"Impulse response","level":2,"score":0.4463120698928833},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4229361116886139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3790349066257477},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.27987828850746155},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.17824724316596985},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ncc.2015.7084883","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc.2015.7084883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Twenty First National Conference on Communications (NCC)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.iisc.ac.in:54562","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1966264494","https://openalex.org/W1981745143","https://openalex.org/W1995319862","https://openalex.org/W1995828869","https://openalex.org/W2040412438","https://openalex.org/W2091360050","https://openalex.org/W2107861471","https://openalex.org/W2123684326","https://openalex.org/W2127271355","https://openalex.org/W2129131372","https://openalex.org/W2131664668","https://openalex.org/W2137213227","https://openalex.org/W2151693816","https://openalex.org/W2296616510","https://openalex.org/W2798909945","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W2042644197","https://openalex.org/W2073241848","https://openalex.org/W2785927776","https://openalex.org/W2020549994","https://openalex.org/W4220674950","https://openalex.org/W3130682819","https://openalex.org/W2033385447","https://openalex.org/W2096684559","https://openalex.org/W4206193249","https://openalex.org/W2918676124"],"abstract_inverted_index":{"Estimation":[0],"of":[1,9,16,32,75],"linear":[2,23,63],"prediction":[3,11],"coefficients":[4,65],"under":[5,48],"the":[6,10,17,29,33,44,62,67,73,76,95,106],"sparsity":[7,49],"constraint":[8],"residue,":[12],"is":[13,41],"a":[14,56,89],"modification":[15],"traditional":[18],"minimum":[19],"mean":[20],"square":[21],"error":[22],"predictor":[24,64],"formulation,":[25],"which":[26],"accounts":[27],"for":[28,36,60],"impulse":[30],"nature":[31],"residual":[34,69],"signal":[35],"voiced":[37],"speech":[38,84,103],"signals.":[39],"This":[40],"solved":[42],"using":[43,79],"1-norm":[45],"minimization":[46],"approach":[47,78,97],"constraints.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"develop":[55],"successive":[57],"approximation":[58],"algorithm":[59],"estimating":[61],"and":[66,81],"sparse":[68],"signal.":[70],"We":[71],"illustrate":[72],"usefulness":[74],"proposed":[77,96],"synthetic,":[80],"also":[82],"real":[83],"examples.":[85],"Experimental":[86],"results":[87],"in":[88],"multi-pulse":[90],"based":[91,110,120],"analysis-synthesis":[92],"show":[93],"that":[94],"can":[98],"provide":[99],"better":[100],"perceptual":[101],"quality":[102],"reconstruction":[104],"than":[105,117],"orthogonal":[107],"matching":[108],"pursuit":[109],"algorithm,":[111],"with":[112],"computational":[113],"time":[114],"much":[115],"lower":[116],"convex":[118],"optimization":[119],"techniques.":[121]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}