{"id":"https://openalex.org/W2116482004","doi":"https://doi.org/10.1109/glocom.2012.6503822","title":"Novel tree-search algorithm versus Sphere-Decoding-Based Algorithms for MIMO system with Inter-Symbol Interference","display_name":"Novel tree-search algorithm versus Sphere-Decoding-Based Algorithms for MIMO system with Inter-Symbol Interference","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2116482004","doi":"https://doi.org/10.1109/glocom.2012.6503822","mag":"2116482004"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2012.6503822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2012.6503822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Global Communications Conference (GLOBECOM)","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/A5101812914","display_name":"Chong Xu","orcid":"https://orcid.org/0000-0002-1093-7660"},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chong Xu","raw_affiliation_strings":["National Institute of Standards and Technology, Gaithersburg, USA"],"affiliations":[{"raw_affiliation_string":"National Institute of Standards and Technology, Gaithersburg, USA","institution_ids":["https://openalex.org/I1321296531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062830296","display_name":"Hamid Gharavi","orcid":"https://orcid.org/0000-0003-3832-488X"},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hamid Gharavi","raw_affiliation_strings":["National Institute of Standards and Technology, Gaithersburg, USA"],"affiliations":[{"raw_affiliation_string":"National Institute of Standards and Technology, Gaithersburg, USA","institution_ids":["https://openalex.org/I1321296531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101812914"],"corresponding_institution_ids":["https://openalex.org/I1321296531"],"apc_list":null,"apc_paid":null,"fwci":0.3546,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65246923,"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":"4470","last_page":"4475"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9991999864578247,"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.7990869283676147},{"id":"https://openalex.org/keywords/space\u2013time-block-code","display_name":"Space\u2013time block code","score":0.7926473617553711},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7092677354812622},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.6519633531570435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6065710186958313},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5935457944869995},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5498641729354858},{"id":"https://openalex.org/keywords/guard-interval","display_name":"Guard interval","score":0.49408653378486633},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.4933585226535797},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4697205126285553},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.46961861848831177},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46953973174095154},{"id":"https://openalex.org/keywords/interference","display_name":"Interference (communication)","score":0.45081835985183716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2742122411727905},{"id":"https://openalex.org/keywords/orthogonal-frequency-division-multiplexing","display_name":"Orthogonal frequency-division multiplexing","score":0.2437347173690796},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.15494155883789062}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7990869283676147},{"id":"https://openalex.org/C83487572","wikidata":"https://www.wikidata.org/wiki/Q371792","display_name":"Space\u2013time block code","level":4,"score":0.7926473617553711},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7092677354812622},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.6519633531570435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6065710186958313},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5935457944869995},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5498641729354858},{"id":"https://openalex.org/C2777796584","wikidata":"https://www.wikidata.org/wiki/Q1132816","display_name":"Guard interval","level":4,"score":0.49408653378486633},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.4933585226535797},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4697205126285553},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.46961861848831177},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46953973174095154},{"id":"https://openalex.org/C32022120","wikidata":"https://www.wikidata.org/wiki/Q797225","display_name":"Interference (communication)","level":3,"score":0.45081835985183716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2742122411727905},{"id":"https://openalex.org/C40409654","wikidata":"https://www.wikidata.org/wiki/Q375889","display_name":"Orthogonal frequency-division multiplexing","level":3,"score":0.2437347173690796},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.15494155883789062},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2012.6503822","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2012.6503822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Global Communications Conference (GLOBECOM)","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":12,"referenced_works":["https://openalex.org/W1984959503","https://openalex.org/W2011396057","https://openalex.org/W2027635460","https://openalex.org/W2075718541","https://openalex.org/W2096974994","https://openalex.org/W2106907805","https://openalex.org/W2118425896","https://openalex.org/W2128504632","https://openalex.org/W2141131298","https://openalex.org/W2158997686","https://openalex.org/W2161723231","https://openalex.org/W6674763995"],"related_works":["https://openalex.org/W2100169124","https://openalex.org/W2363263113","https://openalex.org/W2160133013","https://openalex.org/W1556745361","https://openalex.org/W2085933817","https://openalex.org/W2117070194","https://openalex.org/W2054827663","https://openalex.org/W2102400249","https://openalex.org/W2370730162","https://openalex.org/W2159823397"],"abstract_inverted_index":{"In":[0,56],"this":[1,77],"paper":[2],"we":[3,129],"firstly":[4],"propose":[5],"a":[6,21,59,85,101,143],"general":[7,31,110],"model":[8,32],"to":[9,66,69],"combat":[10],"the":[11,38,49,72,80,96,108,115,121,137,149,153,156,160],"Inter-Symbol":[12],"Interference":[13],"(ISI)":[14],"caused":[15],"by":[16,26,37,48],"frequency":[17],"selective":[18],"channels":[19],"in":[20,107],"Multi-InputMulti-Output":[22],"(MIMO)":[23],"system":[24,154],"and/or":[25],"asynchronous":[27],"cooperative":[28],"transmissions.":[29],"The":[30],"is":[33,146],"not":[34],"only":[35],"exemplified":[36],"Asynchronous":[39],"Cooperative":[40],"Liner":[41],"Dispersion":[42],"Codes":[43],"(ACLDC)":[44],"scheme,":[45],"but":[46],"also":[47],"Time-Reversed":[50],"Space-Time":[51],"Block":[52],"Code":[53],"(TR-STBC)":[54],"scheme.":[55,162],"these":[57],"schemes":[58],"guard":[60],"interval":[61],"of":[62,74],"various":[63],"lengths":[64],"has":[65],"be":[67],"inserted":[68],"help":[70],"mitigate":[71],"effect":[73],"ISI.":[75],"Consequently,":[76],"could":[78,93],"impact":[79],"effective":[81],"symbol":[82],"rate":[83],"for":[84],"small":[86],"block-size.":[87],"A":[88],"larger":[89],"block":[90],"size":[91],"however,":[92],"substantially":[94],"increase":[95],"decoding":[97],"complexity.":[98],"We":[99,112],"present":[100],"novel":[102],"low-complexity":[103],"breadth-adjustable":[104],"tree-search":[105],"algorithm":[106,119,134],"proposed":[109],"model.":[111],"will":[113,130,135],"discuss":[114],"difference":[116],"between":[117],"our":[118,133],"and":[120],"Sphere":[122],"Decoding":[123],"(SD)-based":[124],"algorithms.":[125],"With":[126],"simulation":[127],"results,":[128],"illustrate":[131],"that":[132,145],"achieve":[136],"optimal":[138],"Bit-Error-Rate":[139],"(BER)":[140],"performance":[141],"with":[142],"complexity":[144],"lower":[147],"than":[148],"SD-based":[150],"algorithms,":[151],"whether":[152],"employs":[155],"ACLDC":[157],"scheme":[158],"or":[159],"TR-STBC":[161]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}