IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i4d10.1007_s10878-016-0045-5.html
   My bibliography  Save this article

A new effective branch-and-bound algorithm to the high order MIMO detection problem

Author

Listed:
  • Ye Tian

    (Southwestern University of Finance and Economics)

  • Ke Li

    (Southwestern University of Finance and Economics)

  • Wei Yang

    (Southwestern University of Finance and Economics)

  • Zhiyong Li

    (Southwestern University of Finance and Economics)

Abstract

This paper develops a branch-and-bound method based on a new convex reformulation to solve the high order MIMO detection problem. First, we transform the original problem into a $$\{-1,1\}$$ { - 1 , 1 } constrained quadratic programming problem with the smallest size. The size of the reformulated problem is smaller than those problems derived by some traditional transformation methods. Then, we propose a new convex reformulation which gets the maximized average objective value as the lower bound estimator in the branch-and-bound scheme. This estimator balances very well between effectiveness and computational cost. Thus, the branch-and-bound algorithm achieves a high total efficiency. Several simulations are used to compare the performances of our method and other benchmark methods. The results show that this proposed algorithm is very competitive for high accuracy and relatively good efficiency.

Suggested Citation

  • Ye Tian & Ke Li & Wei Yang & Zhiyong Li, 2017. "A new effective branch-and-bound algorithm to the high order MIMO detection problem," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1395-1410, May.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:4:d:10.1007_s10878-016-0045-5
    DOI: 10.1007/s10878-016-0045-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-016-0045-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-016-0045-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ye Tian & Jr-Fong Dang, 2015. "MIMO Detection for High Order QAM by Canonical Dual Approach," Journal of Applied Mathematics, Hindawi, vol. 2015, pages 1-8, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shuchen Wang & Suixiang Gao & Wenguo Yang, 2023. "Pilot pattern design scheme with branch and bound in PSA-OFDM system," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-16, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:33:y:2017:i:4:d:10.1007_s10878-016-0045-5. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.