{"id":"https://openalex.org/W2128900057","doi":"https://doi.org/10.1109/wcnc.2005.1424629","title":"Sample rejection for efficient simulation of intersymbol interference channels with MLSD","display_name":"Sample rejection for efficient simulation of intersymbol interference channels with MLSD","publication_year":2005,"publication_date":"2005-04-25","ids":{"openalex":"https://openalex.org/W2128900057","doi":"https://doi.org/10.1109/wcnc.2005.1424629","mag":"2128900057"},"language":"en","primary_location":{"id":"doi:10.1109/wcnc.2005.1424629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2005.1424629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2005","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/A5032363978","display_name":"Pavel Loskot","orcid":"https://orcid.org/0000-0002-2773-2186"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"P. Loskot","raw_affiliation_strings":["ICORE Wireless Communications Laboratory, Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","[Dept. of Electr. & Comput. Eng., Alberta Univ., Edmonton, Alta., Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICORE Wireless Communications Laboratory, Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Alberta Univ., Edmonton, Alta., Canada]","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038087450","display_name":"Norman C. Beaulieu","orcid":"https://orcid.org/0000-0001-9233-219X"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"N.C. Beaulieu","raw_affiliation_strings":["ICORE Wireless Communications Laboratory, Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","[Dept. of Electr. & Comput. Eng., Alberta Univ., Edmonton, Alta., Canada]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICORE Wireless Communications Laboratory, Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"[Dept. of Electr. & Comput. Eng., Alberta Univ., Edmonton, Alta., Canada]","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19149269,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"911","last_page":"916"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994999766349792,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994999766349792,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/intersymbol-interference","display_name":"Intersymbol interference","score":0.9258033633232117},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.804311990737915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6965603232383728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6730947494506836},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6022309064865112},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.6012533903121948},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.5443886518478394},{"id":"https://openalex.org/keywords/maximum-likelihood-sequence-estimation","display_name":"Maximum likelihood sequence estimation","score":0.4481002986431122},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.4240038990974426},{"id":"https://openalex.org/keywords/estimation-theory","display_name":"Estimation theory","score":0.2604484558105469},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.2373538613319397},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13984981179237366},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12782695889472961}],"concepts":[{"id":"https://openalex.org/C97812054","wikidata":"https://www.wikidata.org/wiki/Q2166055","display_name":"Intersymbol interference","level":3,"score":0.9258033633232117},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.804311990737915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6965603232383728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6730947494506836},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6022309064865112},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.6012533903121948},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.5443886518478394},{"id":"https://openalex.org/C191462741","wikidata":"https://www.wikidata.org/wiki/Q6795902","display_name":"Maximum likelihood sequence estimation","level":3,"score":0.4481002986431122},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.4240038990974426},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.2604484558105469},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.2373538613319397},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13984981179237366},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12782695889472961}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcnc.2005.1424629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcnc.2005.1424629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Wireless Communications and Networking Conference, 2005","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":15,"referenced_works":["https://openalex.org/W190076915","https://openalex.org/W1040230600","https://openalex.org/W1572157493","https://openalex.org/W1580968560","https://openalex.org/W1590772317","https://openalex.org/W1969047098","https://openalex.org/W1969423828","https://openalex.org/W1989400955","https://openalex.org/W1998055811","https://openalex.org/W2002749794","https://openalex.org/W2064173571","https://openalex.org/W2132367129","https://openalex.org/W2134730684","https://openalex.org/W2152797116","https://openalex.org/W2165052658"],"related_works":["https://openalex.org/W2143297499","https://openalex.org/W3096277017","https://openalex.org/W1915619113","https://openalex.org/W2790444905","https://openalex.org/W2133857928","https://openalex.org/W4232476001","https://openalex.org/W2073817053","https://openalex.org/W2544568790","https://openalex.org/W2783469447","https://openalex.org/W2164818839"],"abstract_inverted_index":{"A":[0],"sample":[1,20,129],"rejection":[2,21,51,130],"scheme":[3],"introduced":[4],"previously":[5],"is":[6,79],"generalized":[7],"for":[8,28,56,81,137,161],"the":[9,17,77,86,93,106,113,134,138,170],"simulation":[10,30,135],"of":[11,19,25,31,92,163],"multidimensional":[12],"communication":[13],"systems.":[14],"We":[15,120],"consider":[16],"use":[18],"(a":[22],"special":[23],"case":[24],"importance":[26],"sampling)":[27],"efficient":[29,160],"uncoded":[32],"continuous":[33],"transmission":[34],"with":[35,59],"periodic":[36],"trellis-termination":[37],"over":[38],"static":[39],"intersymbol":[40],"interference":[41],"(ISI)":[42],"channels":[43,165],"and":[44,64,117,154,166],"maximum":[45],"likelihood":[46],"sequence":[47,101],"detection.":[48],"Previously":[49],"proposed":[50],"regions":[52,69],"are":[53,70,74,89],"applicable":[54,72],"only":[55],"finite":[57],"lattices":[58],"rectangular":[60],"or":[61,73,84],"circular":[62],"symmetries":[63,88],"moderate":[65],"dimensionality.":[66],"However,":[67],"these":[68,125],"not":[71],"inefficient":[75],"if":[76,85],"dimensionality":[78,107],"increased":[80],"large":[82],"block-lengths,":[83],"lattice":[87],"absent":[90],"because":[91],"ISI.":[94],"Hence,":[95],"we":[96,111],"investigate":[97],"sliding-window":[98],"(near)":[99],"maximum-likelihood":[100],"decoding":[102,153],"(MLSD)":[103],"to":[104,124,132],"resolve":[105],"problem.":[108],"In":[109],"particular,":[110],"study":[112],"truncated":[114],"Viterbi":[115,140,171],"algorithm":[116,141],"feedback":[118,152],"decoding.":[119],"propose":[121],"several":[122],"modifications":[123,156],"two":[126],"algorithms":[127],"using":[128],"principles":[131],"improve":[133],"efficacy":[136],"conventional":[139],"while":[142],"achieving":[143],"near":[144,167],"MLSD":[145,168],"performance.":[146],"Finally,":[147],"numerical":[148],"examples":[149],"confirm":[150],"that":[151],"its":[155],"can":[157],"be":[158],"more":[159],"simulations":[162],"ISI":[164],"than":[169],"algorithm.":[172]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}