{"id":"https://openalex.org/W2032407717","doi":"https://doi.org/10.1109/ispacs.2011.6146061","title":"Performance analysis of adaptive step-size least mean modulus-Newton algorithm","display_name":"Performance analysis of adaptive step-size least mean modulus-Newton algorithm","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2032407717","doi":"https://doi.org/10.1109/ispacs.2011.6146061","mag":"2032407717"},"language":"en","primary_location":{"id":"doi:10.1109/ispacs.2011.6146061","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispacs.2011.6146061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS)","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/A5109873712","display_name":"Shin'ichi Koike","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shin'ichi Koike","raw_affiliation_strings":["Consultant, Tokyo, Japan","Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Consultant, Tokyo, Japan","institution_ids":[]},{"raw_affiliation_string":"Tokyo, Japan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109873712"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3445,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61879953,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering 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/T11233","display_name":"Advanced Adaptive Filtering 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.9991999864578247,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/algorithm","display_name":"Algorithm","score":0.5828790068626404},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5441880822181702},{"id":"https://openalex.org/keywords/modulus","display_name":"Modulus","score":0.5039154887199402},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4106498956680298},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.320822149515152}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5828790068626404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5441880822181702},{"id":"https://openalex.org/C193867417","wikidata":"https://www.wikidata.org/wiki/Q6889814","display_name":"Modulus","level":2,"score":0.5039154887199402},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4106498956680298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.320822149515152},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ispacs.2011.6146061","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispacs.2011.6146061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Symposium on Intelligent Signal Processing and Communications Systems (ISPACS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1481714982","https://openalex.org/W1492221128","https://openalex.org/W1517043853","https://openalex.org/W1544576535","https://openalex.org/W1922782226","https://openalex.org/W1999542175","https://openalex.org/W2025742588","https://openalex.org/W2070546538","https://openalex.org/W2096093732","https://openalex.org/W2115815917","https://openalex.org/W2165155912","https://openalex.org/W2482792214","https://openalex.org/W2547842271","https://openalex.org/W2895674046","https://openalex.org/W6628944063","https://openalex.org/W6631034558","https://openalex.org/W6668339981"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2393888177","https://openalex.org/W2544423928","https://openalex.org/W2115794623","https://openalex.org/W2360264381","https://openalex.org/W2067173559","https://openalex.org/W2148738811","https://openalex.org/W1613730747","https://openalex.org/W2541389358","https://openalex.org/W4318948887"],"abstract_inverted_index":{"This":[0],"paper":[1,65],"first":[2],"reviews":[3],"least":[4],"mean":[5],"modulus-Newton":[6],"(LMM-Newton)":[7],"algorithm":[8,15,38,53,80,87,98,149],"for":[9,35,50,59,101,127],"complex-domain":[10],"adaptive":[11,24,76],"filters.":[12],"The":[13],"LMM-Newton":[14,52,86],"is":[16,54,99,123],"effective":[17],"in":[18],"making":[19],"the":[20,36,47,51,60,64,85,91,96,120,125,138,144,147,162],"convergence":[21,49,92,122,160],"of":[22,95,114,130,132,137,146],"an":[23],"filter":[25,44,48,115,121],"with":[26,39,84,109],"a":[27,40,67,74],"highly":[28],"correlated":[29],"input":[30],"as":[31,33],"fast":[32],"that":[34,119],"LMM":[37,148],"White":[41],"&":[42],"Gaussian":[43],"input.":[45],"However,":[46],"still":[55],"much":[56],"slower":[57],"than":[58],"LMS":[61],"algorithm.":[62],"Then,":[63],"introduces":[66],"generalized":[68],"error":[69],"modulus":[70],"(\u201cp-modulus\u201d)":[71],"and":[72,104,111,158],"proposes":[73],"new":[75],"step-size":[77],"(ASS)":[78],"control":[79],"to":[81,88],"be":[82],"combined":[83],"further":[89],"improve":[90],"speed.":[93],"Analysis":[94],"ASS-LMM-Newton":[97,140],"developed":[100],"calculating":[102],"transient":[103],"steady-state":[105],"behavior.":[106],"Through":[107],"experiment":[108],"simulations":[110],"theoretical":[112,159],"calculations":[113],"convergence,":[116],"we":[117],"find":[118],"almost":[124],"same":[126],"any":[128],"value":[129],"p":[131],"\u201cp-modulus.\u201d":[133],"We":[134],"demonstrate":[135],"effectiveness":[136],"proposed":[139],"algorithm,":[141],"while":[142],"preserving":[143],"robustness":[145],"against":[150],"impulsive":[151],"observation":[152],"noise.":[153],"Good":[154],"agreement":[155],"between":[156],"simulated":[157],"validates":[161],"analysis.":[163]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
