{"id":"https://openalex.org/W2920944948","doi":"https://doi.org/10.1109/istel.2018.8661003","title":"A Fast Fixed Point Algorithm for Real-Time Spectrum Balancing of DSL","display_name":"A Fast Fixed Point Algorithm for Real-Time Spectrum Balancing of DSL","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2920944948","doi":"https://doi.org/10.1109/istel.2018.8661003","mag":"2920944948"},"language":"en","primary_location":{"id":"doi:10.1109/istel.2018.8661003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2018.8661003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Symposium on Telecommunications (IST)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5060551773","display_name":"Mohammad Behfarnia","orcid":null},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Behfarnia","raw_affiliation_strings":["Department of Electrical Engineering, University of Isfahan, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005698368","display_name":"Amir R. Forouzan","orcid":"https://orcid.org/0000-0001-6330-2573"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Amir R. Forouzan","raw_affiliation_strings":["Department of Electrical Engineering, University of Isfahan, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054452842","display_name":"Mohamad Farzan Sabahi","orcid":"https://orcid.org/0000-0003-2359-2582"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohamad F. Sabahi","raw_affiliation_strings":["Department of Electrical Engineering, University of Isfahan, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39268498"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27142168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"144","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12146","display_name":"Power Line Communications and Noise","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12146","display_name":"Power Line Communications and Noise","score":1.0,"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"}},{"id":"https://openalex.org/T11873","display_name":"PAPR reduction in OFDM","score":0.9934999942779541,"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"}},{"id":"https://openalex.org/T11444","display_name":"Electromagnetic Compatibility and Noise Suppression","score":0.9908999800682068,"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/digital-subscriber-line","display_name":"Digital subscriber line","score":0.9267205595970154},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7275455594062805},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7172832489013672},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5120468735694885},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.4813445508480072},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48034512996673584},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4585731625556946},{"id":"https://openalex.org/keywords/ramer\u2013douglas\u2013peucker-algorithm","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","score":0.43762820959091187},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17253562808036804},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.12408530712127686},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09226205945014954}],"concepts":[{"id":"https://openalex.org/C201374245","wikidata":"https://www.wikidata.org/wiki/Q104534","display_name":"Digital subscriber line","level":2,"score":0.9267205595970154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7275455594062805},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7172832489013672},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5120468735694885},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4813445508480072},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48034512996673584},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4585731625556946},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.43762820959091187},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17253562808036804},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.12408530712127686},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09226205945014954},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/istel.2018.8661003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istel.2018.8661003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 9th International Symposium on Telecommunications (IST)","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":5,"referenced_works":["https://openalex.org/W2091734568","https://openalex.org/W2103262619","https://openalex.org/W2110391887","https://openalex.org/W2607928667","https://openalex.org/W4301014524"],"related_works":["https://openalex.org/W2056183469","https://openalex.org/W2920944948","https://openalex.org/W2055000019","https://openalex.org/W2117183908","https://openalex.org/W2393888177","https://openalex.org/W2007369275","https://openalex.org/W2060431457","https://openalex.org/W2533612799","https://openalex.org/W2137128366","https://openalex.org/W1968984272"],"abstract_inverted_index":{"A":[0,14],"real-time":[1,15,62],"algorithm":[2,17,20,36,72,77,83],"for":[3,21],"spectrum":[4],"balancing":[5],"(SB)":[6],"of":[7],"digital":[8],"subscriber":[9],"lines":[10],"(DSL)":[11],"is":[12,18,37],"proposed.":[13],"SB":[16,63,81],"an":[19],"which":[22],"the":[23,52,66,71,76,79],"PSD":[24],"and":[25,42],"power":[26],"regulatory":[27],"constraints":[28],"are":[29,73],"always":[30],"met":[31],"after":[32],"each":[33],"iteration.":[34],"The":[35],"based":[38],"on":[39],"fixed-point":[40],"iterations":[41],"has":[43],"a":[44,59],"low":[45],"computational":[46],"complexity.":[47],"Our":[48],"simulations":[49],"show":[50],"that":[51],"proposed":[53,61],"technique":[54],"converges":[55],"much":[56],"faster":[57],"than":[58],"recently":[60],"algorithm.":[64],"Moreover,":[65],"achievable":[67],"bit":[68],"rates":[69],"by":[70],"near-optimal.":[74],"Particularly":[75],"outperforms":[78],"iterative":[80],"(ISB)":[82],"in":[84],"large":[85],"scenarios.":[86]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}