Achieving low-complexity maximum-likelihood detection for the 3D MIMO code
The 3D Multiple-input multiple-output (MIMO) code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MI...
Gespeichert in:
| Veröffentlicht in: | EURASIP journal on wireless communications and networking 2014-02, Vol.2014 (1), p.1-16, Article 20 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 16 |
|---|---|
| container_issue | 1 |
| container_start_page | 1 |
| container_title | EURASIP journal on wireless communications and networking |
| container_volume | 2014 |
| creator | Liu, Ming Crussière, Matthieu Hélard, Maryline Hélard, Jean-François |
| description | The 3D Multiple-input multiple-output (MIMO) code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast decodable. It is proven that the ML decoding performance can be achieved with a complexity of
O
(
M
4.5
) instead of
O
(
M
8
) in quasi-static channel with
M
-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of the 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration. |
| doi_str_mv | 10.1186/1687-1499-2014-20 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00929761v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1551057489</sourcerecordid><originalsourceid>FETCH-LOGICAL-b411t-2a9573d9621e78a3f01b623cb13b466abf8ffce575151735bcfc1c8eb099d8573</originalsourceid><addsrcrecordid>eNp9kc1OwzAQhCMEEqXwANxyhEPAm38fqxZoUate4Gw5zqZxSeJip6V9exwFVYAQl11rd2ZW-uw410DuANL4HuI08SCk1PMJhLacOIPj7PTb-9y5MGZNSBCE1B84zyNRStzJZuVW6sMTqt5UuJftwa35Xtbb2qvkG1ayVCp3c2xRtFI1bqG025boBhN3MVssXaFyvHTOCl4ZvPrqQ-f18eFlPPXmy6fZeDT3shCg9XxOoyTIaewDJikPCgJZ7AcigyAL45hnRVoUAqMkggiSIMpEIUCkmBFK89Rah85tn1vyim20rLk-MMUlm47mrJsRQn2axLADq5302kyqGnOBTat_uX5uLADWsWIdK9axtMXG3PQxG63et2haVksjsKp4g2prGEQRkCgJU2ql0EuFVsZoLI7HgLDuq_6M93uPsdpmhZqt1VY3FuI_pk_WqpTV</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1551057489</pqid></control><display><type>article</type><title>Achieving low-complexity maximum-likelihood detection for the 3D MIMO code</title><source>DOAJ Directory of Open Access Journals</source><source>SpringerNature Journals</source><source>Springer Nature OA Free Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Liu, Ming ; Crussière, Matthieu ; Hélard, Maryline ; Hélard, Jean-François</creator><creatorcontrib>Liu, Ming ; Crussière, Matthieu ; Hélard, Maryline ; Hélard, Jean-François</creatorcontrib><description>The 3D Multiple-input multiple-output (MIMO) code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast decodable. It is proven that the ML decoding performance can be achieved with a complexity of
O
(
M
4.5
) instead of
O
(
M
8
) in quasi-static channel with
M
-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of the 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration.</description><identifier>ISSN: 1687-1499</identifier><identifier>ISSN: 1687-1472</identifier><identifier>EISSN: 1687-1499</identifier><identifier>DOI: 10.1186/1687-1499-2014-20</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Block codes ; Channels ; Communications Engineering ; Complexity ; Computer Science ; Decoders ; Decoding ; Engineering ; Information Systems Applications (incl.Internet) ; Modulation ; Networking and Internet Architecture ; Networks ; Signal,Image and Speech Processing ; Three dimensional ; Wireless communication</subject><ispartof>EURASIP journal on wireless communications and networking, 2014-02, Vol.2014 (1), p.1-16, Article 20</ispartof><rights>Liu et al.; licensee Springer. 2014. This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-b411t-2a9573d9621e78a3f01b623cb13b466abf8ffce575151735bcfc1c8eb099d8573</cites><orcidid>0000-0001-5425-4063 ; 0000-0003-3669-5695</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1186/1687-1499-2014-20$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://doi.org/10.1186/1687-1499-2014-20$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>230,314,780,784,864,885,27924,27925,41120,41488,42189,42557,51319,51576</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00929761$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Liu, Ming</creatorcontrib><creatorcontrib>Crussière, Matthieu</creatorcontrib><creatorcontrib>Hélard, Maryline</creatorcontrib><creatorcontrib>Hélard, Jean-François</creatorcontrib><title>Achieving low-complexity maximum-likelihood detection for the 3D MIMO code</title><title>EURASIP journal on wireless communications and networking</title><addtitle>J Wireless Com Network</addtitle><description>The 3D Multiple-input multiple-output (MIMO) code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast decodable. It is proven that the ML decoding performance can be achieved with a complexity of
O
(
M
4.5
) instead of
O
(
M
8
) in quasi-static channel with
M
-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of the 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration.</description><subject>Block codes</subject><subject>Channels</subject><subject>Communications Engineering</subject><subject>Complexity</subject><subject>Computer Science</subject><subject>Decoders</subject><subject>Decoding</subject><subject>Engineering</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Modulation</subject><subject>Networking and Internet Architecture</subject><subject>Networks</subject><subject>Signal,Image and Speech Processing</subject><subject>Three dimensional</subject><subject>Wireless communication</subject><issn>1687-1499</issn><issn>1687-1472</issn><issn>1687-1499</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><recordid>eNp9kc1OwzAQhCMEEqXwANxyhEPAm38fqxZoUate4Gw5zqZxSeJip6V9exwFVYAQl11rd2ZW-uw410DuANL4HuI08SCk1PMJhLacOIPj7PTb-9y5MGZNSBCE1B84zyNRStzJZuVW6sMTqt5UuJftwa35Xtbb2qvkG1ayVCp3c2xRtFI1bqG025boBhN3MVssXaFyvHTOCl4ZvPrqQ-f18eFlPPXmy6fZeDT3shCg9XxOoyTIaewDJikPCgJZ7AcigyAL45hnRVoUAqMkggiSIMpEIUCkmBFK89Rah85tn1vyim20rLk-MMUlm47mrJsRQn2axLADq5302kyqGnOBTat_uX5uLADWsWIdK9axtMXG3PQxG63et2haVksjsKp4g2prGEQRkCgJU2ql0EuFVsZoLI7HgLDuq_6M93uPsdpmhZqt1VY3FuI_pk_WqpTV</recordid><startdate>20140201</startdate><enddate>20140201</enddate><creator>Liu, Ming</creator><creator>Crussière, Matthieu</creator><creator>Hélard, Maryline</creator><creator>Hélard, Jean-François</creator><general>Springer International Publishing</general><general>BioMed Central Ltd</general><general>SpringerOpen</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0001-5425-4063</orcidid><orcidid>https://orcid.org/0000-0003-3669-5695</orcidid></search><sort><creationdate>20140201</creationdate><title>Achieving low-complexity maximum-likelihood detection for the 3D MIMO code</title><author>Liu, Ming ; Crussière, Matthieu ; Hélard, Maryline ; Hélard, Jean-François</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-b411t-2a9573d9621e78a3f01b623cb13b466abf8ffce575151735bcfc1c8eb099d8573</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Block codes</topic><topic>Channels</topic><topic>Communications Engineering</topic><topic>Complexity</topic><topic>Computer Science</topic><topic>Decoders</topic><topic>Decoding</topic><topic>Engineering</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Modulation</topic><topic>Networking and Internet Architecture</topic><topic>Networks</topic><topic>Signal,Image and Speech Processing</topic><topic>Three dimensional</topic><topic>Wireless communication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Ming</creatorcontrib><creatorcontrib>Crussière, Matthieu</creatorcontrib><creatorcontrib>Hélard, Maryline</creatorcontrib><creatorcontrib>Hélard, Jean-François</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>EURASIP journal on wireless communications and networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Ming</au><au>Crussière, Matthieu</au><au>Hélard, Maryline</au><au>Hélard, Jean-François</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Achieving low-complexity maximum-likelihood detection for the 3D MIMO code</atitle><jtitle>EURASIP journal on wireless communications and networking</jtitle><stitle>J Wireless Com Network</stitle><date>2014-02-01</date><risdate>2014</risdate><volume>2014</volume><issue>1</issue><spage>1</spage><epage>16</epage><pages>1-16</pages><artnum>20</artnum><issn>1687-1499</issn><issn>1687-1472</issn><eissn>1687-1499</eissn><abstract>The 3D Multiple-input multiple-output (MIMO) code is a robust and efficient space-time block code (STBC) for the distributed MIMO broadcasting but suffers from high maximum-likelihood (ML) decoding complexity. In this paper, we first analyze some properties of the 3D MIMO code to show that the 3D MIMO code is fast decodable. It is proven that the ML decoding performance can be achieved with a complexity of
O
(
M
4.5
) instead of
O
(
M
8
) in quasi-static channel with
M
-ary square QAM modulations. Consequently, we propose a simplified ML decoder exploiting the unique properties of the 3D MIMO code. Simulation results show that the proposed simplified ML decoder can achieve much lower processing time latency compared to the classical sphere decoder with Schnorr-Euchner enumeration.</abstract><cop>Cham</cop><pub>Springer International Publishing</pub><doi>10.1186/1687-1499-2014-20</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0001-5425-4063</orcidid><orcidid>https://orcid.org/0000-0003-3669-5695</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1687-1499 |
| ispartof | EURASIP journal on wireless communications and networking, 2014-02, Vol.2014 (1), p.1-16, Article 20 |
| issn | 1687-1499 1687-1472 1687-1499 |
| language | eng |
| recordid | cdi_hal_primary_oai_HAL_hal_00929761v1 |
| source | DOAJ Directory of Open Access Journals; SpringerNature Journals; Springer Nature OA Free Journals; EZB-FREE-00999 freely available EZB journals |
| subjects | Block codes Channels Communications Engineering Complexity Computer Science Decoders Decoding Engineering Information Systems Applications (incl.Internet) Modulation Networking and Internet Architecture Networks Signal,Image and Speech Processing Three dimensional Wireless communication |
| title | Achieving low-complexity maximum-likelihood detection for the 3D MIMO code |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T01%3A55%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Achieving%20low-complexity%20maximum-likelihood%20detection%20for%20the%203D%20MIMO%20code&rft.jtitle=EURASIP%20journal%20on%20wireless%20communications%20and%20networking&rft.au=Liu,%20Ming&rft.date=2014-02-01&rft.volume=2014&rft.issue=1&rft.spage=1&rft.epage=16&rft.pages=1-16&rft.artnum=20&rft.issn=1687-1499&rft.eissn=1687-1499&rft_id=info:doi/10.1186/1687-1499-2014-20&rft_dat=%3Cproquest_hal_p%3E1551057489%3C/proquest_hal_p%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1551057489&rft_id=info:pmid/&rfr_iscdi=true |