IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i4d10.1007_s10878-023-01037-2.html
   My bibliography  Save this article

Pilot pattern design scheme with branch and bound in PSA-OFDM system

Author

Listed:
  • Shuchen Wang

    (University of Chinese Academy of Sciences)

  • Suixiang Gao

    (University of Chinese Academy of Sciences
    Zhongguancun Laboratory)

  • Wenguo Yang

    (University of Chinese Academy of Sciences)

Abstract

Pilot symbol assisted (PSA) channel estimation is an important means to improve the communication quality of orthogonal frequency division multiplexing (OFDM) systems. The insertion position of the pilot in the frequency domain and time domain of the OFDM symbol is called the pilot pattern. The appropriate pilot pattern can greatly reduce channel estimation error and enhance communication quality. In this paper, the branch and bound (BnB) method is adopted to design the pilot pattern BnB-PP for the first time. Specifically, the result of the linear minimum mean square error method is taken as the target value of channel estimation in PSA-OFDM systems. For branching, pilot positions are randomly selected one by one in the form of the binary tree. For the boundary, after the pilots are filled randomly, a correction term is subtracted from the result of channel estimation at this time to present the expectation boundary. The results show that BnB-PP is better than the common pilot pattern. When signal-to-noise ratio is 36, the average MSE of channel estimation for 32 and 64 pilots in 1344 data signals is reduced by $$93.24\%$$ 93.24 % and $$62.33\%$$ 62.33 % respectively compared with the lattice-type pilot pattern.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:4:d:10.1007_s10878-023-01037-2
    DOI: 10.1007/s10878-023-01037-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-023-01037-2
    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-023-01037-2?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. D. Quadri & E. Soutif & P. Tolla, 2009. "Exact solution method to solve large scale integer quadratic multidimensional knapsack problems," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 157-167, February.
    2. Sven Mallach, 2018. "Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 871-895, October.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    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.
    1. SYAFITRI, Utami & SARTONO, Bagus & GOOS, Peter, 2015. "D- and I-optimal design of mixture experiments in the presence of ingredient availability constraints," Working Papers 2015003, University of Antwerp, Faculty of Business and Economics.
    2. Federico Della Croce & Dominique Quadri, 2012. "Improving an exact approach for solving separable integer quadratic knapsack problems," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 21-28, January.
    3. Kuen-Fang Jea & Jen-Ya Wang & Chih-Wei Hsu, 2019. "Two-Agent Advertisement Scheduling on Physical Books to Maximize the Total Profit," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(03), pages 1-24, June.
    4. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.

    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:45:y:2023:i:4:d:10.1007_s10878-023-01037-2. 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.