A Novel Maximum-Likelihood Detection for the Binary MIMO System Using DC Programming
The multiple-input multiple-output (MIMO) system is widely used in wireless communications. For the problem of the discrete maximum-likelihood (ML) detection for the MIMO system, one can formulate it as binary quadratic programming (BQP). The general BQP problem is an NP-hard problem, which is a cha...
Saved in:
| Published in: | International Conference on Awareness Science and Technology pp. 1 - 6 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.10.2019
|
| Subjects: | |
| ISSN: | 2325-5994 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The multiple-input multiple-output (MIMO) system is widely used in wireless communications. For the problem of the discrete maximum-likelihood (ML) detection for the MIMO system, one can formulate it as binary quadratic programming (BQP). The general BQP problem is an NP-hard problem, which is a challenge for finding promising solutions. The variable complexity is a special considered issue. In this paper, inspired by the optimization of sparse constrains, we employ a regularization approach to deal with the binary constraints in the proposed formulation and then introduce the difference of convex functions (DC) programming to solve the formulated nonconvex cost function. A novel and robust DC algorithm is proposed. Numerical experiments show that the proposed algorithm, which is based on DC programming, can achieve accurate results with a higher convergence rate. |
|---|---|
| AbstractList | The multiple-input multiple-output (MIMO) system is widely used in wireless communications. For the problem of the discrete maximum-likelihood (ML) detection for the MIMO system, one can formulate it as binary quadratic programming (BQP). The general BQP problem is an NP-hard problem, which is a challenge for finding promising solutions. The variable complexity is a special considered issue. In this paper, inspired by the optimization of sparse constrains, we employ a regularization approach to deal with the binary constraints in the proposed formulation and then introduce the difference of convex functions (DC) programming to solve the formulated nonconvex cost function. A novel and robust DC algorithm is proposed. Numerical experiments show that the proposed algorithm, which is based on DC programming, can achieve accurate results with a higher convergence rate. |
| Author | Ding, Shuxue Li, Xiang Tan, Benying Asoh, Hideki Akaho, Shotaro Li, Yujie |
| Author_xml | – sequence: 1 givenname: Benying surname: Tan fullname: Tan, Benying organization: The University of Aizu,School of Computer Science and Engineering,Aizuwakamatsu,Japan – sequence: 2 givenname: Xiang surname: Li fullname: Li, Xiang organization: The University of Aizu,School of Computer Science and Engineering,Aizuwakamatsu,Japan – sequence: 3 givenname: Shuxue surname: Ding fullname: Ding, Shuxue organization: Guilin University of Electronic Technology,School of Artificial Intelligence,Guilin,China – sequence: 4 givenname: Yujie surname: Li fullname: Li, Yujie organization: National Institute of Advanced Industrial Science and Technology,Tsukuba,Japan – sequence: 5 givenname: Shotaro surname: Akaho fullname: Akaho, Shotaro organization: National Institute of Advanced Industrial Science and Technology,Tsukuba,Japan – sequence: 6 givenname: Hideki surname: Asoh fullname: Asoh, Hideki organization: National Institute of Advanced Industrial Science and Technology,Tsukuba,Japan |
| BookMark | eNotkF1PwjAYhavRRMT9Am76B4Z923Xre4kgSgJiwrwm3XgLVbaabX7w710iVycnOXny5NyyqzrUxNgIxBhA4P1iOvnZ5GMpAMcGpQKFFyzCzEAmDSgjQV2ygVRSxxoxuWFR274L0c9TlCkOWD7hL-Gbjnxlf331VcVL_0FHfwhhx2fUUdn5UHMXGt4diD_42jYnvlqs1nxzajuq-Fvr6z2fTflrE_aNraq-3rFrZ48tReccsnz-mE-f4-X6qTdexh4Qu1himrgEE20t2sKkRmhwKgVArTKnEKSTptDK7YzWmlSRmTJ1bieFsEVJashG_1hPRNvPxle93PZ8g_oDKP9SHA |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICAwST.2019.8923139 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781728138213 1728138213 |
| EISSN | 2325-5994 |
| EndPage | 6 |
| ExternalDocumentID | 8923139 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL |
| ID | FETCH-LOGICAL-i199t-2964f4945aa9ab868051f36119537f3912f28b53fd8555e3b78c6ffd200abce3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000521753600023&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:42:11 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i199t-2964f4945aa9ab868051f36119537f3912f28b53fd8555e3b78c6ffd200abce3 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_8923139 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-10-01 |
| PublicationDateYYYYMMDD | 2019-10-01 |
| PublicationDate_xml | – month: 10 year: 2019 text: 2019-10-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | International Conference on Awareness Science and Technology |
| PublicationTitleAbbrev | ICAwST |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0001969269 |
| Score | 1.7144884 |
| Snippet | The multiple-input multiple-output (MIMO) system is widely used in wireless communications. For the problem of the discrete maximum-likelihood (ML) detection... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Antenna measurements binary quadratic programming (BQP) Convex functions DC algorithm (DCA) Detectors difference of convex functions (DC) programming MIMO communication MIMO system ML detection Programming Receiving antennas Transmitting antennas |
| Title | A Novel Maximum-Likelihood Detection for the Binary MIMO System Using DC Programming |
| URI | https://ieeexplore.ieee.org/document/8923139 |
| WOSCitedRecordID | wos000521753600023&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH4B4sETKhh_pwePVti6re0RQSKJIIk7cCNd1yaLMAwO9M-37SbExIu3tknTpO3X99p-73sAt6kWWnDSxcZZIDjg2sPCJwobcNCu1MZEaeGSTdDJhM1mfFqDu10sjFLKkc_UvS26v_x0JTf2qazDrDdCeB3qlEZlrNb-PYVH3I94JSzkdXln1O99vsaWvWW2Q9nzVwoVZ0GGzf-NfQTtfSgemu6MzDHUVH4CzZ9cDKiCZgviHpqstmqBxuIrW26W-Dl7U4vMihajgSoc4SpHxkNFxuNDDy4KF41H4xdUapYjxx1Ag74dzTK2lqbahnj4GPefcJUxAWce5wW2f6g64EEoBBcJi5iBnCaRlXUjVBPu-dpnSUh0ysIwVCShTEZapwYqIpGKnEIjX-XqDFBi7pXSpwbQWgeCpInVKvRkwkIemLM6OIeWnaP5e6mJMa-m5-Lv5ks4tMtQkuCuoFGsN-oaDuS2yD7WN24hvwFJVp6F |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFH5BNNETKhh_24NHp2zttvaIIIHIJok7cCPd1iaLMAwO9M-37SbExIu3tknTpO3X99p-73sAt6nkkjPctpSzgC3CpG1xBwtLgcNvJ1KZKMlNsgk_DOlkwsY1uNvEwgghDPlM3Oui-ctPF8lKP5U9UO2NYLYDuy4hTruM1tq-qDCPOR6rpIXsNnsYdjufr5Hmb6kNUfb9lUTF2JB-43-jH0JrG4yHxhszcwQ1kR9D4ycbA6rA2YSog8LFWsxQwL-y-WpujbI3Mcu0bDHqicJQrnKkfFSkfD70aOJwUTAMXlCpWo4MewD1uno0zdmaq2oLov5T1B1YVc4EK7MZKyz9iyoJIy7njMfUowp0Enta2A37EjPbkQ6NXSxT6rquwLFPE0_KVIGFx4nAJ1DPF7k4BRSrm2Xi-ArSUhKO01irFdpJTF1G1GlNzqCp52j6XqpiTKvpOf-7-Qb2B1Ewmo6G4fMFHOglKSlxl1AvlitxBXvJusg-ltdmUb8BuEmhzA |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Awareness+Science+and+Technology&rft.atitle=A+Novel+Maximum-Likelihood+Detection+for+the+Binary+MIMO+System+Using+DC+Programming&rft.au=Tan%2C+Benying&rft.au=Li%2C+Xiang&rft.au=Ding%2C+Shuxue&rft.au=Li%2C+Yujie&rft.date=2019-10-01&rft.pub=IEEE&rft.eissn=2325-5994&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FICAwST.2019.8923139&rft.externalDocID=8923139 |