{"id":"https://openalex.org/W1973935965","doi":"https://doi.org/10.1109/isit.2008.4595344","title":"Near ML detection using Dijkstra’s algorithm with bounded list size over MIMO channels","display_name":"Near ML detection using Dijkstra’s algorithm with bounded list size over MIMO channels","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W1973935965","doi":"https://doi.org/10.1109/isit.2008.4595344","mag":"1973935965"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4595344","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595344","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0802.1785","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Atsushi Okawado","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Atsushi Okawado","raw_affiliation_strings":["Department of Communication and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Ryutaroh Matsumoto","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryutaroh Matsumoto","raw_affiliation_strings":["Department of Communication and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":null,"display_name":"Tomohiko Uyematsu","orcid":null},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomohiko Uyematsu","raw_affiliation_strings":["Department of Communication and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Communication and Integrated Systems, Tokyo Institute of Technology, Meguro, Tokyo, Japan","institution_ids":["https://openalex.org/I114531698"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114531698"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0391591,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2022","last_page":"2025"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","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/T10125","display_name":"Advanced Wireless Communication Techniques","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/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6940000057220459},{"id":"https://openalex.org/keywords/qr-decomposition","display_name":"QR decomposition","score":0.6593000292778015},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6194999814033508},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5268999934196472},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.48910000920295715},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.3752000033855438},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3321000039577484}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6967999935150146},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6940000057220459},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.6593000292778015},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6194999814033508},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5497999787330627},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5268999934196472},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.48910000920295715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41679999232292175},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C137270730","wikidata":"https://www.wikidata.org/wiki/Q120811","display_name":"Detection theory","level":3,"score":0.3028999865055084},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.29109999537467957},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2008.4595344","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595344","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:0802.1785","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0802.1785","pdf_url":"https://arxiv.org/pdf/0802.1785","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0802.1785","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0802.1785","pdf_url":"https://arxiv.org/pdf/0802.1785","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2100700755","https://openalex.org/W2103005479","https://openalex.org/W2112772743","https://openalex.org/W2130509920","https://openalex.org/W2133475491","https://openalex.org/W2141451835","https://openalex.org/W2156787051","https://openalex.org/W6635506272","https://openalex.org/W6675492391","https://openalex.org/W6676924032"],"related_works":[],"abstract_inverted_index":{"We":[0],"propose":[1],"Dijkstra\u2019s":[2],"algorithm":[3,63],"with":[4],"bounded":[5],"list":[6,45],"size":[7,46],"after":[8],"QR":[9,36],"decomposition":[10,37],"for":[11],"decreasing":[12],"the":[13,31,44,51,59,61],"computational":[14,67],"complexity":[15],"of":[16,21,33],"near":[17],"maximum-likelihood":[18],"(ML)":[19],"detection":[20],"signals":[22],"over":[23],"multiple-input-multiple-output":[24],"(MIMO)":[25],"channels.":[26],"After":[27],"that,":[28],"we":[29],"compare":[30],"performances":[32],"proposed":[34,62],"algorithm,":[35],"M-algorithm":[38],"(QRM-MLD),":[39],"and":[40],"its":[41],"improvement.":[42],"When":[43],"is":[47],"set":[48],"to":[49],"achieve":[50],"almost":[52],"same":[53],"symbol":[54],"error":[55],"rate":[56],"(SER)":[57],"as":[58],"QRM-MLD,":[60],"has":[64],"smaller":[65],"average":[66],"complexity.":[68]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}